Fence patrolling by mobile agents with distinct speeds
A Kawamura, Y Kobayashi - Distributed Computing, 2015 - Springer
Suppose we want to patrol a fence (line segment) using kk mobile agents with given speeds
v _1 v 1,..., v _k vk so that every point on the fence is visited by an agent at least once in …
v _1 v 1,..., v _k vk so that every point on the fence is visited by an agent at least once in …
Optimal patrolling of fragmented boundaries
A set of mobile robots is deployed on a simple curve of finite length, composed of a finite set
of vital segments separated by neutral segments. The robots have to patrol the vital …
of vital segments separated by neutral segments. The robots have to patrol the vital …
Approximation algorithms for distance constraint sweep coverage with base stations
J Liang, X Huang, Z Zhang - Journal of Combinatorial Optimization, 2019 - Springer
In this paper, we study the minimum distance constraint sweep coverage problem
(MinSDCSC), the goal of which is to find the minimum number of mobile sensors and their …
(MinSDCSC), the goal of which is to find the minimum number of mobile sensors and their …
When patrolmen become corrupted: Monitoring a graph using faulty mobile robots
A team of k mobile robots is deployed on a weighted graph whose edge weights represent
distances. The robots move perpetually along the domain, represented by all points …
distances. The robots move perpetually along the domain, represented by all points …
Camera network coordination for intruder detection
This paper proposes surveillance trajectories for a network of autonomous cameras to detect
intruders. We consider smart intruders, which appear at arbitrary times and locations, are …
intruders. We consider smart intruders, which appear at arbitrary times and locations, are …
[HTML][HTML] The beachcombers' problem: Walking and searching with mobile robots
J Czyzowicz, L Gąsieniec, K Georgiou… - Theoretical Computer …, 2015 - Elsevier
We introduce and study a new problem concerning the exploration of a geometric domain by
mobile robots. Consider a line segment [0, I] and a set of n mobile robots r 1, r 2,…, rn placed …
mobile robots. Consider a line segment [0, I] and a set of n mobile robots r 1, r 2,…, rn placed …
On fence patrolling by mobile agents
Suppose that a fence needs to be protected (perpetually) by $ k $ mobile agents with
maximum speeds $ v_1,\ldots, v_k $ so that no point on the fence is left unattended for more …
maximum speeds $ v_1,\ldots, v_k $ so that no point on the fence is left unattended for more …
Patrolling by robots equipped with visibility
We study the problem of mobile robots with distinct visibility ranges patrolling a curve.
Assume a set of k mobile robots (patrolmen) a 1, a 2,⋯, ak walking along a unit-length curve …
Assume a set of k mobile robots (patrolmen) a 1, a 2,⋯, ak walking along a unit-length curve …
Patrolling trees with mobile robots
Consider k identical robots traversing the edges of a geometric tree. The robots have to
patrol the tree by perpetually moving along edges, but without exceeding their maximum unit …
patrol the tree by perpetually moving along edges, but without exceeding their maximum unit …
Engineering management models for urban security
M Muaafa, JE Ramirez-Marquez - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
The allocation of limited yet costly police resources is a daily dilemma for police
commanders. More than 50% of police department costs go into patrolling operations, which …
commanders. More than 50% of police department costs go into patrolling operations, which …