DeepAI AI Chat

Phase Transitions of Plan Modification in Conformant Planning

12/13/2010

∙

by Junping Zhou, et al.

∙

∙

We explore phase transitions of plan modification, which mainly focus on the conformant planning problems. By analyzing features of plan modification in conformant planning problems, quantitative results are obtained. If the number of operators is less than, almost all conformant planning problems can't be solved with plan modification. If the number of operators is more than, almost all conformant planning problems can be solved with plan modification. The results of the experiments also show that there exists an experimental threshold of density (ratio of number of operators to number of propositions), which separates the region where almost all conformant planning problems can't be solved with plan modification from the region where almost all conformant planning problems can be solved with plan modification.

Junping Zhou
8 publications
Minghao Yin
19 publications

∙ 09/25/2018

Finding plans subject to stipulations on what information they divulge

Motivated by applications where privacy is important, we consider planni...

0 Yulin Zhang, et al. ∙

∙ 06/26/2011

Structure and Complexity in Planning with Unary Operators

Unary operator domains -- i.e., domains in which operators have a single...

0 R. I. Brafman, et al. ∙

∙ 11/21/2019

Generalized Planning with Positive and Negative Examples

Generalized planning aims at computing an algorithm-like structure (gene...

0 Javier Segovia-Aguas, et al. ∙

∙ 05/27/2011

Efficient Implementation of the Plan Graph in STAN

STAN is a Graphplan-based planner, so-called because it uses a variety o...

0 M. Fox, et al. ∙

∙ 02/27/2013

Planning with External Events

I describe a planning methodology for domains with uncertainty in the fo...

0 Jim S. Blythe, et al. ∙

∙ 12/18/2019

Dynamic Toolbox for ETRINV

Recently, various natural algorithmic problems have been shown to be ∃R-...

0 Mikkel Abrahamsen, et al. ∙

∙ 09/17/2017

Memory Augmented Control Networks

Planning problems in partially observable environments cannot be solved ...

0 Arbaaz Khan, et al. ∙