Initialization of the shooting method via the Hamilton-Jacobi-Bellman approach
From MaRDI portal
Publication:604254
DOI10.1007/s10957-010-9649-6zbMath1200.49030arXiv0910.0521MaRDI QIDQ604254
Emiliano Cristiani, Pierre Martinon
Publication date: 10 November 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.0521
Hamilton-Jacobi-Bellman equations; shooting method; optimal control problems; Pontryagin's minimum principle; minimum time problems
49M05: Numerical methods based on necessary conditions
34H05: Control problems involving ordinary differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient data structure and accurate scheme to solve front propagation problems
- Singular arcs in the generalized Goddard's problem
- Numerical solution of singular control problems using multiple shooting techniques
- Optimality conditions and synthesis for the minimum time problem
- Normality of the maximum principle for nonconvex constrained Bolza problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Genericity results for singular curves
- An anti-diffusive scheme for viability problems
- Direct optimization methods for solving a complex state-constrained optimal control problem in microeconomics
- Goddard problem in presence of a dynamic pressure limit
- Solving Ordinary Differential Equations I
- Numerical computation of singular control functions in trajectory optimization problems
- Fast Semi-Lagrangian Schemes for the Eikonal Equation and Applications
- The Relationship between the Maximum Principle and Dynamic Programming
- Real-time computation of feedback controls for constrained optimal control problems. part 2: A correction method based on multiple shooting
- Some Characterizations of Optimal Trajectories in Control Theory
- Estimates of Convergence of Fully Discrete Schemes for the Isaacs Equation of Pursuit-Evasion Differential Games Via Maximum Principle
- Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
- NUMERICAL METHODS FOR DIFFERENTIAL GAMES BASED ON PARTIAL DIFFERENTIAL EQUATIONS
- A Connection Between the Maximum Principle and Dynamic Programming for Constrained Control Problems
- The theory of dynamic programming
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
