On-Line Obstacle Avoidance at High Speeds
This paper presents an efficient algorithm for on-line obstacle avoidance that accounts for robot dynamics and actuator constraints. The robot trajectory (path and speed) is generated on-line by avoiding obstacles, optimally, one at a time. The trajectory is generated recursively using a basic algorithm that plans trajectory segments to intermediate goals. The use of intermediate goals ensures safety and convergence to the global goal. This approach reduces the original problem of avoiding m obstacles to m simpler problems of avoiding one obstacle each, producing a planner that is linear, instead of exponential, in the number of obstacles.
Unable to display preview. Download preview PDF.
- R.A. Knepper and M.T. Mason. Path diversity is only part of the problem. In ICRA, 2009.Google Scholar
- Y. Kuwata, G. A. Fiore, J. Teo, E. Frazzoli, and J. P. How. Motion planning for urban driving using RRT. In ICRA, 2008.Google Scholar
- S. Sundar. Near-Optimal Feedback Control of Robotic Manipulators. Ph.D. Dissertation, Dept. of Mechanical, Aerospace and Nuclear Engineering, University of California, Los Angeles, CA, 1994.Google Scholar
- M. P. Vitus, V. Pradeep, G. M. Hoffmann, S. L. Waslander, and C. J. Tomlin. Tunnel-milp: Path planning with sequential convex polytopes. In AIAA Guidance, Navigation and Control Conf., 2008.Google Scholar