Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination

Marika Ivanová, Pavel Surynek, Katsutoshi Hirayama

2018

Abstract

We address a problem of area protection in graph-based scenarios with multiple agents. The problem consists of two adversarial teams of agents that move in an undirected graph. Agents are placed in vertices of the graph and they can move into adjacent vertices in a conflict-free way in an indented environment. The aim of one team - attackers - is to invade into a given area while the aim of the opponent team - defenders - is to protect the area from being entered by attackers. We study strategies for assigning vertices to be occupied by the team of defenders in order to block attacking agents. We show that the decision version of the problem of area protection is PSPACE-hard. Further, we develop various on-line vertex-allocation strategies for the defender team and evaluate their performance in multiple benchmarks. Our most advanced method tries to capture bottlenecks in the graph that are frequently used by the attackers during their movement. The performed experimental evaluation suggests that this method often defends the area successfully even in instances where the attackers significantly outnumber the defenders.

Paper Citation

in Harvard Style

Ivanová M., Surynek P. and Hirayama K. (2018). Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination.In Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-275-2, pages 184-191. DOI: 10.5220/0006583601840191

in Bibtex Style

@conference{icaart18,
author={Marika Ivanová and Pavel Surynek and Katsutoshi Hirayama},
title={Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination},
booktitle={Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2018},
pages={184-191},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006583601840191},
isbn={978-989-758-275-2},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination
SN - 978-989-758-275-2
AU - Ivanová M.
AU - Surynek P.
AU - Hirayama K.
PY - 2018
SP - 184
EP - 191
DO - 10.5220/0006583601840191