Header menu link for other important links
Path planning with local information
Kamala Krithivasan
Published in Springer Verlag
Volume: 338 LNCS
Pages: 108 - 121
We consider the problem of path-planning for a point mobile automaton in the presence of unknown obstacles in a two dimensional space. We present an algorithm which has better worst case complexity than that of Lumelsky and Stepanov [4], which is the best known at present. © 1988, Springer-Verlag.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherData powered by TypesetSpringer Verlag
Open AccessNo
Concepts (5)
  •  related image
    Software engineering
  •  related image
    Local information
  •  related image
    Two dimensional spaces
  •  related image
  •  related image
    Motion planning