Zero-Shot Transferable Solution Method for Parametric Optimal Control Problems

📅 2025-09-22
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
To address the high computational overhead of conventional optimal control methods under frequently varying objective functions, this paper proposes a transferable control framework based on a Function Encoder (FE). The method adopts an offline–online decomposition paradigm: during offline training, a set of reusable neural basis functions is learned to construct a universal function space; during online deployment, only lightweight coefficient estimation is required for zero-shot adaptation to novel objective functions. By integrating imitation learning with data- and problem-description-driven projection mappings, the framework generalizes across diverse dynamical systems, state/action dimensions, and cost structures. Experiments demonstrate near-optimal performance on multiple nonlinear systems with minimal online computation, enabling deployment as a semi-global real-time feedback controller. The core contributions are the first introduction of a transferable function-space mechanism and an efficient offline–online decoupled architecture.

Technology Category

Application Category

📝 Abstract
This paper presents a transferable solution method for optimal control problems with varying objectives using function encoder (FE) policies. Traditional optimization-based approaches must be re-solved whenever objectives change, resulting in prohibitive computational costs for applications requiring frequent evaluation and adaptation. The proposed method learns a reusable set of neural basis functions that spans the control policy space, enabling efficient zero-shot adaptation to new tasks through either projection from data or direct mapping from problem specifications. The key idea is an offline-online decomposition: basis functions are learned once during offline imitation learning, while online adaptation requires only lightweight coefficient estimation. Numerical experiments across diverse dynamics, dimensions, and cost structures show our method delivers near-optimal performance with minimal overhead when generalizing across tasks, enabling semi-global feedback policies suitable for real-time deployment.
Problem

Research questions and friction points this paper is trying to address.

Solves parametric optimal control problems with varying objectives
Eliminates need for re-solving when objectives change
Enables zero-shot adaptation to new tasks efficiently
Innovation

Methods, ideas, or system contributions that make the work stand out.

Function encoder policies learn reusable neural basis functions
Offline-online decomposition enables lightweight online coefficient estimation
Zero-shot adaptation via projection or direct mapping from specifications
🔎 Similar Papers
No similar papers found.
X
Xingjian Li
Oden Institute, UT Austin
K
Kelvin Kan
Department of Mathematics, UCLA
Deepanshu Verma
Deepanshu Verma
Clemson University
Scientific ComputingInverse ProblemsPDE constrained optimizationMachine Learning
Krishna Kumar
Krishna Kumar
Indian Institute of Technology Kharagpur
Pattern-forming InstabilitiesNonlinear Dynamics
S
Stanley Osher
Department of Mathematics, UCLA
J
Ján Drgoňa
Department of Civil and Systems Engineering, Johns Hopkins University