Control a state-dependent dynamic graph to a pre-specified structure

Fei Chen; Zengqiang Chen; Zhongxin Liu; Zhuzhi Yuan

Kybernetika (2009)

  • Volume: 45, Issue: 5, page 801-808
  • ISSN: 0023-5954

Abstract

top
Recent years have witnessed an increasing interest in coordinated control of distributed dynamic systems. In order to steer a distributed dynamic system to a desired state, it often becomes necessary to have a prior control over the graph which represents the coupling among interacting agents. In this paper, a simple but compelling model of distributed dynamical systems operating over a dynamic graph is considered. The structure of the graph is assumed to be relied on the underling system's states. Then by following a proper protocol, the state-dependent dynamic graph is driven to a pre-specified structure. The main results are derived via Lasalle's Invariant Principle and numerical examples that find very good agreements with the analytical results are also included.

How to cite

top

Chen, Fei, et al. "Control a state-dependent dynamic graph to a pre-specified structure." Kybernetika 45.5 (2009): 801-808. <http://eudml.org/doc/37702>.

@article{Chen2009,
abstract = {Recent years have witnessed an increasing interest in coordinated control of distributed dynamic systems. In order to steer a distributed dynamic system to a desired state, it often becomes necessary to have a prior control over the graph which represents the coupling among interacting agents. In this paper, a simple but compelling model of distributed dynamical systems operating over a dynamic graph is considered. The structure of the graph is assumed to be relied on the underling system's states. Then by following a proper protocol, the state-dependent dynamic graph is driven to a pre-specified structure. The main results are derived via Lasalle's Invariant Principle and numerical examples that find very good agreements with the analytical results are also included.},
author = {Chen, Fei, Chen, Zengqiang, Liu, Zhongxin, Yuan, Zhuzhi},
journal = {Kybernetika},
keywords = {state-dependent graph; Lasalleś Invariant Principle; dynamic system; state-dependent graph; Lasalle's invariant principle; dynamic system},
language = {eng},
number = {5},
pages = {801-808},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Control a state-dependent dynamic graph to a pre-specified structure},
url = {http://eudml.org/doc/37702},
volume = {45},
year = {2009},
}

TY - JOUR
AU - Chen, Fei
AU - Chen, Zengqiang
AU - Liu, Zhongxin
AU - Yuan, Zhuzhi
TI - Control a state-dependent dynamic graph to a pre-specified structure
JO - Kybernetika
PY - 2009
PB - Institute of Information Theory and Automation AS CR
VL - 45
IS - 5
SP - 801
EP - 808
AB - Recent years have witnessed an increasing interest in coordinated control of distributed dynamic systems. In order to steer a distributed dynamic system to a desired state, it often becomes necessary to have a prior control over the graph which represents the coupling among interacting agents. In this paper, a simple but compelling model of distributed dynamical systems operating over a dynamic graph is considered. The structure of the graph is assumed to be relied on the underling system's states. Then by following a proper protocol, the state-dependent dynamic graph is driven to a pre-specified structure. The main results are derived via Lasalle's Invariant Principle and numerical examples that find very good agreements with the analytical results are also included.
LA - eng
KW - state-dependent graph; Lasalleś Invariant Principle; dynamic system; state-dependent graph; Lasalle's invariant principle; dynamic system
UR - http://eudml.org/doc/37702
ER -

References

top
  1. Consensus decision making in animals, Trends Ecol. Evol. 20 (2005), 450–456. 
  2. On the rendezvous problem for multiple nonholonomic agents, IEEE Trans. Automat. Control 52 (2007), 5, 916–922. MR2324255
  3. Speed versus accuracy in collective decision making, Proc. Roy. Soc. London Ser. B 270 (2003), 270, 2457–2463. 
  4. Agreement over random networks, IEEE Trans. Automat. Control 50 (2005), 11, 1867–1872. MR2182742
  5. Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Trans. Automat. Control 48 (2003), 6, 988–1001. MR1986266
  6. A general synchronization method of chaotic communication systems via Kalman filtering, Kybernetika 44 (2008), 1, 43–52. MR2405054
  7. On state-dependent dynamic graphs and their controllability properties, IEEE Trans. Automat. Control 50 (2005), 3, 387–392. MR2123101
  8. Stability of multiagent systems with time-dependent communication links, IEEE Trans. Automat. Control 50 (2005), 2, 169–182. MR2116423
  9. Novel type of phase transition in a system of self-deriven particles, Phys. Rev. Lett. 75 (1995), 6, 1226–1229. 
  10. Controlling connectivity of dynamic graphs, In: IEEE Conf. on Decision and Control and European Control Conference, Seville 2005, p. 6. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.