Single-Agent Parallel Window Search: A Summary of Results
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Tools. Pages 36-40.
Abstract
We show how node ordering can be combined with parallel window search to quickly find a nearly optimal solution to single-agent problems. First, we show how node ordering by maximum g among nodes with equal f = g + h values can improve the performance of IDA*. We then consider a window search where different processes perform IDA* simultaneously on the same problem but with different cost thresholds. Finally, we combine the two ideas to produce a parallel window search algorithm in which node ordering information is shared among the different processes. Parallel window search can be used to find a nearly optimal solution quickly, improve the solution until it is optimal, and then finally guarantee optimality, depending on the amount of time available.
@inproceedings{ijcai1989p6,
title = {Single-Agent Parallel Window Search: A Summary of Results},
author = {Powley, Curt and Korf, Richard E.},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {36--40},
year = {1989},
month = {8},
note = {Tools},
url = {https://ijcai.org/proceedings/1989/6},
}
TY - CPAPER TI - Single-Agent Parallel Window Search: A Summary of Results AU - Powley, Curt AU - Korf, Richard E. T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 36 EP - 40 UR - https://ijcai.org/proceedings/1989/6 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
