Optimal path planning in time-varying flows using adaptive discretization

41Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Autonomous marine vehicles (AMVs) are typically deployed for long periods of time in the ocean to monitor different physical, chemical, and biological processes. Given their limited energy budgets, it makes sense to consider motion plans that leverage the dynamics of the surrounding flow field so as to minimize energy usage for these vehicles. In this letter, we present a graph-search-based method to compute energy optimal paths for AMVs in 2-D time-varying flows. The novelty of the proposed algorithm lies in the use of an adaptive discretization scheme to construct the search graph. We demonstrate the proposed algorithm by computing optimal energy paths using an analytical time-varying flow model and using time-varying ocean flow data provided by the Regional Ocean Model System. We compare the output paths with those computed via an optimal control formulation and numerically demonstrate that the proposed method can overcome problems inherent in existing fixed discretization schemes.

Cite

CITATION STYLE

APA

Kularatne, D., Bhattacharya, S., & Hsieh, M. A. (2018). Optimal path planning in time-varying flows using adaptive discretization. IEEE Robotics and Automation Letters, 3(1), 458–465. https://doi.org/10.1109/LRA.2017.2761939

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free