ESP: pursuit evasion on series-parallel graphs

Authors:
K. Daniel;R. Borie;S. Koenig;C. Tovey
Affiliations:
Univeristy of Southern California;University of Alabama;Univeristy of Southern California;Georgia Tech, ISYE
Venue:
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Year:
2010

Citing 3
Cited 1

Recontamination does not help to search a graph

Journal of the ACM (JACM)
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Algorithms and complexity results for pursuit-evasion problems

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Multi-UAV motion planning for guaranteed search

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a heuristic approach, called ESP, that solves large pursuit-evasion problems on series-parallel (that is, treewidth-2) graphs quickly and with small costs. It exploits their topology by performing dynamic programming on their decomposition graphs. We show that ESP scales up to much larger graphs than a strawman approach based on previous results from the literature.