Name
Title | ||
|---|---|---|
Non-Uniform Policies for Multi-Robot Asymmetric Perimeter Patrol in Adversarial Domains |
Abstract | ||
|---|---|---|
A patrol of robot teams, where the robots are required to repeatedly visit a target area, is a useful tool in detecting an adversary trying to penetrate. In this work we examine the Closed Perimeter Patrol problem, in which the robots travel along a closed perimeter and the adversary is aware of the robots' patrol policy. The goal is to maximize the probability of penetration detection. Previous work dealt with symmetric tracks, in which all parts of the track have similar properties, and suggested non-deterministic patrol schemes, characterized by a uniform policy along the entire area. We consider more realistic scenarios of asymmetric tracks, with various parts of the track having different properties, and suggest a patrol policy with a non-uniform policy along different points of the track. We compare the achievements of both models and show the advantage of the non-uniform model. We further explore methods to efficiently calculate the attributes needed to maximize the probability of penetration detection and compare their implementation in various scenarios.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.5555/3398761.3398876 | AAMAS '19: International Conference on Autonomous Agents and Multiagent Systems
Auckland
New Zealand
May, 2020 |
DocType | ISBN | Citations |
Conference | 978-1-4503-7518-4 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yaniv Oshrat | 1 | 0 | 1.01 |
| Noa Agmon | 2 | 455 | 44.79 |
| Sarit Kraus | 3 | 6810 | 768.04 |