当前位置: X-MOL 学术SIAM J. Control Optim. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the Stochastic Flocking of the Cucker--Smale Flock with Randomly Switching Topologies
SIAM Journal on Control and Optimization ( IF 2.2 ) Pub Date : 2020-08-12 , DOI: 10.1137/19m1279150
Jiu-Gang Dong , Seung-Yeal Ha , Jinwook Jung , Doheon Kim

SIAM Journal on Control and Optimization, Volume 58, Issue 4, Page 2332-2353, January 2020.
We present an emergent stochastic flocking dynamics of the Cucker--Smale (CS) ensemble under randomly switching network topologies. The evolution of the CS ensemble with randomly switching topologies involves two random components (switching times and choices of network topologies at switching instants). First, we allow switching times for the network topology to be random so that the successive increments are i.i.d. processes following the common probability distribution. Second, at each switching instant, we choose a network topology randomly from a finite set of admissible network topologies whose union contains a spanning tree. Even for the fixed deterministic network topology, the CS ensemble may not exhibit a monocluster flocking, depending on the initial data and the decay mode of the communication weight functions measuring the degree of interactions between particles. For the flocking dynamics of the CS ensemble with these two random components, we first use a priori conditions on the network topologies and the uniform boundedness of the position diameter, and derive the flocking estimates via matrix theory together with a priori conditions, and then replace the a priori condition for the position diameter by some suitable condition on system parameters and communication weight. A priori conditions on the network topology will be guaranteed by the suitable spanning tree time-blocks with probability one.


中文翻译:

杜鹃(Cucker)-雄性羊群的随机植绒与随机切换拓扑。

SIAM控制与优化杂志,第58卷,第4期,第2332-2353页,2020年1月。
我们提出了随机切换网络拓扑下的Cucker-Smale(CS)集成群的随机涌现动态。带有随机交换拓扑的CS集成的发展涉及两个随机成分(交换时间和交换瞬间网络拓扑的选择)。首先,我们允许网络拓扑的切换时间是随机的,以便连续的增量是遵循公共概率分布的同余过程。其次,在每个交换时刻,我们从有限的一组允许的网络拓扑中随机选择一个网络拓扑,这些拓扑的并集包含一个生成树。即使对于固定的确定性网络拓扑,CS集成也可能不会表现出单集群群集,取决于初始数据和通信权重函数的衰减模式,权重函数可测量粒子之间的相互作用程度。对于具有这两个随机分量的CS集合的植绒动力学,我们首先在网络拓扑上使用先验条件,并使用位置直径的均匀有界性,然后通过矩阵理论与先验条件一起得出植绒估计值,然后替换通过系统参数和通讯权重的适当条件确定位置直径的先验条件。网络拓扑的先验条件将由概率为1的合适的生成树时间块来保证。我们首先使用网络拓扑的先验条件和位置直径的均匀有界性,然后通过矩阵理论与先验条件一起得出植绒估计值,然后用系统上的一些合适条件替换先验条件参数和通讯权重。网络拓扑的先验条件将由概率为1的合适的生成树时间块来保证。我们首先使用网络拓扑的先验条件和位置直径的均匀有界性,然后通过矩阵理论与先验条件一起得出植绒估计值,然后用系统上的一些合适条件替换先验条件参数和通讯权重。网络拓扑的先验条件将由概率为1的合适的生成树时间块来保证。
更新日期:2020-08-14
down
wechat
bug