Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ISCAS.2010.5537735 | Circuits and Systems |
Keywords | Field | DocType |
graph theory,nonlinear dynamical systems,cycle graph,graph theoretical properties,nonlinear dynamical system | Graph theory,Linear dynamical system,Synchronization,Projected dynamical system,Control theory,Computer science,Cycle graph,Integral graph,Dynamical systems theory,Complex network | Conference |
ISSN | ISBN | Citations |
0271-4302 | 978-1-4244-5309-2 | 1 |
PageRank | References | Authors |
0.38 | 8 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chai Wah Wu | 1 | 330 | 67.62 |