Das, Kaushik and Ghose, Debasish (2009) Positional Consensus in Multi-Agent Systems using a Broadcast Control Mechanism. In: 2009 American Control Conference, June 10-12, 2009, Hyatt Regency Riverfront, St. Louis, MO, USA, pp. 5731-5736.
PDF
getPDF.pdf - Published Version Restricted to Registered users only Download (774kB) | Request a copy |
Abstract
In this paper a strategy for controlling a group of agents to achieve positional consensus is presented. The proposed technique is based on the constraint that every agents must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming formulation that is computationally less intensive than earlier proposed methods. Moreover, we introduce a random perturbation input in the control command that helps us to achieve perfect consensus even for a large number of agents, which was not possible with the existing strategy in the literature. Moreover, we extend the method to achieve positional consensus at a pre-specified location. The effectiveness of the approach is illustrated through simulation results.
Item Type: | Conference Paper |
---|---|
Series.: | PROCEEDINGS OF THE AMERICAN CONTROL CONFERENCE |
Publisher: | IEEE |
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: | 08 Jan 2010 08:58 |
Last Modified: | 19 Sep 2010 05:49 |
URI: | http://eprints.iisc.ac.in/id/eprint/24244 |
Actions (login required)
View Item |