Augmenting RRT∗-planner with local trees for motion planning in complex dynamic environments

Collision free navigation in dynamic environments, where motion of moving obstacles is unknown, still presents a significant challenge. Sampling based algorithms are well known for their simplicity and are widely used in many real time motion planning problems. While many sampling based algorithms for dynamic environments exist, assumptions taken by these algorithms such as known trajectories of moving obstacles, make them unsuitable for motion planning in real-world problems. In this paper, we present RRT* based motion planning in unknown dynamic environments. Effectiveness of our idea is demonstrated in multiple simulations with more than 15 simultaneously moving obstacles placed in various environments.

[1]  Jean-Claude Latombe,et al.  Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..

[2]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[3]  James J. Kuffner,et al.  Multipartite RRTs for Rapid Replanning in Dynamic Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[4]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[5]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[6]  Yoram Koren,et al.  Potential field methods and their inherent limitations for mobile robot navigation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[7]  Thierry Fraichard,et al.  Safe motion planning in dynamic environments , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[8]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[9]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[10]  Florent Lamiraux,et al.  On the expected complexity of random path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.