scholarly journals Control law synthesis for distributed multi-agent systems: Application to active clock distribution networks

Author(s):  
A. Korniienko ◽  
G. Scorletti ◽  
E. Colinet ◽  
E. Blanco ◽  
J. Juillard ◽  
...  
Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-6 ◽  
Author(s):  
Zhengquan Yang ◽  
Qing Zhang ◽  
Zengqiang Chen

In this paper, the formation problem for multi-agent systems with region constraint is studied while few researchers consider this problem. The goal is to control all multi-agents to enter the constraint area while reaching formation. Each agent is constrained by a common convex set. A formation control law is presented based on local information of the neighborhood. It is proved that the positions of all the agents would converge to the set constraint while reaching formation. Finally, two numerical examples are presented to illustrate the validity of the theoretical results.


2020 ◽  
Vol 10 (21) ◽  
pp. 7466
Author(s):  
Wenhao Jia ◽  
Jinzhi Wang

This paper solves the distributed fault detection (FD) problem for heterogeneous multi-agent systems (MAS). For a heterogeneous MAS, we adopt a distributed control law to realise cooperative output regulation (COR) when no fault occurs in the MAS, and propose a state-feedback-based FD scheme, where the adopted distributed control law and proposed FD scheme all utilise state information. Furthermore, we consider the condition that state information is unmeasurable, the output-feedback-based distributed FD scheme is proposed, and the adopted distributed control law also utilises measurement output. Finally, two numerical examples are utilised to verify that the proposed distributed FD schemes could locate and remove the faulty agent in time.


Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5014
Author(s):  
Karlo Griparić

The effectiveness of collaboration in distributed networks, such as sensor networks and multi-agent systems, relies on nodes’ ability to exchange information. The availability of various communication protocols with different technical properties opens the possibility to guarantee connectivity during a system’s operation in any condition. A communication network can be represented by a graph on which connectivity can be expressed by a well-known algebraic connectivity value or Fiedler value. It is one of the most important tools used in many applications where connectivity preservation is required. In this paper, a trust-based consensus algorithm for algebraic connectivity estimation has been implemented. To guarantee the accomplishment of the global objective and the system’s performance, our contributions include: (i) a novel decentralized framework for combining multiple communication channels in a resulting channel and (ii) a decentralized algebraic connectivity control law that dynamically changes the number of agents in the system during operation. The proposed algebraic connectivity control strategy has been evaluated in simulations and in a real multi-robot system using two channels with different properties and initial topologies.


Author(s):  
M. Khaledyan ◽  
M. de Queiroz

In this paper, we present a leader-follower type solution to the formation maneuvering problem for multiple, nonholonomic wheeled mobile robots. Our solution is based on the graph that models the coordination among the robots being a spanning tree. Our kinematic control law ensures, in the least squares sense, that the robots globally exponentially acquire a given planar formation while the formation globally exponentially tracks a desired trajectory. The proposed control is demonstrated by numerical simulations of five unicycle vehicles.


Sign in / Sign up

Export Citation Format

Share Document