Hierarchical strategy synthesis for pursuit-evasion problems

Rattanachai Ramaithitima, Siddharth Srivastava, Subhrajit Bhattacharya, Alberto Speranzon, Vijay Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a novel approach for solving pursuit-evasion problems where multiple pursuers with limited sensing capabilities are used to detect all possible mobile evaders in a given environment. We make no assumptions about the number, the speed, or the maneuverability of evaders. Our algorithm takes as input a map of the environment and sensor models for the pursuers. We then obtain a ? graph representation of an environment using a Cech Complex. Even with such a representation, the configuration space grows exponentially with the number of pursuers. In order to address this challenge, we propose an abstraction framework to partition the configuration space into sets of topologically similar configurations that preserve the space of possible evader locations. We validate our approach on several simulated environments with varying topologies and numbers of pursuers.

Original languageEnglish (US)
Title of host publicationFrontiers in Artificial Intelligence and Applications
EditorsGal A. Kaminka, Frank Dignum, Eyke Hullermeier, Paolo Bouquet, Virginia Dignum, Maria Fox, Frank van Harmelen
PublisherIOS Press
Pages1370-1378
Number of pages9
ISBN (Electronic)9781614996712
DOIs
StatePublished - Jan 1 2016
Externally publishedYes
Event22nd European Conference on Artificial Intelligence, ECAI 2016 - The Hague, Netherlands
Duration: Aug 29 2016Sep 2 2016

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume285
ISSN (Print)0922-6389

Other

Other22nd European Conference on Artificial Intelligence, ECAI 2016
CountryNetherlands
CityThe Hague
Period8/29/169/2/16

Fingerprint

Maneuverability
Topology
Sensors

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Ramaithitima, R., Srivastava, S., Bhattacharya, S., Speranzon, A., & Kumar, V. (2016). Hierarchical strategy synthesis for pursuit-evasion problems. In G. A. Kaminka, F. Dignum, E. Hullermeier, P. Bouquet, V. Dignum, M. Fox, & F. van Harmelen (Eds.), Frontiers in Artificial Intelligence and Applications (pp. 1370-1378). (Frontiers in Artificial Intelligence and Applications; Vol. 285). IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1370

Hierarchical strategy synthesis for pursuit-evasion problems. / Ramaithitima, Rattanachai; Srivastava, Siddharth; Bhattacharya, Subhrajit; Speranzon, Alberto; Kumar, Vijay.

