Connectivity graphs as models of local interactions

DOI10.1016/J.AMC.2004.08.039MaRDI QIDQ2572678zbMATH OpenOpenAlexFDO

Authors Abubakr Muhammad, Magnus Egerstedt

Publication date 4 November 2005

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2004.08.039

zbMATH Keywords

simplicial complexesgraph amalgamationtopological characterizationdecentralized algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Directed graphs for the analysis of rigidity and persistence in autonomous agent systems
• A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol
• Operations on rigid formations of autonomous agents
• Graph theoretic methods in multiagent networks
• Flocks and formations

Cites work

• scientific article; zbMATH DE number 3812514 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 2065647 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Kinetic connectivity for unit disks
• The union of balls and its dual shape

Cited in

(10)

• A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks
• A dynamical systems approach to weighted graph matching
• Local connectivity of neutral networks
• A local structure model for network analysis
• A connection between formation infeasibility and velocity alignment in kinematic multi-agent systems
• Multi-agent formation control based on Bell-shaped potential functions
• scientific article; zbMATH DE number 637324 (Why is no real title available?)
• Graph process specifications for hybrid networked systems
• Local dependency in networks
• An algorithm for weighted sub-graph matching based on gradient flows

This page was built for publication: Connectivity graphs as models of local interactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572678)