Switching from bidirectional to unidirectional search

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1999, Pages 1178-1183

  Kaindl, Hermann ^a   Kainz, Gerhard ^a   Steiner, Roland ^b   Auer, Andreas ^c   Radda, Klaus ^d  

^a SIEMENS AG ÖSTERREICH   (Austria)

^b not available   (Austria)

^c not available   (Austria)

^d not available   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BI-DIRECTIONAL SEARCH; DIFFERENT DOMAINS; NEW APPROACHES; OPTIMALITY; SEARCH ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

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

References (24)

1. P.P. Chakrabarti, S. Ghose, A. Acharya. and S.C. DcSarkar. Heuristic search in restricted memory. Artificial intelligence, 41(2): 197-221, 1989.
2. J. Culberson and J. Schaeffer. Searching with pattern databases. In G. McCalla, editor, Advances in Artificial Intelligence, pages 402-416. Springer-Verlag. Berlin, 1996.
3. D. de Champeaux and L. Sim. An improved bidirectional heuristic search algorithm. J. ACM, 24(2):177-191, 1977.
4. R. Dechter and J. Pearl. Generalized best-first strategies and the optimality of ,4*. J. ACM, 32(3):505-536, 1985.
5. J.F. Dillenburg and PC. Nelson. Perimeter search. Artificial Intelligence, 65(1): 165-178, 1994.
6. I.P Gent and T. Walsh. From approximate to optimal solutions: constructing pruning and propagation rules. In Proc. Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), pages 1396-1401. San Francisco, CA: Morgan Kaufmann Publishers, 1997.
7. S. Ghosh, A. Mahanti, and D.S. Nau. ITS: an efficient limited-memory heuristic tree search algorithm. In Proc. Twelfth National Conference on Artificial Intelligence (AAAI-94), pages 1353-1358. Menlo Park, CA: AAAI Press / The MIT Press, 1994.
8. H. Kaindl and G. Kainz. Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research (JAIR), 7:283-317, 1997.
9. H. Kaindl and H. Smetana. Experimental comparison of heuristic search algorithms. In AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods, pages 11-14, 1994.
10. H. Kaindl, G. Kainz, A. Leeb, and H. Smetana. How to use limited memory in heuristic search. In Proc. Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 236-242. San Francisco, CA: Morgan Kaufmann Publishers, 1995.
11. G. Kainz. Neue Algorithmen fur die bidirektionale heuristische Suche. Doctoral dissertation, Technische Universitat Wien, Vienna, Austria, 1996.
12. R.E. Korf and L.A. Taylor. Finding optimal solutions to the Twenty-Four Puzzle. In Proc. Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 1202-1207. Menlo Park, CA: AAAI Press / The MIT Press, 1996.
13. R.E. Korf. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985.
14. R.E. Korf. From approximate to optimal solutions: a case study of number partitioning. In Proc. Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 266-272. San Francisco, CA: Morgan Kaufmann Publishers, 1995.
15. J.B.H. Kwa. BS*: An Admissible Bidirectional Staged Heuristic Search Algorithm. Artificial Intelligence, 38(2):95 109, 1989.
16. E.L. Lawler and D. Wood. Branch-andbound methods: a survey. Operations Research, 14(4):699-719, 1966.
17. G. Manzini. BIDA*: an improved perimeter search algorithm. Artificial Intelligence, 75(2):347-360, 1995.
18. I. Pohl. Bi-directional search. In Machine Intelligence 6, pages 127-140, Edinburgh, 1971. Edinburgh University Press.
19. A. Reinefeld and T.A. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMl), 16( 12):701-709, July 1994.
20. S.J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs, NJ, 1995.
21. S. Russell. Efficient memory-bounded search methods. In Proc. Tenth European Conference on Artificial Intelligence (ECAI-92), pages 1-5. Chichester, England: Wiley, 1992.
22. A.K. Sen and A. Bagchi. Fast recursive formulations for best-first search that allow controlled use of memory. In Proc. Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), pages 297-302. San Francisco, CA: Morgan Kaufmann Publishers, 1989.
23. R. Steiner. Back jumping in Zustandsraumen und bidirektionale Suche beim TSP. Diplomarbeit, Technische Universitat Wien, Vienna, Austria, 1996.
24. W. Zhang and R.E. Korf. Depth-first vs. best-first search: new results. In Proc. Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 769-775. Menlo Park, CA: AAA! Press /The MIT Press, 1993.