1. A formal basis for the heuristic determination of minimum cost paths;Hart;IEEE Transactions on Systems, Science, and Cybernetics SSC,1968
2. A note on two problems in connexion with graphs;Dijkstra;Numerische Mathematik,1959
3. Generalized best-first search strategies and the optimality af A∗;Dechter;Journal of the Association for Computing Machinery,1985
4. Approximate reasoning using anytime algorithms;Zilberstein,1995
5. T.L. Dean, M. Boddy, An analysis of time-dependent planning, in: Proceedings of the National Conference on Artificial Intelligence (AAAI), 1988