3 research outputs found
From Global, Finite-Time, Linear Computations to Local, Edge-Based Interaction Rules
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.DOI: 10.1109/TAC.2014.2380643A network of locally interacting agents can be
thought of as performing a distributed computation. But not
all computations can be faithfully distributed. This paper investigates
which global, linear transformations can be computed
in finite time using local rules with time varying weights, i.e.,
rules which rely solely on information from adjacent nodes in
a network. The main result states that a linear transformation
is computable in finite time using local rules if and only if the
transformation has positive determinant. An optimal control
problem is solved for finding the local interaction rules, and
simulations are performed to elucidate how optimal solutions
can be obtained