loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Author: Gavin Rens

Affiliation: University of KwaZulu-Natal and CSIR Meraka, South Africa

ISBN: 978-989-758-074-1

Keyword(s): Online, POMDP, Planning, Heuristic, Optimization, Belief-state Compression, Expected Feature Values.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Planning and Scheduling ; Reactive AI ; Simulation and Modeling ; Soft Computing ; Symbolic Systems ; Uncertainty in AI

Abstract: A novel algorithm to speed up online planning in partially observable Markov decision processes (POMDPs) is introduced. I propose a method for compressing nodes in belief-decision-trees while planning occurs. Whereas belief-decision-trees branch on actions and observations, with my method, they branch only on actions. This is achieved by unifying the branches required due to the nondeterminism of observations. The method is based on the expected values of domain features. The new algorithm is experimentally compared to three other online POMDP algorithms, outperforming them on the given test domain.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.80.6.254

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Rens, G. (2015). Speeding up Online POMDP Planning - Unification of Observation Branches by Belief-state Compression Via Expected Feature Values.In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-074-1, pages 241-246. DOI: 10.5220/0005165802410246

@conference{icaart15,
author={Gavin Rens.},
title={Speeding up Online POMDP Planning - Unification of Observation Branches by Belief-state Compression Via Expected Feature Values},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2015},
pages={241-246},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005165802410246},
isbn={978-989-758-074-1},
}

TY - CONF

JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Speeding up Online POMDP Planning - Unification of Observation Branches by Belief-state Compression Via Expected Feature Values
SN - 978-989-758-074-1
AU - Rens, G.
PY - 2015
SP - 241
EP - 246
DO - 10.5220/0005165802410246

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.