pith. sign in

arxiv: 2604.23203 · v1 · submitted 2026-04-25 · 🧮 math.DS

A Network Transformation Mapping Approach to Synchronization of Multi-Agent Systems With Disconnected Switching Topologies

Haotian Xu , Bohui Wang , Shuai Liu , Chao Shen , Xiangyu Meng , Guanghui Wen This is my paper

Pith reviewed 2026-05-08 07:10 UTC · model grok-4.3

classification 🧮 math.DS
keywords multi-agent systemssynchronizationswitching topologiesnetwork transformation mappingasymptotic synchronizationrandom disconnectionsadaptive coupling gainsunstable leader
0
0 comments X

The pith

Multi-agent systems achieve asymptotic synchronization even with randomly disconnecting and reconnecting links under exponential timing.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper tackles the challenge of synchronizing multiple agents to an unstable leader when communication links switch on and off randomly, with both connected and disconnected intervals following negative exponential distributions. It introduces a network transformation mapping that splits the topology into reachable and unreachable segments at every instant, allowing information flow and convergence only in reachable segments. By setting the synchronization speed so that the amount of convergence during reachable intervals exceeds the divergence during unreachable ones, the agents reach asymptotic synchronization across the full time horizon. The approach also adds adaptive coupling gains to lower complexity and applies to jointly connected topologies plus distributed observers without spanning trees at any time.

Core claim

The central claim is that a network transformation mapping divides the communication network into reachable and unreachable parts at any time, and designing each node's synchronization speed such that its convergence amplitude in the reachable part exceeds its divergence amplitude in the unreachable part ensures all nodes achieve asymptotic synchronization over the entire time domain, even when links disconnect and reconnect randomly with exponentially distributed intervals.

What carries the argument

The network transformation mapping method, which partitions the communication network into reachable and unreachable parts at any time to determine when a node can access the leader's information and synchronize.

If this is right

  • All nodes achieve asymptotic synchronization over the entire time domain.
  • Adaptive strategies for coupling gains reduce the computational complexity of the network transformation mapping.
  • The method applies to jointly connected switching topologies.
  • The method extends to distributed observers under topologies that lack a spanning tree at any time.
  • Numerical simulations confirm effectiveness for synchronous control of multi-one-link manipulator systems and multi-motor systems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The method could extend to communication models with other random interval distributions beyond exponential, provided the average connected time still favors net convergence.
  • It suggests synchronization designs can tolerate arbitrary intermittent connectivity if the effective ratio of connected to disconnected durations is tuned appropriately.
  • This framework might guide control in distributed robotic systems operating under unreliable wireless links without requiring continuous topology connectivity.

Load-bearing premise

For each node, the synchronization speed must be designed such that its convergence amplitude in the reachable part exceeds its divergence amplitude in the unreachable part.

What would settle it

Run a long-term simulation or hardware experiment with the proposed speed design under random exponential disconnection intervals; if the synchronization errors of the agents fail to approach zero asymptotically, the central claim is falsified.

Figures

Figures reproduced from arXiv: 2604.23203 by Bohui Wang, Chao Shen, Guanghui Wen, Haotian Xu, Shuai Liu, Xiangyu Meng.

Figure 1
Figure 1. Figure 1: Switching networks for counterexample view at source ↗
Figure 3
Figure 3. Figure 3: An example of the distributed observer in unbounded leader case view at source ↗
Figure 5
Figure 5. Figure 5: In Fig. 6, the first subfigure explains when this agent view at source ↗
Figure 4
Figure 4. Figure 4: Communication networks among all agents. a) The topology when all links work normal, and all arcs, whether red or black, have a probability of view at source ↗
Figure 5
Figure 5. Figure 5: Time varying trajectories of error dynamics for each agent view at source ↗
Figure 6
Figure 6. Figure 6: Relationship between dynamic performance and the structure com view at source ↗
Figure 8
Figure 8. Figure 8: It is assumed that 6 networks in this figure appear in view at source ↗
Figure 8
Figure 8. Figure 8: Communication networks among four agents view at source ↗
Figure 9
Figure 9. Figure 9: Time varying trajectories of error dynamics for each agent. Line a) shows the tracking errors of the control protocol with network transformation. view at source ↗
read the original abstract

