Empirical analysis of new methods for computing minimum cost paths with turn constraints

Ali Boroujerdi; Jeffrey K. Uhlmann

doi:10.1117/12.317554

12 August 1998 Empirical analysis of new methods for computing minimum cost paths with turn constraints

Ali Boroujerdi, Jeffrey K. Uhlmann

Proceedings Volume 3366, Robotic and Semi-Robotic Ground Vehicle Technology; (1998) https://doi.org/10.1117/12.317554
Event: Aerospace/Defense Sensing and Controls, 1998, Orlando, FL, United States

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.

Citation Download Citation

Ali Boroujerdi and Jeffrey K. Uhlmann "Empirical analysis of new methods for computing minimum cost paths with turn constraints", Proc. SPIE 3366, Robotic and Semi-Robotic Ground Vehicle Technology, (12 August 1998); https://doi.org/10.1117/12.317554

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available