TY - GEN
T1 - A* search with inconsistent heuristics
AU - Zhang, Zhifu
AU - Sturtevant, Nathan R.
AU - Holte, Robert
AU - Schaeffer, Jonathan
AU - Felner, Ariel
PY - 2009
Y1 - 2009
N2 - Early research in heuristic search discovered that using inconsistent heuristics with A* could result in an exponential increase in the number of node expansions. As a result, the use of inconsistent heuristics has largely disappeared from practice. Recently, inconsistent heuristics have been shown to be effective in IDA*, especially when applying the bidirectional pathmax (BPMX) enhancement. This paper presents new worst-case complexity analysis of A*'s behavior with inconsistent heuristics, discusses how BPMX can be used with A*, and gives experimental results justifying the use of inconsistent heuristics in A* searches.
AB - Early research in heuristic search discovered that using inconsistent heuristics with A* could result in an exponential increase in the number of node expansions. As a result, the use of inconsistent heuristics has largely disappeared from practice. Recently, inconsistent heuristics have been shown to be effective in IDA*, especially when applying the bidirectional pathmax (BPMX) enhancement. This paper presents new worst-case complexity analysis of A*'s behavior with inconsistent heuristics, discusses how BPMX can be used with A*, and gives experimental results justifying the use of inconsistent heuristics in A* searches.
UR - http://www.scopus.com/inward/record.url?scp=77958537798&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77958537798
SN - 9781577354260
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 634
EP - 639
BT - IJCAI-09 - Proceedings of the 21st International Joint Conference on Artificial Intelligence
PB - International Joint Conferences on Artificial Intelligence
T2 - 21st International Joint Conference on Artificial Intelligence, IJCAI 2009
Y2 - 11 July 2009 through 16 July 2009
ER -