TY - GEN
T1 - Minimizing node expansions in bidirectional search with consistent heuristics
AU - Shaham, Eshed
AU - Felner, Ariel
AU - Sturtevant, Nathan R.
AU - Rosenschein, Jeffrey S.
N1 - Funding Information:
The work was partially supported by the Israel Science Foundation (ISF) under grant #844/17 to Ariel Felner. This research has also been partially supported by the HUJI Cy-ber Security Research Center in conjunction with the Israel National Cyber Directorate (INCD) in the Prime Minister’s Office.
Publisher Copyright:
© 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - A* is optimally effective with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. Among bidirectional algorithms the Fractional MM algorithm is optimally effective (given the correct parameters) among admissible algorithms. This paper generalizes the bidirectional result to more complex settings where more information on the problem domain can be exploited: (1) When the cost of the minimal edge ? is known. (2) When the algorithm knows that the heuristics are consistent. This characterization uses a novel algorithm called MT. MT is similar to Fractional MM and is also optimally effective, but simpler to analyze.
AB - A* is optimally effective with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. Among bidirectional algorithms the Fractional MM algorithm is optimally effective (given the correct parameters) among admissible algorithms. This paper generalizes the bidirectional result to more complex settings where more information on the problem domain can be exploited: (1) When the cost of the minimal edge ? is known. (2) When the algorithm knows that the heuristics are consistent. This characterization uses a novel algorithm called MT. MT is similar to Fractional MM and is also optimally effective, but simpler to analyze.
UR - http://www.scopus.com/inward/record.url?scp=85074929198&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85074929198
T3 - Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018
SP - 81
EP - 89
BT - Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018
A2 - Bulitko, Vadim
A2 - Storandt, Sabine
PB - AAAI press
T2 - 11th International Symposium on Combinatorial Search, SoCS 2018
Y2 - 14 July 2018 through 15 July 2018
ER -