Mathematical Approach of Cost Function Constructed by Hermite Interpolation to Obtain Optimal Signal by Using DP Algorithm

ABSTRACT In this article, we investigate an optimal control problem characterized by fixed terminal time and a partially constrained terminal state, for which we construct the cost function by using Hermite interpolation. The formulation of this cost function constitutes the principal methodological contribution of the work which is a novel technique in our article. To demonstrate its effectiveness, we present an illustrative dynamic model in which the proposed cost function is employed to determine admissible ranges of control inputs between prescribed fixed points. Leveraging the proposed framework, we obtain the optimal control signal using the Dynamic Programming (DP) algorithm and satisfying the reachable set between the range of admissible controls corresponding to the original range of state variables with respect to time step for the defined discrete‐time model. Then we formulate a discrete‐time optimal control problem to minimize the cost‐to‐go function with respect to control inputs across time intervals related to each time step between the final time range , while the system evolves between specified minimum initial and terminal sizes within the original state range . Finally, that example on the dynamic time model demonstrates the validity and applicability of our proposed technique.

Authors

Institutions

Publication Details

Journal
Optimal Control Applications and Methods
Published
2026-07-28
DOI
https://doi.org/10.1002/oca.70125
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mathematical Approach of Cost Function Constructed by Hermite Interpolation to Obtain Optimal Signal by Using DP Algorithm

Gargi Chakraborty, Ishrat Amin
Optimal Control Applications and Methods
Adaptive Dynamic Programming Control
article

Mathematical Approach of Cost Function Constructed by Hermite Interpolation to Obtain Optimal Signal by Using DP Algorithm

Gargi Chakraborty, Ishrat Amin
article en

Abstract

ABSTRACT In this article, we investigate an optimal control problem characterized by fixed terminal time and a partially constrained terminal state, for which we construct the cost function by using Hermite interpolation. The formulation of this cost function constitutes the principal methodological contribution of the work which is a novel technique in our article. To demonstrate its effectiveness, we present an illustrative dynamic model in which the proposed cost function is employed to determine admissible ranges of control inputs between prescribed fixed points. Leveraging the proposed framework, we obtain the optimal control signal using the Dynamic Programming (DP) algorithm and satisfying the reachable set between the range of admissible controls corresponding to the original range of state variables with respect to time step for the defined discrete‐time model. Then we formulate a discrete‐time optimal control problem to minimize the cost‐to‐go function with respect to control inputs across time intervals related to each time step between the final time range , while the system evolves between specified minimum initial and terminal sizes within the original state range . Finally, that example on the dynamic time model demonstrates the validity and applicability of our proposed technique.

Optimal Control Applications and Methods
Vellore Institute of Technology University (IN)
Openalex Percentile: Top 6%
Adaptive Dynamic Programming Control
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.