Reduced complexity dynamic programming based on policy iteration

DOI10.1016/0022-247X(92)90007-ZzbMath0774.49019MaRDI QIDQ1206904

David S. Bayard

Publication date: 1 April 1993

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

optimal controldynamic programmingforward method

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Combinatorial optimization (90C27)

Related Items (4)

Implicit dual control based on particle filtering and forward dynamic programming ⋮ Discrete optimization by optimal control methods. I: Separable problems ⋮ Discrete optimization by optimal control methods. II: The static traveling salesman problem ⋮ Approximate algorithms for the traveling salesman problem. II

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

This page was built for publication: Reduced complexity dynamic programming based on policy iteration