loading
Papers

Research.Publish.Connect.

Paper

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

ISBN: 978-989-758-275-2

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 eval uation suggests that this method often defends the area successfully even in instances where the attackers significantly outnumber the defenders. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.231.226.211

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 2: ICAART, ISBN 978-989-758-275-2, pages 184-191. DOI: 10.5220/0006583601840191

@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 2: ICAART,},
year={2018},
pages={184-191},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006583601840191},
isbn={978-989-758-275-2},
}

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: 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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.