Multi-agent Research Articles

Generalized Homogeneous Formation Control for Unicycle Multi-Agent Systems

In this paper, the formation control problem for unicycle multi-agent systems is considered. The design of a generalized homogeneous leader–follower formation control protocol is studied which shows that such a control protocol can be obtained by “upgrading” from the classical linear control. With this proposed control protocol, a finite-time stability of the formation error is ensured if the acceleration of the leader is bounded by some known value. In addition, if the leader acceleration is unknown but bounded, the robust formation is achieved by ensuring the formation error’s input-to-state stability. Simulations are carried out to verify the effectiveness of the proposed control protocol.

Approximation-based adaptive two-bit-triggered bipartite tracking control for nonlinear networked MASs subject to periodic disturbances

Purpose This paper aims to investigate the problem of adaptive bipartite tracking control in nonlinear networked multi-agent systems (MASs) under the influence of periodic disturbances. It considers both cooperative and competitive relationships among agents within the MASs. Design/methodology/approach In response to the inherent limitations of practical systems regarding transmission resources, this paper introduces a novel approach. It addresses both control signal transmission and triggering conditions, presenting a two-bit-triggered control method aimed at conserving system transmission resources. Additionally, a command filter is incorporated to address the problem of complexity explosion. Furthermore, to model the uncertain nonlinear dynamics affected by time-varying periodic disturbances, this paper combines Fourier series expansion and radial basis function neural networks. Finally, the effectiveness of the proposed methodology is demonstrated through simulation results. Findings Based on neural networks and command filter control method, an adaptive two-bit-triggered bipartite control strategy for nonlinear networked MASs is proposed. Originality/value The proposed control strategy effectively addresses the challenges of limited transmission resources, nonlinear dynamics and periodic disturbances in networked MASs. It guarantees the boundedness of all signals within the closed-loop system while also ensuring effective bipartite tracking performance.

Cooperation and Fairness in Multi-Agent Reinforcement Learning

Multi-agent systems are trained to maximize shared cost objectives, which typically reflect system-level efficiency. However, in the resource-constrained environments of mobility and transportation systems, efficiency may be achieved at the expense of fairness — certain agents may incur significantly greater costs or lower rewards compared to others. Tasks could be distributed inequitably, leading to some agents receiving an unfair advantage while others incur disproportionately high costs. It is, therefore, important to consider the tradeoffs between efficiency and fairness in such settings. We consider the problem of fair multi-agent navigation for a group of decentralized agents using multi-agent reinforcement learning (MARL). We consider the reciprocal of the coefficient of variation of the distances traveled by different agents as a measure of fairness and investigate whether agents can learn to be fair without significantly sacrificing efficiency (i.e., increasing the total distance traveled). We find that by training agents using min-max fair distance goal assignments along with a reward term that incentivizes fairness as they move towards their goals, the agents (1) learn a fair assignment of goals and (2) achieve almost perfect goal coverage in navigation scenarios using only local observations. For goal coverage scenarios, we find that, on average, the proposed model yields a 14% improvement in efficiency and a 5% improvement in fairness over a baseline model that is trained using random assignments. Furthermore, an average of 21% improvement in fairness can be achieved by the proposed model as compared to a model trained on optimally efficient assignments; this increase in fairness comes at the expense of only a 7% decrease in efficiency. Finally, we extend our method to environments in which agents must complete coverage tasks in prescribed formations and show that it is possible to do so without tailoring the models to specific formation shapes. [Code]

Signed-network-based consensus control for nonlinear multi-agent systems: a dynamic encryption–decryption approach

Abstract This paper is concerned with the bipartite secure control issue for a class of discrete-time nonlinear multi-agent systems under a dynamic encryption–decryption approach. First, the coupling relationships between agents are portrayed through a signed graph topology containing the edges of positive and negative connection weights. Next, the information transmissions between agents and their neighbors are executed via a shared communication network. The dynamic encryption–decryption approach is implemented to transform original signals into ciphertexts. Under the assumption that the signed graph is structurally balanced, a signed-network-based bipartite secure controller is designed to achieve the desired state control for the nonlinear multi-agent system and sufficient conditions are obtained for the existence of the desired signed-network-based state controller. Furthermore, a precise definition of the minimum channel capacity is proposed to understand the factors affecting the minimum channel capacity. Finally, the effectiveness of the proposed approach is illustrated by two simulation examples.

