Multi-agent Research Articles

Adaptive finite-time consensus tracking for nonlinear second-order multi-agent systems based on integral sliding mode

This paper delves into the investigation of finite-time consensus for second-order nonlinear multi-agent systems (MASs) with external disturbances under directed topology. The MASs considered in this study consist of n followers and a leader, all of which are subject to bounded disturbances. First, a continuous nonsingular integral terminal sliding mode is designed, which can effectively eliminate the singularity and chattering. Then, a finite-time disturbance observer is introduced to estimate and compensate for disturbances. Subsequently, an integral sliding mode adaptive controller is designed to enhance system’s robustness, improve response speed, and increase tracking accuracy. Furthermore, Lyapunov theory is utilized to demonstrate that the system achieves finite-time consensus under a directed connected topology. Finally, we apply a simulation to verify the efficacy of the proposed consensus control protocol.

An integrated decision-execution framework of cooperative control for multi-agent systems via reinforcement learning

Cooperative control is both a crucial and hot research topic for multi-agent systems (MASs). However, most existing cooperative control strategies guarantee tracking stability under various non-ideal conditions, while the path decision capability is often ignored. In this paper, the integrated decision-execution (IDE) framework is newly presented for cooperative control of multi-agent systems (MASs) to accomplish the integrated task of path decision and cooperative execution. This framework includes a decision layer and a control layer. The decision layer generates a continuous trajectory for the virtual leader to reach the target from its initial position in an unknown environment. To achieve the goal of this layer, (1) the Step-based Adaptive Search Q-learning (SASQ-learning) algorithm is proposed based on reinforcement learning to efficiently find the discrete path, (2) an Axis-based Trajectory Fitting (ATF) method is developed to convert the discrete path into a continuous trajectory for mobile agents. In the control layer, this trajectory is used to regulate the following MASs to achieve cooperative tracking control with the presence of input saturation. Simulation experiments are presented to demonstrate the effectiveness of this framework.

Nodal Consensus in Multiagent Systems With Edge Communications

Nodal Consensus in Multiagent Systems With Edge Communications

Time-varying formation tracking of multi-agent systems with multiple leaders based on aperiodic time-triggered intermittent control

In this article, the distributed aperiodic time-triggered intermittent control protocol (DATICP) is presented for the time-varying formation tracking of multi-agent systems (MASs) with multiple leaders. Firstly, we present the mathematical description of DATICP. The characteristic of DATICP lies in that for each agent, its control signal is updated at aperiodic sampling instants on work time intervals and disappears on rest time intervals. Secondly, based on a mixed time-dependent Lyapunov functional (MTLF), the exponential stability theorem of the derived system is established. Thirdly, according to the theorem, sufficient conditions are given to achieve time-varying formation tracking for MASs with multiple leaders by DATICP. As a result, a corollary is obtained which compromises conservativeness and complexity. Finally, two simulation examples are offered for illustration.

Robust Collaborative Visual-Inertial SLAM for Mobile Augmented Reality.

Achieving precise real-time localization and ensuring robustness are critical challenges in multi-user mobile AR applications. Leveraging collaborative information to augment tracking accuracy on lightweight devices and fortify overall system robustness emerges as a crucial necessity. In this paper, we propose a robust centralized collaborative rnulti-agent VI-SLAM system for mobile AR interaction and server-side efficient consistent mapping. The system deploys a lightweight VIO frontend on mobile devices for real-time tracking, and a backend running on a remote server to update multiple submaps. When overlapping areas between submaps across agents are detected, the system performs submap fusion to establish a globally consistent map. Additionally, we propose a map registration and fusion strategy based on covisibility areas for online registration and fusion in multi-agent scenarios. To improve the tracking accuracy of the frontend on agent, we introduce a strategy for updating the global map to the local map at a moderate frequency between the camera-rate pose estimation of the frontend VIO and the low-frequency global map optimization, using a tightly coupled strategy to achieve consistency of the multi-agent frontend poses estimation in the global map. The effectiveness of the proposed method is further confirmed by executing backend mapping on the server and deploying VIO frontends on multiple mobile devices for AR demostration. Additionally, we discuss the scalability of the proposed system by analyzing network traffic, synchronization frequency, and other factors at both the agent and server ends.

Adaptive fault-tolerant containment control for heterogeneous uncertain nonlinear multi-agent systems under actuator faults

As modern control systems involve a growing number of actuators, the consequent number of faults occurrence, which may deteriorate the closed-loop system performance, is increasing. Focusing on the containment control problem of generic nonlinear high-order heterogeneous uncertain Multi-Agent Systems, this study proposes a novel distributed adaptive fault-tolerant Proportional-Integral-Derivative control protocol to improve the reliability and the resilience of the whole networked systems against actuator failures. The Lyapunov theory, combined with the Barbalat lemma, provides the design of suitable adaptive mechanisms that adjust the PID control actions to ensure the asymptotic convergence of the closed-loop containment errors for the overall network, hence implying the convergence of each agent state toward the convex region shaped by the multiple leaders, despite the occurrence of actuators faults. The fulfillment of the fault-tolerant containment objective is ensured by requiring a lower computational burden with respect to alternative solutions, hence resulting in more attractive for wider practical engineering applications. Numerical simulation results, also including a comparison analysis with a state-of-the-art controller, corroborate the efficiency and the advantages of the proposed distributed PID controller.

Distributed Nash Equilibrium Seeking for Constrained Multicluster Games of Second-Order Nonlinear Multiagent Systems

Distributed Nash Equilibrium Seeking for Constrained Multicluster Games of Second-Order Nonlinear Multiagent Systems

Practical Consensus Tracking of Asynchronously Switched Multiagent Systems

Practical Consensus Tracking of Asynchronously Switched Multiagent Systems

Robust Data-Driven Compensation Iterative Learning Consensus Tracking Control for MIMO Multiagent Systems With Random Packet Dropouts

Robust Data-Driven Compensation Iterative Learning Consensus Tracking Control for MIMO Multiagent Systems With Random Packet Dropouts

Collisions-Free Distributed Cooperative Output Regulation of Nonlinear Multiagent Systems

Collisions-Free Distributed Cooperative Output Regulation of Nonlinear Multiagent Systems

Random Coordinate Descent for Resource Allocation in Open Multiagent Systems

Random Coordinate Descent for Resource Allocation in Open Multiagent Systems

Distributed MPC for Self-Organized Cooperation of Multiagent Systems

Distributed MPC for Self-Organized Cooperation of Multiagent Systems

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.

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.