scholarly journals A framework for the probabilistic analysis of hierarchical planning systems

1984 ◽  
Vol 1 (1) ◽  
pp. 23-42 ◽  
Author(s):  
J. K. Lenstra ◽  
A. H. G. Rinnooy Kan ◽  
L. Stougie
2020 ◽  
Vol 34 (06) ◽  
pp. 9883-9891 ◽  
Author(s):  
Daniel Höller ◽  
Gregor Behnke ◽  
Pascal Bercher ◽  
Susanne Biundo ◽  
Humbert Fiorino ◽  
...  

The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophisticated solving techniques. In principle, this development would make the comparison between systems easier (because the domains are not tailored to a single system anymore) and – much more important – also the integration into other systems, because the modeling process is less tedious (due to the lack of advice) and there is no (or less) commitment to a certain planning system the model is created for. However, these advantages are destroyed by the lack of a common input language and feature set supported by the different systems. In this paper, we propose an extension to PDDL, the description language used in non-hierarchical planning, to the needs of hierarchical planning systems.


2010 ◽  
Vol 21 (4) ◽  
pp. 413-426 ◽  
Author(s):  
Philip G. Moscoso ◽  
Jan C. Fransoo ◽  
Dieter Fischer

2014 ◽  
Vol 68 ◽  
pp. 49-63 ◽  
Author(s):  
Kasper Bislev Kallestrup ◽  
Lasse Hadberg Lynge ◽  
Renzo Akkerman ◽  
Thordis Anna Oddsdottir

1979 ◽  
pp. 63-93 ◽  
Author(s):  
Arnoldo C. Hax ◽  
Gabriel R. Bitran

2006 ◽  
Vol 104 (2) ◽  
pp. 427-440 ◽  
Author(s):  
B. Selçuk ◽  
J.C. Fransoo ◽  
A.G. De Kok

1981 ◽  
Vol 29 (4) ◽  
pp. 707-716 ◽  
Author(s):  
M. A. H. Dempster ◽  
M. L. Fisher ◽  
L. Jansen ◽  
B. J. Lageweg ◽  
J. K. Lenstra ◽  
...  

Author(s):  
Pascal Bercher ◽  
Ron Alford ◽  
Daniel Höller

Hierarchical planning has attracted renewed interest in the last couple of years, which led to numerous novel formalisms, problem classes, and theoretical investigations. Yet it is important to differentiate between the various formalisms and problem classes, since they show -- sometimes fundamental -- differences with regard to their expressivity and computational complexity: Some of them can be regarded equivalent to non-hierarchical formalisms while others are clearly more expressive. We survey the most important hierarchical problem classes and explain their differences and similarities. We furthermore give pointers to some of the best-known planning systems capable of solving the respective problem classes.


2002 ◽  
Vol 31 (10) ◽  
pp. 591-595 ◽  
Author(s):  
Rolf Krüger ◽  
Marion Steven

Sign in / Sign up

Export Citation Format

Share Document