Convergence-guaranteed time-varying RRT path planning for profiling floats in 4-Dimensional flow


Autoria(s): Huynh, Van T.; Dunbabin, Matthew; Smith, Ryan N.
Data(s)

01/12/2014

Resumo

This paper presents an extension to the Rapidly-exploring Random Tree (RRT) algorithm applied to autonomous, drifting underwater vehicles. The proposed algorithm is able to plan paths that guarantee convergence in the presence of time-varying ocean dynamics. The method utilizes 4-Dimensional, ocean model prediction data as an evolving basis for expanding the tree from the start location to the goal. The performance of the proposed method is validated through Monte-Carlo simulations. Results illustrate the importance of the temporal variance in path execution, and demonstrate the convergence guarantee of the proposed methods.

Formato

application/pdf

Identificador

http://eprints.qut.edu.au/81681/

Publicador

Australian Robotics and Automation Association

Relação

http://eprints.qut.edu.au/81681/1/pap108.pdf

https://ssl.linklings.net/conferences/acra/acra2014_proceedings/views/includes/files/pap108.pdf

Huynh, Van T., Dunbabin, Matthew, & Smith, Ryan N. (2014) Convergence-guaranteed time-varying RRT path planning for profiling floats in 4-Dimensional flow. In Australasian Conference on Robotics and Automation 2014, Australian Robotics and Automation Association, Melbourne, Australia, pp. 1-9.

Direitos

Copyright 2014 [please consult the authors]

Fonte

School of Electrical Engineering & Computer Science; Institute for Future Environments; Science & Engineering Faculty

Palavras-Chave #path planning #rapidly exploring random trees #underwater vehicles #profiling floats
Tipo

Conference Paper