Abstract
This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes in the environment invalidate the current plan, the adaptive path planner attempts to adapt the old plan to the new situation. The paper proposes an efficient representation for path that is easily amendable to adaptation. Associated with the path planner is a set of repair strategies. These repair strategies are local methods to fix a plan to compensate for object movement in the domain. The repair strategies are specific and have a high probability of being able to fix a plan. An empirical evaluation shows that adaptive path planning is suitable to highly dynamic domains, such as RoboCup. Adaptive path planning reduces the cumulative planning time by a factor of 2:7 compared to Bicchi’s planner. At the same time, the quality of the plans generated by the adaptive path planner were similar to those generated by Bicchi’s planner.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Antonio Bicchi, Giuseppe Casalino, and Corrado San tilli. Planning shortest bounded-curvature paths for a class of nonholomic vehicles among obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation, pages 1349–1354, 1995.
Kristian J. Hammond. Case Based Planning. Academic Press Inc., 1989.
Nicholas Hildreth. Adaptive path planning for real-time systems. Master’s thesis, University of Auckland, July 2000.
J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.
J.A. Reeds and R.A. Shepp. Optimal paths for a car that goes both forward and backward.Pacific Journal of Mathematics, 145(2), 1990.
Stuart Russel and Peter Norvig. A rtificial Intelligence: A Modern Approach, chapter 20, pages 598–624. Prentice-Hall Inc., Englewood Cliffs, New Jersey 07632, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baltes, J., Hildreth, N. (2001). Adaptive Path Planner for Highly Dynamic Environments. In: Stone, P., Balch, T., Kraetzschmar, G. (eds) RoboCup 2000: Robot Soccer World Cup IV. RoboCup 2000. Lecture Notes in Computer Science(), vol 2019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45324-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-45324-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42185-6
Online ISBN: 978-3-540-45324-6
eBook Packages: Springer Book Archive