Controlling the learning process of real-time heuristic search

Barto, 1995, Learning to act using real-time dynamic programming, Artificial Intelligence, 72, 81, 10.1016/0004-3702(94)00011-O Bertsekas, 1989 Bonet, 1998, Learning sorting and decision trees with POMDPs, 73 Bonet, 2001, Planning as heuristic search, Artificial Intelligence, 129, 5, 10.1016/S0004-3702(01)00108-4 Dasgupta, 1994, Agent search in a tree and the optimality of iterative deepening, Artificial Intelligence, 71, 195, 10.1016/0004-3702(94)90066-3 Davis, 1988, The advantages of using depth and breadth components in heuristic search, 19 Dorf, 1995 Edelkamp, 1997, New strategies in learning real time heuristic search, 30 Furcy, 2000, Speeding up the convergence of real-time search, 891 D. Furcy, S. Koenig, Speeding up the convergence of real-time search: empirical setup and proofs, Technical Report GIT-COGSCI-2000/01, College of Computing, Georgia Institute of Technology, Atlanta, GA, 2000 Furcy, 2001, Combining two fast-learning real-time search algorithms yields even faster learning Harris, 1974, The heuristic search under conditions of error, Artificial Intelligence, 5, 217, 10.1016/0004-3702(74)90014-9 Hart, 1968, A formal basis for the heuristic determination of minimum cost path, IEEE Trans. Systems Sci. Cybernet. (SSC), 4, 100, 10.1109/TSSC.1968.300136 Ikeda, 1999, Enhanced A∗ algorithms for multiple alignments: Optimal alignments for several sequences and k-opt approximate alignments for large cases, Theoret. Comput. Sci., 210, 341, 10.1016/S0304-3975(98)00093-0 Ishida, 1997 Ishida, 1991, Moving-target search, 204 Ishida, 1995, Moving-target search: A real-time search for changing goals, IEEE Trans. Pattern Anal. Machine Intelligence (PAMI), 17, 609, 10.1109/34.387507 Ishida, 1996, Improving the learning efficiencies of real-time search, 305 S. Koenig, The complexity of real-time search, Technical Report CMU-CS-92-145, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1992 Koenig, 2001, Mini-max real-time search, Artificial Intelligence, 129, 165, 10.1016/S0004-3702(01)00103-5 Korf, 1985, Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence, 27, 97, 10.1016/0004-3702(85)90084-0 Korf, 1990, Real-time heuristic search, Artificial Intelligence, 42, 189, 10.1016/0004-3702(90)90054-4 Korf, 1993, Linear-space best-first search, Artificial Intelligence, 62, 41, 10.1016/0004-3702(93)90045-D Miura, 1998, Stochastic node caching for efficient memory-bounded search, 450 Mizuno, 1995, Evaluation on learning efficiencies of real-time search, J. Japan. Soc. Artificial Intelligence, 10, 306 Moore, 1993, Prioritized sweeping: Reinforcement learning with less data and less time, Machine Learning, 13, 103, 10.1007/BF00993104 Pearl, 1984 Pohl, 1970, First results on the effect of error in heuristic search, 219 Pohl, 1970, Heuristic search viewed as path finding in a graph, Artificial Intelligence, 1, 193, 10.1016/0004-3702(70)90007-X Ratner, 1990, The (n2−1)-puzzle and related relocation problems, J. Symbolic Comput., 10, 111, 10.1016/S0747-7171(08)80001-6 Russell, 1991 Shimbo, 2000, Towards real-time search with inadmissible heuristics, 609 Simon, 1996 Yoshizumi, 2000, A∗ with partial expansion for large branching factor problems, 923