Optimizing trajectory-trees in belief space improves performance in partially observable robotic planning by capturing observation-dependent contingencies, shown via PO-MPC with D-AuLa optimization and PO-LGP extending LGP.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
The paper proposes Trajectory Regularized Merging (TRM) to enable storage-free model merging in continual learning by optimizing in an augmented trajectory subspace with task alignment, prediction consistency, and gradient responsiveness objectives, claiming SOTA results.
citing papers explorer
-
Optimizing Trajectory-Trees in Belief Space: An Application from Model Predictive Control to Task and Motion Planning
Optimizing trajectory-trees in belief space improves performance in partially observable robotic planning by capturing observation-dependent contingencies, shown via PO-MPC with D-AuLa optimization and PO-LGP extending LGP.
-
Revitalizing the Beginning: Avoiding Storage Dependency for Model Merging in Continual Learning
The paper proposes Trajectory Regularized Merging (TRM) to enable storage-free model merging in continual learning by optimizing in an augmented trajectory subspace with task alignment, prediction consistency, and gradient responsiveness objectives, claiming SOTA results.
- Provably Data-driven Lagrangian Relaxation for Mixed Integer Linear Programming