Next Article in Journal
Drive the Drive: From Discrete Motion Plans to Smooth Drivable Trajectories
Next Article in Special Issue
Vision-Based Cooperative Pose Estimation for Localization in Multi-Robot Systems Equipped with RGB-D Cameras
Previous Article in Journal
Adaptive Neuro-Fuzzy Technique for Autonomous Ground Vehicle Navigation
Article Menu

Export Article

Open AccessArticle
Robotics 2014, 3(4), 371-399; doi:10.3390/robotics3040371

The Role of Visibility in Pursuit/Evasion Games

1
Department of Electrical and Computer Engineering, Aristotle University, GR 54248, Thessaloniki, Greece
2
Laboratoire J. A. Dieudonné, UMR CNRS-UNS No 7351, Université de Nice Sophia-Antipolis, Parc Valrose 06108 Nice Cedex 2, France
3
Department of Mathematics, Ryerson University, 350 Victoria St., Toronto, ON, M5B 2K3, Canada
*
Author to whom correspondence should be addressed.
Received: 3 September 2014 / Revised: 6 November 2014 / Accepted: 26 November 2014 / Published: 8 December 2014
(This article belongs to the Special Issue Coordination of Robotic Systems)
View Full-Text   |   Download PDF [563 KB, uploaded 8 December 2014]   |  

Abstract

The cops-and-robber (CR) game has been used in mobile robotics as a discretized model (played on a graph G) of pursuit/evasion problems. The “classic” CR version is a perfect information game: the cops’ (pursuer’s) location is always known to the robber (evader) and vice versa. Many variants of the classic game can be defined: the robber can be invisible and also the robber can be either adversarial (tries to avoid capture) or drunk (performs a random walk). Furthermore, the cops and robber can reside in either nodes or edges of G. Several of these variants are relevant as models or robotic pursuit/evasion. In this paper, we first define carefully several of the variants mentioned above and related quantities such as the cop number and the capture time. Then we introduce and study the cost of visibility (COV), a quantitative measure of the increase in difficulty (from the cops’ point of view) when the robber is invisible. In addition to our theoretical results, we present algorithms which can be used to compute capture times and COV of graphs which are analytically intractable. Finally, we present the results of applying these algorithms to the numerical computation of COV. View Full-Text
Keywords: mobile robotics; robot coordination; pursuit/evasion mobile robotics; robot coordination; pursuit/evasion
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Kehagias, A.; Mitsche, D.; Prałat, P. The Role of Visibility in Pursuit/Evasion Games. Robotics 2014, 3, 371-399.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Robotics EISSN 2218-6581 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top