Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Monotonicity in graph searching
Journal of Algorithms
Easy problems for tree-decomposable graphs
Journal of Algorithms
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Lower bounds on the pathwidth of some grid-like graphs
Discrete Applied Mathematics
The impact of adversarial knowledge on adversarial planning in perimeter patrol
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track
Improving the Efficiency of Clearing with Multi-agent Teams
International Journal of Robotics Research
Agent-based coordination of human-multirobot teams in complex environments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Industry track
ESP: pursuit evasion on series-parallel graphs
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
The complexity of grid coverage by swarm robotics
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
A distributed dynamics for webgraph decontamination
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Static and expanding grid coverage with ant robots: Complexity results
Theoretical Computer Science
Multi-agent Cooperative Cleaning of Expanding Domains
International Journal of Robotics Research
Connected searching of weighted trees
Theoretical Computer Science
Search and pursuit-evasion in mobile robotics
Autonomous Robots
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Efficient algorithms for pursuing moving evaders in terrains
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Hierarchical visibility for guaranteed search in large-scale outdoor terrain
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
We study pursuit-evasion problems where a number of pursuers have to clear a given graph. We study when polynomial-time algorithms exist to determine how many pursuers are needed to clear a given graph and how a given number of pursuers should move on the graph to clear it with either a minimum sum of their travel distances or minimum task-completion time. We generalize prior work to both unit-width arbitrary-length and unit-length arbitrary-width graphs and derive both algorithms and complexity results for a variety of graph topologies. In this context, we describe a polynomial-time algorithm, called CLEARTHETREE, that is much shorter and algorithmically simpler than the state-of-the-art algorithm for the minimum pursuer problem on trees. Our theoretical research lays a firm theoretical foundation for pursuit evasion on graphs and informs practitioners about which problems are easy and which ones are hard.