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

A Genetic Algorithm Approach to Multi-Agent Mission Planning Problems

Fulltext:


Publication Type:

Book chapter

Venue:

Communications in Computer and Information Science

Publisher:

Springer, Cham

DOI:

https://doi.org/10.1007/978-3-030-37584-3_6


Abstract

Multi-Agent Systems (MASs) have received great attention from scholars and engineers in different domains, including computer science and robotics. MASs try to solve complex and challenging problems (e.g., a mission) by dividing them into smaller problem instances (e.g., tasks) that are allocated to the individual autonomous entities (e.g., agents). By fulfilling their individual goals, they lead to the solution to the overall mission. A mission typically involves a large number of agents and tasks, as well as additional constraints, e.g., coming from the required equipment for completing a given task. Addressing such problem can be extremely complicated for the human operator, and several automated approaches fall short of scalability. This paper proposes a genetic algorithm for the automation of multi-agent mission planning. In particular, the contributions of this paper are threefold. First, the mission planning problem is cast into an Extended Colored Traveling Salesperson Problem (ECTSP), formulated as a mixed integer linear programming problem. Second, a precedence constraint reparation algorithm to allow the usage of common variation operators for ECTSP is developed. Finally, a new objective function minimizing the mission makespan for multi-agent mission planning problems is proposed.

Bibtex

@incollection{Miloradovic5705,
author = {Branko Miloradovic and Baran {\c{C}}{\"u}r{\"u}kl{\"u} and Mikael Ekstr{\"o}m and Alessandro Papadopoulos},
title = {A Genetic Algorithm Approach to Multi-Agent Mission Planning Problems},
isbn = {978-3-030-37584-3},
editor = {Parlier G.; Liberatore F.; Demange M.},
volume = {1162},
pages = {109--134},
month = {January},
year = {2020},
booktitle = {Communications in Computer and Information Science},
publisher = {Springer, Cham},
url = {http://www.es.mdu.se/publications/5705-}
}