Compiling uncertainty away in conformant planning problems with bounded width
H Palacios, H Geffner - Journal of Artificial Intelligence Research, 2009 - jair.org
Conformant planning is the problem of finding a sequence of actions for achieving a goal in
the presence of uncertainty in the initial state or action effects. The problem has been …
the presence of uncertainty in the initial state or action effects. The problem has been …
Hybrid conditional planning using answer set programming
We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-
ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions …
ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions …
[PDF][PDF] Acting in partially observable environments when achievement of the goal cannot be guaranteed
The problem of planning in partially observable environments can be regarded as a search
problem in belief space where beliefs express the collection of states that are deemed …
problem in belief space where beliefs express the collection of states that are deemed …
CAMP-BDI: an approach for multiagent systems robustness through capability-aware agents maintaining plans
AG White - 2017 - era.ed.ac.uk
Rational agent behaviour is frequently achieved through the use of plans, particularly within
the widely used BDI (Belief-Desire-Intention) model for intelligent agents. As a …
the widely used BDI (Belief-Desire-Intention) model for intelligent agents. As a …