A new representation and associated algorithms for generalized planning
Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and buildin...
Gespeichert in:
| Veröffentlicht in: | Artificial intelligence 2011-02, Vol.175 (2), p.615-647 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 647 |
|---|---|
| container_issue | 2 |
| container_start_page | 615 |
| container_title | Artificial intelligence |
| container_volume | 175 |
| creator | Srivastava, Siddharth Immerman, Neil Zilberstein, Shlomo |
| description | Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for
generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems. |
| doi_str_mv | 10.1016/j.artint.2010.10.006 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_861534528</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0004370210001761</els_id><sourcerecordid>861534528</sourcerecordid><originalsourceid>FETCH-LOGICAL-c434t-b97156294e0d930914a15287d337084ecec8c4e8002e4fa89cccbd9adcd927943</originalsourceid><addsrcrecordid>eNp9kLtOwzAUhi0EEuXyBgxZEFOCb03sBamqoCBVYoHZcu2T4ip1gu2C4OlxScXIdG7_uX0IXRFcEUzq202lQ3I-VRT_piqM6yM0IaKhZSMpOUYTjDEvWYPpKTqLcZNDJiWZoMWs8PBZBBgCRPBJJ9f7Qntb6Bh743SC7HbrPrj0to1F24diDR6C7tx3Lg2d9t759QU6aXUX4fJgz9Hrw_3L_LFcPi-e5rNlaTjjqVzJhkxrKjlgKxmWhGsypaKxLN8mOBgwwnAQGFPgrRbSGLOyUltjJW0kZ-foZpw7hP59BzGprYsGunwG9LuoRE2mjOeRWclHpQl9jAFaNQS31eFLEaz22NRGjdjUHts-m7HltuvDAh2N7tqgvXHxr5eyphYZadbdjTrI3344CCoaB96AdQFMUrZ3_y_6AYa-hV8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>861534528</pqid></control><display><type>article</type><title>A new representation and associated algorithms for generalized planning</title><source>Elsevier ScienceDirect Journals Complete</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Srivastava, Siddharth ; Immerman, Neil ; Zilberstein, Shlomo</creator><creatorcontrib>Srivastava, Siddharth ; Immerman, Neil ; Zilberstein, Shlomo</creatorcontrib><description>Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for
generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems.</description><identifier>ISSN: 0004-3702</identifier><identifier>EISSN: 1872-7921</identifier><identifier>DOI: 10.1016/j.artint.2010.10.006</identifier><identifier>CODEN: AINTBB</identifier><language>eng</language><publisher>Oxford: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Artificial intelligence ; Automated planning ; C (programming language) ; Computation ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Computer systems performance. Reliability ; Construction ; Exact sciences and technology ; Expert systems ; Handles ; Plan verification ; Plans with loops ; Representations ; Software ; Theoretical computing</subject><ispartof>Artificial intelligence, 2011-02, Vol.175 (2), p.615-647</ispartof><rights>2010 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c434t-b97156294e0d930914a15287d337084ecec8c4e8002e4fa89cccbd9adcd927943</citedby><cites>FETCH-LOGICAL-c434t-b97156294e0d930914a15287d337084ecec8c4e8002e4fa89cccbd9adcd927943</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.artint.2010.10.006$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,45974</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23768921$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Srivastava, Siddharth</creatorcontrib><creatorcontrib>Immerman, Neil</creatorcontrib><creatorcontrib>Zilberstein, Shlomo</creatorcontrib><title>A new representation and associated algorithms for generalized planning</title><title>Artificial intelligence</title><description>Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for
generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Automated planning</subject><subject>C (programming language)</subject><subject>Computation</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Computer systems performance. Reliability</subject><subject>Construction</subject><subject>Exact sciences and technology</subject><subject>Expert systems</subject><subject>Handles</subject><subject>Plan verification</subject><subject>Plans with loops</subject><subject>Representations</subject><subject>Software</subject><subject>Theoretical computing</subject><issn>0004-3702</issn><issn>1872-7921</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kLtOwzAUhi0EEuXyBgxZEFOCb03sBamqoCBVYoHZcu2T4ip1gu2C4OlxScXIdG7_uX0IXRFcEUzq202lQ3I-VRT_piqM6yM0IaKhZSMpOUYTjDEvWYPpKTqLcZNDJiWZoMWs8PBZBBgCRPBJJ9f7Qntb6Bh743SC7HbrPrj0to1F24diDR6C7tx3Lg2d9t759QU6aXUX4fJgz9Hrw_3L_LFcPi-e5rNlaTjjqVzJhkxrKjlgKxmWhGsypaKxLN8mOBgwwnAQGFPgrRbSGLOyUltjJW0kZ-foZpw7hP59BzGprYsGunwG9LuoRE2mjOeRWclHpQl9jAFaNQS31eFLEaz22NRGjdjUHts-m7HltuvDAh2N7tqgvXHxr5eyphYZadbdjTrI3344CCoaB96AdQFMUrZ3_y_6AYa-hV8</recordid><startdate>20110201</startdate><enddate>20110201</enddate><creator>Srivastava, Siddharth</creator><creator>Immerman, Neil</creator><creator>Zilberstein, Shlomo</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110201</creationdate><title>A new representation and associated algorithms for generalized planning</title><author>Srivastava, Siddharth ; Immerman, Neil ; Zilberstein, Shlomo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c434t-b97156294e0d930914a15287d337084ecec8c4e8002e4fa89cccbd9adcd927943</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Automated planning</topic><topic>C (programming language)</topic><topic>Computation</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Computer systems performance. Reliability</topic><topic>Construction</topic><topic>Exact sciences and technology</topic><topic>Expert systems</topic><topic>Handles</topic><topic>Plan verification</topic><topic>Plans with loops</topic><topic>Representations</topic><topic>Software</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Srivastava, Siddharth</creatorcontrib><creatorcontrib>Immerman, Neil</creatorcontrib><creatorcontrib>Zilberstein, Shlomo</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</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>Artificial intelligence</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Srivastava, Siddharth</au><au>Immerman, Neil</au><au>Zilberstein, Shlomo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A new representation and associated algorithms for generalized planning</atitle><jtitle>Artificial intelligence</jtitle><date>2011-02-01</date><risdate>2011</risdate><volume>175</volume><issue>2</issue><spage>615</spage><epage>647</epage><pages>615-647</pages><issn>0004-3702</issn><eissn>1872-7921</eissn><coden>AINTBB</coden><abstract>Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for
generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems.</abstract><cop>Oxford</cop><pub>Elsevier B.V</pub><doi>10.1016/j.artint.2010.10.006</doi><tpages>33</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0004-3702 |
| ispartof | Artificial intelligence, 2011-02, Vol.175 (2), p.615-647 |
| issn | 0004-3702 1872-7921 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_861534528 |
| source | Elsevier ScienceDirect Journals Complete; EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Artificial intelligence Automated planning C (programming language) Computation Computer science control theory systems Computer systems and distributed systems. User interface Computer systems performance. Reliability Construction Exact sciences and technology Expert systems Handles Plan verification Plans with loops Representations Software Theoretical computing |
| title | A new representation and associated algorithms for generalized planning |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T13%3A37%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20new%20representation%20and%20associated%20algorithms%20for%20generalized%20planning&rft.jtitle=Artificial%20intelligence&rft.au=Srivastava,%20Siddharth&rft.date=2011-02-01&rft.volume=175&rft.issue=2&rft.spage=615&rft.epage=647&rft.pages=615-647&rft.issn=0004-3702&rft.eissn=1872-7921&rft.coden=AINTBB&rft_id=info:doi/10.1016/j.artint.2010.10.006&rft_dat=%3Cproquest_cross%3E861534528%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=861534528&rft_id=info:pmid/&rft_els_id=S0004370210001761&rfr_iscdi=true |