Real-time optimization-based planning in dynamic environments using GPUs
Authors:
- 1 May 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10504729,p. 4090-4097
Abstract
We present a novel algorithm to compute collision-free trajectories in dynamic environments. Our approach is general and does not require a priori knowledge about the obstacles or their motion. We use a replanning framework that interleaves optimization-based planning with execution. Furthermore, we describe a parallel formulation that exploits a high number of cores on commodity graphics processors (GPUs) to compute a high-quality path in a given time interval. We derive bounds on how parallelization can improve the responsiveness of the planner and the quality of the trajectory.Keywords
This publication has 27 references indexed in Scilit:
- Manipulation planning with goal sets using constrained trajectory optimization2011
- SIPP: Safe interval path planning for dynamic environments2011
- Generalized velocity obstacles2009
- Roadmap-based motion planning in dynamic environmentsIEEE Transactions on Robotics, 2005
- Newton-type algorithms for dynamics-based robot movement optimizationIEEE Transactions on Robotics, 2005
- Elastic bands: connecting path planning and control2002
- Elastic Strips: A Framework for Motion Generation in Human EnvironmentsThe International Journal of Robotics Research, 2002
- Motion Planning in Dynamic Environments Using Velocity ObstaclesThe International Journal of Robotics Research, 1998
- SANDROS: a dynamic graph search algorithm for motion planningIEEE Transactions on Robotics and Automation, 1998
- Stochastic global optimization methods part I: Clustering methodsMathematical Programming, 1987