Authors:
Marika Ivanová
1
;
Pavel Surynek
2
and
Katsutoshi Hirayama
3
Affiliations:
1
University of Bergen, Norway
;
2
National Institute of Advanced Industrial Science and Technology (AIST), Japan
;
3
Kobe University, Japan
Keyword(s):
Graph-based Path-finding, Area Protection, Area Invasion, Asymmetric Goals, Mobile Agents, Agent Navigation, Defensive Strategies, Adversarial Planning.
Related
Ontology
Subjects/Areas/Topics:
Agents
;
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Bioinformatics
;
Biomedical Engineering
;
Cooperation and Coordination
;
Distributed and Mobile Software Systems
;
Enterprise Information Systems
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Information Systems Analysis and Specification
;
Intelligent Control Systems and Optimization
;
Knowledge Engineering and Ontology Development
;
Knowledge-Based Systems
;
Methodologies and Technologies
;
Mobile Agents
;
Multi-Agent Systems
;
Operational Research
;
Planning and Scheduling
;
Robot and Multi-Robot Systems
;
Simulation
;
Simulation and Modeling
;
Software Engineering
;
State Space Search
;
Symbolic Systems
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 eva
luation suggests that this method often defends the area successfully even in instances where
the attackers significantly outnumber the defenders.
(More)