Extended colored traveling salesperson for modeling multi-agent mission planning problems
2019 (English)In: ICORES 2019 - Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress , 2019, p. 237-244Conference paper, Published paper (Refereed)
Abstract [en]
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 Extensive 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.
Place, publisher, year, edition, pages
SciTePress , 2019. p. 237-244
Keywords [en]
Colored traveling salesperson (CTSP), Genetic algorithms, Multi-agent mission planning, Integer programming, Operations research, Software agents, Human operator, Integer Linear Programming, Mission planning, Mission planning problem, Objective functions, Traveling salesperson problem, Variation operator, Multi agent systems
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:mdh:diva-43305DOI: 10.5220/0007309002370244ISI: 000668111400025Scopus ID: 2-s2.0-85064712559ISBN: 9789897583520 (print)OAI: oai:DiVA.org:mdh-43305DiVA, id: diva2:1314605
Conference
8th International Conference on Operations Research and Enterprise Systems, ICORES 2019, 19 February 2019 through 21 February 2019
2019-05-092019-05-092023-10-26Bibliographically approved