Login / Signup

A comparative study on the path length performance of maze-searching and robot motion planning algorithms.

Vladimir J. Lumelsky
Published in: IEEE Trans. Robotics Autom. (1991)
Keyphrases
  • path length
  • significant improvement
  • learning algorithm
  • high dimensional
  • mobile robot
  • computational cost
  • computationally efficient
  • shortest path
  • graph theory