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

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 3366, Issue , 1998, Pages 262-272

  Boroujerdi, Ali ^a   Uhlmann, Jeffrey K ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

Dijkstra's algorithm; Least cost paths; Range searching; Routing; Turn constraints

Indexed keywords

COST BENEFIT ANALYSIS; COSTS; GRAPH THEORY; GROUND VEHICLES; ROBOTICS; ROBOTS; THREE DIMENSIONAL; VEHICLE ROUTING;

DIJKSTRA'S ALGORITHM; LEAST COST PATHS; RANGE SEARCHING; ROUTING; TURN CONSTRAINTS;

ROUTING ALGORITHMS;

EID: 62249185949     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.317554     Document Type: Conference Paper

References (5)

1. A. Boroujerdi and J. Uhlmann, "An Efficient Algorithm for Computing Least Cost Paths with Turn Constraints," (submitted to Information Processing Letters, 1997).
2. A. Boroujerdi, J. Uhlmann, M. Zuniga, "Constrained Routing for Strike Aircraft," NRL Review, 1997.
3. K. Mehlhorn and S. Naher, "Dynamical Fractional Cascading," Algorithmica, 5:215-241, 1990.
4. B. Moret, H. Shapiro, Algorithms from N to NP, Benjamin/Cummings, US (1990).
5. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, Prentice-Hall, 1995.