Approximate dynamic programming using support vector regression

This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architectures in approximate dynamic programming problems, explains some difficulties encountered by these architectures, and argues...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2008 47th IEEE Conference on Decision and Control s. 3811 - 3816
Hlavní autoři: Bethke, B., How, J.P., Ozdaglar, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2008
Témata:
Computational modeling
Computer architecture
Costs
Decision making
Dynamic programming
Finance
Function approximation
Neural networks
Space technology
Uncertainty
ISBN:9781424431236, 1424431239
ISSN:0191-2216
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architectures in approximate dynamic programming problems, explains some difficulties encountered by these architectures, and argues that SVR-based architectures can avoid some of these difficulties. A key contribution of this paper is to present an extension of the SVR problem to carry out approximate policy iteration by forcing the Bellman error to zero at selected states. The algorithm does not require trajectory simulations to be performed and is able to utilize a rich set of basis functions in a computationally efficient way. Computational results for an example problem are shown.
ISBN:9781424431236
1424431239
ISSN:0191-2216
DOI:10.1109/CDC.2008.4739322