Heuristically arrival time field-biased (HeAT) random tree: An online path planning algorithm for mobile robot considering kinodynamic constraints
Authors:
- 1 December 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 360-365
Abstract
This paper presents a new path planning algorithm for mobile robot in dynamic environments. We calculate the arrival time field as a bias which gives larger weights for shorter and safer paths towards a goal. We apply a randomized path search guided by the arrival time field for constructing the path considering kinematic and dynamic (kinodynamic) constraints of actual robot. We also consider path quality by adding heuristic constraints such as directing the initial heading of the robot and reducing unstable movements of the robot by using a heading criterion. The path will be extracted by backtracking the nodes which reach the goal area to the root of the tree generated by the randomized search. We provide a brief comparison between our algorithm and other existing algorithms. Simulation and experimental results prove that our algorithm is fast enough to be applied to the real robot and show the effectiveness of the algorithm for handling kinodynamic problems.Keywords
This publication has 9 references indexed in Scilit:
- Sampling-Based Path Planning on Configuration-Space CostmapsIEEE Transactions on Robotics, 2010
- Adaptive workspace biasing for sampling-based planners2008
- PDE-based robust robotic navigationImage and Vision Computing, 2007
- A Motion Planner for a Hybrid Robotic System with Kinodynamic Constraints2007
- An obstacle-based rapidly-exploring random tree2006
- RT-middleware: distributed component middleware for RT (robot technology)2005
- Approaches for heuristically biasing RRT growth2004
- Real-time randomized path planning for robot navigation2003
- Randomized kinodynamic planning2003