Abstract
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.
Cite
CITATION STYLE
APA
Datta, A., & Krithivasan, K. (1988). Path planning with local information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 338 LNCS, pp. 108–121). Springer Verlag. https://doi.org/10.1007/3-540-50517-2_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free