A hamilton-jacobi optimal control framework for dynamic transportation network management

Authors

  • R. Arivukkodi Author
  • Shivam P. Chaudhary Author
  • Lingam Sunitha Author
  • Madhur Taneja Author
  • Rahul Kumar Singh Author
  • Amruta Prasad Kharade Author
  • Mohit Aggarwal Author

Keywords:

Hamilton–jacobi optimal control, hamilton–jacobi–bellman equation, dynamic transportation networks, optimal feedback control, traffic flow optimization, nonlinear dynamical systems, intelligent transportation management.

Abstract

Advanced mathematical optimization modeling techniques are needed in dynamic transportation networks for the purpose of handling traffic dynamics and varying requirements of adaptive decision-making. In this study, a mathematical optimal control model based on Hamilton–Jacobi equations is designed to formulate the problem of managing dynamic transportation networks that are characterized by traffic dynamics modelled by nonlinear controlled dynamical systems. An optimal feedback control strategy has been developed using this model to solve the problem of minimizing congestion, travel delays, and costs associated with transportation operation while ensuring theoretical properties of existence, uniqueness, and stability. In formulating the problem, state dynamics, control variables, and cost functional are used, and the connection between system dynamics and the optimization objective is established via the Hamiltonian formulation. The Hamilton-Jacobi-Bellman (HJB) equation is obtained from the dynamic programming principle. The proposed method is investigated through a simulation of a transportation network with 20 nodes, 45 edges, and a 60-minute operational duration. A comparison with the STA, MPC, and RL-based techniques reveals that the proposed HJB algorithm gives the lowest delay value of 10.7 minutes, congestion value of 0.46, and cost value of 890. This algorithm yields a 42.5% reduction in delay, a 43.9% reduction in congestion, and a 41.4% reduction in cost compared to existing algorithms. Moreover, a stability analysis shows that the optimization is stable through the reduction of the objective cost from 1520 to 890 over 50 iterations.

Downloads

Download data is not yet available.

Downloads

Published

2026-09-22

How to Cite

A hamilton-jacobi optimal control framework for dynamic transportation network management . (2026). Minimax Theory and Its Applications, 11(2s), 70-79. https://journalmta.com/index.php/jmta/article/view/399