Multi-robot target detection and tracking: taxonomy and survey
Target detection and tracking encompasses a variety of decisional problems such as
coverage, surveillance, search, patrolling, observing and pursuit-evasion along with others …
coverage, surveillance, search, patrolling, observing and pursuit-evasion along with others …
Search and pursuit-evasion in mobile robotics: A survey
This paper surveys recent results in pursuit-evasion and autonomous search relevant to
applications in mobile robotics. We provide a taxonomy of search problems that highlights …
applications in mobile robotics. We provide a taxonomy of search problems that highlights …
[图书][B] Parameterized algorithms
The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …
parameterized algorithms and complexity accessible to graduate students and advanced …
[图书][B] Planning algorithms
SM LaValle - 2006 - books.google.com
Planning algorithms are impacting technical disciplines and industries around the world,
including robotics, computer-aided design, manufacturing, computer graphics, aerospace …
including robotics, computer-aided design, manufacturing, computer graphics, aerospace …
[图书][B] The game of cops and robbers on graphs
A Bonato - 2011 - books.google.com
This book is the first and only one of its kind on the topic of Cops and Robbers games, and
more generally, on the field of vertex pursuit games on graphs. The book is written in a lively …
more generally, on the field of vertex pursuit games on graphs. The book is written in a lively …
Graph searching and a min-max theorem for tree-width
PD Seymour, R Thomas - Journal of Combinatorial Theory, Series B, 1993 - Elsevier
The tree-width of a graph G is the minimum k such that G may be decomposed into a" tree-
structure" of pieces each with at most k+ l vertices. We prove that this equals the maximum k …
structure" of pieces each with at most k+ l vertices. We prove that this equals the maximum k …
An annotated bibliography on guaranteed graph searching
FV Fomin, DM Thilikos - Theoretical computer science, 2008 - Elsevier
Graph searching encompasses a wide variety of combinatorial problems related to the
problem of capturing a fugitive residing in a graph using the minimum number of searchers …
problem of capturing a fugitive residing in a graph using the minimum number of searchers …
Directed tree-width
T Johnson, N Robertson, PD Seymour… - Journal of Combinatorial …, 2001 - Elsevier
We generalize the concept of tree-width to directed graphs and prove that every directed
graph with no “haven” of large order has small tree-width. Conversely, a digraph with a large …
graph with no “haven” of large order has small tree-width. Conversely, a digraph with a large …
Distributed control applications within sensor networks
B Sinopoli, C Sharp, L Schenato… - Proceedings of the …, 2003 - ieeexplore.ieee.org
Sensor networks are gaining a central role in the research community. This paper addresses
some of the issues arising from the use of sensor networks in control applications. Classical …
some of the issues arising from the use of sensor networks in control applications. Classical …
A visibility-based pursuit-evasion problem
LJ Guibas, JC Latombe, SM LaValle, D Lin… - International Journal of …, 1999 - World Scientific
This paper addresses the problem of planning the motion of one or more pursuers in a
polygonal environment to eventually" see" an evader that is unpredictable, has unknown …
polygonal environment to eventually" see" an evader that is unpredictable, has unknown …