In many relevant path planning problems, loop closure constraints reduce the configuration space to a manifold embedded in the higher-dimensional joint ambient space. Whereas many progresses have been done to solve path planning problems in the presence of obstacles, only few work consider loop closure constraints. In this paper we present the AtlasRRT algorithm, a planner specially tailored for such constrained systems that builds on recently developed tools for higher-dimensional continuation. These tools provide procedures to define charts that locally parametrize manifolds and to coordinate them forming an atlas. AtlasRRT simultaneously builds an atlas and a Rapidly-Exploring Random Tree (RRT), using the atlas to sample relevant configurations for the RRT, and the RRT to devise directions of expansion for the atlas. The new planner is advantageous since samples obtained from the atlas allow a more efficient extension of the RRT than state of the art approaches, where samples are generated in the joint ambient space. ; Peer Reviewed ; Postprint (author’s final draft)


    Access

    Download


    Export, share and cite



    Title :

    Path planning with loop closure constraints using an atlas-based RRT



    Publication date :

    2011-01-01


    Type of media :

    Miscellaneous


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629




    Topological constraints in search-based robot path planning

    Bhattacharya, S. | British Library Online Contents | 2012



    Multiple Aircraft Deconflicted Path Planning with Weather Avoidance Constraints

    Pannequin, Jessica / Bayen, Alexandre / Mitchell, Ian et al. | AIAA | 2007



    UAV Path Planning With Terrain Constraints for Aerial Scanning

    Yuan, Jinbiao / Liu, Zhenbao / Xiong, Xiaoyu et al. | IEEE | 2024