Abstract Purpose of Review Robotic patrolling aims at protecting a physical environment by
deploying a team of one or more autonomous mobile robots in it. A key problem in this …

This article surveys recent advancements in strategy designs for persistent robotic
surveillance tasks, with a focus on stochastic approaches. The problem describes how …

This article studies a stochastic robotic surveillance problem where a mobile robot moves
randomly on a graph to capture a potential intruder that strategically attacks a location on the …

We consider the problem of finding patrol schedules for k robots to visit a given set of n sites
in a metric space. Each robot has the same maximum speed and the goal is to minimize the …

We consider the following surveillance problem: Given a set $ P $ of $ n $ sites in a metric
space and a set of $ k $ robots with the same maximum speed, compute a patrol schedule of …

There has been a long-standing interest in computing diverse solutions to optimization
problems. In 1995 J. Krarup posed the problem of finding k-edge disjoint Hamiltonian …

As various smart services are increasingly deployed in modern cities, many unexpected
conflicts arise due to various physical world couplings. Existing solutions for conflict …

The problem of decentralized multi-robot patrol has previously been approached primarily
with hand-designed strategies for minimization of'idlenes' over the vertices of a graph …

As various smart services are increasingly deployed in modern cities, many unexpected
conflicts arise due to various physical world couplings. Existing solutions for conflict …

We study diverse solutions to optimization problems and design fair scheduling of demands
with different priorities on wireless networks The problem of finding several sufficiently …