Multiple Agents Moving Target Search
- Mark Goldenberg
- Alex Kovarksy
- Xiaomeng Wu, Computing Science
- Jonathan Schaeffer, Department of Computing Science, University of Alberta
Traditional single-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 all 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.
Citation
M. Goldenberg, A. Kovarksy, X. Wu, J. Schaeffer. "Multiple Agents Moving Target Search". International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, pp 1511-1512, January 2003.| Keywords: | machine learning |
| Category: | In Conference |
BibTeX
@incollection{Goldenberg+al:IJCAI03,
author = {Mark Goldenberg and Alex Kovarksy and Xiaomeng Wu and Jonathan
Schaeffer},
title = {Multiple Agents Moving Target Search},
Pages = {1511-1512},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI)},
year = 2003,
}Last Updated: June 05, 2007Submitted by Staurt H. Johnson
