A comparative study on the path length performance of maze-searching and robot motion planning algorithms
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 7 (1), 57-66
- https://doi.org/10.1109/70.68070
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Incorporating range sensing in the robot navigation functionIEEE Transactions on Systems, Man, and Cybernetics, 1990
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shapeAlgorithmica, 1987
- Effect of kinematics on motion planning for planar robot arms moving amidst unknown obstaclesIEEE Journal on Robotics and Automation, 1987
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- On the power of the compass (or, why mazes are easier to search than graphs)Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Environments, labyrinths and automataLecture Notes in Computer Science, 1977
- Economic Traversal of LabyrinthsMathematics Magazine, 1970