Hierarchically Integrated Models: Learning to Navigate from Heterogeneous Robots
Not on the map. Why?
Abstract (arXiv)
Deep reinforcement learning algorithms require large and diverse datasets in order to learn successful policies for perception-based mobile navigation. However, gathering such datasets with a single robot can be prohibitively expensive. Collecting data with multiple different robotic platforms with possibly different dynamics is a more scalable approach to large-scale data collection. But how can deep reinforcement learning algorithms leverage such heterogeneous datasets? In this work, we propose a deep reinforcement learning algorithm with hierarchically integrated models (HInt). At training time, HInt learns separate perception and dynamics models, and at test time, HInt integrates the two models in a hierarchical manner and plans actions with the integrated model. This method of planning with hierarchically integrated models allows the algorithm to train on datasets gathered by a variety of different platforms, while respecting the physical capabilities of the deployment robot at test time. Our mobile navigation experiments show that HInt outperforms conventional hierarchical policies and single-source approaches.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 31 of its 36 references that are in the map. First posted on arXiv 24 Jun 2021.
Builds on
31 of 36 references.
References · 31
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,084
- 2015End-to-End Training of Deep Visuomotor Policiescited by 847
- 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
- 2018Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Modelscited by 748
- 2018QT-Opt: Scalable Deep Reinforcement Learning for Vision-Based Robotic Manipulationcited by 730
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 436
- 2016Learning Hand-Eye Coordination for Robotic Grasping with Deep Learning and Large-Scale Data Collectioncited by 312
- 2017Neural Network Dynamics for Model-Based Deep Reinforcement Learning with Model-Free Fine-Tuningcited by 288
- 2019RoboNet: Large-Scale Multi-Robot Learningcited by 268
- 2018Learning to Drive in a Daycited by 266
19 more
- 2016CAD2RL: Real Single-Image Flight without a Single Real Imagecited by 227
- 2018Generative Adversarial Imitation from Observationcited by 183
- 2017Using Simulation and Domain Adaptation to Improve Efficiency of Deep Robotic Graspingcited by 138
- 2016Learning Modular Neural Network Policies for Multi-Task and Multi-Robot Transfercited by 124
- 2015Model Predictive Path Integral Control using Covariance Variable Importance Samplingcited by 122
- 2018Imitating Latent Policies from Observationcited by 101
- 2020BADGR: An Autonomous Self-Supervised Learning-Based Navigation Systemcited by 97
- 2018Driving Policy Transfer via Modularity and Abstractioncited by 91
- 2016Sim-to-Real Robot Learning from Pixels with Progressive Netscited by 89
- 2019Provably Efficient Imitation Learning from Observation Alonecited by 78
- 2018Learning Navigation Behaviors End-to-End with AutoRLcited by 70
- 2019Combining Optimal Control and Learning for Visual Navigation in Novel Environmentscited by 50
- 2019Scaling Local Control to Large-Scale Topological Navigationcited by 37
- 2018VR-Goggles for Robots: Real-to-sim Domain Adaptation for Visual Controlcited by 34
- 2020Hierarchically Decoupled Imitation for Morphological Transfercited by 30
- 2018Beauty and the Beast: Optimal Methods Meet Learning for Drone Racingcited by 20
- 2017Intention-Net: Integrating Planning and Deep Learning for Goal-Directed Autonomous Navigationcited by 19
- 2019Neural Autonomous Navigation with Riemannian Motion Policycited by 6
- 2016Modular Deep Q Networks for Sim-to-real Transfer of Visuo-motor Policiescited by 5
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1.
3 papers.