K*: A heuristic search algorithm for finding the k shortest paths

Artificial Intelligence

Volumn 175, Issue 18, 2011, Pages 2129-2154

  Aljazzar, Husain ^a   Leue, Stefan ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Heuristic search; k Shortest paths problem; K*; On the fly search

Indexed keywords

EXPERIMENTAL EVALUATION; HEURISTIC FUNCTIONS; HEURISTIC SEARCH; HEURISTIC SEARCH ALGORITHMS; K SHORTEST PATH; K-SHORTEST-PATHS PROBLEM; MAIN MEMORY; ON-THE-FLY; ROUTE PLANNING; RUNTIMES; SEARCH ALGORITHMS; STATE OF THE ART; WEIGHTED GRAPH; WORST-CASE COMPLEXITY;

HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; MODEL CHECKING; MODULAR ROBOTS; STOCHASTIC MODELS;

GRAPH THEORY;

EID: 80052824090     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2011.07.003     Document Type: Article

References (23)

1. D. Eppstein Finding the k shortest paths SIAM J. Computing 28 2 1998 652 673 URL http://dx.doi.org/10.1137/S0097539795290477
2. C. Baier, and J.-P. Katoen Principles of Model Checking 2008 The MIT Press
3. T. Han, and J.-P. Katoen Counterexamples in probabilistic model checking 13th International Conference on Tools and Algorithms for the Construction of Systems (TACAS?07) Lecture Notes in Computer Science vol. 4424 2007 Springer 72 86 (Pubitemid 350262647)
4. H. Aljazzar, Directed diagnostics of system dependability models, PhD thesis, University of Konstanz, 2009. URL http://kops.ub.uni-konstanz.de/ volltexte/2009/9188/.
5. H. Aljazzar, and S. Leue Generation of counterexamples for model checking of Markov decision processes 6th International Conference on the Quantitative Evaluation of Systems (QEST?09) 2009 IEEE Computer Society Press 197 206
6. E. de Queirós Vieira Martins, J.L.E. dos Santos, A new shortest paths ranking algorithm, Tech. rep., Departamento de Matemática, Universidade de Coimbra, Portugal, July 1999, URL: http://www.mat.uc.pt/~eqvm.
7. V.M. Jiménez, and A. Marzal Computing the k shortest paths: A new algorithm and an experimental comparison 3rd International Workshop on Algorithm Engineering (WAE?99) Lecture Notes in Computer Science vol. 1668 1999 Springer 15 29
8. V.M. Jiménez, and A. Marzal A lazy version of Eppstein?s shortest paths algorithm 2nd International Workshop on Experimental and Efficient Algorithms (WEA?03) Lecture Notes in Computer Science vol. 2647 2003 Springer 179 190
9. L. Galand, and P. Perny Search for compromise solutions in multi-objective state space graphs 17th European Conference on Artificial Intelligence (ECAI?06) Frontiers in Artificial Intelligence and Applications vol. 141 2006 IOS Press 93 97
10. * parsing 46th Annual Meeting of the Association for Computational Linguistics (ACL?09), ACL-IJCNLP?09 2009 Association for Computational Linguistics 958 966
11. H. Aljazzar, H. Hermanns, and S. Leue Counterexamples for timed probabilistic reachability 3rd International Conference of Formal Modeling and Analysis of Timed Systems (FORMATS?05) Lecture Notes in Computer Science vol. 3829 2005 Springer 177 195 (Pubitemid 43952395)
12. H. Aljazzar, and S. Leue Directed explicit state-space search in the generation of counterexamples for stochastic model checking IEEE Transaction on Software Engineering 36 1 2010 37 60
13. H. Aljazzar, M. Fischer, L. Grunske, M. Kuntz, F. Leitner, and S. Leue Safety analysis of an airbag system using probabilistic FMEA and probabilistic counter examples 6th International Conference on the Quantitative Evaluation of Systems (QEST?09) 2009 IEEE Computer Society Press 299 308
14. E.W. Dijkstra A note on two problems in connexion with graphs Numerische Mathematik 1 1959 269 271
15. J. Pearl Heuristics - Intelligent Search Strategies for Computer Problem Solving 1986 Addision-Wesley
16. * J. ACM 32 3 1985 505 536 (Pubitemid 15507408)
17. G.N. Frederickson Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees 32nd Annual Symposium on Foundations of Computer Science FOCS 1991 1991 IEEE 632 641
18. G.N. Frederickson An optimal algorithm for selection in a min-heap Information and Computation 104 2 1993 197 214
19. P. Sanders, and D. Schultes Engineering fast route planning algorithms 6th International Workshop on Experimental Algorithms (WEA?07) Lecture Notes in Computer Science vol. 4525 2007 Springer 23 36 (Pubitemid 350259657)
20. J.Y. Yen Finding the k shortest loopless paths in a network Management Science 17 11 1971 712 716
21. The 9th DIMACS implementation challenge: The shortest path problem, Department of Computer and System Sciences Antonio Ruberti, Sapienza University of Rome, http://www.dis.uniroma1.it/~challenge9/, 2006.
22. B.R. Haverkort, H. Hermanns, J.-P. Katoen, On the use of model checking techniques for dependability evaluation, in: 19th IEEE Symposium on Reliable Distributed Systems (SRDS 2000), 2000, pp. 228-237. (Pubitemid 32026844)
23. A. Hinton, M.Z. Kwiatkowska, G. Norman, and D. Parker PRISM: A tool for automatic verification of probabilistic systems 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS?06) Lecture Notes in Computer Science vol. 3920 2006 Springer 441 444 (Pubitemid 44019387)