This paper focuses on the multi-agent synchronization problem with an open-loop unstable leader and followers under the switching topologies. For this issue, the typical approach is intermittent communication (including a spanning tree intermittently) or fast switching strategy. We here consider a more general scenario where each communication link between two agents is randomly disconnected and reconnected, and the durations of both the disconnected intervals and the connected intervals follow negative exponential distributions. To handle this issue, we propose a network transformation mapping method that divides the communication network into reachable and unreachable parts at any time. A node can access the leader's information and synchronize only when it lies in the reachable part; otherwise, it cannot. For each node, the synchronization speed is designed such that its convergence amplitude in the reachable part exceeds its divergence amplitude in the unreachable part. Hence, all nodes achieve asymptotic synchronization over the entire time domain. We further develop adaptive strategies for coupling gains to reduce the computational complexity introduced by the network transformation mapping. The proposed method is also applicable to jointly connected switching topologies and distributed observers under topologies that lack a spanning tree at any time. Finally, two numerical simulations -- synchronous control of multi-one-link manipulator systems and multi-motor systems based on Fieldbus -- are provided to demonstrate the effectiveness of our approach.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper claims to solve asymptotic synchronization for multi-agent systems with an open-loop unstable leader under randomly switching topologies in which each link disconnects and reconnects with independent exponential durations. It introduces a network transformation mapping that partitions the graph into reachable and unreachable components at each instant, designs per-node synchronization speeds so that the convergence amplitude during reachable intervals exceeds the divergence amplitude during unreachable intervals, and concludes that all nodes therefore synchronize asymptotically over the whole time horizon. Adaptive coupling-gain strategies are added to reduce complexity, and the method is extended to jointly connected topologies and to distributed observers; two numerical examples (multi-manipulator and multi-motor systems) are provided.

Significance. If the stability argument can be made rigorous, the work would supply a constructive design for synchronization under a broader class of intermittent random topologies than the usual persistent-spanning-tree or fast-switching assumptions, which is relevant for unreliable communication networks. The adaptive-gain extension and the explicit applicability statements to jointly connected and observer-based cases are practical strengths.

major comments (2)
  1. [Main stability result / proof of asymptotic synchronization] The central claim (abstract and main theorem) that the per-interval amplitude condition implies almost-sure asymptotic synchronization does not address the fact that exponential disconnection intervals are unbounded. For any fixed or adaptively chosen speed, sample paths exist with arbitrarily long unreachable intervals that produce arbitrarily large divergence before reconnection; the net error evolution is the cumulative integral of the signed rate and converges to zero a.s. only if the speed satisfies a strict inequality involving the open-loop instability rate and the stationary occupation measure of the reachable set under the induced continuous-time Markov chain. No such explicit relation appears in the stability analysis.
  2. [Section on network transformation mapping and error dynamics] The network transformation mapping is asserted to correctly identify reachable nodes at each instant, yet the subsequent Lyapunov or error analysis does not incorporate the ergodic average over the stationary distribution of the switching process. This omission is load-bearing for the “hence all nodes achieve asymptotic synchronization” conclusion.
minor comments (2)
  1. [Preliminaries / network transformation definition] The notation for the reachable/unreachable partition and the mapping operator could be introduced with a small illustrative graph example to improve readability.
  2. [Numerical examples] The two simulation sections would benefit from a quantitative table comparing synchronization error decay rates under the proposed method versus a baseline intermittent-communication controller.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments, which highlight important aspects of rigor in the almost-sure stability analysis. We agree that the current presentation of the main theorem and error dynamics requires strengthening to explicitly address the unbounded nature of the exponential intervals and the role of the stationary occupation measure. We will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: The central claim (abstract and main theorem) that the per-interval amplitude condition implies almost-sure asymptotic synchronization does not address the fact that exponential disconnection intervals are unbounded. For any fixed or adaptively chosen speed, sample paths exist with arbitrarily long unreachable intervals that produce arbitrarily large divergence before reconnection; the net error evolution is the cumulative integral of the signed rate and converges to zero a.s. only if the speed satisfies a strict inequality involving the open-loop instability rate and the stationary occupation measure of the reachable set under the induced continuous-time Markov chain. No such explicit relation appears in the stability analysis.

    Authors: The referee correctly notes that almost-sure convergence under unbounded intervals requires more than per-interval amplitude comparison. In the manuscript the per-node speeds are selected using the exponential rates so that the expected convergence amplitude exceeds the expected divergence amplitude; this choice implicitly ensures a negative long-run growth rate. However, we acknowledge that the proof does not yet explicitly invoke the ergodic theorem for the continuous-time Markov chain or state the required strict inequality between the instability rate and the stationary occupation measure of the reachable set. We will revise the stability analysis in the main theorem to include this relation and the application of the ergodic theorem, thereby rigorously establishing almost-sure asymptotic synchronization. revision: yes

  2. Referee: The network transformation mapping is asserted to correctly identify reachable nodes at each instant, yet the subsequent Lyapunov or error analysis does not incorporate the ergodic average over the stationary distribution of the switching process. This omission is load-bearing for the “hence all nodes achieve asymptotic synchronization” conclusion.

    Authors: We agree that the error-dynamics section would benefit from an explicit ergodic-average step. The network transformation mapping correctly partitions the graph into reachable and unreachable components at each instant, and the instantaneous error evolution is analyzed via a Lyapunov function whose derivative is negative in the reachable intervals and positive (but controlled) in the unreachable intervals. To close the argument, the time-averaged growth must be shown negative almost surely. We will augment the Lyapunov analysis with the stationary distribution of the induced Markov chain and the corresponding ergodic average, making the passage from per-interval behavior to global almost-sure convergence fully rigorous. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained from problem setup

