Control of quantized multi-agent systems with linear nearest neighbor rules: A finite field approach

Abstract

We study the problem of controlling a multi-agent system where each agent is only allowed to be in a discrete and finite set of states. Each agent is capable of updating its state based on the states of its neighbors, and there is a leader agent in the network that is allowed to update its state in arbitrary ways (within the discrete set) in order to put all agents in a desired state. We present a novel solution to this problem by viewing the discrete states of the system as elements of a finite field. Specifically, we develop a theory of structured linear systems over finite fields, and show that such systems will be controllable provided that the size of the finite field is sufficiently large, and that the graph associated with the system satisfies certain properties. We then use these results to show that a multi-agent system with a leader node is controllable via a linear nearest-neighbor update as long as there is a path from the leader to every node, and that the number of discrete states for each node is large enough. ©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/grasp_papers/55 Control of Quantized Multi-Agent Systems with Linear NearestNeighbor Rules: A Finite Field Approach Shreyas Sundaram and Christoforos N. HadjicostisAbstract-We study the problem of controlling a multi-agent system where each agent is only allowed to be in a discrete and finite set of states. Each agent is capable of updating its state based on the states of its neighbors, and there is a leader agent in the network that is allowed to update its state in arbitrary ways (within the discrete set) in order to put all agents in a desired state. We present a novel solution to this problem by viewing the discrete states of the system as elements of a finite field. Specifically, we develop a theory of structured linear systems over finite fields, and show that such systems will be controllable provided that the size of the finite field is sufficiently large, and that the graph associated with the system satisfies certain properties. We then use these results to show that a multi-agent system with a leader node is controllable via a linear nearest-neighbor update as long as there is a path from the leader to every node, and that the number of discrete states for each node is large enough.

Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex Networks

“…For first-order nodal dynamics, our main result is not substantively different from those presented for discrete time and finite state systems in [24] , [25] . They show that networks with nontrivial nodal dynamics are structurally observable with a single output node and structurally controllable with a single input node.…”

Convergence Analysis of Distributed Set-Valued Information Systems

“…Moreover, A 2 does not admit the eigenvalue λ = ∅ by Proposition 3.3, while any scalar λ ⊆ X \ ∅ is an eigenvalue of A 2 , with associated eigenvector V λ = (X, X) T , with X ⊆ λ. A complete characterization of the Boolean spectrum of a generic map is complex (see, e.g., the work in [21]). However, for a subclass of these maps, the two following results can be stated:…”