论文信息 - The Loyal Opposition Comments on Plan Domain Description Languages

The Loyal Opposition Comments on Plan Domain Description Languages

In this paper we take a critical look at PDDL 2.1 as designers and users of plan domain description languages. We describe planning domains that have features which are hard to model using PDDL 2.1. We then offer some suggestions on domain description language design, and describe how these suggestions make modeling our chosen domains easier.

Keith Golden | Ari K. Jónsson | Jeremy Frank

[1] Keith Golden,et al. DPADL: An Action Language for Data Processing Domains , 2002 .

[2] Keith Golden,et al. Representing Sensing Actions: The Middle Ground Revisited , 1996, KR.

[3] David E. Smith,et al. The Logic of Reachability , 2002, AIPS.

[4] Maria Fox,et al. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[5] Philippe Laborie,et al. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[6] P. Baptiste,et al. Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling , 1996 .

[7] Nicola Muscettola,et al. Computing the Envelope for Stepwise-Constant Resource Allocations , 2002, CP.

[8] Keith Golden,et al. Universal Quantification in a Constraint-Based Planner , 2002, AIPS.

[9] Nicola Muscettola,et al. Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.

[10] Jeremy Frank,et al. Constraint-Based Attribute and Interval Planning , 2003, Constraints.