Zero-Shot Transferable Solution Method for Parametric Optimal Control Problems

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.

Institutions

Publication Details

Journal
arXiv (Cornell University)
Published
2025-09-22
Primary Topic
CO2 Reduction Techniques and Catalysts
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Zero-Shot Transferable Solution Method for Parametric Optimal Control Problems

arXiv (Cornell University)
CO2 Reduction Techniques and Catalysts
article

Zero-Shot Transferable Solution Method for Parametric Optimal Control Problems

article en

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.

arXiv (Cornell University)
Johns Hopkins University (US), Johns Hopkins Medicine (US), Johns Hopkins University Applied Physics Laboratory (US), The University of Texas at Austin (US)
National Science Foundation, U.S. Department of Energy, Defense Advanced Research Projects Agency, Advanced Scientific Computing Research
Openalex Percentile: Top 64%
CO2 Reduction Techniques and Catalysts
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Zero-Shot Transferable Solution Method for Parametric Optimal Control Problems · arXiv (Cornell University) (2025) | TGRS Research Map | TGRS