A new algorithm for distributed control problem with shortest-distance constraints (Q1792710)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm for distributed control problem with shortest-distance constraints |
scientific article; zbMATH DE number 6952815
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for distributed control problem with shortest-distance constraints |
scientific article; zbMATH DE number 6952815 |
Statements
A new algorithm for distributed control problem with shortest-distance constraints (English)
0 references
12 October 2018
0 references
Summary: 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.
0 references
0 references
0 references
