Truncated Approximate Dynamic Programming with Task-Dependent Terminal Value | Zendy

Amirmassoud Farahmand | Zendy; Daniel Nikovski | Zendy; Yuji Igarashi | Zendy; Hiroki Konaka | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Truncated Approximate Dynamic Programming with Task-Dependent Terminal Value

Author(s) -

Amirmassoud Farahmand,

Daniel Nikovski,

Yuji Igarashi,

Hiroki Konaka

Publication year - 2016

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - Uncategorized

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v30i1.10397

Subject(s) - bellman equation , markov decision process , terminal (telecommunication) , estimator , computer science , function (biology) , mathematical optimization , dynamic programming , terminal value , horizon , class (philosophy) , value (mathematics) , time horizon , task (project management) , markov process , algorithm , mathematics , artificial intelligence , statistics , machine learning , production (economics) , net present value , engineering , telecommunications , geometry , macroeconomics , systems engineering , evolutionary biology , economics , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research