Guaranteed global performance through local coordinations

doi:10.1016/j.automatica.2011.01.078

Return

Guaranteed global performance through local coordinations

2011-05-01

PRE

Mohammad Karimadini

Hai Lin *

DOI：10.1016/j.automatica.2011.01.078

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2011 Elsevier Ltd. All rights reserved.

Keywords:

Global task decomposition

Cooperative control

Multi-agent system

Distributed discrete event systems

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.