Paper Titles

Cast Shadow Removal in a Real-Time Environment
p.2548

Verification Mechanism for Online Responses in Criteria Prioritization
p.2555

Research on Intelligent Flowmeter Calibration Software System Design
p.2560

Master-Slave Global Synchronization for Froude Pendulums via Linear State Error Feedback Control
p.2565

Review on Certain Group Planning Domain of IPC
p.2570

A GA Approach for Damage Localization Using Scattered Lamb Wave
p.2579

MPI+OpenMP Hybrid Parallel Algorithm Performance Research on Two-Dimensional Compressible Flow Field Simulation
p.2585

A Hybrid Optimization Based on GPU Parallel Computing Method and its Application of Three Dimensional Large Eddy Simulations
p.2589

Research of Ontology Based FPBS Design Model
p.2595

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 275-277Review on Certain Group Planning Domain of IPC

Review on Certain Group Planning Domain of IPC

Article Preview

Abstract:

Automated Planning is a very important branch of Artificial Intelligence, and one of the top competitions of Automated Planning is International Planning Competition, which is held by International Conference on Automated Planning and Scheduling. This paper gives the concepts about planning domains, and lists the sources of planning domains of IPC. Then from the aspects of application, the planning domains used in IPC are classified to three parts, theoretical research domains, application-oriented domains and comprehensive domains. And application-oriented domains are divided into five groups: robots-related domains, astronomy domains, engineering domains, games domains and network-related domains. Combining with the development of planning domains in 6 sessions of IPC, potential trends of the development of planning domains are explored.

You might also be interested in these eBooks

Applied Mechanics and Materials I

Info:

Periodical:

Applied Mechanics and Materials (Volumes 275-277)

Pages:

2570-2578

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.275-277.2570

Citation:

Cite this paper

Online since:

January 2013

Authors:

Nurbol Luktarhan, Nan Nan Xie, Muheyatn Niyazbek, Jin Shan He

Keywords:

Certain Planning Domains, International Planning Competition

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] McDermott D. PDDL—the planning domain definition language[R]. Yale Center for Computational Vision and Control, (1998).

[2] Bernhard Nebel. On the computational complexity of temporal projection, planning, and plan validation[A]. In: AAAIAmerican Association for Artificial Intelligence, AAAI'92 Proceedings of the tenth national conference on Artificial intelligence[C]. 1994, 66(1): 125-160.

DOI: 10.1016/0004-3702(94)90005-1

[3] Malte Helmert. Complexity results for standard benchmark domains in planning[J]. Journal of Artiﬁcial Intelligence, 2003, 143: 219-262.

DOI: 10.1016/s0004-3702(02)00364-8

[4] Derek Long and Maria Fox. The 3rd International Planning Competition: Results and Analysis[J]. Journal of Artificial Intelligence Research, 2003, 20: 1-59.

[5] Harri Holma and Antti Toskala. WCDMA for UMTS- Radio Access for 3rd Generation Mobile Communications, Third Edition[M]. Finland: John Wiley & Sons, Ltd., (2004).

DOI: 10.1002/0470870982

[6] Jorg Hoffmann, Stefan Edelkamp and Sylvie Thiebaux. Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4[J]. Journal of Artiﬁcial Intelligence Research, 2006, 26: 53-541.

DOI: 10.1613/jair.1982

[7] org Hoffmann and Stefan Edelkamp. The Deterministic Part of IPC-4: An Overview[J]. Journal of Artiﬁcial Intelligence Research, 2005, 24: 519-579.

DOI: 10.1613/jair.1677

[8] Alfonso E. Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti and Yannis Dimopoulos. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners[J]. Journal of Artificial Intelligence, 2009, 173: 619–668.

DOI: 10.1016/j.artint.2008.10.012

[9] IPC-2008 Domains. http: /ipc. informatik. uni-freiburg. de/Domains.

[10] Drew Mcdermott. The 1998 AI Planning Systems Competition[J]. The Association for the Advancement of Artificial Intelligence, 2000, 21(2): 35-56.

[11] J. Wolfe, B. Marthi, and S. Russell. Combined task and motion planning for mobile manipulation[A]. In: the 20th International Conference on Automated Planning and Scheduling(ICAPS '10)[C]2010: 254–257.

DOI: 10.1609/icaps.v20i1.13436

[12] Malte Helmert, Hauke Lasinger. The Scanalyzer domain: Greenhouse logistics as a planning problem[A]. In: Proc. ICAPS 2010[C]. 2010: 234–237.

DOI: 10.1609/icaps.v20i1.13431

[13] Maria Fox and Derek Long. PDDL2. 1: An Extension to PDDL for Expressing Temporal Planning Domains[J]. Journal of Artificial Intelligence Research, 2003, 20: 61-124.

DOI: 10.1613/jair.1129

[14] Sylvie Thiebaux, Jorg Hoffmann and Bernhard Nebel. In Defense of PDDL Axioms[J]. Journal of Artificial Intelligence, 2005, 168(1-2): 38-69.

DOI: 10.1016/j.artint.2005.05.004

[15] Alfonso Gerevini and Derek Long. Plan Constraints and Preferences in PDDL3. [R] University of Brescia, Italy: (2005).

[16] Alfonso Gerevini and Derek Long. Preferences and Soft Constraints in PDDL3[A]. In: Proceedings of the ICAPS-2006 Workshop on Preferences and Soft Constraints in Planning[C]. 2006: 46-54.

[17] Giuseppe Della Penna, Benedetto Intrigila, Daniele Magazzeni, Fabio Mercorio. A PDDL+ Benchmark Problem: The Batch Chemical Plant[A]. In: Proceedings of the Twentieth International Conference on Automated Planning and Scheduling (ICAPS 2010)[C], (2010).

DOI: 10.1609/icaps.v20i1.13430