Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. K. Forbus, J. Mahoney, and K. Dill. How qualitative spatial reasoning can improve strategy game AIs. AAAI Spring Symposium on Artificial Intelligence and Interactive Entertainment, pages 35–40, 2001.
2. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet., 4(2):100–107, 1968.
3. S. Johnson. Wild Things. Wired, pages 78–83, 2002. March issue.
4. R. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97–109, 1985.
5. R. Korf, M. Reid, and S. Edelkamp. Time complexity of iterative-deepening A*. Artificial Intelligence, 129(2):199–218, 2001.
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Commercial Supersonic Air Travel: Flight Routing and Demand Forecasting;Journal of Air Transportation;2024-05-17
2. Curvilinear Standard Cell Design for Semiconductor Manufacturing;IEEE Transactions on Semiconductor Manufacturing;2024-05
3. Comparison of Optimizing Path Planning for Mobile Robots with Obstacle Avoidance;2024 Seventh International Women in Data Science Conference at Prince Sultan University (WiDS PSU);2024-03-03
4. World Representation in Artificial Intelligence;Encyclopedia of Computer Graphics and Games;2024
5. Using Entropy for Modeling Difficulty in the Asteroid Escape Sliding Puzzle;2023 IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON);2023-12-05