Federated reinforcement learning for robot motion planning with zero-shot generalization
Not on the map. Why?
Abstract (arXiv)
This paper considers the problem of learning a control policy for robot motion planning with zero-shot generalization, i.e., no data collection and policy adaptation is needed when the learned policy is deployed in new environments. We develop a federated reinforcement learning framework that enables collaborative learning of multiple learners and a central server, i.e., the Cloud, without sharing their raw data. In each iteration, each learner uploads its local control policy and the corresponding estimated normalized arrival time to the Cloud, which then computes the global optimum among the learners and broadcasts the optimal policy to the learners. Each learner then selects between its local control policy and that from the Cloud for next iteration. The proposed framework leverages on the derived zero-shot generalization guarantees on arrival time and safety. Theoretical guarantees on almost-sure convergence, almost consensus, Pareto improvement and optimality gap are also provided. Monte Carlo simulation is conducted to evaluate the proposed framework.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 57 references that are in the map. First posted on arXiv 20 Mar 2024.
Builds on
21 of 57 references.
References · 21
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
- 2015End-to-End Training of Deep Visuomotor Policiescited by 847
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
- 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
- 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 372
- 2018Quantifying Generalization in Reinforcement Learningcited by 345
- 2018Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agentscited by 189
- 2021A Survey of Zero-shot Generalisation in Deep Reinforcement Learningcited by 164
- 2013Deep Learning for Detecting Robotic Graspscited by 114
- 2020On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problemscited by 79
- 2019Convergence rates for the stochastic gradient descent method for non-convex objective functionscited by 66
9 more
- 2020Convergence of Meta-Learning with Task-Specific Adaptation over Partial Parameterscited by 65
- 2021Offline Meta-Reinforcement Learning with Online Self-Supervisioncited by 52
- 2021Fault-Tolerant Federated Reinforcement Learning with Theoretical Guaranteecited by 52
- 2016Funnel Libraries for Real-Time Robust Feedback Motion Planningcited by 28
- 2022Federated Stochastic Approximation under Markov Noise and Heterogeneity: Applications in Reinforcement Learningcited by 27
- 2020Perception-Based Temporal Logic Planning in Uncertain Semantic Mapscited by 12
- 2020Safe Feedback Motion Planning: A Contraction Theory and L1-Adaptive Control Based Approachcited by 11
- 2020A Real-Time Approach for Chance-Constrained Motion Planning with Dynamic Obstaclescited by 9
- 2021Provably Safe Model-Based Meta Reinforcement Learning: An Abstraction-Based Approachcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.
- 2026GraphAllocBench: A Flexible Benchmark for Preference-Conditioned Multi-Objective Policy Learningcited by 2
- 2024Federated Cubic Regularized Newton Learning with Sparsification-amplified Differential Privacycited by 1
- 2025Byzantine-resilient federated online learning for Gaussian process regressioncited by 0
- 2026GraphAllocBench: A Flexible Benchmark for Preference-Conditioned Multi-Objective Policy Learning28 Jan 2026
- 2025Byzantine-resilient federated online learning for Gaussian process regression18 Jul 2025
- 2024Federated Cubic Regularized Newton Learning with Sparsification-amplified Differential Privacy8 Aug 2024