Solving decentralized multi-agent control problems with genetic algorithms

Author(s):  
Maciej A. Mazurowski ◽  
Jacek M. Zurada
2014 ◽  
Vol 134 (10) ◽  
pp. 1515-1523
Author(s):  
Akihiro Ogawa ◽  
Kazunari Maki ◽  
Kiyoshi Hata ◽  
Yasunori Takeuchi ◽  
Fumio Ishikawa

2014 ◽  
Vol 41 (4) ◽  
pp. 1663-1671
Author(s):  
Shingo Mabu ◽  
Kotaro Hirasawa ◽  
Masanao Obayashi ◽  
Takashi Kuremoto

Author(s):  
D. H. A. Maithripala ◽  
D. H. S. Maithripala ◽  
S. Jayasuriya

We propose a framework for synthesizing real-time trajectories for a wide class of coordinating multi-agent systems. The class of problems considered is characterized by the ability to decompose a given formation objective into an equivalent set of lower dimensional problems. These include the so called radar deception problem and the formation control problems that fall under formation keeping and/or formation reconfiguration tasks. The decomposition makes the approach scalable, computationally economical, and decentralized. Most importantly, the designed trajectories are dynamically feasible, meaning that they maintain the formation while satisfying the nonholonomic and saturation type velocity and acceleration constraints of each individual agent. The main contributions of this paper are (i) explicit consideration of second order dynamics for agents, (ii) explicit consideration of nonholonomic and saturation type velocity and acceleration constraints, (iii) unification of a wide class of formation control problems, and (iv) development of a real-time, distributed, scalable, computationally economical motion planning algorithm.


Sign in / Sign up

Export Citation Format

Share Document