z-logo
open-access-imgOpen Access
Speeding up Online POMDP Planning - Unification of Observation Branches by Belief-state Compression Via Expected Feature Values
Author(s) -
Gavin Rens
Publication year - 2015
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5220/0005165802410246
Subject(s) - partially observable markov decision process , computer science , unification , markov decision process , domain (mathematical analysis) , feature (linguistics) , decision tree , artificial intelligence , observable , markov chain , state (computer science) , automated planning and scheduling , algorithm , mathematical optimization , machine learning , markov process , markov model , mathematics , mathematical analysis , linguistics , statistics , philosophy , physics , quantum mechanics , programming language

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom