Learning in real-time search: A unifying framework

Journal of Artificial Intelligence Research

Volumn 25, Issue , 2006, Pages 119-157

  Bulitko, Vadim ^a   Lee, Greg ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; COMPUTER NETWORKS; COMPUTER SOFTWARE; FUNCTIONS; HEURISTIC METHODS; LEARNING SYSTEMS; PLANNING; REAL TIME SYSTEMS; ROUTERS; SENSORS; THREE TERM CONTROL SYSTEMS;

CONTROL PARAMETERS; LRTS; REAL-TIME SEARCH METHODS;

ARTIFICIAL INTELLIGENCE;

EID: 33744456486     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1789     Document Type: Article

References (54)

1. Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence, 72(1), 81-138.
2. BioWare (1999). Baldur's Gate. http://www.bioware.com/games/baldur_gate.
3. Blizzard (2002). Warcraft 3: Reign of chaos, http://www.blizzard.com/ war3.
4. Botea, A., Müller, M., & Schaeffer, J. (2004). Near Optimal Hierarchical Path-Finding. Journal of Game Development, 1(1), 7-28.
5. Braginsky, D., & Estrin, D. (2002). Rumor routing algorithm for sensor networks. In Proceedings of the First ACM Workshop on Sensor Networks and Applications, pp. 22-31.
6. Bulitko, V. (2003). Lookahead pathologies and meta-level control in real-time heuristic search. In Proceedings of the 15th Euromicro Conference on Real-Time Systems, pp. 13-16, Porto, Portugal.
7. Bulitko, V., Li, L., Greiner, R., & Levner, I. (2003). Lookahead pathologies for single agent search. In Proceedings of International Joint Conference on Artificial Intelligence, pp. 1531-1533, Acapulco, Mexico.
8. Bulitko, V. (2004). Learning for adaptive real-time search. Tech. rep. http://arxiv.org/abs/cs.AI/0407016, Computer Science Research Repository (CoRR).
9. Buro, M. (1995). Probcut: An effective selective extension of the alpha-beta algorithm. ICCA Journal, 18, 71-76.
10. Buro, M. (2002). ORTS: A hack-free RTS game environment. In Proceedings of International Computers and Games Conference, p. 12, Edmonton, Canada.
11. Chimura, F., & Tokoro, M. (1994). The Trailblazer search: A new method for searching and capturing moving targets. In Proceedings of the National Conference on Artificial Intelligence, pp. 1347-1352.
12. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs.. Numerische Mathematik, 1, 269-271.
13. Ensemble-Studios (1999). Age of empires II: Age of kings, http://www.microsoft.com/games/age2.
14. Furcy, D., & Koenig, S. (2000). Speeding up the convergence of real-time search. In Proceedings of the National Conference on Artificial Intelligence, pp. 891-897.
15. Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107.
16. Herbert, M., McLachlan, R., & Chang, P. (1999). Experiments with driving modes for urban robots. In Proceedings of the SPIE Mobile Robots.
17. Holte, R., Drummond, C., Perez, M., Zimmer, R., & MacDonald, A. (1994). Searching with abstractions: A unifying framework and new high-performance algorithm. In Proceedings of the Canadian Artificial Intelligence Conference, pp. 263-270.
18. Holte, R. (1996). Hierarchical A*: Searching abstraction hierarchies efficiently. In Proceedings of the National Conference on Artificial Intelligence, pp. 530-535.
19. Hsu, F., Campbell, M., & Hoane, A. (1995). Deep Blue system overview. In Proceedings of the 9th ACM International Conference on Supercomputing, pp. 240-244.
20. Ishida, T. (1997). Real-time Search for Learning Autonomous Agents. Kluwer Academic Publishers.
21. Ishida, T., & Korf, R. (1991). Moving target search. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 204-210.
22. Ishida, T., & Korf, R. (1995). A realtime search for changing goals. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(6), 609-619.
23. Kallmann, M., Bieri, H., & Thalmann, D. (2003). Fully dynamic constrained Delaunay triangulations. In Brunnett, G., Hamann, B., Mueller, H., & Linsen, L. (Eds.), Geometric Modelling for Scientific Visualization, pp. 241-257. Springer-Verlag, Heidelberg, Germany.
24. Kitano, H., Tadokoro, S., Noda, I., Matsubara, H., Takahashi, T., Shinjou, A., & Shimada, S. (1999). Robocup rescue: Search and rescue in large-scale disasters as a domain for autonomous agents research. In Proceedings of the IEEE Conference on Man, Systems, and Cybernetics.
25. Koenig, S. (1999). Exploring unknown environments with real-time search or reinforcement learning. In Proceedings of the Neural Information Processing Systems, pp. 1003-1009.
26. Koenig, S., & Likhachev, M. (2002). D* Lite. In Proceedings of the National Conference on Artificial Intelligence, pp. 476-483.
27. Koenig, S., Tovey, C., & Smirnov, Y. (2003). Performance bounds for planning in unknown terrain. Artificial Intelligence, 147, 253-279.
28. Koenig, S. (2001). Agent-centered search. Artificial Intelligence Magazine, 22(4), 109-132.
29. Koenig, S. (2004). A comparison of fast search methods for real-time situated agents. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2, pp. 864-871.
30. Koenig, S., & Simmons, R. (1998). Solving robot navigation problems with initial pose uncertainty using real-time heuristic search. In Proceedings of the International Conference on Artificial Intelligence Planning Systems, pp. 144-153.
31. Korf, R. (1985). Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27(3), 97-109.
32. Korf, R. (1990). Real-time heuristic search. Artificial Intelligence, 42(2-3), 189-211.
33. Korf, R. (1993). Linear-space best-first search. Artificial Intelligence, 62, 41-78.
34. Ng, A. Y., Coates, A., Diel, M., Ganapathi, V., Schulte, J., Tse, B., Berger, E., & Liang, E. (2004). Inverted autonomous helicopter flight via reinforcement learning. In Proceedings of the International Symposium on Experimental Robotics.
35. Pearl, J. (1984). Heuristics. Addison-Wesley.
36. Pottinger, D. C. (2000). Terrain analysis in realtime strategy games. In Proceedings of Computer Game Developers Conference.
37. Ratner, D., & Warmuth, M. (1986). Finding a shortest solution for the N × N extension of the 15-puzzle is intractable. In Proceedings of the National Conference on Artificial Intelligence, pp. 168-172.
38. Reece, D., Krauss, M., & Dumanoir, P. (2000). Tactical movement planning for individual combatants. In Proceedings of the 9th Conference on Computer Generated Forces and Behavioral Representation.
39. Royer, E., & Toh, C. (1999). A review of current routing protocols for ad hoc mobile wireless networks. In IEEE Personal Communications, Vol. 6, pp. 46-55.
40. Russell, S., & Wefald, E. (1991). Do the right thing: Studies in limited rationality. MIT Press.
41. Schaeffer, J., Culberson, J., Treloar, N., Knight, B., Lu, P., & Szafron, D. (1992). A world championship caliber checkers program. Artificial Intelligence, 53(2-3), 273-290.
42. Shang, Y., Fromherz, M. P., Zhang, Y., & Crawford, L. S. (2003). Constraint-based routing for ad-hoc networks. In Proceedings of the IEEE International Conference on Information Technology: Research and Education, pp. 306-310, Newark, NJ, USA.
43. Shimbo, M., & Ishida, T. (2003). Controlling the learning process of real-time heuristic search. Artificial Intelligence, 146(1), 1-41.
44. Shue, L.-Y., Li, S.-T., & Zamani, R. (2001). An intelligent heuristic algorithm for project scheduling problems. In Proceedings of the Thirty Second Annual Meeting of the Decision Sciences Institute, San Francisco.
45. Shue, L.-Y., & Zamani, R. (1993). An admissible heuristic search algorithm. In Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems, Vol. 689 of LNAI, pp. 69-75. Springer Verlag.
46. Stenz, A. (1995). The focussed D* algorithm for real-time replanning. In Proceedings of the International Conference on Artificial Intelligence, pp. 1652-1659.
47. Sturtevant, N. (2005). Path refinement in A* search. Tech. rep., University of Alberta.
48. Sutton, R. (2005). The value function hypothesis, http://rlai.cs. ualberta.ca/RLAI/ valuefunctionhypothesis.html.
49. Sutton, R., & Barto, A. (1998). Reinforcement Learning: An Introduction. MIT Press.
50. Thayer, S., Digney, B., Diaz, M., Stentz, A., Nabbe, B., & Hebert, M. (2000). Distributed robotic mapping of extreme environments. In Proceedings of the SPIE: Mobile Robots XV and Telemanipulator and Telepresence Technologies VII.
51. Watkins, C. (1989). Learning from Delayed Rewards. Ph.D. thesis, Kings College, Cambridge University.
52. Woodcock, S. (2000). Can AI SDKs help?. Game Developer magazine.
53. Yan, T., He, T., & Stankovic, J. A. (2003). Differentiated surveillance for sensor networks. In Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 51-62.
54. Yu, Y., Govindan, R., & Estrin, D. (2001). Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. Tech. rep. UCLA/CSD-TR-01-0023, UCLA Computer Science Department.