CONTINGENT PLANNING AS BELIEF SPACE SEARCH

Incheol Kim, Hyunsik Kim

2011

Abstract

In this paper, we present a new heuristic search algorithm for solving contingent planning problems with the partial initial condition and nondeterministic actions. The algorithm efficiently searches through a cyclic AND-OR graph with dynamic updates of heuristic values, and generates a contingent plan that is guaranteed to achieve the goal despite of the uncertainty in the initial state and the uncertain effects of actions. Through several experiments, we demonstrate the efficiency of this algorithm.

Paper Citation

in Harvard Style

Kim I. and Kim H. (2011). CONTINGENT PLANNING AS BELIEF SPACE SEARCH . In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-40-9, pages 694-697. DOI: 10.5220/0003288906940697

in Bibtex Style

@conference{icaart11,
author={Incheol Kim and Hyunsik Kim},
title={CONTINGENT PLANNING AS BELIEF SPACE SEARCH},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2011},
pages={694-697},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003288906940697},
isbn={978-989-8425-40-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - CONTINGENT PLANNING AS BELIEF SPACE SEARCH
SN - 978-989-8425-40-9
AU - Kim I.
AU - Kim H.
PY - 2011
SP - 694
EP - 697
DO - 10.5220/0003288906940697