Switching from Bidirectional to Unidirectional Search
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Search. Pages 1178-1182.
Abstract
Recen tl y, we showed that for traditional bidirectional 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 problematic. Using our improved understanding of the problem, we developed a new approach to improving this kind of search: switching to unidirectional search after the search frontiers meet for the first time (with the first solution found). This new approach shows improvements over previous bidirectional 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 .
@inproceedings{ijcai1999p167,
title = {Switching from Bidirectional to Unidirectional Search},
author = {Kaindl, Hermann and Kainz, Gerhard and Steiner, Roland and Auer, Andreas and Radda, Klaus},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {1178--1182},
year = {1999},
note = {Search},
url = {https://ijcai.org/proceedings/1999/167},
}
TY - CPAPER TI - Switching from Bidirectional to Unidirectional Search AU - Kaindl, Hermann AU - Kainz, Gerhard AU - Steiner, Roland AU - Auer, Andreas AU - Radda, Klaus T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 1178 EP - 1182 UR - https://ijcai.org/proceedings/1999/167 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
