A review of generalized planning

S Jiménez, J Segovia-Aguas… - The Knowledge …, 2019 - cambridge.org
Generalized planning studies the representation, computation and evaluation of solutions
that are valid for multiple planning instances. These are topics studied since the early days …

Answer set planning: a survey

SC Tran, E Pontelli, M Balduccini… - Theory and Practice of …, 2023 - cambridge.org
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans,
that is, solutions to planning problems, that transform a given state of the world to another …

Belief tracking for planning with sensing: Width, complexity and approximations

B Bonet, H Geffner - Journal of Artificial Intelligence Research, 2014 - jair.org
We consider the problem of belief tracking in a planning setting where states are valuations
over a set of variables that are partially observable, and beliefs stand for the sets of states …

[HTML][HTML] Domain-independent planning for services in uncertain and dynamic environments

E Kaldeli, A Lazovik, M Aiello - Artificial Intelligence, 2016 - Elsevier
Research in automated planning provides novel insights into service composition and
contributes towards the provision of automatic compositions which adapt to changing user …

Distributed, Dynamic and Recursive Planning for Holonic Multi-Agent Systems: A Behavioural Model-Based Approach

NEH Dehimi, S Galland, Z Tolba, N Allaoua, M Ferkani - Electronics, 2023 - mdpi.com
In this work, we propose a new distributed, dynamic, and recursive planning approach able
to consider the hierarchical nature of the holonic agent and the unpredictable evolution of its …

[PDF][PDF] Intelligent Belief State Sampling for Conformant Planning.

A Grastien, E Scala, FB Kessler - IJCAI, 2017 - researchgate.net
We propose a new method for conformant planning based on two ideas. First given a small
sample of the initial belief state we reduce conformant planning for this sample to a classical …

[HTML][HTML] CPCES: A planning framework to solve conformant planning problems through a counterexample guided refinement

A Grastien, E Scala - Artificial Intelligence, 2020 - Elsevier
We introduce cpces, a novel planner for the problem of deterministic conformant planning.
cpces solves the problem by producing candidate plans based on a sample of the initial …

AMPLE: an anytime planning and execution framework for dynamic and uncertain problems in robotics

C Ponzoni Carvalho Chanel, A Albore, J T'hooft… - Autonomous …, 2019 - Springer
Acting in robotics is driven by reactive and deliberative reasonings which take place in the
competition between execution and planning processes. Properly balancing reactivity and …

Domain independent heuristics for online stochastic contingent planning

O Blumenthal, G Shani - Annals of Mathematics and Artificial Intelligence, 2024 - Springer
Partially observable Markov decision processes (POMDP) are a useful model for decision-
making under partial observability and stochastic actions. Partially Observable Monte-Carlo …

[HTML][HTML] A generic approach to planning in the presence of incomplete information: Theory and implementation

ST To, TC Son, E Pontelli - Artificial Intelligence, 2015 - Elsevier
This paper proposes a generic approach to planning in the presence of incomplete
information. The approach builds on an abstract notion of a belief state representation, along …