This paper addresses path planning to consider a cost function defined over the configuration space. The proposed planner computes low-cost paths that follow valleys and saddle points of the configuration-space costmap. It combines the exploratory strength of the Rapidly exploring Random Tree (RRT) algorithm with transition tests used in stochastic optimization methods to accept or to reject new potential states. The planner is analyzed and shown to compute low-cost solutions with respect to a path-quality criterion based on the notion of mechanical work. A large set of experimental results is provided to demonstrate the effectiveness of the method. Current limitations and possible extensions are also discussed. ; Postprint (published version)


    Access

    Download


    Export, share and cite



    Sampling-Based Path Planning on Configuration-Space Costmaps

    Jaillet, Léonard / Cortés, Juan / Simeon, Thierry | BASE | 2010

    Free access


    Sampling-based Path Planning for an Autonomous Helicopter

    Pettersson, Per Olof | BASE | 2006

    Free access

    Sampling-Based Path Planning for UAV Collision Avoidance

    Lin, Yucong / Saripalli, Srikanth | IEEE | 2017


    Sampling-based planning in phase space

    Heinrich, Steffen | Springer Verlag | 2018