Abstract
Grid-based methods for finding cost optimal robot paths around obstacles are popular because of their flexibility and simple implementation. However, their computational complexity becomes unfeasible for real-time path planning if the resolution of the grid is high.
These methods assume complete knowledge about the world, but in dynamic environments where sensing is done on board the robot, less is known about far-away obstacles than about the ones in close proximity.
The paper proposes to utilize this observation by employing a grid of variable resolution. The resolution is high next to the robot and becomes lower with increasing distance. This results in huge savings in computational costs while the initial parts of the paths are still planned with high accuracy. The same principle is applied to the time-axis, allowing for planning paths around moving obstacles with only a moderate increase in computational costs.
This work was supported by a fellowship within the postdoc program of the German Academic Exchange Service (DAAD).
Chapter PDF
References
Brooks, R., Lozano-Pérez, T.: A subdivision algorithm in configuration space for findpath with rotation. In: Proceedings of the 8th International Conference on Artificial Intelligence (ICAI), pp. 799–806 (1983)
Bruce, J., Veloso, M.M.: Real-time randomized path planning for robot navigation. In: Proceedings of the 2002 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2002) (October 2002)
Donald, B., Xavier, P., Canny, J., Reif, J.: Kinodynamic motion planning. Journal of the ACM 40(5), 1048–1066 (1993)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths in graphs. IEEE Transactions on Systems Science and Cybernetics SSC-4(2), 100–107 (1968)
Kambhampati, S., Davis, L.S.: Multiresolution path planning for mobile robots. IEEE Journal of Robotics and Automation RA-2(3), 135–145 (1986)
Kavraki, L., Svestka, P., Latombe, J.C., Overmars, M.: Probabilistic road maps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4), 566–580 (1996)
Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotic Research 5(1), 90–98 (1986)
Latombe, J.-C.: Robot Motion Planning. Kluwer Academic Publishers, Boston (1991)
Latombe, J.-C.: Motion planning: A journey of robots, molecules, digital actors, and other artifacts. International Journal of Robotics Research 18(11), 1119–1128 (1999)
Lozano-Pérez, T.: Spatial planning: A configuration space approach. IEEE Transactions on Computers C-32(2), 108–120 (1983)
Nilsson, N.J.: A mobile automaton: An application of artificial intelligence techniques. In: Proceedings of the 1st International Joint Conference on Artificial Intelligence, Washington, DC, pp. 509–520 (1969)
O’Dunlaing, C., Yap, C.K.: A retraction method for planning the motion of a disc. Journal of Algorithms 6, 104–111 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behnke, S. (2004). Local Multiresolution Path Planning. In: Polani, D., Browning, B., Bonarini, A., Yoshida, K. (eds) RoboCup 2003: Robot Soccer World Cup VII. RoboCup 2003. Lecture Notes in Computer Science(), vol 3020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25940-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-25940-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22443-3
Online ISBN: 978-3-540-25940-4
eBook Packages: Springer Book Archive