Get all the updates for this publication
Conferences
Path planning with local informationPublished in Springer Verlag
1988
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.
Topics: Any-angle path planning (61)%61% related to the paper, Worst-case complexity (56)%56% related to the paper, Motion planning (55)%55% related to the paper, Convex hull (55)%55% related to the paper and Point (geometry) (53)%53% related to the paper
View more info for "Path Planning with Local Information"
Content may be subject to copyright.
Related Papers (3)
ConferencesInferring plane orientation from a single motion blurred image2014 | Institute of Electrical and Electronics Engineers Inc.
About the journal
| Journal | Data powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Publisher | Data powered by TypesetSpringer Verlag |
| ISSN | 03029743 |
| Open Access | No |
Concepts (5)
Software engineering- Local information
- Two dimensional spaces
- WORST-CASE COMPLEXITY
- Motion planning
