pith. sign in

arxiv: 1510.05773 · v1 · pith:V3X54FZ7new · submitted 2015-10-20 · 💻 cs.SY · cs.SY

Distributed Surrounding Design of Target Region with Complex Adjacency Matrices

classification 💻 cs.SY cs.SY
keywords distributedsurroundingadjacencyconvextargetagentsanglesassumptions
0
0 comments X
read the original abstract

This is a complete version of the 6-page IEEE TAC technical note [1]. In this paper, we consider the distributed surrounding of a convex target set by a group of agents with switching communication graphs. We propose a distributed controller to surround a given set with the same distance and desired projection angles specified by a complex-value adjacency matrix. Under mild connectivity assumptions, we give results in both consistent and inconsistent cases for the set surrounding in a plane. Also, we provide sufficient conditions for the multi-agent coordination when the convex set contains only the origin.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.