full rationale

The paper introduces a network transformation mapping to partition agents into reachable/unreachable sets under random exponential switching. Synchronization speeds are designed to satisfy an amplitude inequality (convergence during reachable intervals exceeds divergence during unreachable intervals). Asymptotic synchronization is then claimed as a consequence. This chain does not reduce any result to its inputs by construction: the amplitude condition is an imposed design requirement, not a self-definition of the target synchronization or a fitted parameter renamed as prediction. No load-bearing self-citations, uniqueness theorems, or ansatzes are quoted or required in the provided text. The approach derives the claimed outcome from the stated switching model and design choice without equivalence to the inputs.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 1 invented entities

The claim rests on the domain assumption of negative-exponential interval durations and on the per-node design choice that convergence exceeds divergence; these are not derived from first principles within the abstract.

free parameters (1)
  • synchronization speed
    Per-node value chosen so reachable-part convergence amplitude exceeds unreachable-part divergence amplitude
axioms (2)
  • domain assumption Durations of disconnected and connected intervals follow negative exponential distributions
    Stated as the random process governing link state changes
  • domain assumption Leader is open-loop unstable
    Given as part of the problem setup
invented entities (1)
  • network transformation mapping no independent evidence
    purpose: Partitions the communication network into reachable and unreachable parts at each instant
    Newly introduced construct to analyze synchronization under disconnection

pith-pipeline@v0.9.0 · 5538 in / 1317 out tokens · 35042 ms · 2026-05-08T07:10:41.003738+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

