Abstract
Dynamic environments, in which robots and for example humans share a common workspace impose a variety of requirements on path planning algorithms, including real-time capabilities and collision tests based on sensor input. We propose a randomized-roadmap-based path planning algorithm that limits the number of collision tests and distance calculations to a volume achievable in real-time, while still being able to achieve high path clearance and statistical completeness given an unlimited number of planning cycles. It does so by exploiting the knowledge about static portions of the environment using a static, collision-checked roadmap and by interleaving planning and execution. Image-based distance measurements are induced by the graph search algorithm and interpolated to allow planning of time-optimized paths on the roadmap with a reduced number of distance measurements.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barraquand, J., Latombe, J.-C.: Robot motion planning: A distributed representation approach. International Journal of Robotics Research 10(6), 628–649 (1991)
Brock, O., Kathib, O.: Elastic Strips: A framework for integrated planning and execution. In: Corke, P., Trevelyan, J. (eds.) Proceedings of the International Symposium on Experimental Robotics. Lecture Notes in Control and Information Sciences, vol. 250, pp. 328–338. Springer, Heidelberg (1999)
Geraerts, R., Overmars, M.H.: Clearance based path optimization for motion planning. In: Proceedings of the International Conference on Robotics and Automation, New Orleans, USA, April 26 – May 1, 2004, vol. 3, pp. 2386–2392 (2004)
Gecks, T., Henrich, D.: Path Planning and Execution in Fast-Changing Environments with Known and Unknown Objects. In: Proceedings of the International Conference on Intelligent Robots and Systems, San Diego, USA, pp. 21–26 (2007)
Henrich, D., Wörn, H., Wurll, C.: On-line path planning with optimal C-space discretization. In: Proceedings of the International Conference on Intelligent Robots and Systems, Victoria, Canada, October 12-16 (1998)
Holleman, C., Kavraki, L.E.: A Framework for Using the Workspace Medial Axis in PRM Planners. In: Proceedings of the International Conference on Robotics and Automation, San Francisco, USA, April 24-28, 2000, pp. 1408–1413 (2000)
Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research 5(1), 90–98 (1986)
Lindemann, S.R., LaValle, S.M.: Smoothly blending vector fields for global robot navigation. In: Proceedings of the 44th IEEE Conference on Decision & Control, Sevilla, Spain, December 12-15, 2005, pp. 3353–3559 (2005)
Likhachev, M., Fergusson, D., Gordon, G., Stentz, A., Thrun, S.: Anytime dynamic a*: An anytime, replanning algorithm. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS) (2005)
Quinlan, S., Kathib, O.: Elastic bands: Connecting path planning and control. In: Proceedings of the International Conference on Robotics and Automation, vol. 2, pp. 802–807 (1993)
Schwartz, J.T., Sharir, M.: On the piano movers problem: II. General techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics 1(4), 293–351 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gecks, T., Henrich, D. (2009). Sensor-Based Online Planning of Time-Optimized Paths in Dynamic Environments. In: Kröger, T., Wahl, F.M. (eds) Advances in Robotics Research. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01213-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-01213-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01212-9
Online ISBN: 978-3-642-01213-6
eBook Packages: EngineeringEngineering (R0)