Loading…

The 1998 AI Planning Systems Competition

The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind. Its goal was to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, measure overall progress in the field, and set up a fra...

Full description

Saved in:
Bibliographic Details
Published in:The AI magazine 2000-06, Vol.21 (2), p.35-55
Main Author: McDermott, Drew
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 55
container_issue 2
container_start_page 35
container_title The AI magazine
container_volume 21
creator McDermott, Drew
description The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind. Its goal was to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, measure overall progress in the field, and set up a framework for long‐term creation of a repository of problems in a standard notation. A rules committee for the competition was created in 1997 and had long discussions on how the contest should go. One result of these discussions was the pddl notation for planning domains. This notation was used to set up a set of planning problems and get a modest problem repository started. As a result, five planning systems were able to compete when the contest took place in June 1998. All these systems solved problems in the strips framework, with some slight extensions. The attempt to find domains for other forms of planning foundered because of technical and organizational problems. In spite of this problem, the competition achieved its goals partially in that it confirmed that substantial progress had occurred in some subfields of planning, and it allowed qualitative comparison among different planning algorithms. It is urged that the competition continue to take place and to evolve.
doi_str_mv 10.1609/aimag.v21i2.1506
format article
fullrecord <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_27200604</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A63365797</galeid><sourcerecordid>A63365797</sourcerecordid><originalsourceid>FETCH-LOGICAL-g2981-3ce9ebf662b3ee53b4d0b32702d08561d9acacfa478108083b13e6409301b2633</originalsourceid><addsrcrecordid>eNpdkL1PwzAQRy0EEqWwM0YMiIGUOztx7DFEFCpVKhJltpz0GlLlo9Qp0P8et2ViuuXpfk-PsWuEEUrQD7ZqbDn64ljxEcYgT9iAiwRDLTmesgEkQoWRBH7OLpxbAYBUQg7Y3fyDAtRaBekkeK1t21ZtGbztXE-NC7KuWVNf9VXXXrKzpa0dXf3dIXsfP82zl3A6e55k6TQsuVYYioI05UspeS6IYpFHC8gFT4AvQMUSF9oWtljaKFEICpTIUZCMQAvAnEshhuz2-He96T635HrTVK6g2qtRt3WGJ9y7Q-TBm3_gqttuWu9mOCgUGMXSQ_dHqLQ1maoturann77o6ppKMt48m5nUz8o40YnH9RH_rmramfXGR93sDILZNzaHxubQ2OwbmzRNJ49jQOX3fgFq628e</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>208131456</pqid></control><display><type>article</type><title>The 1998 AI Planning Systems Competition</title><source>ABI/INFORM Collection</source><source>Library &amp; Information Science Abstracts (LISA)</source><source>Social Science Premium Collection (Proquest) (PQ_SDU_P3)</source><source>Library &amp; Information Science Collection</source><creator>McDermott, Drew</creator><creatorcontrib>McDermott, Drew</creatorcontrib><description>The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind. Its goal was to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, measure overall progress in the field, and set up a framework for long‐term creation of a repository of problems in a standard notation. A rules committee for the competition was created in 1997 and had long discussions on how the contest should go. One result of these discussions was the pddl notation for planning domains. This notation was used to set up a set of planning problems and get a modest problem repository started. As a result, five planning systems were able to compete when the contest took place in June 1998. All these systems solved problems in the strips framework, with some slight extensions. The attempt to find domains for other forms of planning foundered because of technical and organizational problems. In spite of this problem, the competition achieved its goals partially in that it confirmed that substantial progress had occurred in some subfields of planning, and it allowed qualitative comparison among different planning algorithms. It is urged that the competition continue to take place and to evolve.</description><identifier>ISSN: 0738-4602</identifier><identifier>EISSN: 2371-9621</identifier><identifier>DOI: 10.1609/aimag.v21i2.1506</identifier><language>eng</language><publisher>La Canada: American Association for Artificial Intelligence</publisher><subject>Algorithms ; Artificial intelligence ; Artificial neural networks ; Committees ; Competition ; Computer networks ; Intelligent devices ; Intelligent machines ; Language ; Machine learning ; Natural language ; Neural networks ; Planning ; Scheduling</subject><ispartof>The AI magazine, 2000-06, Vol.21 (2), p.35-55</ispartof><rights>2000 The Authors. AI Magazine published by John Wiley &amp; Sons Ltd on behalf of Association for the Advancement of Artificial Intelligence</rights><rights>COPYRIGHT 2000 American Association for Artificial Intelligence</rights><rights>Copyright American Association for Artificial Intelligence Summer 2000</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/208131456/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/208131456?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,21381,21394,27305,27924,27925,33611,33612,33906,33907,34135,36060,36061,43733,43892,44363,74221,74409,74895</link.rule.ids></links><search><creatorcontrib>McDermott, Drew</creatorcontrib><title>The 1998 AI Planning Systems Competition</title><title>The AI magazine</title><addtitle>AI Magazine</addtitle><description>The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind. Its goal was to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, measure overall progress in the field, and set up a framework for long‐term creation of a repository of problems in a standard notation. A rules committee for the competition was created in 1997 and had long discussions on how the contest should go. One result of these discussions was the pddl notation for planning domains. This notation was used to set up a set of planning problems and get a modest problem repository started. As a result, five planning systems were able to compete when the contest took place in June 1998. All these systems solved problems in the strips framework, with some slight extensions. The attempt to find domains for other forms of planning foundered because of technical and organizational problems. In spite of this problem, the competition achieved its goals partially in that it confirmed that substantial progress had occurred in some subfields of planning, and it allowed qualitative comparison among different planning algorithms. It is urged that the competition continue to take place and to evolve.</description><subject>Algorithms</subject><subject>Artificial intelligence</subject><subject>Artificial neural networks</subject><subject>Committees</subject><subject>Competition</subject><subject>Computer networks</subject><subject>Intelligent devices</subject><subject>Intelligent machines</subject><subject>Language</subject><subject>Machine learning</subject><subject>Natural language</subject><subject>Neural networks</subject><subject>Planning</subject><subject>Scheduling</subject><issn>0738-4602</issn><issn>2371-9621</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><sourceid>ALSLI</sourceid><sourceid>CNYFK</sourceid><sourceid>F2A</sourceid><sourceid>M0C</sourceid><sourceid>M1O</sourceid><recordid>eNpdkL1PwzAQRy0EEqWwM0YMiIGUOztx7DFEFCpVKhJltpz0GlLlo9Qp0P8et2ViuuXpfk-PsWuEEUrQD7ZqbDn64ljxEcYgT9iAiwRDLTmesgEkQoWRBH7OLpxbAYBUQg7Y3fyDAtRaBekkeK1t21ZtGbztXE-NC7KuWVNf9VXXXrKzpa0dXf3dIXsfP82zl3A6e55k6TQsuVYYioI05UspeS6IYpFHC8gFT4AvQMUSF9oWtljaKFEICpTIUZCMQAvAnEshhuz2-He96T635HrTVK6g2qtRt3WGJ9y7Q-TBm3_gqttuWu9mOCgUGMXSQ_dHqLQ1maoturann77o6ppKMt48m5nUz8o40YnH9RH_rmramfXGR93sDILZNzaHxubQ2OwbmzRNJ49jQOX3fgFq628e</recordid><startdate>200006</startdate><enddate>200006</enddate><creator>McDermott, Drew</creator><general>American Association for Artificial Intelligence</general><general>John Wiley &amp; Sons, Inc</general><scope>3V.</scope><scope>4T-</scope><scope>4U-</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ALSLI</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CNYFK</scope><scope>DWQXO</scope><scope>E3H</scope><scope>F2A</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M1O</scope><scope>M2O</scope><scope>M2P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>S0X</scope><scope>U9A</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200006</creationdate><title>The 1998 AI Planning Systems Competition</title><author>McDermott, Drew</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-g2981-3ce9ebf662b3ee53b4d0b32702d08561d9acacfa478108083b13e6409301b2633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Algorithms</topic><topic>Artificial intelligence</topic><topic>Artificial neural networks</topic><topic>Committees</topic><topic>Competition</topic><topic>Computer networks</topic><topic>Intelligent devices</topic><topic>Intelligent machines</topic><topic>Language</topic><topic>Machine learning</topic><topic>Natural language</topic><topic>Neural networks</topic><topic>Planning</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>McDermott, Drew</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Docstoc</collection><collection>University Readers</collection><collection>ProQuest Career and Technical Education</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Social Science Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>eLibrary</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Library &amp; Information Science Collection</collection><collection>ProQuest Central</collection><collection>Library &amp; Information Sciences Abstracts (LISA)</collection><collection>Library &amp; Information Science Abstracts (LISA)</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer science database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database</collection><collection>Library Science Database</collection><collection>ProQuest research library</collection><collection>Science Database (ProQuest)</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><collection>ProQuest Central Basic</collection><collection>SIRS Editorial</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>The AI magazine</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>McDermott, Drew</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The 1998 AI Planning Systems Competition</atitle><jtitle>The AI magazine</jtitle><addtitle>AI Magazine</addtitle><date>2000-06</date><risdate>2000</risdate><volume>21</volume><issue>2</issue><spage>35</spage><epage>55</epage><pages>35-55</pages><issn>0738-4602</issn><eissn>2371-9621</eissn><abstract>The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind. Its goal was to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, measure overall progress in the field, and set up a framework for long‐term creation of a repository of problems in a standard notation. A rules committee for the competition was created in 1997 and had long discussions on how the contest should go. One result of these discussions was the pddl notation for planning domains. This notation was used to set up a set of planning problems and get a modest problem repository started. As a result, five planning systems were able to compete when the contest took place in June 1998. All these systems solved problems in the strips framework, with some slight extensions. The attempt to find domains for other forms of planning foundered because of technical and organizational problems. In spite of this problem, the competition achieved its goals partially in that it confirmed that substantial progress had occurred in some subfields of planning, and it allowed qualitative comparison among different planning algorithms. It is urged that the competition continue to take place and to evolve.</abstract><cop>La Canada</cop><pub>American Association for Artificial Intelligence</pub><doi>10.1609/aimag.v21i2.1506</doi><tpages>21</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0738-4602
ispartof The AI magazine, 2000-06, Vol.21 (2), p.35-55
issn 0738-4602
2371-9621
language eng
recordid cdi_proquest_miscellaneous_27200604
source ABI/INFORM Collection; Library & Information Science Abstracts (LISA); Social Science Premium Collection (Proquest) (PQ_SDU_P3); Library & Information Science Collection
subjects Algorithms
Artificial intelligence
Artificial neural networks
Committees
Competition
Computer networks
Intelligent devices
Intelligent machines
Language
Machine learning
Natural language
Neural networks
Planning
Scheduling
title The 1998 AI Planning Systems Competition
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T05%3A03%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%201998%20AI%20Planning%20Systems%20Competition&rft.jtitle=The%20AI%20magazine&rft.au=McDermott,%20Drew&rft.date=2000-06&rft.volume=21&rft.issue=2&rft.spage=35&rft.epage=55&rft.pages=35-55&rft.issn=0738-4602&rft.eissn=2371-9621&rft_id=info:doi/10.1609/aimag.v21i2.1506&rft_dat=%3Cgale_proqu%3EA63365797%3C/gale_proqu%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-g2981-3ce9ebf662b3ee53b4d0b32702d08561d9acacfa478108083b13e6409301b2633%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=208131456&rft_id=info:pmid/&rft_galeid=A63365797&rfr_iscdi=true