Laplacian Controllability and Observability of Multi-Agent Systems: Recent advances in Tree Graphs

• DOI: 10.20944/preprints202503.1438.v1
• Publication Date: 2025-03-20T01:14:06Z
• Authors: Gianfranco Parlan...
• Keywords: Observability; Tree (set theory)

Laplacian controllability and observability of a consensus network is widely studied topic in the area multi-agent systems, complex networks large-scale systems. In this paper, problem afforded when communication among nodes described through starlike tree topology. After brief description mathematical setting problem, which adopted for wide number systems engineering applications, some novel results are drawn based on node positions within only. The resulting methods graphical, thus effective exempt from numerical errors, final algorithm provided to perform analysis by machine computation. Several examples show effectiveness proposed.