A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation

DOI10.1016/j.ejcon.2021.04.006zbMath1466.93073OpenAlexW3161577337MaRDI QIDQ2034245

Jan Lunze, Alexander Schwab

Publication date: 21 June 2021

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejcon.2021.04.006

zbMATH Keywords

Delaunay triangulationformation controlnetworked systemscommunication topologies

Mathematics Subject Classification ID

Distributed algorithms (68W15) Multi-agent systems (93A16) Networked control (93B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A state-feedback approach to event-based control
• Classes of graphs which approximate the complete Euclidean graph
• Triangulations and applications
• Transforming triangulations
• On the identification of the convex hull of a finite set of points in the plane
• A method for designing the communication structure of networked controllers
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Two algorithms for constructing a Delaunay triangulation
• Voronoi Diagrams of Moving Points
• Consensus and Cooperation in Networked Multi-Agent Systems
• Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
• Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
• Star splaying