Shortest path discovery problems: A framework, algorithms and experimental results

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 550-555

  Szepesvári, Csaba ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL PATH; REAL-WORLD EXPERIMENTS; SHORTEST PATH DISCOVERY (SPD) PROBLEMS; VEHICLE LICENSE PLATES;

ALGORITHMS; DISTANCE MEASUREMENT; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; MOTION PLANNING; OPTIMIZATION; PERFORMANCE;

ROBOTS;

EID: 9444228190     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Frigioni, D.; Marchetti-Spaccamela, A.; and Nanni, U. 2000. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms 34(2):251-281.
2. Furcy, D., and Koenig, S. 2000. Speeding up the convergence of real-time search. In Proceedings of the National Conference on Artificial Intelligence, 891-897.
3. Korf, R. 1990. Real-time heuristic search. Artificial Intelligence 42:189-211.
4. Ramalingam, G., and Reps, T. 1996. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms 21(2):267-305.