The joy of forgetting: Faster anytime search via restarting

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 137-144

  Richter, Silvia ^a,b   Thayer, Jordan T ^c   Ruml, Wheeler ^c  

^a GRIFFITH UNIVERSITY   (Australia)

^b CSIRO   (Australia)

^c UNIVERSITY OF NEW HAMPSHIRE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME SEARCH; GREEDY SEARCH; INITIAL SOLUTION; INITIAL STATE; NEW SOLUTIONS; OPTIMISATIONS; POOR PERFORMANCE;

SYSTEMATIC ERRORS;

HEURISTIC METHODS;

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

References (22)

1. Sandip Aine, P. P. Chakrabarti, and Rajeev Kumar. AWA* - A window constrained anytime heuristic search algorithm. In Proc. IJCAI 2007, pages 2250-2255, 2007.
2. Rina Dechter and Judea Pearl. The optimality of A*. In Laveen Kanal and Vipin Kumar, editors, Search in Artificial Intelligence, pages 166-199. Springer-Verlag, 1988.
3. David Furcy and Sven Koenig. Limited discrepancy beam search. In Proc. IJCAI 2005, pages 125-131, 2005.
4. Carla P. Gomes, Bart Selman, and Henry A. Kautz. Boosting combinatorial search through randomization. In Proc. AAAI 1998, pages 431-437, 1998.
5. Eric A. Hansen and Rong Zhou. Anytime heuristic search. JAIR, 28:267-297, 2007.
6. Eric A. Hansen, Shlomo Zilberstein, and Victor A. Danilchenko. Anytime heuristic search: First results. Technical Report CMPSC1 97-50, University of Massachusetts, Amherst, September 1997.
7. Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2): 100-107, 1968.
8. William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Proc. IJCA1 1995, pages 607-615, 1995.
9. Malte Helmert and Héctor Geffner. Unifying the causal graph and additive heuristics. In Proc. ICAPS 2008, pages 140-147, 2008.
10. Malte Helmert and Gabriele Röger. How good is almost perfect? In Proc. AAAI 2008, pages 944-949, 2008.
11. Malte Helmert, Minh Do, and Ioannis Refanidis. IPC 2008, deterministic part. Web site, http://ipc.Informatik.uni-freiburg.de, 2008.
12. Malte Helmert. The Fast Downward planning system. JAIR, 26:191-246, 2006.
13. Richard E. Korf. Depth-first iterative-deepending: An optimal admissible tree search. AIJ, 27(1):97-109, 1985.
14. Maxim Likhachev, Geoffrey J. Gordon, and Sebastian Thrun. ARA*: Anytime A* with provable bounds on sub-optimality. In Proc. NIPS-03, 2004.
15. Maxim Likhachev, Dave Ferguson, Geoffrey J. Gordon, Anthony Stentz, and Sebastian Thrun. Anytime search in dynamic graphs. AIJ, 172(14):1613-1643, 2008.
16. Ira Pohl. Heuristic search viewed as path finding in a graph. AIJ, 1:193-204, 1970.
17. Silvia Richter, Malte Helmert, and Matthias Westphal. Landmarks revisited. In Proc. AAAI 2008, pages 975-982, 2008.
18. Silvia Richter, Jordan T. Thayer, and Wheeler Ruml. The joy of forgetting: Faster anytime search via restarting. In International Symposium on Combinatorial Search (SoCS 2009), 2009.
19. Bart Selman, Hector J. Levesque, and David G. Mitchell. A new method for solving hard satisfiability problems. In Proc. AAAI-92, pages 440-446, 1992.
20. Uzi Zahavi, Ariel Felner, Jonathan Schaeffer, and Nathan R. Sturtevant. Inconsistent heuristics. In Proc. AAAI 2007, pages 1211-1216, 2007.
21. Weixiong Zhang. Complete anytime beam search. In Proc. AAAI 1998, pages 425-430, 1998.
22. Rong Zhou and Eric A. Hansen. Beam-stack search: Integrating backtracking with beam search. In Proc. ICAPS 2005, pages 90-98, 2005.