Book ChapterDOI
Pursuit-evasion in a graph
T. D. Parsons
- pp 426-441
Reads0
Chats0
About:
The article was published on 1978-01-01. It has received 522 citations till now. The article focuses on the topics: Null graph & Line graph.read more
Citations
More filters
MonographDOI
Planning Algorithms: Introductory Material
TL;DR: This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms, into planning under differential constraints that arise when automating the motions of virtually any mechanical system.
Journal ArticleDOI
The NP-completeness column: An ongoing guide
TL;DR: This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness, and readers who have results they would like mentioned (NP-hardness, PSPACE- hardness, polynomialtime-solvability, etc.), or open problems they wouldlike publicized, should send them to David S. Johnson.
Journal ArticleDOI
Vertex-to-vertex pursuit in a graph
TL;DR: This work characterize the graphs on which the cop has a winning strategy, and connects the problem with the structure theory of graphs based on products and retracts.
Journal ArticleDOI
Search and pursuit-evasion in mobile robotics
TL;DR: A taxonomy of search problems is provided that highlights the differences resulting from varying assumptions on the searchers, targets, and the environment and highlights current open problems in the area and explores avenues for future work.
Journal ArticleDOI
A game of cops and robbers
Martin Aigner,M. Fromme +1 more
TL;DR: It is shown that there are graphs on which arbitrarily many cops are needed to catch the robber and it is proved that for planar graphs 3 cops always suffice to win.