scholarly journals Extended Colored Traveling Salesperson for Modeling Multi-Agent Mission Planning Problems

Author(s):  
Branko Miloradović ◽  
Baran Çürüklü ◽  
Mikael Ekström ◽  
Alessandro Papadopoulos
2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Da-Wei Jin ◽  
Li-Ning Xing

The multiple satellites mission planning is a complex combination optimization problem. A knowledge-based simulated annealing algorithm is proposed to the multiple satellites mission planning problems. The experimental results suggest that the proposed algorithm is effective to the given problem. The knowledge-based simulated annealing method will provide a useful reference for the improvement of existing optimization approaches.


Games ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 54
Author(s):  
Simone Battistini

Pursuit-evasion games are used to define guidance strategies for multi-agent planning problems. Although optimal strategies exist for deterministic scenarios, in the case when information about the opponent players is imperfect, it is important to evaluate the effect of uncertainties on the estimated variables. This paper proposes a method to characterize the game space of a pursuit-evasion game under a stochastic perspective. The Mahalanobis distance is used as a metric to determine the levels of confidence in the estimation of the Zero Effort Miss across the capture zone. This information can be used to gain an insight into the guidance strategy. A simulation is carried out to provide numerical results.


Author(s):  
Gema Bello-Orgaz ◽  
Cristian Ramirez-Atencia ◽  
Jaime Fradera-Gil ◽  
David Camacho

Author(s):  
Tristan Charrier ◽  
Arthur Queffelec ◽  
Ocan Sankur ◽  
François Schwarzentruber

Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model an area by a topological graph specifying the movement and the connectivity constraints of the agents. We study the theoretical complexity of the reachability and the coverage problems of a fleet of connected agents on various classes of topological graphs. We establish the complexity of these problems on known classes, and introduce a new class called sight-moveable graphs which admit efficient algorithms.


2014 ◽  
Vol 12 (2) ◽  
pp. 325-331 ◽  
Author(s):  
Peng Ni ◽  
Jin-Mang Liu ◽  
Yong-Lan Liu ◽  
Qiang Fu

2016 ◽  
Vol 21 (17) ◽  
pp. 4883-4900 ◽  
Author(s):  
Cristian Ramirez-Atencia ◽  
Gema Bello-Orgaz ◽  
María D. R-Moreno ◽  
David Camacho

Sign in / Sign up

Export Citation Format

Share Document