TY - GEN
T1 - A Feedback-Driven Learning Framework for Adaptive Neural Motion Planner
AU - Zheng, Huaihang
AU - Liu, Shangfei
AU - Wang, Junzheng
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - This paper presents a feedback-driven learning framework for adaptive neural motion planners to address the challenges of motion planning in high-dimensional and complex environments. Recently, learning-based motion planning frameworks have shown promise for providing efficient solutions; however, these methods face significant generalization challenges when encountering unseen tasks, resulting in a substantial decline in planning success rates. To tackle this, our framework integrates continual learning techniques with feedback loops, enabling the planner to autonomously adapt to new tasks while mitigating catastrophic forgetting. We propose a novel sample selection strategy that combines the GEM gradient projection method with an adaptive greedy algorithm. This algorithm, guided by beta distribution sampling, dynamically adjusts episodic memory updates based on task success rates, ensuring that the samples remain diverse and representative. Extensive experiments in complex environments validate the superior adaptability, robustness, and efficiency of the framework compared to existing methods.
AB - This paper presents a feedback-driven learning framework for adaptive neural motion planners to address the challenges of motion planning in high-dimensional and complex environments. Recently, learning-based motion planning frameworks have shown promise for providing efficient solutions; however, these methods face significant generalization challenges when encountering unseen tasks, resulting in a substantial decline in planning success rates. To tackle this, our framework integrates continual learning techniques with feedback loops, enabling the planner to autonomously adapt to new tasks while mitigating catastrophic forgetting. We propose a novel sample selection strategy that combines the GEM gradient projection method with an adaptive greedy algorithm. This algorithm, guided by beta distribution sampling, dynamically adjusts episodic memory updates based on task success rates, ensuring that the samples remain diverse and representative. Extensive experiments in complex environments validate the superior adaptability, robustness, and efficiency of the framework compared to existing methods.
KW - Beta distribution sampling
KW - Catastrophic forgetting
KW - Continual learning
KW - Neural motion planning
UR - https://www.scopus.com/pages/publications/105013968281
U2 - 10.1109/CCDC65474.2025.11090812
DO - 10.1109/CCDC65474.2025.11090812
M3 - Conference contribution
AN - SCOPUS:105013968281
T3 - Proceedings of the 37th Chinese Control and Decision Conference, CCDC 2025
SP - 4447
EP - 4453
BT - Proceedings of the 37th Chinese Control and Decision Conference, CCDC 2025
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 37th Chinese Control and Decision Conference, CCDC 2025
Y2 - 16 May 2025 through 19 May 2025
ER -