Please use this identifier to cite or link to this item:
Title: Guaranteed global performance through local coordinations
Authors: Karimadini, M.
Lin, H. 
Keywords: Cooperative control
Distributed discrete event systems
Global task decomposition
Multi-agent system
Issue Date: May-2011
Citation: Karimadini, M., Lin, H. (2011-05). Guaranteed global performance through local coordinations. Automatica 47 (5) : 890-898. ScholarBank@NUS Repository.
Abstract: It is an amazing fact that remarkably complex behaviors could emerge from a large collection of very rudimentary dynamical agents through very simple local interactions. However, it still remains elusive on how to design these local interactions among agents so as to achieve certain desired collective behaviors. This paper aims to tackle this challenge and proposes a divide-and-conquer approach to guarantee specified global behaviors through local coordination and control design for multi-agent systems. The basic idea is to decompose the requested global specification into subtasks for each individual agent in such a way that the fulfillment of these subtasks by each individual agent will imply the satisfaction of the global specification as a team. First, it is shown by a counterexample that not all specifications can be decomposed in this sense. Then, the main part of the paper is set to identify conditions for the proposed decomposability. Later on, the result is generalized to the case of arbitrary finite number of agents, and a hierarchical algorithm is proposed, which is shown to be a sufficient condition. Finally, a cooperative control scenario for a team of three robots is developed to illustrate the task decomposition procedure. © 2011 Elsevier Ltd. All rights reserved.
Source Title: Automatica
ISSN: 00051098
DOI: 10.1016/j.automatica.2011.01.078
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Oct 9, 2018


checked on Oct 9, 2018

Page view(s)

checked on Feb 25, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.