42 extracted references · 42 canonical work pages

  1. [1]

    A time-varying observer-based approach to equilibrium estimation and compensation for synchronization of het- erogeneous nonlinear cyber-physical systems,

    B. Wang and C. Shen, “A time-varying observer-based approach to equilibrium estimation and compensation for synchronization of het- erogeneous nonlinear cyber-physical systems,”IEEE Transactions on Automatic Control, vol. 68, no. 10, pp. 6176–6183, 2023

    work page 2023

  2. [2]

    Decentralized and distributed control of large-scale interconnected multi-agent systems in prescribed time,

    H. Ye, C. Wen, and Y . Song, “Decentralized and distributed control of large-scale interconnected multi-agent systems in prescribed time,”IEEE Transactions on Automatic Control, vol. pp, no. 99, pp. 1–16, 2024

    work page 2024

  3. [3]

    Human-in-the-loop fuzzy iterative learning control of consensus for unknown mixed-order nonlinear multi- agent systems,

    J. Chen, J. Xie, J. Li, and W. Chen, “Human-in-the-loop fuzzy iterative learning control of consensus for unknown mixed-order nonlinear multi- agent systems,”IEEE Transactions on Fuzzy Systems, vol. 32, no. 1, pp. 255–265, 2024

    work page 2024

  4. [4]

    Finite-time observer-basedh ∞ fault-tolerant output formation tracking control for heterogeneous nonlinear multi-agent systems,

    Q. Wang, X. Dong, B. Wang, Y . Hua, and Z. Ren, “Finite-time observer-basedh ∞ fault-tolerant output formation tracking control for heterogeneous nonlinear multi-agent systems,”IEEE Transactions on Network Science and Engineering, vol. 10, no. 4, pp. 1822–1834, 2023

    work page 2023

  5. [5]

    Distributed state estimation for heterogeneous sensor networks,

    L. Zheng, G. Battistelli, L. Chisci, F. Yang, and L. Shi, “Distributed state estimation for heterogeneous sensor networks,”Automatica, vol. 169, p. 111839, 2024

    work page 2024

  6. [6]

    Distributed observer for full-measured nonlinear systems based on knowledge of fmcf,

    H. Xu, S. Liu, Y . Li, and K. Li, “Distributed observer for full-measured nonlinear systems based on knowledge of fmcf,”IEEE/CAA Journal of Automatica Sinica, vol. pp, no. 99, pp. 1–17, 2024

    work page 2024

  7. [7]

    The leader-following attitude control of multiple rigid spacecraft systems,

    H. Cai and J. Huang, “The leader-following attitude control of multiple rigid spacecraft systems,”Automatica, vol. 50, no. 4, pp. 1109–1115, 2014

    work page 2014

  8. [8]

    Distributed consensus observer for multiagent systems with high-order integrator dynamics,

    Z. Zuo, M. Defoort, B. Tian, and Z. Ding, “Distributed consensus observer for multiagent systems with high-order integrator dynamics,” IEEE Transactions on Automatic Control, vol. 65, no. 4, pp. 1771–1778, 2020

    work page 2020

  9. [9]

    A time-varying observer design for synchronization with an uncertain target and its applications in coordinated mission rendezvous,

    B. Wang, “A time-varying observer design for synchronization with an uncertain target and its applications in coordinated mission rendezvous,” Automatica, p. 109931, 2022

    work page 2022

  10. [10]

    Event-triggered privacy preserving consensus control with edge-based additive noise,

    L. Liang, R. Ding, S. Liu, and R. Su, “Event-triggered privacy preserving consensus control with edge-based additive noise,”IEEE Transactions on Automatic Control, vol. pp, no. 99, pp. 1–8, 2024

    work page 2024

  11. [11]

    Anti-attack event-triggered control for nonlinear multi-agent systems with input quantization,

    Y . Xu, T. Li, Y . Yang, Q. Shan, S. Tong, and C. L. P. Chen, “Anti-attack event-triggered control for nonlinear multi-agent systems with input quantization,”IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 12, pp. 10 105–10 115, 2023

    work page 2023

  12. [12]

    Event-triggered communication network with limited-bandwidth constraint for multi- agent reinforcement learning,

    G. Hu, Y . Zhu, D. Zhao, M. Zhao, and J. Hao, “Event-triggered communication network with limited-bandwidth constraint for multi- agent reinforcement learning,”IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 8, pp. 3966–3978, 2023

    work page 2023

  13. [13]

    Iterative learning control for nonlinear uncertain parameterized multi-agent systems with non-identical partially unknown control directions,

    J. Chen, J. Li, W. Chen, S. Zhang, and J. Zhang, “Iterative learning control for nonlinear uncertain parameterized multi-agent systems with non-identical partially unknown control directions,”IEEE Transactions on Network Science and Engineering, vol. 11, no. 4, pp. 3358–3369, 2024

    work page 2024

  14. [14]

    A distributed primal-dual push-sum algorithm on open multiagent networks,

    R. Sawamura, N. Hayashi, and M. Inuiguchi, “A distributed primal-dual push-sum algorithm on open multiagent networks,”IEEE Transactions on Automatic Control, vol. pp, no. 99, pp. 1–8, 2024

    work page 2024

  15. [15]

    Distributed global optimization for a class of nonconvex optimization with coupled constraints,

    X. Ren, D. Li, Y . Xi, and H. Shao, “Distributed global optimization for a class of nonconvex optimization with coupled constraints,”IEEE Transactions on Automatic Control, vol. 67, no. 8, pp. 4322–4329, 2022

    work page 2022

  16. [16]

    Leader-following consensus of multi-agent systems under fixed and switching topologies,

    N. Wei and D. Cheng, “Leader-following consensus of multi-agent systems under fixed and switching topologies,”Systems & Control Letters, vol. 59, no. 3, pp. 209–217, 2010

    work page 2010

  17. [17]

    Seeking tracking consensus for general linear multiagent systems with fixed and switching signed networks,

    Y . Cheng, L. Shi, J. Shao, and W. X. Zheng, “Seeking tracking consensus for general linear multiagent systems with fixed and switching signed networks,”IEEE Transactions on Cybernetics, vol. 52, no. 7, pp. 6697– 6706, 2022

    work page 2022

  18. [18]

    Exponential con- sensus of linear systems over switching network: A subspace method to establish necessity and sufficiency,

    Q. Ma, J. Qin, W. X. Zheng, Y . Shi, and Y . Kang, “Exponential con- sensus of linear systems over switching network: A subspace method to establish necessity and sufficiency,”IEEE Transactions on Cybernetics, vol. pp, no. 99, pp. 1–10, 2020

    work page 2020

  19. [19]

    Dynamic consensus of second-order networked multiagent systems with switching topology and time-varying delays,

    C.-J. Li, G.-P. Liu, P. He, F. Deng, and H. Li, “Dynamic consensus of second-order networked multiagent systems with switching topology and time-varying delays,”IEEE Transactions on Cybernetics, vol. pp, no. 99, pp. 1–11, 2021

    work page 2021

  20. [20]

    The consensus for discrete-time linear multi-agent systems under directed switching networks,

    J. Huang, “The consensus for discrete-time linear multi-agent systems under directed switching networks,”IEEE Transactions on Automatic Control, vol. 62, no. 8, pp. 4086–4092, 2017

    work page 2017

  21. [21]

    Cooperative tracking control of multiagent systems: A heterogeneous coupling network and intermittent communication framework,

    B. Wang, B. Chen, J. Wang, B. Zhang, Z. Zhang, and X. Qiu, “Cooperative tracking control of multiagent systems: A heterogeneous coupling network and intermittent communication framework,”IEEE Transactions on Cybernetics, vol. 49, no. 12, pp. 4308–4320, 2019

    work page 2019

  22. [22]

    Distributed tracking of nonlinear multiagent systems under directed switching topology: An observer-based protocol,

    G. Wen, W. Yu, Y . Xia, X. Yu, and J. Hu, “Distributed tracking of nonlinear multiagent systems under directed switching topology: An observer-based protocol,”IEEE Transactions on Systems, Man, & Cybernetics: Systems, vol. 47, no. 5, pp. 869–881, 2017

    work page 2017

  23. [23]

    Pinning synchronization of directed networks with switching topologies: A multiple lyapunov functions approach,

    G. Wen, W. Yu, G. Hu, J. Cao, and X. Yu, “Pinning synchronization of directed networks with switching topologies: A multiple lyapunov functions approach,”IEEE Transactions on Neural Networks & Learning Systems, vol. 26, no. 12, pp. 3239–3250, 2015

    work page 2015

  24. [24]

    A general framework for robust output synchronization of heterogeneous nonlinear networked systems,

    L. Zhu, Z. Chen, and R. H. Middleton, “A general framework for robust output synchronization of heterogeneous nonlinear networked systems,” IEEE Transactions on Automatic Control, vol. 61, no. 8, pp. 2092–2107, 2016

    work page 2092

  25. [25]

    Output synchronization of nonlinear heterogeneous multi-agent systems with switching networks,

    G. D. Khan, Z. Chen, and H. Meng, “Output synchronization of nonlinear heterogeneous multi-agent systems with switching networks,” Systems &; Control Letters, vol. 125, pp. 45–50, 2019

    work page 2019

  26. [26]

    Comments on “output synchronization of nonlinear heterogeneous multi-agent systems with switching networks

    H. Xu, J. Wang, B. Wang, Y . Song, and I. Brahmia, “Comments on “output synchronization of nonlinear heterogeneous multi-agent systems with switching networks”: [systems & control letters 125 (2019) 45-50],” Systems & Control Letters, vol. 144, p. 104756, 2020

    work page 2019

  27. [27]

    Distributed state estimation under jointly connected switching networks: Continuous-time linear sys- tems and discrete-time linear systems,

    L. Zhang, M. Lu, F. Deng, and J. Chen, “Distributed state estimation under jointly connected switching networks: Continuous-time linear sys- tems and discrete-time linear systems,”IEEE Transactions on Automatic Control, vol. 69, no. 2, pp. 1104–1111, 2024

    work page 2024

  28. [28]

    Robust synchronization control of switched net- worked euler-lagrange systems,

    M. Lu and L. Liu, “Robust synchronization control of switched net- worked euler-lagrange systems,”IEEE Transactions on Cybernetics, vol. 52, no. 7, pp. 6834–6842, 2022

    work page 2022

  29. [29]

    Adaptive output synchronization for a class of uncertain non- linear multi-agent systems over switching networks,

    J. Huang, “Adaptive output synchronization for a class of uncertain non- linear multi-agent systems over switching networks,”IEEE Transactions on Automatic Control, vol. 69, no. 4, pp. 2645–2651, 2024

    work page 2024

  30. [30]

    Distributed exponential state estimation of linear systems over jointly connected switching networks,

    T. Liu and J. Huang, “Distributed exponential state estimation of linear systems over jointly connected switching networks,”Automatica, vol. 159, p. 111373, 2024

    work page 2024

  31. [31]

    Fully distributed output regulation of linear discrete-time multiagent systems with time-varying topology and delays,

    K. Zhang, Z.-Y . Li, and B. Zhou, “Fully distributed output regulation of linear discrete-time multiagent systems with time-varying topology and delays,”Automatica, vol. 167, p. 111755, 2024

    work page 2024

  32. [32]

    Adaptive distributed observer for general linear leader systems over periodic switching igraphs,

    C. He and J. Huang, “Adaptive distributed observer for general linear leader systems over periodic switching igraphs,”Automatica, vol. 137, p. 110021, 2022

    work page 2022

  33. [33]

    Sufficient conditions for fast switching synchronization in time-varying network topologies,

    D. J. Stilwell, E. M. Bollt, and D. G. Roberson, “Sufficient conditions for fast switching synchronization in time-varying network topologies,” SIAM Journal on Applied Dynamical Systems, vol. 5, no. 1, pp. 140–156, 2006

    work page 2006

  34. [34]

    Distributed state estimation for jointly observ- able linear systems over time-varying networks,

    S. Wang and M. Guay, “Distributed state estimation for jointly observ- able linear systems over time-varying networks,”Automatica, vol. 163, p. 111564, 2024

    work page 2024

  35. [35]

    Sampled-data secure group consensus for nonlinear multi-agent systems in fixed/switching topologies,

    Z. Duan, A. Wei, and X. Zhang, “Sampled-data secure group consensus for nonlinear multi-agent systems in fixed/switching topologies,”IEEE Systems Journal, vol. 18, no. 1, pp. 737–745, 2024

    work page 2024

  36. [36]

    Distributed asynchronous consen- sus control of nonlinear multi-agent systems under directed switching topologies,

    R. Zuo, Y . Li, M. Lv, and Z. Liu, “Distributed asynchronous consen- sus control of nonlinear multi-agent systems under directed switching topologies,”Automatica, vol. 152, p. 110952, 2023

    work page 2023

  37. [37]

    A nonlinear observer-based approach to robust cooperative tracking for heteroge- neous spacecraft attitude control and formation applications,

    B. Wang, W. Chen, B. Zhang, P. Shi, and H. Zhang, “A nonlinear observer-based approach to robust cooperative tracking for heteroge- neous spacecraft attitude control and formation applications,”IEEE Transactions on Automatic Control, vol. 68, no. 1, pp. 400–407, 2023

    work page 2023

  38. [38]

    Low complexity robust output synchronization protocol with prescribed performance for high-order heterogeneous uncertain mimo nonlinear multi-agent systems,

    I. Katsoukis and G. A. Rovithakis, “Low complexity robust output synchronization protocol with prescribed performance for high-order heterogeneous uncertain mimo nonlinear multi-agent systems,”IEEE Transactions on Automatic Control, vol. 67, no. 6, pp. 3128–3133, 2022

    work page 2022

  39. [39]

    Su and Z

    S. Su and Z. Lin, “Distributed consensus control of multi-agent systems with higher order agent dynamics and dynamically changing directed in- ROBERGet al.: HIGH-EFFICIENCY DIODE AND TRANSISTOR RECTIFIERS 15 teraction topologies,”IEEE Transactions on Automatic Control, vol. 61, no. 2, pp. 515–519, 2016

    work page 2016

  40. [40]

    Qu,Cooperative Control of Dynamical Systems: Applications to Autonomous Vehicles

    Z. Qu,Cooperative Control of Dynamical Systems: Applications to Autonomous Vehicles. Springer, 2009

    work page 2009

  41. [41]

    Adaptive distributed observer for an uncertain leader over directed acyclic graphs,

    S. Wang and J. Huang, “Adaptive distributed observer for an uncertain leader over directed acyclic graphs,” inAdvances in Neural Networks – ISNN 2019, H. Lu, H. Tang, and Z. Wang, Eds. Cham: Springer International Publishing, 2019, pp. 25–34

    work page 2019

  42. [42]

    Adaptive leader-following consensus for multiple euler–lagrange systems with an uncertain leader system,

    ——, “Adaptive leader-following consensus for multiple euler–lagrange systems with an uncertain leader system,”IEEE Transactions on Neural Networks and Learning Systems, vol. 30, no. 7, pp. 2188–2196, 2019

    work page 2019