Abstract
This paper considers a reduced version of the general motion planning problem with uncertainty and an implemented complete polynomial algorithm solving it. This algorithm computes a guaranteed plan by backchaining nondirectional preimages of the goal until one fully contains the set of possible initial positions of the robot. It assumes that “landmarks” are scattered across the workspace. Robot control and sensing are perfect within the fields of influence of these landmarks, while control is imperfect and sensing null outside these fields. We propose extensions of the planning algorithm that eliminate the need for several of these assumptions.
Preview
Unable to display preview. Download preview PDF.
References
Briggs, A.J., “An efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty,” Proc. of the 5th Annual ACM Symp. on Computational Geometry, Saarbruchen, Germany, 1989, pp. 187–196.
Buckley, S.J., Planning and teaching Compliant Motion Strategies, Ph.D. Dissertation, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA (1986).
Canny, J.F. and Reif, J., “New Lower Bound Techniques for Robot Motion Planning Problems,” 27th IEEE Symp. on Foundations of Computer Science, Los Angeles, CA, 1987, pp. 49–60.
Canny, J.F., “On Computability of Fine Motion Plans,” Proc. of the IEEE Int. Conf. on Robotics and Automation, Scottsdale, AZ, 1989, pp. 177–182.
Christiansen, A., Mason, M. and Mitchell, T.M., Learning Reliable Manipulation Strategies without Initial Physical Models, IEEE Int. Conf. on Robotics and Automation, Cincinnati, OH (1990).
Donald, B.R., “The Complexity of Planar Compliant Motion Planning Under Uncertainty,” Algorithmica, 5, 1990, pp. 353–382.
Donald, B.R. and Jennings, J., “Sensor Interpretation and Task-Directed Planning Using Perceptual Equivalence Classes,” Proc. of the IEEE Int. Conf. on Robotics and Automation, Sacramento, CA, 1991, pp. 190–197.
Erdmann, M., On Motion Planning with Uncertainty, Tech. Rep. 810, AI Lab., MIT, Cambridge, MA, 1984.
Friedman, J., Computational Aspects of Compliant Motion Planning, Ph.D. Dissertation, Report No. STAN-CS-91-1368, Dept. of Computer Science, Stanford University, Stanford, CA, 1991.
Latombe, J.C., Lazanas, A., and Shekhar, S., “Robot Motion Planning with Uncertainty in Control and Sensing,” Artificial Intelligence J., 52(1), 1991, pp. 1–47.
Lazanas, A., and Latombe, J.C., Landmark-Based Robot Navigation, Tech. Rep. STAN-CS-92-1428, Dept. of Computer Science, Stanford, CA, 1992.
Lazanas, A., and Latombe, J.C., Motion Planning with Controllable Directional Uncertainty, Tech. Rep., Dept. of Computer Science, Stanford, CA, 1992.
Levitt, T.S., Lawton, D.T., Chelberg, D.M. and Nelson, P.C., “Qualitative Navigation,” Image Understanding Workshop, Los Angeles, CA, 1987, pp. 447–465.
Lozano-Pérez, T., Mason, M.T. and Taylor, R.H., “Automatic Synthesis of Fine-Motion Strategies for Robots,” Int. J. of Robotics Research, 3(1), 1984, pp. 3–24.
Mahadevan, S. and Connell, J., Automatic Programming of Behavior-based Robots using Reinforcement Learning, IBM T.J. Watson Res. Rept. (1990).
Natarajan, B.K., The Complexity of Fine Motion Planning, Int. J. of Robotics Research, 7(2):36–42, 1988.
Schoppers, M.J., Representation and Automatic Synthesis of Reaction Plans, Ph.D. Dissertation, Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lazanas, A., Latombe, JC. (1993). Landmark-based robot motion planning. In: Laugier, C. (eds) Geometric Reasoning for Perception and Action. GRPA 1991. Lecture Notes in Computer Science, vol 708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57132-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-57132-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57132-2
Online ISBN: 978-3-540-47913-0
eBook Packages: Springer Book Archive