K. Daniel, R. Borie, S. Koenig and C. Tovey. ESP: Pursuit Evasion on Series-Parallel Graphs [Short Paper]. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2010.

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. Errata: We made an (almost unnoticeable) change to Figure 2 to reflect an update in the program code.

Download the paper in pdf.

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.

This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.