Loading [MathJax]/jax/output/SVG/jax.js
Search Advanced

Networks and Heterogeneous Media

2007, Volume 2, Issue 4: 627-646. doi: 10.3934/nhm.2007.2.627
Previous Article Next Article

On rendezvous control with randomly switching communication graphs

  • 1.
    Department of Information Engineering, Via Gradenigo 6/b, Padova, 35131
  • Received: 01 June 2007 Revised: 01 September 2007

  • Primary: 68W20, 93C85 Secondary: 90B15.

  • In this paper we analyze randomized coordination control strategies for the rendezvous problem of multiple agents with unknown initial positions. The performance of these control strategies is measured in terms of three metrics: average relative agents’ distance, total input energy consumption, and number of packets per unit time that each agent can receive from the other agents. By considering an LQ-like performance index, we show that a-priori knowledge about the first and second order statistics of agents’ initial position can greatly improve performance as compared to rendezvous control strategies based only on relative distance feedback. Moreover, we show that randomly switching communication topologies, as compared to static communication topologies, require very little information exchange to achieve high performance even when the number of agents grows very large.

    Citation: Luca Schenato, Sandro Zampieri. On rendezvous control with randomly switching communication graphs[J]. Networks and Heterogeneous Media, 2007, 2(4): 627-646. doi: 10.3934/nhm.2007.2.627

    Related Papers:

    [1] Luca Schenato, Sandro Zampieri . On rendezvous control with randomly switching communication graphs. Networks and Heterogeneous Media, 2007, 2(4): 627-646. doi: 10.3934/nhm.2007.2.627
    [2] Mattia Bongini, Massimo Fornasier, Oliver Junge, Benjamin Scharf . Sparse control of alignment models in high dimension. Networks and Heterogeneous Media, 2015, 10(3): 647-697. doi: 10.3934/nhm.2015.10.647
    [3] Yuntian Zhang, Xiaoliang Chen, Zexia Huang, Xianyong Li, Yajun Du . Managing consensus based on community classification in opinion dynamics. Networks and Heterogeneous Media, 2023, 18(2): 813-841. doi: 10.3934/nhm.2023035
    [4] Yilun Shang . Group pinning consensus under fixed and randomly switching topologies with acyclic partition. Networks and Heterogeneous Media, 2014, 9(3): 553-573. doi: 10.3934/nhm.2014.9.553
    [5] GuanLin Li, Sebastien Motsch, Dylan Weber . Bounded confidence dynamics and graph control: Enforcing consensus. Networks and Heterogeneous Media, 2020, 15(3): 489-517. doi: 10.3934/nhm.2020028
    [6] Didier Georges . Infinite-dimensional nonlinear predictive control design for open-channel hydraulic systems. Networks and Heterogeneous Media, 2009, 4(2): 267-285. doi: 10.3934/nhm.2009.4.267
    [7] Georges Bastin, Alexandre M. Bayen, Ciro D'Apice, Xavier Litrico, Benedetto Piccoli . Preface. Networks and Heterogeneous Media, 2009, 4(2): i-v. doi: 10.3934/nhm.2009.4.2i
    [8] Rudy R. Negenborn, Peter-Jules van Overloop, Tamás Keviczky, Bart De Schutter . Distributed model predictive control of irrigation canals. Networks and Heterogeneous Media, 2009, 4(2): 359-380. doi: 10.3934/nhm.2009.4.359
    [9] Raúl M. Falcón, Venkitachalam Aparna, Nagaraj Mohanapriya . Optimal secret share distribution in degree splitting communication networks. Networks and Heterogeneous Media, 2023, 18(4): 1713-1746. doi: 10.3934/nhm.2023075
    [10] A M Ishtiaque Mahbub, Behdad Chalaki, Andreas A. Malikopoulos . A constrained optimal control framework for vehicle platoons with delayed communication. Networks and Heterogeneous Media, 2023, 18(3): 982-1005. doi: 10.3934/nhm.2023043
  • In this paper we analyze randomized coordination control strategies for the rendezvous problem of multiple agents with unknown initial positions. The performance of these control strategies is measured in terms of three metrics: average relative agents’ distance, total input energy consumption, and number of packets per unit time that each agent can receive from the other agents. By considering an LQ-like performance index, we show that a-priori knowledge about the first and second order statistics of agents’ initial position can greatly improve performance as compared to rendezvous control strategies based only on relative distance feedback. Moreover, we show that randomly switching communication topologies, as compared to static communication topologies, require very little information exchange to achieve high performance even when the number of agents grows very large.


  • This article has been cited by:

    1. Mojtaba Nourian, Peter E. Caines, Roland P. Malhame, Minyi Huang, Nash, Social and Centralized Solutions to Consensus Problems via Mean Field Control Theory, 2013, 58, 0018-9286, 639, 10.1109/TAC.2012.2215399
    2. Lihua Sun, Research and Simulation of Handover Algorithm in Mobile Communication System, 2021, 2074, 1742-6588, 012039, 10.1088/1742-6596/2074/1/012039
    3. Mojtaba Nourian, Peter E. Caines, Roland P. Malhame, A Mean Field Game Synthesis of Initial Mean Consensus Problems: A Continuum Approach for Non-Gaussian Behavior, 2014, 59, 0018-9286, 449, 10.1109/TAC.2013.2270867
  • Reader Comments
  • © 2007 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
Networks and Heterogeneous Media
1.2 1.8

Metrics

Article views(3555) PDF downloads(86) Cited by(3)

Preview PDF
Download XML
Export Citation
Article outline
Abstract

Other Articles By Authors

Related pages

Tools

Copyright © AIMS Press

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog