Spatially Decomposed Searching by Heterogeneous Unmanned Systems
Unmanned vehicle control algorithms are continuously evolving, but may still overlook benefits of the intrinsic spatial separation offered in operations spanning multiple planes (aerial, ground/surface, underwater, etc.). We approach the problem of distributing a search space among heterogeneous vehicles over multiple planes from a distributed computing perspective. This yields a decomposition framework which we present with two sample search implementations: a distributed pheromone-based search, and a centralized auctioning search. Both algorithms operate similarly, incorporating differences among search vehicles and taking advantage of the inherent spatial separation between classes of vehicles to simplify searching. An Initial implementation of an auction-based search built on the decomposition framework is discussed along with potential future development.
M. R. Gosnell et al., "Spatially Decomposed Searching by Heterogeneous Unmanned Systems," Proceedings of the 2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems (2007, Waltham, MA), pp. 52-57, Institute of Electrical and Electronics Engineers (IEEE), May 2007.
The definitive version is available at https://doi.org/10.1109/KIMAS.2007.369784
2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems, KIMAS 2007 (2007: Apr. 30-May 3, Waltham, MA)
Keywords and Phrases
Algorithms; Multi Agent Systems, Heterogeneous Unmanned Systems; Search Space, Unmanned Aerial Vehicles (UAV)
International Standard Book Number (ISBN)
Article - Conference proceedings
© 2007 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
01 May 2007