THE MULTI-AGENT PLANNING PROBLEM

Tamás Kalmár-Nagy, Giovanni Giardini

2011

Abstract

The purpose of this paper is to present a Multi-Agent planner for a team of autonomous agents. The approach is demonstrated by the Multi-Agent Planning Problem, which is a variant of the classical Multiple Traveling Salesmen Problem (MTSP): given a set of n goals/targets and a team of m agents, the optimal team strategy consists of finding m tours such that each target is visited only once and by only one agent, and the total cost of visiting all nodes is minimal. The proposed solution method is a Genetic Algorithm Inspired Steepest Descent (GAISD) method. To validate the approach, the method has been benchmarked against MTSPs and routing problems. Numerical experiments demonstrate the goodness of the approach.

Paper Citation

in Harvard Style

Kalmár-Nagy T. and Giardini G. (2011). THE MULTI-AGENT PLANNING PROBLEM . In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-40-9, pages 296-305. DOI: 10.5220/0003177502960305

in Bibtex Style

@conference{icaart11,
author={Tamás Kalmár-Nagy and Giovanni Giardini},
title={THE MULTI-AGENT PLANNING PROBLEM},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2011},
pages={296-305},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003177502960305},
isbn={978-989-8425-40-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - THE MULTI-AGENT PLANNING PROBLEM
SN - 978-989-8425-40-9
AU - Kalmár-Nagy T.
AU - Giardini G.
PY - 2011
SP - 296
EP - 305
DO - 10.5220/0003177502960305