Multiple Agents Moving Target Search
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1536-1537.
Abstract
Traditional si ngle-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). There are algorithms for relaxing one or two of these constraints; in this paper we want to relax a ll four. The application domain is to have multiple search agents cooperate to pursue and capture a moving target. Agents are allowed to communicate with each other. For solving Multiple Agents Moving Target (MAMT) applications, we present a framework for specifying a family of suitable search algorithms. This paper investigates several effective approaches for solving problem instances in this domain.
@inproceedings{ijcai2003p264,
title = {Multiple Agents Moving Target Search},
author = {Goldenberg, Mark and Kovarsky, Alexander and Wu, Xiaomeng and Schaeffer, Jonathan},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1536--1537},
year = {2003},
url = {https://ijcai.org/proceedings/2003/264},
}
TY - CPAPER TI - Multiple Agents Moving Target Search AU - Goldenberg, Mark AU - Kovarsky, Alexander AU - Wu, Xiaomeng AU - Schaeffer, Jonathan T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1536 EP - 1537 UR - https://ijcai.org/proceedings/2003/264 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
