The DOI matches its Crossref record; 62 of the 62 references it cites were found in a registry or an index.
N$^{2}$M$^{2}$: Learning Navigation for Arbitrary Mobile Manipulation Motions in Unseen and Dynamic Environments
Open accessAbstract
Despite its importance in both industrial and service robotics, mobile manipulation remains a significant challenge as it requires seamless integration of end-effector trajectory generation with navigation skills as well as reasoning over long-horizons. Existing methods struggle to control the large configuration space and to navigate dynamic and unknown environments. In the previous work, we proposed to decompose mobile manipulation tasks into a simplified motion generator for the end-effector in task space and a trained reinforcement learning agent for the mobile base to account for the kinematic feasibility of the motion. In this work, we introduce Neural Navigation for Mobile Manipulation (N$^{2}$M$^{2}$), which extends this decomposition to complex obstacle environments, extends the agent's control to the torso joint and the norm of the end-effector motion velocities, uses a more general reward function and, thereby, enables robots to tackle a much broader range of tasks in real-world settings. The resulting approach can perform unseen, long-horizon tasks in unexplored environments while instantly reacting to dynamic obstacles and environmental changes. At the same time, it provides a simple way to define new mobile manipulation tasks. We demonstrate the capabilities of our proposed approach in extensive simulation and real-world experiments on multiple kinematically diverse mobile manipulators.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“We use this method in our real world evaluation as it generalizes across different robots, tasks, and environments.”
From Learning Hierarchical Interactive Multi-Object Search for Mobile Manipulation (2023) · cites this paper as [7]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“For semantic segmentation, a wide range of models exists, including older methods such as Mask R-CNN [5] as well as newer, transfomer-based methods [6], [7].”
From Learning Hierarchical Interactive Multi-Object Search for Mobile Manipulation (2023) · cites this paper as [7]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Soft actor-critic Off-policy maximum entropy deep reinforcement learning with a stochastic actor
Haarnoja, T., Zhou, A., Abbeel, P., & Levine, S. (2018) · arXiv · doi:10.48550/arxiv.1801.01290 · Cited by 5,594
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
Sutton, R. S., Precup, D., & Singh, S. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00052-1 · Cited by 3,119
Universal Value Function Approximators
Schaul, T., Horgan, D., Gregor, K., & Silver, D. (2015) · Cited by 701
The Option-Critic Architecture
Bacon, P.-L., Harb, J., & Precup, D. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10916 · Cited by 687
Voxblox: Incremental 3D Euclidean Signed Distance Fields for on-board MAV planning
Oleynikova, H., Taylor, Z., Fehr, M., Siegwart, R., & Nieto, J. (2017) · 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8202315 · Cited by 658
Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning
Everett, M., Chen, Y. F., & How, J. P. (2018) · 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8593871 · Cited by 614
A Survey of Embodied AI: From Simulators to Research Tasks
Duan, J., Yu, S., Tan, H. L., Zhu, H., & Tan, C. (2022) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2022.3141105 · Cited by 420
Integrated Task and Motion Planning
Garrett, C. R., Chitnis, R., Holladay, R., Kim, B., Silver, T., Kaelbling, L. P., & Lozano-Pérez, T. (2021) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-091420-084139 · Cited by 409
Research works printed but not linked: 6
- li, 0, HRL4IN: Hierarchical reinforcement learning for interactive navigation with mobile manipulators, Proc Conf Robot Learn, 603
- patel, 0, DWA-RL: Dynamically feasible deep reinforcement learning policy for robot navigation in dense mobile crowds, Proc IEEE Int Conf Robot Automat, 6057
- chen, 0, Learning exploration policies for navigation, Proc Int Conf Learn Representations
- bansal, 0, Combining optimal control and learning for visual navigation in novel environments, Proc Conf Robot Learn, 100, 420
- klink, 2020, Self-paced deep reinforcement learning, Adv Neural Inf Process Syst, 33, 9216
- pardo, 0, Time limits in reinforcement learning, Proc Int Conf Mach Learn, 80, 4045
Cited by
Learning Hierarchical Interactive Multi-Object Search for Mobile Manipulation
Schmalstieg, F., Honerkamp, D., Welschehold, T., & Valada, A. (2023) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2023.3329619 · Cited by 21
Self-citation
Metadata
- Authors
- Honerkamp, D., Welschehold, T., & Valada, A.
- Affiliations
- University of Freiburg (DE)
- Venue
- IEEE Transactions on Robotics
- Published
- 2023-10
- Volume
- 39
- Issue
- 5
- Pages
- 3601-3619
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W4382365724
- Cited by
- 30
- References
- 62
- Citations by year
- 2026: 4 · 2025: 10 · 2024: 13 · 2023: 3
- FWCI
- 2.66
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Robotics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Engineering › Control and Systems Engineering › Robot Manipulation and Learning
- Physical Sciences › Engineering › Control and Systems Engineering › Control and Dynamics of Mobile Robots
- Keywords
- mobile manipulation, reinforcement learning, dynamic environments, unknown environments, dynamic obstacles, long-horizon navigation, kinematic feasibility, task decomposition, mobile manipulators
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: N$^{2}$M$^{2}$: Learning Navigation for Arbitrary Mobile Manipulation Motions in Unseen and Dynamic Environments. https://app.cochat.ai/papers/10.1109/tro.2023.3284346
- The paper
- Honerkamp, D., Welschehold, T., & Valada, A. (2023). N$^{2}$M$^{2}$: Learning Navigation for Arbitrary Mobile Manipulation Motions in Unseen and Dynamic Environments. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2023.3284346
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.