Abstract

Accounting for uncertainty in optimal path planning is essential for many applications. We present and apply stochastic level-set partial differential equations that govern the stochastic time-optimal reachability fronts and time-optimal paths for vehicles navigating in uncertain, strong, and dynamic flow fields. To solve these equations efficiently, we obtain and employ their dynamically orthogonal reduced-order projections, maintaining accuracy while achieving several orders of magnitude in computational speed-up when compared to classic Monte Carlo methods. We utilize the new equations to complete stochastic reachability and time-optimal path planning in three test cases: (i) a canonical stochastic steady-front with uncertain flow strength, (ii) a stochastic barotropic quasi-geostrophic double-gyre circulation, and (iii) a stochastic flow past a circular island. For all the three test cases, we analyze the results with a focus on studying the effect of flow uncertainty on the reachability fronts and time-optimal paths, and their probabilistic properties. With the first test case, we demonstrate the approach and verify the accuracy of our solutions by comparing them with the Monte Carlo solutions. With the second, we show that different flow field realizations can result in paths with high spatial dissimilarity but with similar arrival times. With the third, we provide an example where time-optimal path variability can be very high and sensitive to uncertainty in eddy shedding direction downstream of the island.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.