George, JM and Sujit, PB and Sousa, JB and Pereira, FL (2010) Coalition Formation With Communication Ranges and Moving Targets. In: American Control Conference, JUN 30-JUL 02, 2010, Baltimore, MD, pp. 1605-1610.
Coalition.pdf - Published Version
Restricted to Registered users only
Download (423Kb) | Request a copy
A team of unmanned aerial vehicles (UAVs) with limited communication ranges and limited resources are deployed in a region to search and destroy stationary and moving targets. When a UAV detects a target, depending on the target resource requirement, it is tasked to form a coalition over the dynamic network formed by the UAVs. In this paper, we develop a mechanism to find potential coalition members over the network using principles from internet protocol and introduce an algorithm using Particle Swarm Optimization to generate a coalition that destroys the target is minimum time. Monte-Carlo simulations are carried out to study how coalition are formed and the effects of coalition process delays.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2009 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)|
|Date Deposited:||12 Apr 2011 07:45|
|Last Modified:||12 Apr 2011 07:45|
Actions (login required)