Distributed Optimization on Matrix‐Weighted Networks

ABSTRACTThis article is intended to tackle the optimization problems for continuous‐time first‐order and second‐order multi‐agent systems (MASs) operating over matrix‐weighted networks. A matrix‐weighted network serves as a powerful framework to model the interdependence among agents' multidimensional states, providing an effective approach to analyze smart grids, intelligent transportation systems, and so forth. Our optimization objective is to facilitate the convergence of all agents toward the optimal value of a global cost function, which is formed by a sum of local cost functions. To achieve this goal, distributed optimization algorithms based on Hessian matrix and gradient information are constructed. Additionally, an edge‐based event‐triggered mechanism is utilized to avoid communicating with all neighbors at the time of event triggering. It is proved that this mechanism theoretically excludes Zeno behavior. The results show that the proposed algorithms ensure that the agents can achieve the optimization goal while reducing energy consumption. Finally, an application is presented to substantiate the theoretical results.

Coordination of NPCs in multi-agent systems based on behavior trees

Abstract. This paper addresses the design and coordination challenges of controlling non-player characters' (NPCs) behaviors in multi-agent systems (MAS) using behavior trees (BTs), which are preferred over finite state machines (FSMs) due to their hierarchical structure and ease of maintenance. While BTs effectively resolve the question of "What to do next?" for individual NPCs, their application in MAS, particularly with the integration of a blackboard system for central control, reveals limitations in efficiency, robustness, and heuristic capacity as system complexity increases. To explore solutions to these challenges, this study analyzes various algorithms that enhance the functionality of behavior trees within MAS. The research focuses on three primary areas: the optimization of behavior trees, the development of behavior tree search algorithms, and the improvement of communication algorithms within BTs. Methods involve a comparative analysis of existing and new algorithmic approaches to identify and address inefficiencies in NPC coordination. The findings indicate that advanced behavior tree configurations, when combined with innovative search and communication strategies, significantly improve the coordination, robustness, and operational efficiency of MAS. These enhancements allow for more dynamic and responsive NPC interactions in complex gaming environments.

Self-triggered consensus resilient control for multi-agent systems against sensor deception attacks based on a single parameter learning method

This paper presents a self-triggered consensus resilient control method for nonlinear multi-agent systems (MASs) under sensor deception attacks. A single parameter learning method is integrated into backstepping technique to simplify design procedure. The neural networks are utilized to compensate for unknown dynamics of the MASs. Moreover, a self-triggered mechanism is presented for MASs to refrain from continuously monitoring triggering conditions and conserve communication resources. The designed controller can resist sensor deception attacks and guarantee that all signals of the MASs are uniformly bounded. An expository simulation example reveals the virtue of the presented method.

Distributed Optimization Control for the System with Second-Order Dynamic

No matter whether with constraint or without constraint, most of the research about distributed optimization is studied for the kind of quadratic performance criteria that does not have an integrator; these optimization problems only concern the state value at the time of the final state, not the whole process of the system change. For this problem, this paper discusses second-order multi-agent systems with a discrete-time dynamic and a continuous-time dynamic, respectively, for distributed optimization control problems, and proposes sufficient conditions to ensure the quadratic performance criteria with an integrator is positive. Specifically, under sufficient conditions, we describe the multi-agent systems that are considered in this paper to be connected topology; all the agents can obtain the information from their neighbors. In addition, the structure of our controller only relies on the Laplace matrix of the system’s topology, and the reaction coefficients in the controller are the parameters in the performance criteria. Finally, the analysis of convergence is given and verified by numerical examples and simulations.

Simultaneous fault-tolerant consensus control and disturbance suppression for multi-agent systems with polynomial form fault under switching topology

For continuous-time linear leader-follower multi-agent systems with polynomial faults, the problem of fault-tolerant state consensus under switching topologies is studied. firstly, the average dwell time method is introduced, and observers are designed for different topologies to observe faults and disturbances. Secondly, according to the observed estimated value, the corresponding fault-tolerant control consensus protocol is proposed considering the switching situation of the communication topology. Finally, both theoretical analysis and simulation examples verify that the proposed design scheme can compensate faults and disturbance rejection.

