Learning Kinematic Feasibility for Mobile Manipulation Through Deep Reinforcement Learning
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Mobile manipulation tasks remain one of the critical challenges for the widespread adoption of autonomous robots in both service and industrial scenarios. While planning approaches are good at generating feasible whole-body robot trajectories, they struggle with dynamic environments as well as the incorporation of constraints given by the task and the environment. On the other hand, dynamic motion models in the action space struggle with generating kinematically feasible trajectories for mobile manipulation actions. We propose a deep reinforcement learning approach to learn feasible dynamic motions for a mobile base while the end-effector follows a trajectory in task space generated by an arbitrary system to fulfill the task at hand. This modular formulation has several benefits: it enables us to readily transform a broad range of end-effector motions into mobile applications, it allows us to use the kinematic feasibility of the end-effector trajectory as a dense reward signal and its modular formulation allows it to generalise to unseen end-effector motions at test time. We demonstrate the capabilities of our approach on multiple mobile robot platforms with different kinematic abilities and different types of wheeled platforms in extensive simulated as well as real-world experiments.
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.
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 · cited 5×
“We optimise this objective with recent model-free RL algorithms that have shown to be robust to noise and overestimation, namely TD3 [21] and SAC [22].”
MethodInfluentialAddressing Function Approximation Error in Actor-Critic Methods
Fujimoto, S., van Hoof, H., & Meger, D. (2018) · arXiv · doi:10.48550/arxiv.1802.09477 · Cited by 3,650 · cited 4×
“Parameters not mentioned are left at their default values, including the actor and critic networks of two fully-connected layers size (256, 256) for SAC and (400, 300) for TD3.”
MethodInfluentialDesign and use paradigms for gazebo, an open-source multi-robot simulator
Koenig, N., & Howard, A. (2005) · 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566) · doi:10.1109/iros.2004.1389727 · Cited by 3,638
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
Cited by
(2022) · doi:10.15607/rss.2023.xix.025 · Cited by 916
RT-1: Robotics Transformer for Real-World Control at Scale
Brohan, A., Brown, N., Carbajal, J., Chebotar, Y., Dabis, J., Finn, C., Gopalakrishnan, K., Hausman, K., Herzog, A., Hsu, J., et al. (2022) · arXiv · doi:10.48550/arxiv.2212.06817 · Cited by 727
Honerkamp, D., Welschehold, T., & Valada, A. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3284346 · Cited by 30
Self-citationLearning 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-citationSchmalstieg, F., Honerkamp, D., Welschehold, T., & Valada, A. (2023) · Springer Proceedings in Advanced Robotics · doi:10.1007/978-3-031-25555-7_5 · Cited by 16
Self-citation
Metadata
- Authors
- Honerkamp, D., Welschehold, T., & Valada, A.
- Venue
- IEEE Robotics and Automation Letters
- Published
- 2021-10
- Volume
- 6
- Issue
- 4
- Pages
- 6289-6296
- ISSN
- 2377-3766 (ISSN-L)
- 2377-3774
- OpenAlex
- W3120528925
- Cited by
- 57
- References
- 4
- FWCI
- 2.91
- Type
- journal article
- Language
- en
- Open access
- green
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: Learning Kinematic Feasibility for Mobile Manipulation Through Deep Reinforcement Learning. https://app.cochat.ai/papers/10.1109/lra.2021.3092685
- The paper
- Honerkamp, D., Welschehold, T., & Valada, A. (2021). Learning Kinematic Feasibility for Mobile Manipulation Through Deep Reinforcement Learning. IEEE Robotics and Automation Letters. https://doi.org/10.1109/lra.2021.3092685
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.