A visibility-based pursuit-evasion game between two nonholonomic robots in environments with obstacles

In this paper, a visibility-based pursuit-evasion game in an environment with obstacles is addressed. A pursuer wants to maintain the visibility of an evader at all times. Both players are nonholonomic robots shaped like discs. To determine the players’ motion policies and their trajectories–subject...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Autonomous robots Ročník 46; číslo 2; s. 349 - 371
Hlavní autoři: Lozano, Eliezer, Becerra, Israel, Ruiz, Ubaldo, Bravo, Luis, Murrieta-Cid, Rafael
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.02.2022
Springer Nature B.V
Témata:
Artificial Intelligence
Barriers
Computer Imaging
Control
Differential games
Engineering
Game theory
Mechatronics
Pattern Recognition and Graphics
Players
Pursuit-evasion games
Robotics
Robotics and Automation
Robots
Surveillance
Visibility
Vision
Motion planning
Nonholonomic constraints
Algorithms
Pursuit-evasion
Incomplete information
ISSN:0929-5593, 1573-7527
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, a visibility-based pursuit-evasion game in an environment with obstacles is addressed. A pursuer wants to maintain the visibility of an evader at all times. Both players are nonholonomic robots shaped like discs. To determine the players’ motion policies and their trajectories–subject to differential constraints–, an RRT* approach that minimizes the time traveled is utilized. The proposed formulation presents an alternative for computing a strategy of persistent surveillance of the evader, difficult to model from a classical differential games perspective given that there is no clear termination condition when the pursuer can maintain the evader’s visibility forever. A sufficient condition to keep evader surveillance is also provided. Additionally, the proposed approach is general because it can be adapted to address a variety of scenarios. To illustrate such flexibility, we address different aspects of the problem: (1) Knowledge of the environment (availability of a global map vs. a local representation). (2) Strategies of the players (execution of optimal strategies vs. deviations from the optimal ones to deceive the opponent). (3) Sensor capabilities (limited vs. unlimited sensor range).
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0929-5593
1573-7527
DOI:10.1007/s10514-021-10026-5