Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms

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

Volumn , Issue , 2010, Pages 177-184

  Valenzano, Richard ^a   Sturtevant, Nathan ^a   Schaeffer, Jonathan ^a   Buro, Karen ^b   Kishimoto, Akihiro ^c  

^a UNIVERSITY OF ALBERTA   (Canada)

^b MACEWAN UNIVERSITY   (Canada)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED PLANNING SYSTEMS; MULTIPLE PARAMETERS; OFFLINE; ORDERS OF MAGNITUDE; PARALLELIZATIONS; PARAMETER SETTING; PARAMETER-TUNING; PROBLEM INSTANCES; SEARCH ALGORITHMS; SEARCH SPEED; SINGLE-AGENT; SLIDING-TILE PUZZLES;

AUTOMATION; LEARNING ALGORITHMS;

PARAMETER ESTIMATION;

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

References (18)

1. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artif. Intell. 129(1-2):5-33.
2. Burns, E.; Lemons, S.; Ruml, W.; and Zhou, R. 2009a. Parallel Best-First Search: Optimal and Suboptimal Solutions. In Proceedings of the International Symposium on Combinatorial Search (SoCS-09).
3. Burns, E.; Lemons, S.; Ruml, W; and Zhou, R. 2009b. Suboptimal and anytime heuristic search on multi-core machines. In ICAPS.
4. Cook, D. J., and Varnell, R. C. 1997. Maximizing the Benefits of Parallel Search Using Machine Learning. In AAAI, 559-564.
5. Culberson, J. C., and Schaeffer, J. 1996. Searching with Pattern Databases. In McCalla, G. L, ed., Canadian Conference on AI, volume 1081 of Lecture Notes in Computer Science, 402-416. Springer.
6. Felner, A.; Kraus, S.; and Korf, R. E. 2003. Kbfs: K-bestfirst search. Ann. Math. Artif. Intell. 39(1-2):19-39.
7. Furcy, D., and Koenig, S. 2005. Limited Discrepancy Beam Search. In IJCAI, 125-131.
8. Gomes, C. P.; Selman, B.; and Crato, N. 1997. Heavy-tailed distributions in combinatorial search. In Smolka, G., ed., CP, volume 1330 of Lecture Notes in Computer Science, 121-135. Springer.
9. Hamadi, Y.; Jabbour, S.; and Sais, L. 2009. ManySAT: a Parallel SAT Solver. Journal on Satisfiability, Boolean Modeling and Computation 6:245-262.
10. Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: What's the difference anyway? In ICAPS.
11. Helmert, M., and Geffner, H. 2008. Unifying the causal graph and additive heuristics. In ICAPS, 140-147.
12. Helmert, M. 2006. The fast downward planning system. J. Artif. Intell. Res. (JAIR) 26:191-246.
13. Hutter, F.; Hoos, H. H.; and Stützle, T. 2007. Automatic Algorithm Configuration Based on Local Search. In AAAI, 1152-1157. AAAI Press.
14. Kishimoto, A.; Fukunaga, A.; and Botea, A. 2009. Scalable, Parallel Best-First Search for Optimal Sequential Planning. In ICAPS, 201-208.
15. Knight, K. 1993. Are Many Reactive Agents Better Than a Few Deliberative Ones? In IJCAI, 432-437.
16. Korf, R. E. 1985. Iterative-Deepening-A*: An Optimal Admissible Tree Search. In IJCAI, 1034-1036.
17. Korf, R. E. 1993. Linear-Space Best-First Search. Artif. Intell. 62(1):41-78.
18. Wintersteiger, C. M.; Hamadi, Y.; and de Moura, L. M. 2009. A Concurrent Portfolio Approach to SMT Solving. In Bouajjani, A., and Maler, O., eds., CAV, volume 5643 of Lecture Notes in Computer Science, 715-720. Springer.