TBA*: Time-Bounded A*

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 431-436

  Björnsson, Yngvi ^a   Bulitko, Vadim ^b   Sturtevant, Nathan ^b  

^a REYKJAVIK UNIVERSITY   (Iceland)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS;

FINDING PATHS; HEURISTIC SEARCH ALGORITHMS; PATH FINDING; PATTERN DATABASE; PLANNING AND EXECUTION; PLANNING STEPS; REAL TIME RESPONSE; REAL-TIME SEARCHES;

HEURISTIC ALGORITHMS;

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

References (13)

1. Y. Björnsson, M. Enzenberger, R. Holte, and J. Schaeffer. Fringe search: Beating A* at pathfinding on computer game maps. In IEEE Symp. on Comp. Intelligence in Games, pages 125-132, 2005.
2. V. Bulitko, N. Sturtevant, J. Lu, and T. Yau. Graph Abstraction in Real-time Heuristic Search. JAIR, 30:51-100, 2007.
3. V. Bulitko, M. Luštrek, J. Schaeffer, Y. Björnsson, and S. Sigmundarson. Dynamic Control in Real-Time Heuristic Search. JAIR, 32:419-452, 2008.
4. R. B. Dial. Shortest-path forest with topological ordering. Commun. ACM, 12(11):632-633, 1969.
5. P.E. Hart, N.J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Systems Science and Cyber., 4(2):100-107, 1968.
6. T. Ishida. Moving target search with intelligence. In AAAI, pages 525-532, 1992.
7. S. Koenig. A comparison of fast search methods for real-time situated agents. In AAMAS, pages 864-871, 2004.
8. R.E. Korf. Depth-first iterative deepening : An optimal admissible tree search. AIJ, 27(3):97-109, 1985.
9. R.E. Korf. Real-time heuristic search. AIJ, 42(2-3):189-211, 1990.
10. M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun. Anytime dynamic A*: An anytime, replanning algorithm. In ICAPS, pages 262-271, 2005.
11. D. C. Rayner, K. Davison, V. Bulitko, K. Anderson, and J. Lu. Real-time heuristic search with a priority queue. In IJCAI, pages 2372-2377, 2007.
12. A. Stenz. The focussed D* algorithm for realtime replanning. In IJCAI, pages 1652-1659, 1995.
13. N. Sturtevant and M. Buro. Partial pathfinding using map abstraction and refinement. In AAAI, pages 1392-1397, 2005.