Reduced complexity dynamic programming based on policy iteration
From MaRDI portal
Publication:1206904
DOI10.1016/0022-247X(92)90007-ZzbMath0774.49019MaRDI QIDQ1206904
Publication date: 1 April 1993
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
49L20: Dynamic programming in optimal control and differential games
90C27: Combinatorial optimization
Related Items
Approximate algorithms for the traveling salesman problem. II, Discrete optimization by optimal control methods. I: Separable problems, Discrete optimization by optimal control methods. II: The static traveling salesman problem, Implicit dual control based on particle filtering and forward dynamic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational aspects of discrete-time optimal control
- Robust experiment design via stochastic approximation
- DESIGN OF EXPERIMENTS IN NON-LINEAR SITUATIONS
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Implicit dual control for general stochastic systems
- The stagewise Kuhn-Tucker condition and differential dynamic programming
- Generalized Simulated Annealing for Function Optimization
- A forward method for optimal stochastic nonlinear and adaptive control
- Transient analysis of an adaptive system for optimization of design parameters
- D-Optimality for Regression Designs: A Review
- A new approach to differential dynamic programming for discrete time systems
