Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 1604824, 6 pages
Research Article

A New Algorithm for Distributed Control Problem with Shortest-Distance Constraints

1School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China
2Key Laboratory of Dependable Service Computing in Cyber Physical Society, Ministry of Education and School of Automation, Chongqing University, Chongqing 400044, China

Received 4 March 2016; Revised 27 May 2016; Accepted 22 November 2016

Academic Editor: Zhan Shu

Copyright © 2016 Yu Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper investigates the distributed shortest-distance problem of multiagent systems where agents satisfy the same continuous-time dynamics. The objective of multiagent systems is to find a common point for all agents to minimize the sum of the distances from each agent to its corresponding convex region. A distributed consensus algorithm is proposed based on local information. A sufficient condition also is given to guarantee the consensus. The simulation example shows that the distributed shortest-distance consensus algorithm is effective for our theoretical results.