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 , domain (mathematical analysis) , markov decision process , feature (linguistics) , decision tree , observable , artificial intelligence , markov chain , automated planning and scheduling , algorithm , machine learning , markov process , theoretical computer science , markov model , mathematics , statistics , linguistics , philosophy , programming language , mathematical analysis , physics , quantum mechanics

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