Speeding up moving-target search

Proceedings of the International Conference on Autonomous Agents

Volumn , Issue , 2007, Pages 1144-1151

  Koenig, Sven ^a   Likhachev, Maxim ^b   Sun, Xiaoxun ^a  

^a Dept of Physics   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

D; Hunter; Incremental heuristic search; lite; Moving target search; MT adaptive A; Planning with the freespace assumption; Target; Unknown terrain; Video games

Indexed keywords

D; HUNTER; INCREMENTAL HEURISTIC SEARCH; LITE; MOVING-TARGET SEARCH; MT-ADAPTIVE A; UNKNOWN TERRAIN; VIDEO GAMES;

AGENTS; AUTONOMOUS AGENTS; COMPUTER CONTROL SYSTEMS; FUZZY CLUSTERING; GAME THEORY; MODULAR ROBOTS; TARGETS; TELLURIC PROSPECTING;

HEURISTIC METHODS;

EID: 60449083144     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1329125.1329353     Document Type: Conference Paper

References (14)

1. M. Goldenberg, A. Kovaksy, X. Wu, and J. Schaeffer. Multiple agents moving target search, In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1538-1538, 2003.
2. P. Hart, N. Nilsson, and 6. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 2:100-107, 1968.
3. R. Holte, T. Mkadmi, R. Zimmer, and A. MacDonald. Speeding up problem solving by abstraction: A graph oriented approach. Artificial Intelligence, 85(1-2):321-361, 1996.
4. T. Ishida and R. Korf. Moving target search. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 204-210, 1991.
5. S. Koenig and M. Likhachev. D* Lite. In Proceedings of the National Conference on Artificial Intelligence, pages 476-483, 2002.
6. S. Koenig and M. Likhachev. Incremental A*. In T. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 1539-1546, Cambridge, MA, 2002. MIT Press.
7. S. Koenig and M. Likhachev. Adaptive A*. In Proceedings of the International Joint Conference on Autonomous Agents and Multi-Agent Systems, pages 1311-1312, 2005.
8. S. Koenig and M. Likhachev. A new principle for incremental heuristic search: Theoretical results. In Proceedings of the International Conference on Automated Planning and Scheduling, pages 410-413, 2006.
9. S. Koenig and M. Likhachev. Real-Time Adaptive A*. In Proceedings of the International Joint Conference on Autonomous Agents and Multi-Agent Systems, pages 281-288, 2006.
10. S. Koenig, M. Likhachev, and D. Furcy. Lifelong Planning A*. Artificial Intelligence, 155(1-2):93-146, 2004.
11. S. Koenig and R. Simmons. Real-time search in non-deterministic domains. In Proceedings of the international Joint Conference on Artificial Intelligence, pages 1660-1667, 1995.
12. M. Likhachev and S. Koenig. Speeding up the Parti-Game algorithm. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 1563-1570, Cambridge, MA, 2002. MIT Press.
13. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1985.
14. A. Stentz. The focussed D* algorithm for real-time replanning, In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1652-1659, 1995.