49,470 research outputs found
DGMem: Learning Visual Navigation Policy without Any Labels by Dynamic Graph Memory
In recent years, learning-based approaches have demonstrated significant
promise in addressing intricate navigation tasks. Traditional methods for
training deep neural network navigation policies rely on meticulously designed
reward functions or extensive teleoperation datasets as navigation
demonstrations. However, the former is often confined to simulated
environments, and the latter demands substantial human labor, making it a
time-consuming process. Our vision is for robots to autonomously learn
navigation skills and adapt their behaviors to environmental changes without
any human intervention. In this work, we discuss the self-supervised navigation
problem and present Dynamic Graph Memory (DGMem), which facilitates training
only with on-board observations. With the help of DGMem, agents can actively
explore their surroundings, autonomously acquiring a comprehensive navigation
policy in a data-efficient manner without external feedback. Our method is
evaluated in photorealistic 3D indoor scenes, and empirical studies demonstrate
the effectiveness of DGMem.Comment: 8 pages, 6 figure
Learning Deployable Navigation Policies at Kilometer Scale from a Single Traversal
Model-free reinforcement learning has recently been shown to be effective at
learning navigation policies from complex image input. However, these
algorithms tend to require large amounts of interaction with the environment,
which can be prohibitively costly to obtain on robots in the real world. We
present an approach for efficiently learning goal-directed navigation policies
on a mobile robot, from only a single coverage traversal of recorded data. The
navigation agent learns an effective policy over a diverse action space in a
large heterogeneous environment consisting of more than 2km of travel, through
buildings and outdoor regions that collectively exhibit large variations in
visual appearance, self-similarity, and connectivity. We compare pretrained
visual encoders that enable precomputation of visual embeddings to achieve a
throughput of tens of thousands of transitions per second at training time on a
commodity desktop computer, allowing agents to learn from millions of
trajectories of experience in a matter of hours. We propose multiple forms of
computationally efficient stochastic augmentation to enable the learned policy
to generalise beyond these precomputed embeddings, and demonstrate successful
deployment of the learned policy on the real robot without fine tuning, despite
environmental appearance differences at test time. The dataset and code
required to reproduce these results and apply the technique to other datasets
and robots is made publicly available at rl-navigation.github.io/deployable
Role Playing Learning for Socially Concomitant Mobile Robot Navigation
In this paper, we present the Role Playing Learning (RPL) scheme for a mobile
robot to navigate socially with its human companion in populated environments.
Neural networks (NN) are constructed to parameterize a stochastic policy that
directly maps sensory data collected by the robot to its velocity outputs,
while respecting a set of social norms. An efficient simulative learning
environment is built with maps and pedestrians trajectories collected from a
number of real-world crowd data sets. In each learning iteration, a robot
equipped with the NN policy is created virtually in the learning environment to
play itself as a companied pedestrian and navigate towards a goal in a socially
concomitant manner. Thus, we call this process Role Playing Learning, which is
formulated under a reinforcement learning (RL) framework. The NN policy is
optimized end-to-end using Trust Region Policy Optimization (TRPO), with
consideration of the imperfectness of robot's sensor measurements. Simulative
and experimental results are provided to demonstrate the efficacy and
superiority of our method
- …