IN Load Control Algorithms for Market-Based Multi-Agent Systems

2003 ◽  
pp. 249-265
Author(s):  
A. Patel ◽  
J. Barria ◽  
J. Pitt
Keyword(s):  
Control Algorithms ◽  
Load Control ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent

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.

Robot Actions Planning Algorithms in Multi-Agent System

2014 ◽  
Vol 223 ◽  
pp. 221-230 ◽  
Author(s):  
Damian Ledziński ◽  
Tomasz Marciniak ◽  
Mirosław Maszewski ◽  
Dariusz Boroński
Keyword(s):  
Energy Consumption ◽  
Robot Control ◽  
Routing Algorithms ◽  
Control Algorithms ◽  
Multi Agent System ◽  
Basic Information ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
The Impact

In this paper, the basic information about multi-agent systems is given. The authors propose robot control algorithms for managing virtual autonomous warehouses, where the task performed by the robots is transportation between specific locations in the warehouse and a number of distribution points. Algorithms control the work of a single robot, including the cooperation with other robots in the environment as well as collisions avoidance. Different routing algorithms are evaluated through simulations focusing on service time and waiting time of executing tasks. The impact of the proposed algorithms on energy consumption was also checked, since this is important for the working time between battery charges.

Sign in / Sign up

Export Citation Format

Share Document