Complex Laplacians and Applications in Multi-Agent Systems
read the original abstract
Complex-valued Laplacians have been shown to be powerful tools in the study of distributed coordination of multi-agent systems in the plane including formation shape control problems and set surrounding control problems. In this paper, we first provide some characterizations of complex Laplacians. As an application, we then establish some necessary and sufficient conditions to ensure that the agents interacting on complex-weighted networks converge to consensus in some sense. These general consensus results are used to discuss some multi-agent coordination problems in the plane.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Consensus and Synchronization of Multi-agent Systems over Finite Fields -- Graph Topologies
Two new algorithms efficiently explore subsets of admissible matrices to generate communication topologies enabling consensus and synchronization in finite-state multi-agent systems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.