COMPLEXITY, DECIDABILITY AND UNDECIDABILITY RESULTS FOR DOMAIN-INDEPENDENT PLANNING

被引：75
|
作者：
EROL, K [1 ]
NAU, DS [1 ]
SUBRAHMANIAN, VS [1 ]
机构：
[1] UNIV MARYLAND,INST ADV COMP STUDIES,COLLEGE PK,MD 20742
来源：
ARTIFICIAL INTELLIGENCE | 1995年 / 76卷 / 1-2期
基金：
美国国家科学基金会;
关键词：
Computational complexity - Decision theory - Functions - Planning - Problem solving;
D O I：
10.1016/0004-3702(94)00080-K
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show conditions under which planning is decidable and undecidable. Our results on this topic solve an open problem posed by Chapman (1987), and clear up some difficulties with his undecidability theorems. For those cases where planning is decidable, we explain how the time complexity varies depending on a wide variety of conditions: whether or not function symbols are allowed; whether or not delete lists are allowed; whether or not negative preconditions are allowed; whether or not the predicates are restricted to be propositional (i.e., O-ary); whether the planning operators are given as part of the input to the planning problem, or instead are fixed in advance. whether or not the operators can have conditional effects.
引用
收藏
页码：75 / 88
页数：14
相关论文
共 50 条
  • [1] Incorporating Domain-Independent Planning Heuristics in Hierarchical Planning
    Shivashankar, Vikas
    Alford, Ron
    Aha, David W.
    [J]. THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 3658 - 3664
  • [2] Inferring state constraints for domain-independent planning
    Gerevini, A
    Schubert, L
    [J]. FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, 1998, : 905 - 912
  • [3] Deep Learning of Heuristics for Domain-independent Planning
    Trunda, Otakar
    Bartak, Roman
    [J]. ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2020, : 79 - 88
  • [4] Domain-Independent, Automatic Partitioning for Probabilistic Planning
    Dai, Peng
    Mausam
    Weld, Daniel S.
    [J]. 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 1677 - 1683
  • [5] Domain-independent online planning for STRIPS domains
    Sapena, O
    Onaindía, E
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2002, PROCEEDINGS, 2002, 2527 : 825 - 834
  • [6] Inductive Certificates of Unsolvability for Domain-Independent Planning
    Eriksson, Salome
    Roeger, Gabriele
    Helmert, Malte
    [J]. PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 5244 - 5248
  • [7] DOMAIN-INDEPENDENT PLANNING - REPRESENTATION AND PLAN GENERATION
    WILKINS, DE
    [J]. ARTIFICIAL INTELLIGENCE, 1984, 22 (03) : 269 - 301
  • [8] Semantic attachments for domain-independent planning systems
    Dornhege, Christian
    Eyerich, Patrick
    Keller, Thomas
    Trüg, Sebastian
    Brenner, Michael
    Nebel, Bernhard
    [J]. Springer Tracts in Advanced Robotics, 2012, 76 (STAR): : 99 - 115
  • [9] Decidability and Undecidability Results for Propositional Schemata
    Aravantinos, Vincent
    Caferra, Ricardo
    Peltier, Nicolas
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2011, 40 : 599 - 656
  • [10] Combining Domain-Independent Planning and HTN Planning: The Duet Planner
    Gerevini, Alfonso
    Kuter, Ugur
    Nau, Dana
    Saetti, Alessandro
    Waisbrot, Nathaniel
    [J]. ECAI 2008, PROCEEDINGS, 2008, 178 : 573 - +
12345