Multi-agent flocking via generalized control algorithms: Existence and properties

2016 ◽  
Author(s):  
Jun Zhou ◽  
Huimin Qian ◽  
Xinbiao Lu
Keyword(s):  
Control Algorithms ◽  
Multi Agent

scholarly journals Resilient Control and Safety for Multi-Agent Cyber-Physical Systems

2017 ◽  
Author(s):  
Anna Lukina
Keyword(s):  
Winning Strategy ◽  
Optimization Technique ◽  
Control Algorithms ◽  
Stochastic Dynamical Systems ◽  
Physical Systems ◽  
Planning And Control ◽  
Multi Agent ◽  
And Control ◽  
Non Cooperative Games ◽  
Synthesis Approach

I develop novel intelligent approximation algorithms for solving modern problems of CPSs, such as control and verification, by combining advanced statistical methods. it is important for the control algorithms underlying the class of multi-agent CPSs to be resilient to various kinds of attacks, and so it is for my algorithms. I have designed a very general adaptive receding-horizon synthesis approach to planning and control that can be applied to controllable stochastic dynamical systems. Apart from being fast and efficient, it provides statistical guarantees of convergence. The optimization technique based on the best features of Model Predictive Control and Particle Swarm Optimization proves to be robust in finding a winning strategy in the stochastic non-cooperative games against a malicious attacker. The technique can further benefit probabilistic model checkers and real-world CPSs.

Consensus Based Multi-Agent Control Algorithms

2010 ◽  
pp. 197-218
Author(s):  
Miloš S. Stanković ◽  
Dušan M. Stipanović ◽  
Srdjan S. Stanković
Keyword(s):  
Control Algorithms ◽  
Multi Agent ◽  
Agent Control

Control Algorithms in Multi-Agent Environment

2012 ◽  
Vol 17 (3) ◽  
pp. 47-62 ◽  
Author(s):  
Adam Marchewka ◽  
Zbigniew Lutowski ◽  
Beata Marciniak ◽  
Mścisław Śrutek ◽  
Sławomir Bujnowski
Keyword(s):  
Customer Service ◽  
Service Time ◽  
General Information ◽  
Control Algorithms ◽  
Virtual Library ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Simulation Results ◽  
Number Of Iterations

Abstract In this paper the general information regarding controlling multi-agent systems has been given. The simulation results of using algorithms, proposed by authors, used for controlling groups of robots servicing the virtual library has been presented. These simulations concerned estimation of following parameters: number of iterations needed to complete a task, average customer service time and average customer awaiting service time in function of number of robots, size of library and number of exchange points.

Schooling for multi-agent systems via impulsive containment control algorithms with quantized information

2018 ◽  
Vol 41 (3) ◽  
pp. 828-841 ◽  
Author(s):  
Hong-Xiao Zhang ◽  
Li Ding ◽  
Zhi-Wei Liu
Keyword(s):  
Sufficient Conditions ◽  
Laplacian Matrix ◽  
Control Algorithms ◽  
Multi Agent Systems ◽  
Containment Control ◽  
Agent Systems ◽  
Eigenvalues Of The Laplacian ◽  
Multi Agent ◽  
Necessary And Sufficient ◽  
Theoretical Results

In the paper, schooling problems based on containment control in multi-agent systems that have static or dynamic leaders under directed and undirected communication topologies are investigated. We propose a periodic impulsive containment control algorithm to realize schooling in multi-agent systems. Both ideal and quantized relative state measurements are considered under this framework. Some necessary and sufficient conditions, which depend on the eigenvalues of the Laplacian matrix that is associated with the communication graph, the impulsive period as well as the gain parameters, are obtained to realize the containment control of schooling. Finally, some numerical simulations are illustrated to verify the theoretical results.

Sign in / Sign up

Export Citation Format

Share Document