The degree of nonholonomy in distributed computations

A network of locally interacting agents can be thought of as performing a distributed computation. But not all computations can be faithfully distributed. This paper discusses which global linear transformations can be computed in finite time using local weighting rules, i.e., rules which rely solely on information from adjacent nodes in a network. Additionally, it is shown that the degree of nonholonomy of the computation can be related to the underlying information exchange graph. The main result states that the degree of nonholonomy of the system dynamics is equal to D - 1 where D is the diameter of the information exchange graph. An optimal control problem is solved for finding the local interaction rules, and a simulation is performed to elucidate how optimal solutions can be obtained.

[1]  Sanjay Lall,et al.  A Characterization of Convex Problems in Decentralized Control$^ast$ , 2005, IEEE Transactions on Automatic Control.

[2]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[3]  R. Olfati-Saber,et al.  Consensus Filters for Sensor Networks and Distributed Sensor Fusion , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[4]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[5]  J. Trinkle,et al.  Controlling Shapes of Ensembles of Robots of Finite Size with Nonholonomic Constraints , 2009 .

[6]  S. Sastry.  Nonlinear Systems: Analysis, Stability, and Control , 1999 .

[7]  Santiago Grijalva,et al.  Prosumer-based control architecture for the future electricity grid , 2011, 2011 IEEE International Conference on Control Applications (CCA).

[8]  Kay Römer,et al.  The design space of wireless sensor networks , 2004, IEEE Wireless Communications.

[9]  A.L. Dimeas,et al.  Operation of a multiagent system for microgrid control , 2005, IEEE Transactions on Power Systems.

[10]  Naomi Ehrich Leonard,et al.  Coordinated patterns of unit speed particles on a closed curve , 2007, Syst. Control. Lett..

[11]  George J. Pappas,et al.  Stable flocking of mobile agents part I: dynamic topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[12]  Magnus Egerstedt,et al.  Distributed Power Allocation in Prosumer Networks , 2012 .

[13]  Magnus Egerstedt,et al.  Distributed Coordination Control of Multiagent Systems While Preserving Connectedness , 2007, IEEE Transactions on Robotics.

[14]  Zamora,et al.  Electronic textiles: a platform for pervasive computing , 2003, Proceedings of the IEEE.

[15]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[16]  W. Press,et al.  Numerical Recipes: The Art of Scientific Computing , 1987 .

[17]  Daniel Liberzon,et al.  Calculus of Variations and Optimal Control Theory: A Concise Introduction , 2012 .

[18]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[19]  Sanjay Lall,et al.  A graph-theoretic approach to distributed control over networks , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[20]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[21]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[22]  Tucker R. Balch,et al.  Behavior-based formation control for multirobot teams , 1998, IEEE Trans. Robotics Autom..

[23]  Francesco Bullo,et al.  Coordination and Geometric Optimization via Distributed Dynamical Systems , 2003, SIAM J. Control. Optim..

[24]  Shreyas Sundaram,et al.  Distributed function calculation and consensus using linear iterative strategies , 2008, IEEE Journal on Selected Areas in Communications.

[25]  M. Egerstedt,et al.  From Global Linear Computations to Local Interaction Rules , 2013, 1311.5959.

[26]  R. Brockett.  Finite Dimensional Linear Systems , 2015 .