Planning control rules for reactive agents
Artificial Intelligence
LAO: a heuristic search algorithm that finds solutions with loops
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
Artificial Intelligence
A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis
Model Checking and Artificial Intelligence
Hi-index | 0.00 |
Strong Cycling Planning aims at generating iterative plans that implement trial-and-error strategies, where loops are allowed only so far as there is a chance to reach the goal. In this paper, we tackle the problem of Strong Cyclic Planning under Partial Observability, making three main contributions. First, we provide a formal definition of the problem. We point out that several degrees of solution are possible and equally interesting, depending on the admissible delay between achieving the goal and detecting that it has been achieved. Second, we present a family of planning algorithms that tackle the different versions of the problem. Third, we implement the algorithms using efficient symbolic representation techniques, and experimentally compare their performances.