Frontiers in Artificial Intelligence and Applications. ed. / Gal A. Kaminka; Frank Dignum; Eyke Hullermeier; Paolo Bouquet; Virginia Dignum; Maria Fox; Frank van Harmelen. IOS Press, 2016. p. 1370-1378 (Frontiers in Artificial Intelligence and Applications; Vol. 285).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ramaithitima, R, Srivastava, S, Bhattacharya, S, Speranzon, A & Kumar, V 2016, Hierarchical strategy synthesis for pursuit-evasion problems. in GA Kaminka, F Dignum, E Hullermeier, P Bouquet, V Dignum, M Fox & F van Harmelen (eds), Frontiers in Artificial Intelligence and Applications. Frontiers in Artificial Intelligence and Applications, vol. 285, IOS Press, pp. 1370-1378, 22nd European Conference on Artificial Intelligence, ECAI 2016, The Hague, Netherlands, 8/29/16. https://doi.org/10.3233/978-1-61499-672-9-1370
Ramaithitima R, Srivastava S, Bhattacharya S, Speranzon A, Kumar V. Hierarchical strategy synthesis for pursuit-evasion problems. In Kaminka GA, Dignum F, Hullermeier E, Bouquet P, Dignum V, Fox M, van Harmelen F, editors, Frontiers in Artificial Intelligence and Applications. IOS Press. 2016. p. 1370-1378. (Frontiers in Artificial Intelligence and Applications). https://doi.org/10.3233/978-1-61499-672-9-1370
Ramaithitima, Rattanachai ; Srivastava, Siddharth ; Bhattacharya, Subhrajit ; Speranzon, Alberto ; Kumar, Vijay. / Hierarchical strategy synthesis for pursuit-evasion problems. Frontiers in Artificial Intelligence and Applications. editor / Gal A. Kaminka ; Frank Dignum ; Eyke Hullermeier ; Paolo Bouquet ; Virginia Dignum ; Maria Fox ; Frank van Harmelen. IOS Press, 2016. pp. 1370-1378 (Frontiers in Artificial Intelligence and Applications).
@inproceedings{98753cc1497346318a90bfaf48c901ff,
title = "Hierarchical strategy synthesis for pursuit-evasion problems",
abstract = "We present a novel approach for solving pursuit-evasion problems where multiple pursuers with limited sensing capabilities are used to detect all possible mobile evaders in a given environment. We make no assumptions about the number, the speed, or the maneuverability of evaders. Our algorithm takes as input a map of the environment and sensor models for the pursuers. We then obtain a ? graph representation of an environment using a Cech Complex. Even with such a representation, the configuration space grows exponentially with the number of pursuers. In order to address this challenge, we propose an abstraction framework to partition the configuration space into sets of topologically similar configurations that preserve the space of possible evader locations. We validate our approach on several simulated environments with varying topologies and numbers of pursuers.",
author = "Rattanachai Ramaithitima and Siddharth Srivastava and Subhrajit Bhattacharya and Alberto Speranzon and Vijay Kumar",
year = "2016",
month = "1",
day = "1",
doi = "10.3233/978-1-61499-672-9-1370",
language = "English (US)",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
pages = "1370--1378",
editor = "Kaminka, {Gal A.} and Frank Dignum and Eyke Hullermeier and Paolo Bouquet and Virginia Dignum and Maria Fox and {van Harmelen}, Frank",
booktitle = "Frontiers in Artificial Intelligence and Applications",

}

TY - GEN

T1 - Hierarchical strategy synthesis for pursuit-evasion problems

AU - Ramaithitima, Rattanachai

AU - Srivastava, Siddharth

AU - Bhattacharya, Subhrajit

AU - Speranzon, Alberto

AU - Kumar, Vijay

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We present a novel approach for solving pursuit-evasion problems where multiple pursuers with limited sensing capabilities are used to detect all possible mobile evaders in a given environment. We make no assumptions about the number, the speed, or the maneuverability of evaders. Our algorithm takes as input a map of the environment and sensor models for the pursuers. We then obtain a ? graph representation of an environment using a Cech Complex. Even with such a representation, the configuration space grows exponentially with the number of pursuers. In order to address this challenge, we propose an abstraction framework to partition the configuration space into sets of topologically similar configurations that preserve the space of possible evader locations. We validate our approach on several simulated environments with varying topologies and numbers of pursuers.

AB - We present a novel approach for solving pursuit-evasion problems where multiple pursuers with limited sensing capabilities are used to detect all possible mobile evaders in a given environment. We make no assumptions about the number, the speed, or the maneuverability of evaders. Our algorithm takes as input a map of the environment and sensor models for the pursuers. We then obtain a ? graph representation of an environment using a Cech Complex. Even with such a representation, the configuration space grows exponentially with the number of pursuers. In order to address this challenge, we propose an abstraction framework to partition the configuration space into sets of topologically similar configurations that preserve the space of possible evader locations. We validate our approach on several simulated environments with varying topologies and numbers of pursuers.

UR - http://www.scopus.com/inward/record.url?scp=85013113247&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013113247&partnerID=8YFLogxK

U2 - 10.3233/978-1-61499-672-9-1370

DO - 10.3233/978-1-61499-672-9-1370

M3 - Conference contribution

AN - SCOPUS:85013113247

T3 - Frontiers in Artificial Intelligence and Applications

SP - 1370

EP - 1378

BT - Frontiers in Artificial Intelligence and Applications

A2 - Kaminka, Gal A.

A2 - Dignum, Frank

A2 - Hullermeier, Eyke

A2 - Bouquet, Paolo

A2 - Dignum, Virginia

A2 - Fox, Maria

A2 - van Harmelen, Frank

PB - IOS Press

ER -