Search

This paper studies the dynamic formation control of second-order multi-agent systems (MASs) in three-dimensional space based on the distance control approach. A rigid graph represents the communication topology between agents to improve the system's robustness and stability and avoid collisions and deformations during formation operation. A distributed control strategy based on the relative states among neighbors is designed for each agent to achieve formation and formation maintenance under arbitrary initial conditions. The Lyapunov function, an error function of potential and kinetic energy, is constructed by rigid graph theory and a second-order integrator model. The decreasing of the Lyapunov function is proven by Barbalat's theory, further indicating that the system is asymptotically stable. A second-order MAS composed of nine agents is constructed, and the dynamic scaling of rigid formations in 3D space is achieved through simulation to verify the effectiveness of the controller and the correctness of the theory. [ABSTRACT FROM AUTHOR]

Considering the unknown compound interference in manufacturing systems, the finite-time tracking and synchronization performance of the multi-motor system significantly affects the production safety, reliability, and quality, which can be considered a multi-agent system with unmeasured speed and uncertainty. In recent years, the synchronous control schemes of the multi-motor system have grown to maturity, but the research on the speed sensorless finite-time consensus tracking control remains to be extended. This paper proposes an observer-based leader–follower consensus tracking control for the synchronous coordination control of the multi-motor system. The speed and position of all motors can be tracked by consensus in a finite time when only some motors realize partial interaction. First, a finite-time observer is designed to estimate the unknown composite disturbance and unmeasurable speed variable of each motor. Second, the distributed finite-time consensus tracking control protocol is designed using the observed value and local information interaction. The stability of the overall closed-loop system is theoretically analyzed based on Lyapunov theory and graph theory, which shows that the consensus tracking error converges to an arbitrary small neighborhood of zero, and all signals are globally bounded in finite time. Finally, simulation results are provided to illustrate the effectiveness of the proposed control method. [ABSTRACT FROM AUTHOR]

This paper studies the group consensus problem in networks of multi-agent systems, in which the nonlinear dynamics of all agents are unknown and nonidentical. We assume that the unknown dynamics are linearly parameterized. Adaptive control method is adopted in the algorithm design. A novel algorithm is proposed for the multi-agent systems to reach group consensus via pinning control strategies, which only rely on the relative position information between neighboring agents. The stability and parameter convergence analysis are done based on Lyapunov theory, Barbalat's lemma, adaptive control theory and algebraic graph theory. Finally, a simulation example is given to validate our theoretical results. [ABSTRACT FROM AUTHOR]

This study proposes a collective motion and self-organization control of a swarm of 10 UAVs, which are divided into two clusters of five agents each. A cluster is a group of UAVs in a dedicated area and multiple clusters make a swarm. This paper designs the 3D model of the whole environment by applying graph theory. To address the aforesaid issues, this paper designs a hybrid meta-heuristic algorithm by merging the particle swarm optimization (PSO) with the multi-agent system (MAS). First, PSO only provides the best agents of a cluster. Afterward, MAS helps to assign the best agent as the leader of the nth cluster. Moreover, the leader can find the optimal path for each cluster. Initially, each cluster contains agents at random positions. Later, the clusters form a formation by implementing PSO with the MAS model. This helps in coordinating the agents inside the nth cluster. However, when two clusters combine and make a swarm in a dynamic environment, MAS alone is not able to fill the communication gap of n clusters. This study does it by applying the Vicsek-based MAS connectivity and synchronization model along with dynamic leader selection ability. Moreover, this research uses a B-spline curve based on simple waypoint defined graph theory to create the flying formations of each cluster and the swarm. Lastly, this article compares the designed algorithm with the NSGA-II model to show that the proposed model has better convergence and durability, both in the individual clusters and inside the greater swarm. [ABSTRACT FROM AUTHOR]

The paper addresses the multi-agent path planning (MPP) of mobile agents with multiple goals taking into consideration the kinematic constraints of each agent. The “Swing and Dock” (SaD) robotic system being discussed uses discrete locomotion, where agents swing around fixed pins and dock with their mounting legs to realize displacement from one point to another. The system was developed as a subsystem for mobile robotic fixture (SwarmItFix). Previous work dealt with MPP for SaD agents using the concept of extended temporal graph with Integer Linear Programming (ILP) based formulations. The approach discretized time into unit steps, whereas in reality, the agents are constrained by velocity limits. Hence, a real-time schedule is required to accurately plan the agent movement in a working scenario. We utilize the concept of simple temporal network and extend our ILP formulations to model the velocity kinematic constraints. The mathematical formulations are implemented and tested using a GUROBI solver. Computational results display the effectiveness of the approach. [ABSTRACT FROM AUTHOR]

This article mainly studies first-order coherence related to the robustness of the triplex MASs consensus models with partial complete graph structures; the performance index is studied through algebraic graph theory. The topologies of the novel triplex networks are generated by graph operations and the approach of graph spectra is applied to calculate the first-order network coherence. The coherence asymptotic behaviours of the three cases of the partial complete structures are analysed and compared. We find that under the condition that the number of nodes in partial complete substructures n tends to infinity, the coherence asymptotic behaviour of the two sorts of non-isomorphic three-layered networks will be increased by r − 1 2 (r + 1) , which is irrelevant to the peripheral vertices number p; when p tends to infinity, adding star copies to the original triplex topologies will reverse the original size relationship of the coherence under consideration of the triplex networks. Finally, the coherence of the three-layered networks with the same sorts of parameters, but non-isomorphic graphs, are simulated to verify the results. [ABSTRACT FROM AUTHOR]

Can specific behaviour strategies be induced from low-level observations of two adversary groups of agents with limited domain knowledge? This paper presents a domain-independent Multi-Agent Strategy Discovering Algorithm (MASDA), which discovers strategic behaviour patterns of a group of agents under the described conditions. The algorithm represents the observed multi-agent activity as a graph, where graph connections correspond to performed actions and graph nodes correspond to environment states at action starts. Based on such data representation, the algorithm applies hierarchical clustering and rule induction to extract and describe strategic behaviour. The discovered strategic behaviour is represented visually as graph paths and symbolically as rules. MASDA was evaluated on RoboCup. Both soccer experts and quantitative evaluation confirmed the relevance of the discovered behaviour patterns. [ABSTRACT FROM AUTHOR]