Closed-Form Characterization of Constrained Double-Integrator Optimal Control
Pith reviewed 2026-05-10 14:27 UTC · model grok-4.3
The pith
Closed-form algebraic equations determine the switching times for every admissible combination of bang, coast, and unconstrained arcs in energy-optimal double-integrator control under state and input constraints.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We derive closed-form expressions for the switching times of all admissible profiles, including both constrained and unconstrained arcs, reducing the computation in each case to explicit algebraic equations. We classify all possible combinations of arcs, including special cases, and provide the specific conditions under which each case arises. We prove that when the initial unconstrained trajectory violates both speed and control constraints, the optimal solution follows a predetermined bang-affine-coast profile, enabling direct identification of the optimal trajectory without intermediate feasibility checks.
What carries the argument
The exhaustive classification of admissible bang-coast-unconstrained arc sequences together with the closed-form algebraic expressions for their switching times, obtained by applying Pontryagin's principle to the fixed-time free-terminal-speed problem.
If this is right
- For each admissible combination the optimal switching times are obtained by solving a small number of explicit algebraic equations instead of numerical optimization.
- When both speed and control constraints are violated by the unconstrained solution, the trajectory is immediately given by the bang-affine-coast profile without any feasibility testing.
- All special cases of arc ordering are covered by the classification, so the method applies uniformly to the entire family of admissible problems.
- The reduction to algebra permits direct evaluation of the optimal cost and control law once the active case is identified.
Where Pith is reading between the lines
- Real-time embedded controllers could pre-compute or tabulate the algebraic cases to achieve deterministic latency.
- The same case-enumeration strategy may extend to minimum-time or minimum-fuel problems on the same dynamics.
- Higher-order integrators or systems with more state constraints might admit analogous but larger finite case lists.
- The closed-form nature opens the possibility of sensitivity analysis with respect to constraint bounds without re-solving the entire problem.
Load-bearing premise
That every possible optimal sequence of constrained and unconstrained arcs can be listed in advance as a finite collection of cases, each with its own explicit algebraic switching-time formulas and triggering conditions.
What would settle it
An instance of the double-integrator energy-optimal problem whose optimal trajectory requires an arc sequence or switching-time solution outside the enumerated cases, or for which the algebraic equations yield a trajectory that violates the necessary conditions of Pontryagin's principle.
Figures
read the original abstract
We consider the energy-optimal control problem for double-integrator systems subject to state and control constraints, with fixed terminal time and free terminal speed. When the constraints become active, the optimal trajectory consists of a combination of bang, unconstrained, and coast arcs, whose switching instants must be computed explicitly. In this paper, we derive closed-form expressions for the switching times of all admissible profiles, including both constrained and unconstrained arcs, reducing the computation in each case to explicit algebraic equations. In contrast to prior work, we classify all possible combinations of arcs, including special cases, and provide the specific conditions under which each case arises. Furthermore, we prove that when the initial unconstrained trajectory violates both speed and control constraints, the optimal solution follows a predetermined bang-affine-coast profile, enabling direct identification of the optimal trajectory without intermediate feasibility checks.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript derives closed-form algebraic expressions for the switching times of all admissible combinations of bang, unconstrained, and coast arcs in the energy-optimal control of a double-integrator system subject to speed and control constraints. The problem has fixed terminal time and free terminal speed. Using Pontryagin's minimum principle, the authors enumerate the possible arc profiles, reduce each to explicit algebraic (at most quadratic) equations for the switching instants, classify the conditions under which each profile arises, and prove that simultaneous violation of both constraints always yields a predetermined bang-affine-coast structure that can be identified directly without intermediate feasibility checks.
Significance. If the derivations hold, the work supplies a valuable analytical tool for a canonical low-dimensional optimal-control problem that appears in vehicle motion planning, robotics, and process control. Replacing numerical root-finding or optimization with explicit algebraic formulas for every admissible case, together with the direct identification of the bang-affine-coast profile, removes a common computational bottleneck and yields structural insight that numerical solvers do not provide. The exhaustive finite-case classification is internally consistent with the low state dimension, whose adjoint equations remain algebraic.
minor comments (4)
- [§3.2] §3.2, after Eq. (12): the definition of the 'affine' arc is introduced only by reference to the unconstrained dynamics; an explicit statement of the control law on that arc would improve readability.
- [Table 1] Table 1: the column headings for the switching-time formulas are not aligned with the row labels for the special cases; a small formatting adjustment would prevent misreading.
- [§4.3] §4.3: the numerical validation examples use only two initial conditions; adding one or two additional boundary cases (e.g., near the boundary of the claimed region) would strengthen the empirical support for the algebraic reductions.
- The manuscript cites the classical double-integrator literature but omits a brief comparison with the recent closed-form results of [specific recent paper on time-optimal double integrator]; a one-sentence contrast would clarify the incremental contribution.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of the manuscript and the recommendation for minor revision. No specific major comments were raised in the report.
Circularity Check
No significant circularity; derivation self-contained from Pontryagin's principle
full rationale
The paper applies Pontryagin's minimum principle directly to the fixed-time, free-terminal-speed double-integrator problem with state and control constraints. Adjoint equations remain linear, and switching conditions for bang/unconstrained/coast arcs reduce to at most quadratic algebraic equations for each enumerated profile. The exhaustive classification and the specific bang-affine-coast structure for simultaneous violations follow from the necessary conditions and boundary matching without fitted parameters, self-referential definitions, or load-bearing self-citations. The low state dimension ensures all steps are explicit and internally consistent with the problem structure.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The system obeys double-integrator dynamics with state and control constraints.
- standard math Pontryagin's minimum principle determines the structure of optimal arcs (bang, coast, unconstrained).
Reference graph
Works this paper leans on
-
[1]
J. A. E. Bryson and Y . C. Ho,Applied Optimal Control: Optimiza- tion, Estimation, and Control. Waltham, MA: Blaisdell Publishing Company, 1969
work page 1969
-
[2]
Optimal time trajectory and coordination for connected and automated vehicles,
A. A. Malikopoulos, L. E. Beaver, and I. V . Chremos, “Optimal time trajectory and coordination for connected and automated vehicles,” Automatica, vol. 125, no. 109469, 2021
work page 2021
-
[3]
A closed-form analytical solution for optimal coordination of connected and automated vehicles,
A. A. Malikopoulos and L. Zhao, “A closed-form analytical solution for optimal coordination of connected and automated vehicles,” in 2019 American Control Conference (ACC), pp. 3599–3604, IEEE, 2019
work page 2019
-
[4]
J. A. E. Bryson, W. F. Denham, and S. E. Dreyfus, “Optimal program- ming problems with inequality constraints I: Necessary conditions for extremal solutions,”AIAA Journal, vol. 1, no. 11, pp. 2544–2550, 1963
work page 1963
-
[5]
D. H. Jacobson, M. M. Lele, and J. L. Speyer, “New necessary con- ditions of optimality for control problems with state-variable inequal- ity constraints,”Journal of Mathematical Analysis and Applications, vol. 35, pp. 255–284, 1971
work page 1971
-
[6]
A survey of the maximum principles for optimal control problems with state constraints,
R. F. Hartl, S. P. Sethi, and R. G. Vickson, “A survey of the maximum principles for optimal control problems with state constraints,”SIAM review, vol. 37, no. 2, pp. 181–218, 1995
work page 1995
-
[7]
J. F. Bonnans and A. Hermant, “Second-order analysis for optimal control problems with pure state constraints and mixed control-state constraints,”Annales de l’Institut Henri Poincar ´e – Analyse Non Lin´eaire, vol. 26, no. 2, pp. 561–598, 2009
work page 2009
-
[8]
An introduction to mathematical optimal control theory spring, 2024 version,
L. C. Evans, “An introduction to mathematical optimal control theory spring, 2024 version,”Accessed on June, vol. 28, p. 2024, 2024
work page 2024
-
[9]
J. L. Speyer, R. K. Mehra, and A. E. Bryson Jr, “The separate computation of arcs for optimal flight paths with state variable inequality constraints,” inAdvanced Problems and Methods for space flight optimization, pp. 53–68, Elsevier, 1969
work page 1969
-
[10]
An indirect method for regular state-constrained optimal control problems in flow fields,
R. Chertovskih, D. Karamzin, N. T. Khalil, and F. L. Pereira, “An indirect method for regular state-constrained optimal control problems in flow fields,”IEEE Transactions on Automatic Control, vol. 66, no. 2, pp. 787–793, 2020
work page 2020
-
[11]
Using optimal control to obtain maximum displacement gait for purcell’s three-link swimmer,
O. Wiezel and Y . Or, “Using optimal control to obtain maximum displacement gait for purcell’s three-link swimmer,” in2016 IEEE 55th Conference on Decision and Control (CDC), pp. 4463–4468, IEEE, 2016
work page 2016
-
[12]
A graph-based approach to generate energy-optimal robot trajectories in polygonal environ- ments,
L. E. Beaver, R. Tron, and C. G. Cassandras, “A graph-based approach to generate energy-optimal robot trajectories in polygonal environ- ments,”IFAC-PapersOnLine, vol. 56, no. 2, pp. 7000–7005, 2023
work page 2023
-
[13]
Eco-driving of autonomous vehicles for nonstop crossing of signalized intersections,
X. Meng and C. G. Cassandras, “Eco-driving of autonomous vehicles for nonstop crossing of signalized intersections,”IEEE transactions on automation science and engineering, vol. 19, no. 1, pp. 320–331, 2020
work page 2020
-
[14]
Trajectory optimization of au- tonomous agents with spatio-temporal constraints,
X. Meng and C. G. Cassandras, “Trajectory optimization of au- tonomous agents with spatio-temporal constraints,”IEEE Transactions on Control of Network Systems, vol. 7, no. 3, pp. 1571–1581, 2020
work page 2020
-
[15]
H. Xu, W. Xiao, C. G. Cassandras, Y . Zhang, and L. Li, “A gen- eral framework for decentralized safe optimal control of connected and automated vehicles in multi-lane signal-free intersections,”IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 10, pp. 17382–17396, 2022
work page 2022
-
[16]
H. Bang and A. A. Malikopoulos, “Optimal trajectory planning meets network-level routing: Integrated control framework for emerging mobility systems,”Automatica, 2023 (in press, arXiv:2311.13193)
-
[17]
Optimal Control of Differ- entially Flat Systems is Surprisingly Easy,
L. E. Beaver and A. A. Malikopoulos, “Optimal Control of Differ- entially Flat Systems is Surprisingly Easy,”Automatica, vol. 159, no. 111404, 2024
work page 2024
-
[18]
F. N. Tzortzoglou and A. A. Malikopoulos, “Teaching cars to drive,” IEEE Potentials, vol. 44, no. 6, pp. 15–24, 2025
work page 2025
-
[19]
B. Chalaki, L. E. Beaver, A. M. I. Mahbub, H. Bang, and A. A. Malikopoulos, “A research and educational robotic testbed for real- time control of emerging mobility systems: From theory to scaled experiments,”IEEE Control Systems Magazine, vol. 42, no. 6, pp. 20– 34, 2022
work page 2022
-
[20]
Locatelli,Optimal Control of a Double Integrator: A Primer on Maximum Principle, vol
A. Locatelli,Optimal Control of a Double Integrator: A Primer on Maximum Principle, vol. 68 ofStudies in Systems, Decision and Control. Springer, 2017
work page 2017
-
[21]
Conditions to Provable System-Wide Optimal Coordination of Connected and Automated Vehicles,
A. M. I. Mahbub and A. A. Malikopoulos, “Conditions to Provable System-Wide Optimal Coordination of Connected and Automated Vehicles,”Automatica, vol. 131, no. 109751, 2021
work page 2021
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.