5,991 research outputs found
SA-Net: Deep Neural Network for Robot Trajectory Recognition from RGB-D Streams
Learning from demonstration (LfD) and imitation learning offer new paradigms
for transferring task behavior to robots. A class of methods that enable such
online learning require the robot to observe the task being performed and
decompose the sensed streaming data into sequences of state-action pairs, which
are then input to the methods. Thus, recognizing the state-action pairs
correctly and quickly in sensed data is a crucial prerequisite for these
methods. We present SA-Net a deep neural network architecture that recognizes
state-action pairs from RGB-D data streams. SA-Net performed well in two
diverse robotic applications of LfD -- one involving mobile ground robots and
another involving a robotic manipulator -- which demonstrates that the
architecture generalizes well to differing contexts. Comprehensive evaluations
including deployment on a physical robot show that \sanet{} significantly
improves on the accuracy of the previous method that utilizes traditional image
processing and segmentation.Comment: (in press
Game Theory Models for Multi-Robot Patrolling of Infraestructures
Abstract This work is focused on the problem of performing multi‐robot patrolling for infrastructure security applications in order to protect a known environment at critical facilities. Thus, given a set of robots and a set of points of interest, the patrolling task consists of constantly visiting these points at irregular time intervals for security purposes. Current existing solutions for these types of applications are predictable and inflexible. Moreover, most of the previous centralized and deterministic solutions and only few efforts have been made to integrate dynamic methods. Therefore, the development of new dynamic and decentralized collaborative approaches in order to solve the aforementioned problem by implementing learning models from Game Theory. The model selected in this work that includes belief‐based and reinforcement models as special cases is called Experience‐Weighted Attraction. The problem has been defined using concepts of Graph Theory to represent the environment in order to work with such Game Theory techniques. Finally, the proposed methods have been evaluated experimentally by using a patrolling simulator. The results obtained have been compared with previous availabl
An Energy-aware, Fault-tolerant, and Robust Deep Reinforcement Learning based approach for Multi-agent Patrolling Problems
Autonomous vehicles are suited for continuous area patrolling problems.
However, finding an optimal patrolling strategy can be challenging for many
reasons. Firstly, patrolling environments are often complex and can include
unknown environmental factors. Secondly, autonomous vehicles can have failures
or hardware constraints, such as limited battery life. Importantly, patrolling
large areas often requires multiple agents that need to collectively coordinate
their actions. In this work, we consider these limitations and propose an
approach based on model-free, deep multi-agent reinforcement learning. In this
approach, the agents are trained to automatically recharge themselves when
required, to support continuous collective patrolling. A distributed
homogeneous multi-agent architecture is proposed, where all patrolling agents
execute identical policies locally based on their local observations and shared
information. This architecture provides a fault-tolerant and robust patrolling
system that can tolerate agent failures and allow supplementary agents to be
added to replace failed agents or to increase the overall patrol performance.
The solution is validated through simulation experiments from multiple
perspectives, including the overall patrol performance, the efficiency of
battery recharging strategies, and the overall fault tolerance and robustness
The Fagnano Triangle Patrolling Problem
We investigate a combinatorial optimization problem that involves patrolling
the edges of an acute triangle using a unit-speed agent. The goal is to
minimize the maximum (1-gap) idle time of any edge, which is defined as the
time gap between consecutive visits to that edge. This problem has roots in a
centuries-old optimization problem posed by Fagnano in 1775, who sought to
determine the inscribed triangle of an acute triangle with the minimum
perimeter. It is well-known that the orthic triangle, giving rise to a periodic
and cyclic trajectory obeying the laws of geometric optics, is the optimal
solution to Fagnano's problem. Such trajectories are known as Fagnano orbits,
or more generally as billiard trajectories. We demonstrate that the orthic
triangle is also an optimal solution to the patrolling problem.
Our main contributions pertain to new connections between billiard
trajectories and optimal patrolling schedules in combinatorial optimization. In
particular, as an artifact of our arguments, we introduce a novel 2-gap
patrolling problem that seeks to minimize the visitation time of objects every
three visits. We prove that there exist infinitely many well-structured
billiard-type optimal trajectories for this problem, including the orthic
trajectory, which has the special property of minimizing the visitation time
gap between any two consecutively visited edges. Complementary to that, we also
examine the cost of dynamic, sub-optimal trajectories to the 1-gap patrolling
optimization problem. These trajectories result from a greedy algorithm and can
be implemented by a computationally primitive mobile agent
Developing an online cooperative police patrol routing strategy
A cooperative routing strategy for daily operations is necessary to maintain the effects of hotspot policing and to reduce crime and disorder. Existing robot patrol routing strategies are not suitable, as they omit the peculiarities and challenges of daily police patrol including minimising the average time lag between two consecutive visits to hotspots, as well as coordinating multiple patrollers and imparting unpredictability to patrol routes. In this research, we propose a set of guidelines for patrol routing strategies to meet the challenges of police patrol. Following these guidelines, we develop an innovative heuristic-based and Bayesian-inspired real-time strategy for cooperative routing police patrols. Using two real-world cases and a benchmark patrol strategy, an online agent-based simulation has been implemented to testify the efficiency, flexibility, scalability, unpredictability, and robustness of the proposed strategy and the usability of the proposed guidelines
- …