mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Genetic Algorithm Approach to Multi-Agent Mission Planning Problems
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-5224-8302
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-5832-5452
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0002-1364-8127
2020 (English)In: Operations Research and Enterprise Systems / [ed] Parlier G.; Liberatore F.; Demange M., Springer, Cham , 2020, p. 109-134Chapter in book (Other academic)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer, Cham , 2020. p. 109-134
Keywords [en]
Multi-Agent Systems, Multi-agent mission planning, Extended Colored Traveling Salesperson (ECTSP), Genetic algorithms
National Category
Engineering and Technology Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-46604DOI: 10.1007/978-3-030-37584-3_6Scopus ID: 2-s2.0-85076881781ISBN: 978-3-030-37584-3 (print)OAI: oai:DiVA.org:mdh-46604DiVA, id: diva2:1381268
Projects
Future factories in the CloudAggregate Farming in the CloudAvailable from: 2019-12-20 Created: 2019-12-20 Last updated: 2020-01-02Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Miloradović, BrankoCuruklu, BaranEkström, Mikael

Search in DiVA

By author/editor
Miloradović, BrankoCuruklu, BaranEkström, MikaelPapadopoulos, Alessandro
By organisation
Embedded SystemsSchool of Innovation, Design and Engineering
Engineering and TechnologyComputer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf