Motion planning is a crucial, basic issue in robotics, which aims at driving vehicles or robots towards to a given destination with various constraints, such as obstacles and limited resource. This paper presents a new version of rapidly exploring random trees (RRT), that is, liveness-based RRT (Li-RRT), to address autonomous underwater vehicles (AUVs) motion problem. Different from typical RRT, we define an index of each node in the random searching tree, called “liveness” in this paper, to describe the potential effectiveness during the expanding process. We show that Li-RRT is provably probabilistic completeness as original RRT. In addition, the expected time of returning a valid path with Li-RRT is obviously reduced. To verify the efficiency of our algorithm, numerical experiments are carried out in this paper.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Liveness-Based RRT Algorithm for Autonomous Underwater Vehicles Motion Planning


    Beteiligte:
    Yang Li (Autor:in) / Fubin Zhang (Autor:in) / Demin Xu (Autor:in) / Jiguo Dai (Autor:in)


    Erscheinungsdatum :

    2017




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Real-time optimal motion planning for autonomous underwater vehicles

    Prasanth Kumar, R. / Dasgupta, Anir / Kumar, C.S. | Tema Archiv | 2005


    An Incremental Stochastic Motion Planning Technique for Autonomous Underwater Vehicles

    Tan, C. S. / Sutton, R. / Chudley, J. et al. | British Library Conference Proceedings | 2005


    MTrajPlanner: A Multiple-Trajectory Planning Algorithm for Autonomous Underwater Vehicles

    Gong, Yue-Jiao / Huang, Ting / Ma, Yi-Ning et al. | IEEE | 2023


    Case-Based Path Planning for Autonomous Underwater Vehicles

    Vasudevan, C. / Ganesan, K. | British Library Online Contents | 1996