Share Email Print

Proceedings Paper

Empirical analysis of new methods for computing minimum cost paths with turn constraints
Author(s): Ali Boroujerdi; Jeffrey K. Uhlmann
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper we describe a recently developed algorithm for computing least cost paths under turn angle constraints. If a graph representation of a two or three dimensional routing problem contains V vertices and El edges, then the new algorithm scales as O(IEI log V). This result is substantially better than O((EIIVI) algorithms for the more general problem of routing with turn penalties, which cannot be applied to large scale graphs. We also describe an enhancement to the new algorithm that dramatically improves the performance in practice. We provide empirical results showing that the new algorithm can substantially reduce the computation time required for constrained vehicle routing. This performance is sufficient to allow for the dynamic re-routing of vehicles in uncertain or changing environments. Keywords: Dijkstra's algorithm, least cost paths, range searching, routing, turn constraints.

Paper Details

Date Published: 12 August 1998
PDF: 11 pages
Proc. SPIE 3366, Robotic and Semi-Robotic Ground Vehicle Technology, (12 August 1998); doi: 10.1117/12.317554
Show Author Affiliations
Ali Boroujerdi, Naval Research Lab. (United States)
Jeffrey K. Uhlmann, Naval Research Lab. (United States)

Published in SPIE Proceedings Vol. 3366:
Robotic and Semi-Robotic Ground Vehicle Technology
Grant R. Gerhart; Ben A. Abbott, Editor(s)

© SPIE. Terms of Use
Back to Top