Abstract
This paper presents a theoretical analysis of a casebase used for mobile robot path planning in dynamic environments. Unlike other case-based path planning approaches, we use a grid map to represent the environment that permits the robot to operate in unstructured environments. The objective of the mobile robot is to learn to choose paths that are less risky to follow. Our experiments with real robots have shown the efficiency of our concept. In this paper, we replace a heuristic path planning algorithm of the mobile robot with a seed casebase and prove the upper and lower bounds for the cardinality of the casebase. The proofs indicate that it is realistic to seed the casebase with some solutions to a path-finding problem so that no possible solution differs too much from some path in the casebase. This guarantees that the robot would theoretically find all paths from start to goal. The proof of the upper bound of the casebase cardinality shows that the casebase would in a long run grow too large and all possible solutions cannot be stored. In order to keep only the most efficient solutions the casebase has to be revised at run-time or some other measure of path difference has to be considered.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M.Kruusmaa. Repeated Path Planning for Mobile Robots in Dynamic Environments. Ph.D.Thesis. Chalmes Univeristy of Technology, Gothenburg, Sweden, 2002.
H.Hu, M.Brady. Dynamic Global Path Planning with Uncertainty for Mobile Robots in Manufacturing. IEEE Transactions on Robotics and Automation. Vol. 13, No.5, October 1997, pp.760$#x2013;767. 1997.
K.Z.Haigh. M.M.Veloso. Planning, Execution and Learning in a Robotic Agent. AIPS-98 pp. 120–127, June 1998.
C.Vasudevan, K.Ganesan. Case-based Path Planning for Autonomous Underwater Vehicles. Proc. of 1994 IEEE Int. Symposium on Intelligent Control, pp. 160–165, August 16–18, 1994.
A.K.Goel, K.S.Ali, M.W.Donnellan, A.Gomex de Silva Garza, T.J.Callantine. Multistrategy Adaptive Path Planning. IEEE Expert, Vol.9, No.6, Dec. 1994, pp.57-65. 1994.
S.Fox, D.B.Leake. Combining Case-based Planning and Introspective Reasoning. Proc. of the Sixth Midwest Artificial Intelligence and Cognitive Science Society Conference, Carbondale, IL, April 1995.
L.K.Branting, D.W.Aha. Stratified Case-based Reasoning: Reusing Hierarchical Problem Solving Episodes. Proc. of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, Canada, August 20-25, 1995.
K.Z.Haigh, M.Veloso, Route Planning by Analogy. Case-Based Reasoning Research and Development, Proc. of ICCBR-95, pp. 169–180. Springer-Verlag, 1995.
R.R.Murphy. Introduction to AI Robotics. The MIT Press, 2000.
D. Huttenlocher, D. Klanderman and A. Rucklige. Comparing images using the Hausdorff distance. In IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 15, No.9, pp.850–863, September 1993.
E. Belogay, C. Cabrelli, U. Molter, and R. Shonkwiler. Calculating the Hausdorff distance between curves. Information Processing Letters, 64(1):17–22, 14 October 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag London Limited
About this paper
Cite this paper
Kruusmaa, M.A., Willemson, J. (2003). Covering the Path Space: A Casebase Analysis for Mobile Robot Path Planning. In: Bramer, M., Preece, A., Coenen, F. (eds) Research and Development in Intelligent Systems XIX. Springer, London. https://doi.org/10.1007/978-1-4471-0651-7_1
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0651-7_1
Publisher Name: Springer, London
Print ISBN: 978-1-85233-674-5
Online ISBN: 978-1-4471-0651-7
eBook Packages: Springer Book Archive