Addressing Terminal Constraints in Data-Driven Demand Response Scheduling
Not on the map. Why?
Abstract (arXiv)
Electrified chemical processes are incentivized by exposure to time-varying electricity markets to operate flexibly, but participating in demand response schemes can require satisfying terminal constraints over long horizons. Specifically, terminal constraints may be required when computing optimal schedules in order to preserve dynamic stability. Model-based optimization methods are computationally costly, and data-driven scheduling via reinforcement learning (RL) faces severe credit-assignment challenges. We integrate Goal-Space Planning (GSP) with Deep Deterministic Policy Gradient (DDPG), using learned temporally abstract models over discrete subgoals to propagate value across extended horizons. Using a simulated air separation benchmark, we demonstrate the proposed approach improves sample efficiency over standard DDPG while satisfying terminal storage constraints, mitigating myopic control behavior.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 18 references that are in the map. First posted on arXiv 14 May 2026.
Builds on
7 of 18 references.
References · 7
- 2021Deep Reinforcement Learning with Shallow Controllers: An Experimental Application to PID Tuningcited by 18
- 2022Goal-Space Planning with Subgoal Modelscited by 12
- 2020Chance Constrained Policy Optimization for Process Control and Optimizationcited by 10
- 2020Constrained Model-Free Reinforcement Learning for Process Optimizationcited by 8
- 2023Data-Driven Model Reduction and Nonlinear Model Predictive Control of an Air Separation Unit by Applied Koopman Theorycited by 3
- 2025Hierarchical RL-MPC for Demand Response Schedulingcited by 3
- 2025Survey and Tutorial of Reinforcement Learning Methods in Process Systems Engineeringcited by 2
Built on by
Not cited yet.