Fuzzy adaptive asynchronous sampled-data consensus control for nonlinear multi-agent systems under DoS attacks

This article investigates the problem of fuzzy adaptive resilient asynchronous sampled-data consensus control (SDCC) for a class of uncertain nonlinear strict-feedback multi-agent systems (MASs) under denial-of-service (DoS) attacks and with a directed graph. Firstly, the upper bounds on the sampling intervals and a distributed sampled-data observer are proposed to estimate the leader's output and its high-order derivatives under DoS attacks. Then, the sufficient conditions to ensure the asymptotic convergence of the designed distributed sampled-data observer are established. Based on the distributed sampled-data observer and backstepping control design technique, a distributed fuzzy adaptive resilient control algorithm is developed. It is proved that the proposed control scheme can guarantee that the controlled MASs are stable, and the consensus errors converge to a small neighbourhood of zero. Finally, a simulation example on heterogeneous vehicular platoons verifies the feasibility of the proposed control scheme.

Cluster consensus of finite-field networks with stochastic communication topology

Most of the multi-agent systems (MASs) in real life are with limited storage and communication capabilities; studies on such systems, including consensus problem, however have been mainly based on real number field models. In this article, the cluster consensus problem of MASs with stochastic communication topology over finite-field known as the cluster consensus of finite-field networks (FFNs), is considered. Using the semi-tensor product of matrices, the dynamics of FFNs with stochastic communication topology are equivalently converted into a logical algebraic form, which facilitates further studies. Then a permutation system is introduced. The relationship between cluster consensus of FFNs with stochastic communication topology and the set stability with probability one (SSPO) of the permutation system is revealed. In such an approach, some verifiable criteria can be derived for the cluster consensus of FFNs with stochastic communication topology, without requesting the connectivity of the whole network. Finally, an example is presented to validate the main results.

The asymptotic convergence based on marked locators for time-varying nonlinear multi-agent systems with the protected random switching topologies against stochastic communication disruptions

The asymptotic convergence based on marked locators for time-varying nonlinear multi-agent systems with the protected random switching topologies against stochastic communication disruptions

Adaptive Event-Triggered Consensus Control of Nonlinear Multi-Agent Systems via Output Feedback Methodology: An Application to Energy Efficient Consensus of AUVs

For dealing with the energy consumption in multi-agent systems (MASs), an event-triggered (ET) methodology is promising, which relies on the activation of communication devices only when communication of data is needed. This paper explores the leaderless consensus for nonlinear MASs using an adaptive ET approach via an output feedback methodology. This adaptive ET scheme is preferred as it can adapt to the environment through setting a communication threshold. The proposed approach renders the observed states of agents by use of nonlinear observers in an output feedback control dilemma, making it more practical. Simple Luenberger observers are developed to avoid the problem of always measuring agents’ states. The strategy of adaptive ET-based control is employed to minimize resource use and information transmission. Design conditions for the observer-based adaptive ET consensus control of nonlinear MASs have been derived via a Lyapunov function, containing state estimation error, consensus error, adaptation term, and nonlinearity bounds. In contrast to the existing methods, the present approach applies a more practical output feedback schema, uses adaptive ET proficiency, and deals with nonlinear agents. An example of a formation of autonomous underwater vehicles achieving the basic consensus realization between displacement and velocity is included to illustrate the viability of the resultant approach.

Distributed leader-following bipartite consensus for one-sided Lipschitz multi-agent systems via dual-terminal event-triggered mechanism

This article analyses leader-following bipartite consensus for one-sided Lipschitz multi-agent systems by dual-terminal event-triggered output feedback control approach. A distributed observer is designed to estimate unknown system states by employing relative output information at triggering time instants, and then an event-triggered output feedback controller is proposed. Dual-terminal dynamic event-triggered mechanisms are proposed in sensor–observer channel and controller–actuator channel, which can save communication resources to a great extent, and the Zeno behavior is ruled out. A new generalized one-sided Lipschitz condition is proposed to handle the nonlinear term and achieve bipartite consensus. Some stability conditions are presented to guarantee leader-following bipartite consensus. Finally, one-link robot manipulator systems are introduced to demonstrate the availability of the designed scheme. The results demonstrate that the agents of the robot manipulators can track the reference trajectories bi-directionally, and effectively reduce communication resources by 61.22% and 68.04% at the sensor–observer and controller–actuator channels, respectively.

