On Control of Networks of Dynamical Systems

We consider a network of dynamical systems whose trajectories we wish to control by applying stimuli to a subset of systems. We study the minimum number of systems to control and which systems to control and provide sufficient conditions and necessary conditions for successful control. These conditions are given in terms of graph theoretical properties of the underlying network. For instance, we show that for the cycle graph, the best way to achieve control is by applying control to systems that are approximately equally spaced apart.

By: Chai Wah Wu

Published in: RC24892 in 2009


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .