You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact webmaster@ide.mdh.se
Extended Colored Traveling Salesperson for Modeling Multi-Agent Mission Planning Problems
Publication Type:
Conference/Workshop Paper
Venue:
8th International Conference on Operations Research and Enterprise Systems
DOI:
10.5220/0007309002370244
Abstract
In recent years, multi-agent systems have been widely used in different missions, ranging from underwater to
airborne. A mission typically involves a large number of agents and tasks, making it very hard for the human
operator to create a good plan. A search for an optimal plan may take too long, and it is hard to make a time
estimate of when the planner will finish. A Genetic algorithm based planner is proposed in order to overcome
this issue. The contribution of this paper is threefold. First, an Integer Linear Programming (ILP) formulation
of a novel Extended Colored Traveling Salesperson Problem (ECTSP) is given. Second, a new objective
function suitable for multi-agent mission planning problems is proposed. Finally, a reparation algorithm to
allow usage of common variation operators for ECTSP has been developed.
Bibtex
@inproceedings{Miloradovic5448,
author = {Branko Miloradovic and Baran {\c{C}}{\"u}r{\"u}kl{\"u} and Mikael Ekstr{\"o}m and Alessandro Papadopoulos},
title = {Extended Colored Traveling Salesperson for Modeling Multi-Agent Mission Planning Problems},
month = {February},
year = {2019},
booktitle = {8th International Conference on Operations Research and Enterprise Systems},
url = {http://www.es.mdu.se/publications/5448-}
}