Localized Search for Multiagent Planning
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 252-257.
Abstract
This paper describes the localized search mechanism of the GEMPLAN multiagent planner. Both formal complexity results and empirical results are provided, demonstrating the benefits oflocalized search. A localized domain description is one that decomposes domain activities and requirements into a set of regions. This description is used to infer how domain requirements are semantically localized and, as a result, to enable the decomposition of the planning search space into a set of spaces, one for each domain region. Benefits of localization include a smaller and cheaper overall search space as well as heuristic guidance in controlling search. Such benefits are critical if current planning technologies and other types of reasoning are to be scaled up to large, complex domains.
@inproceedings{ijcai1991p38,
title = {Localized Search for Multiagent Planning},
author = {Lansky, Amy L.},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {252--257},
year = {1991},
month = {8},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1991/38},
}
TY - CPAPER TI - Localized Search for Multiagent Planning AU - Lansky, Amy L. T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 252 EP - 257 UR - https://ijcai.org/proceedings/1991/38 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
