ML Anthology

Switching from Bidirectional to Unidirectional Search

Hermann Kaindl, Gerhard Kainz, Roland Steiner, Andreas Auer, Klaus Radda
IJCAI 1999 pp. 1178-1183
/ijcai/1999/kaindl1999ijcai-switching/

Abstract

Recently, we showed that for traditional bidirec-tional search with "front-to-end " evaluations, it is not the meeting of search fronts but the cost of proving the optimality of a solution that is prob-lematic. Using our improved understanding of the problem, we developed a new approach to improv-ing this kind of search: switching to unidirectional search after the search frontiers meet for the first time (with the first solution found). This new ap-proach shows improvements over previous bidirec-tional search approaches and (partly) also over the corresponding unidirectional search approaches in different domains. Together with a special-purpose improvement for the TSP, this approach showed better results than the standard search algorithms using the same knowledge. 1

PDF Semantic Scholar

Cite

Text

Kaindl et al. "Switching from Bidirectional to Unidirectional Search." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Kaindl et al. "Switching from Bidirectional to Unidirectional Search." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/kaindl1999ijcai-switching/)

BibTeX

@inproceedings{kaindl1999ijcai-switching,
  title     = {{Switching from Bidirectional to Unidirectional Search}},
  author    = {Kaindl, Hermann and Kainz, Gerhard and Steiner, Roland and Auer, Andreas and Radda, Klaus},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {1178-1183},
  url       = {https://mlanthology.org/ijcai/1999/kaindl1999ijcai-switching/}
}