Paper Info
Title
Solving fully-observable non-deterministic planning problems via translation into a general game
Abstract
In this paper, we propose a symbolic planner based on BDDs, which calculates strong and strong cyclic plans for a given non-deterministic input. The efficiency of the planning approach is based on a translation of the nondeterministic planning problems into a two-player turn-taking game, with a set of actions selected by the solver and a set of actions taken by the environment. The formalism we use is a PDDL-like planning domain definition language that has been derived to parse and instantiate general games. This conversion allows to derive a concise description of planning domains with a minimized state vector, thereby exploiting existing static analysis tools for deterministic planning.
Year
DOI
Venue
2009
10.1007/978-3-642-04617-9_1
KI
Keywords
Field
DocType
existing static analysis tool,pddl-like planning domain definition,fully-observable non-deterministic planning problem,instantiate general game,concise description,strong cyclic plan,nondeterministic planning problem,deterministic planning,state vector,non-deterministic input,planning approach,action selection,static analysis tools
Static program analysis,State vector,Observable,Nondeterministic algorithm,Computer science,Theoretical computer science,Parsing,Formalism (philosophy),Solver,Planning Domain Definition Language
Conference
Volume
ISSN
ISBN
5803
0302-9743
3-642-04616-9
Citations 
PageRank 
References 
11
0.71
8
Authors
2
Name
Order
Citations
PageRank
Peter Kissmann118113.93
Stefan Edelkamp21557125.46