Back to Search Start Over

Path planning with local information

Authors :
Amitava Datta
Kamala Krithivasan
Source :
Lecture Notes in Computer Science ISBN: 9783540505174, FSTTCS
Publication Year :
1988
Publisher :
Springer Berlin Heidelberg, 1988.

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.

Subjects

Subjects :
Convex hull
Mathematical optimization
Two-dimensional space
Computer science
Worst-case complexity
Point (geometry)
Motion planning
Any-angle path planning
Automaton

Details

ISBN :
978-3-540-50517-4
ISBNs :
9783540505174
Database :
OpenAIRE
Journal :
Lecture Notes in Computer Science ISBN: 9783540505174, FSTTCS
Accession number :
edsair.doi...........a67decf8283cf3c71c278404460a03fc
Full Text :
https://doi.org/10.1007/3-540-50517-2_74
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details