• International Journal of Aeronautical and Space Sciences
• /
• v.12 no.2
• /
• pp.163-174
• /
• 2011

Task assignments of multiple unmanned aerial vehicles (UAVs) are examined. The phrase "task assignment" comprises the decision making procedures of a UAV group. In this study, an on-line decentralized task assignment algorithm is proposed for an autonomous UAV group. The proposed method is divided into two stages: an order optimization stage and a communications and negotiation stage. A genetic algorithm and negotiation strategy based on one-to-one communication is adopted for each stage. Through the proposed algorithm, decentralized task assignments can be applied to dynamic environments in which sensing range and communication are limited. The performance of the proposed algorithm is verified by performing numerical simulations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.3
• /
• pp.218-223
• /
• 2012

Maintenance and improvement of the graph connectivity is very important for decentralized multi-agent systems. Although the CBBA (Consensus-Based Bundle Algorithm) guarantees suboptimal performance and bounded convergence time, it is only valid for connected graphs. In this study, we apply a decentralized estimation procedure that allows each agent to track the algebraic connectivity of a time-varying graph. Based on this estimation, we design a decentralized gradient controller to maintain the graph connectivity while agents are traveling to perform assigned tasks. Simulation result for fully-actuated first-order agents that move in a 2-D plane are presented.

• The Journal of Korea Robotics Society
• /
• v.3 no.2
• /
• pp.106-111
• /
• 2008

This paper presents a decentralized coordination for a small-scale mobile robot teams performing a task through cooperation. Robot teams are required to generate and maintain various geometric patterns adapting to an environment and/or a task in many cooperative applications. In particular, all robots must continue to strive toward achieving the team's mission even if some members fail to perform their role. Toward this end, given the number of robots in a team, an effective coordination is investigated for decentralized formation control strategies. Specifically, all members are required first to reach agreement on their coordinate system and have an identifier (ID) for role assignment in a self-organizing way. Then, employing IDs on individual robots within a common coordinate system, a decentralized neighbor-referenced formation control is realized to generate, keep, and switch between different geometric shapes. This approach is verified using an in-house simulator and physical mobile robots. We detail and evaluate the formation control approach, whose common features include self-organization, robustness, and flexibility.