Practical consensus of T-S fuzzy positive multi-agent systems using linear programming

This paper presents the practical consensus of T-S fuzzy positive multi-agent systems with interval type-1 and type-2 fuzzy sets using observer-based control protocols. A fuzzy positive observer is first constructed for the systems. An observer-based fuzzy control protocol is designed, where an additional constant term is introduced. Some linear programming conditions are established to achieve the positivity of the original system and its observer. Then, the practical consensus of the original system is transformed into the stability of a dynamic system, where a set of new variables is defined by combining the constant term and the states of the agents. In the first step, the positivity of the new variables is guaranteed. In the second step, the stability of the dynamic system consisting new variables is addressed by using a fuzzy copositive Lyapunov function. The gain matrices of observer and control protocols are formulated based on a matrix decomposition approach. All positive and consensus conditions are described via linear programming. Finally, two examples are provided to verify the validity of the obtained results.

Non-fragile reliable control for multi-agent systems with actuator faults using an improved L-K functional

Non-fragile reliable control for multi-agent systems with actuator faults using an improved L-K functional

Event-triggered bipartite consensus to heterogeneous multiagent systems under DoS attacks: A fully distributed method

This paper studies event-triggered bipartite output consensus problem of heterogeneous multiagent systems under denial-of-service (DoS) attacks. A novel dynamic event-triggered scheme (DETS) is proposed, which, by introducing an extra dynamic function with time-varying coefficients into triggering conditions, can guarantee strictly positive minimum inter-event intervals no matter DoS attacks occur or not. An event-based resilient compensator with adaptive coupling coefficients is then designed to estimate leader's state, and a hybrid model with jump dynamics is constructed that can incorporate the estimation error, DETS, and DoS attacks, and is useful for convergence analysis. Then, a fully distributed observer-based control protocol is designed to regulate the bipartite output consensus. The main advantages of the proposed method include: 1) global information is not needed to implement the event-based control protocol; 2) strictly positive inter-event intervals are guaranteed even under DoS attacks. Finally, a numerical example is presented to testify the main results.

Pareto-optimal synchronization control of nonlinear multi-agent systems via integral reinforcement learning

Pareto-optimal synchronization control of nonlinear multi-agent systems via integral reinforcement learning

A Distributed Algorithm for Reaching Average Consensus in Unbalanced Tree Networks

In this paper, a distributed algorithm for reaching average consensus is proposed for multi-agent systems with tree communication graph, when the edge weight distribution is unbalanced. First, the problem is introduced as a key topic of core algorithms for several modern scenarios. Then, the relative solution is proposed as a finite-time algorithm, which can be included in any application as a preliminary setup routine, and it is well-suited to be integrated with other adaptive setup routines, thus making the proposed solution useful in several practical applications. A special focus is devoted to the integration of the proposed method with a recent Laplacian eigenvalue allocation algorithm, and the implementation of the overall approach in a wireless sensor network framework. Finally, a worked example is provided, showing the significance of this approach for reaching a more precise average consensus in uncertain scenarios.

Fuzzy Adaptive Event-Triggered Consensus Control for Nonlinear Multiagent Systems Under Jointly Connected Switching Networks.

This article studies the fuzzy adaptive event-triggered (ET) consensus control issue of nonlinear multiagent systems (NMASs) under jointly connected switching networks. Since the leader and its high-order derivatives are unknown under jointly connected switching networks, a novel distributed ET reference generator equipped with an ET mechanism is constructed to estimate them. Meanwhile, the continuous information transmission among agents is avoided and the network channel utilization is optimized. Subsequently, fuzzy logic systems (FLSs) are employed to approximate unknown dynamics, and a fuzzy adaptive ET consensus control algorithm only using intermittent communication is designed by backstepping control methodology. It is demonstrated that all the closed-loop signals are semi-globally uniformly ultimately bounded (SGUUB), with the tracking errors converging to a small neighborhood around zero. Finally, we apply the developed fuzzy adaptive ET consensus control algorithm to unmanned surface vehicles (USVs), and the simulation results verify the effectiveness of the proposed ET consensus control algorithm.