Paths that stay on a given network of line segments except to turn onto one segment from another by following a circular arc are studied. The problem of finding a shortest-length collision-free path of this form for an autonomous vehicle with a bound on its steering angle is considered. A polynomial-time algorithm to modify a given feasible path into a shortest-length path traversing the same sequence of lanes is given. However, if the sequence of lanes to be traversed is not fixed, then the general problem of finding a shortest-length path of the restricted form is shown to be NP-complete.<>
Shortest paths for autonomous vehicles
01.01.1989
408828 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
British Library Conference Proceedings | 2011
|FINDING SHORTEST PATHS FOR A TEAM OF CONVOY AND REPAIR VEHICLES
TIBKAT | 2021
|Timetable information and shortest paths
DataCite | 2005
|CALCULATING K-TH SHORTEST PATHS
NTIS | 1971
|