Direct policy search with variable-length genetic algorithm for single beacon cooperative path planning

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

Abstract

This paper focuses on Direct Policy Search (DPS) for cooperative path planning of a single beacon vehicle supporting Autonomous Underwater Vehicles (AUVs) performing surveying missions. Due to the lack of availability of GPS signals underwater, the position errors of the AUVs grow with time even though they are equipped with proprioceptive sensors for dead reckoning. One way to minimize this error is to have a moving beacon vehicle with good positioning data transmit its position acoustically from different locations to other AUVs. When the position is received, the AUVs can fuse this data with the range measured from the travel time of acoustic transmission to better estimate their own positions and keep the error bounded. In this work, we address the beacon vehicle’s path planning problem which takes into account the position errors being accumulated by the supported survey AUVs. We represent the path planning policy as state-action mapping and employ Variable-Length Genetic Algorithm (VLGA) to automatically discover the number of representative states and their corresponding action mapping. We show the resultant planned paths using the learned policy are able to keep the position errors of the survey AUVs bounded over the mission time.

Cite

CITATION STYLE

APA

Teck, T. Y., & Chitre, M. (2014). Direct policy search with variable-length genetic algorithm for single beacon cooperative path planning. In Springer Tracts in Advanced Robotics (Vol. 104, pp. 321–336). Springer Verlag. https://doi.org/10.1007/978-3-642-55146-8_23

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