Distributed multiple-bipartite consensus in networked Lagrangian systems with cooperative–competitive interactions

Zhang, Tiehui; Li, Hengyu; Liu, Jun; Lu, Daowei; Xie, Shaorong; Luo, Jun

doi:10.1007/s11071-021-06674-y

Cited by 11 publications

(4 citation statements)

References 58 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• In contrast with the common bipartite consensus problems [27,28], the bipartite tracking is applied in the IRSs and state constraints of the bipartite tracking are never violated during the state convergence concurrently.…”

Section: Introduction 20mentioning

confidence: 99%

State-constrained bipartite tracking of interconnected robotic systems via hierarchical prescribed-performance control

et al. 2023

Nonlinear Dyn

View full text Add to dashboard Cite

This paper investigates the collaborative de-1 sign problem aiming to achieve state-constrained bipar-2 tite tracking of interconnected robotic systems (IRSs) 3 with prescribed performance. We propose a hierarchi-4 cal state-constrained estimator-based control frame to 5 reduce the complexity of algorithms and improve the 6 adaptation of the tracking control when the robotic-7 s are constrained to physical boundaries and external 8 environment. Without the pre-known tracking trajecto-9 ry, the estimator-based layer can estimate the tracking 10 trajectory at each time interval by the interconnected 11 topology. The position constraints are never violated 12 during the convergence process by designing of control 13 algorithms. The theoretical proof and simulation result-14 s are presented to validate the feasibility of the control 15 algorithms.

show abstract

Section: Introduction 20mentioning

confidence: 99%

State-constrained bipartite tracking of interconnected robotic systems via hierarchical prescribed-performance control

et al. 2023

Nonlinear Dyn

View full text Add to dashboard Cite

show abstract

“…These two communication topologies require the satisfying of the in-degree balance condition between different groups [29][30][31]. It is worth noting that in this type of clustered network, each subgraph only contains positive edges, i.e., cooperative relationships [32]. Recently, the concept of group-bipartite consensus has been introduced by combining acyclic partition and sign function [33].…”

Section: Introductionmentioning

confidence: 99%

Modeling and Control of Wide-Area Networks

Wang,

2023

Mathematics

View full text Add to dashboard Cite

This paper provides a survey of recent research progress in mathematical modeling and distributed control of wide-area networks. Firstly, the modeling is introduced for two types of wide-area networks, i.e., coopetitive networks and cooperative networks, with the help of algebraic graph theory. Particularly, bipartite network topologies and cluster network topologies are introduced for coopetitive networks. With respect to cooperative networks, an intermittent clustered network modeling is presented. Then, some classical distributed control strategies are reviewed for wide-area networks to ensure some desired collective behaviors, such as consensus (or synchronization), bipartite consensus (or polarization), and cluster consensus (or fragmentation). Finally, some conclusions and future directions are summarized.

show abstract

“…Inspired by these works, Zhang provided a novel symmetric positive definite matrix to derive the gain selection criteria in the leader-following case for networked Lagrangian systems [16]. Zhang further introduced an acyclic partition and obtained the explicit expressions of the final states in the leaderless case [17].…”

Section: Introductionmentioning

confidence: 99%

Ordered-Bipartite Consensus of Multi-Agent Systems under Finite Time Control

Zhang

et al. 2022

Applied Sciences

Self Cite

View full text Add to dashboard Cite

Since group consensus (GC) control accounts for one-half of the multi-robot coordination domain, as does complete consensus control, this paper will formulate a certain kind of GC and group bipartite consensus (GBC) in finite time for multi-agent systems (MAS). It should be noted that the key to this work is that information transfer under acyclic partition networks is zero-sum between groups and the cooperative–competitive interaction. The general GC will firstly be achieved under acyclic partition, which reflects the fact that such topology allows the MAS to reach agreement in an ordered and hierarchical process. Further, the information communication is zero-sum within each group under the acyclic partition signed digraph. Thus, the group–bipartite agreement for MAS is given under acyclic bipartite topology. These results display not only an ordered, hierarchical state, but also an intra-group symmetric state. In addition, simulation examples are presented in parallel with the theoretical results.

show abstract

Distributed multiple-bipartite consensus in networked Lagrangian systems with cooperative–competitive interactions

Cited by 11 publications

References 58 publications

State-constrained bipartite tracking of interconnected robotic systems via hierarchical prescribed-performance control

State-constrained bipartite tracking of interconnected robotic systems via hierarchical prescribed-performance control

Modeling and Control of Wide-Area Networks

Ordered-Bipartite Consensus of Multi-Agent Systems under Finite Time Control

Contact Info

Product

Resources

About