Suboptimal dynamic programming with error bounds

Proceedings of the IEEE Conference on Decision and Control

Volumn 2, Issue , 2002, Pages 2354-2359

  Lincoln, Bo ^a   Rantzer, Anders ^a  

^a LUND INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; ERROR ANALYSIS; FUNCTIONS; PARAMETER ESTIMATION; PROBLEM SOLVING;

ERROR BOUNDS; PARAMETERIZED SUBOPTIMAL VALUE FUNCTION; SUBOPTIMAL DYNAMIC PROGRAMMING; TIME ADDITIVE COST FUNCTION;

OPTIMAL CONTROL SYSTEMS;

EID: 0036993268     PISSN: 01912216     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. K. J. Åström. "Optimal control of Markov processes with incomplete state information I." Journal of Mathematical Analysis and Applications, 10, pp. 174-205, 1965.
2. D. P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 2nd edition, 2000.
3. F. Borrelli, A. Bemporad, and M. Morari. "A geometric algorithm for multi-parametric linear programming." Journal of Optimization Theory and Applications, 2002, To appear.
4. A. R. Cassandra. "Tony's pomdp page." http://www.cs.brown.edu/research/ai/pomdp/.
5. A. R. Cassandra. Exact and Approximate Algorithms for Partially Observable Markov Decision Processes. PhD thesis, Brown University, Department of Computer Science, Providence, RI, 1998.
6. B. Lincoln and A. Rantzer. "Optimizing linear system switching." In Proceedings of the 40th Conference on Decision and Control, 2001.
7. S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 1994.