Generating Abstraction Hierarchies: An Automated Approach to Reducing Search in Planning
Generating Abstraction Hierarchies presents a completely automated approach to generating abstractions for problem solving. The abstractions are generated using a tractable, domain-independent algorithm whose only inputs are the definition of a problem space and the problem to be solved and whose ou...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
1993
|
| Schriftenreihe: | The Springer International Series in Engineering and Computer Science, Knowledge Representation, Learning and Expert Systems
214 |
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Zusammenfassung: | Generating Abstraction Hierarchies presents a completely automated approach to generating abstractions for problem solving. The abstractions are generated using a tractable, domain-independent algorithm whose only inputs are the definition of a problem space and the problem to be solved and whose output is an abstraction hierarchy that is tailored to the particular problem. The algorithm generates abstraction hierarchies that satisfy the 'ordered monotonicity' property, which guarantees that the structure of an abstract solution is not changed in the process of refining it. An abstraction hierarchy with this property allows a problem to be decomposed such that the solution in an abstract space can be held invariant while the remaining parts of a problem are solved. The algorithm for generating abstractions is implemented in a system called ALPINE, which generates abstractions for a hierarchical version of the PRODIGY problem solver. Generating Abstraction Hierarchies formally defines this hierarchical problem solving method, shows that under certain assumptions this method can reduce the size of a search space from exponential to linear in the solution size, and describes the implementation of this method in PRODIGY. The abstractions generated by ALPINE are tested in multiple domains on large problem sets and are shown to produce shorter solutions with significantly less search than problem solving without using abstraction. Generating Abstraction Hierarchies will be of interest to researchers in machine learning, planning and problem reformation |
| Beschreibung: | 1 Online-Ressource (XV, 168 p) |
| ISBN: | 9781461531524 |
| DOI: | 10.1007/978-1-4615-3152-4 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045186054 | ||
| 003 | DE-604 | ||
| 005 | 20240426 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180912s1993 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461531524 |9 978-1-4615-3152-4 | ||
| 024 | 7 | |a 10.1007/978-1-4615-3152-4 |2 doi | |
| 035 | |a (ZDB-2-ENG)978-1-4615-3152-4 | ||
| 035 | |a (OCoLC)1053826218 | ||
| 035 | |a (DE-599)BVBBV045186054 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 006.3 |2 23 | |
| 100 | 1 | |a Knoblock, Craig A. |d 1962- |e Verfasser |0 (DE-588)172191041 |4 aut | |
| 245 | 1 | 0 | |a Generating Abstraction Hierarchies |b An Automated Approach to Reducing Search in Planning |c by Craig A. Knoblock |
| 264 | 1 | |a Boston, MA |b Springer US |c 1993 | |
| 300 | |a 1 Online-Ressource (XV, 168 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a The Springer International Series in Engineering and Computer Science, Knowledge Representation, Learning and Expert Systems |v 214 | |
| 520 | |a Generating Abstraction Hierarchies presents a completely automated approach to generating abstractions for problem solving. The abstractions are generated using a tractable, domain-independent algorithm whose only inputs are the definition of a problem space and the problem to be solved and whose output is an abstraction hierarchy that is tailored to the particular problem. The algorithm generates abstraction hierarchies that satisfy the 'ordered monotonicity' property, which guarantees that the structure of an abstract solution is not changed in the process of refining it. An abstraction hierarchy with this property allows a problem to be decomposed such that the solution in an abstract space can be held invariant while the remaining parts of a problem are solved. The algorithm for generating abstractions is implemented in a system called ALPINE, which generates abstractions for a hierarchical version of the PRODIGY problem solver. Generating Abstraction Hierarchies formally defines this hierarchical problem solving method, shows that under certain assumptions this method can reduce the size of a search space from exponential to linear in the solution size, and describes the implementation of this method in PRODIGY. The abstractions generated by ALPINE are tested in multiple domains on large problem sets and are shown to produce shorter solutions with significantly less search than problem solving without using abstraction. Generating Abstraction Hierarchies will be of interest to researchers in machine learning, planning and problem reformation | ||
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Artificial Intelligence (incl. Robotics) | |
| 650 | 4 | |a Computer Science, general | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Artificial intelligence | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461363804 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4615-3152-4 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-ENG | ||
| 940 | 1 | |q ZDB-2-ENG_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030575232 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4615-3152-4 |l BTU01 |p ZDB-2-ENG |q ZDB-2-ENG_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178876609331200 |
|---|---|
| any_adam_object | |
| author | Knoblock, Craig A. 1962- |
| author_GND | (DE-588)172191041 |
| author_facet | Knoblock, Craig A. 1962- |
| author_role | aut |
| author_sort | Knoblock, Craig A. 1962- |
| author_variant | c a k ca cak |
| building | Verbundindex |
| bvnumber | BV045186054 |
| collection | ZDB-2-ENG |
| ctrlnum | (ZDB-2-ENG)978-1-4615-3152-4 (OCoLC)1053826218 (DE-599)BVBBV045186054 |
| dewey-full | 006.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3 |
| dewey-search | 006.3 |
| dewey-sort | 16.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-1-4615-3152-4 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03219nmm a2200433zcb4500</leader><controlfield tag="001">BV045186054</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240426 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180912s1993 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461531524</subfield><subfield code="9">978-1-4615-3152-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4615-3152-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-ENG)978-1-4615-3152-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1053826218</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045186054</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Knoblock, Craig A.</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)172191041</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Generating Abstraction Hierarchies</subfield><subfield code="b">An Automated Approach to Reducing Search in Planning</subfield><subfield code="c">by Craig A. Knoblock</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XV, 168 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">The Springer International Series in Engineering and Computer Science, Knowledge Representation, Learning and Expert Systems</subfield><subfield code="v">214</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Generating Abstraction Hierarchies presents a completely automated approach to generating abstractions for problem solving. The abstractions are generated using a tractable, domain-independent algorithm whose only inputs are the definition of a problem space and the problem to be solved and whose output is an abstraction hierarchy that is tailored to the particular problem. The algorithm generates abstraction hierarchies that satisfy the 'ordered monotonicity' property, which guarantees that the structure of an abstract solution is not changed in the process of refining it. An abstraction hierarchy with this property allows a problem to be decomposed such that the solution in an abstract space can be held invariant while the remaining parts of a problem are solved. The algorithm for generating abstractions is implemented in a system called ALPINE, which generates abstractions for a hierarchical version of the PRODIGY problem solver. Generating Abstraction Hierarchies formally defines this hierarchical problem solving method, shows that under certain assumptions this method can reduce the size of a search space from exponential to linear in the solution size, and describes the implementation of this method in PRODIGY. The abstractions generated by ALPINE are tested in multiple domains on large problem sets and are shown to produce shorter solutions with significantly less search than problem solving without using abstraction. Generating Abstraction Hierarchies will be of interest to researchers in machine learning, planning and problem reformation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence (incl. Robotics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461363804</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4615-3152-4</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-ENG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-ENG_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030575232</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4615-3152-4</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="q">ZDB-2-ENG_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV045186054 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:10:56Z |
| institution | BVB |
| isbn | 9781461531524 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030575232 |
| oclc_num | 1053826218 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XV, 168 p) |
| psigel | ZDB-2-ENG ZDB-2-ENG_Archiv ZDB-2-ENG ZDB-2-ENG_Archiv |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Springer US |
| record_format | marc |
| series2 | The Springer International Series in Engineering and Computer Science, Knowledge Representation, Learning and Expert Systems |
| spelling | Knoblock, Craig A. 1962- Verfasser (DE-588)172191041 aut Generating Abstraction Hierarchies An Automated Approach to Reducing Search in Planning by Craig A. Knoblock Boston, MA Springer US 1993 1 Online-Ressource (XV, 168 p) txt rdacontent c rdamedia cr rdacarrier The Springer International Series in Engineering and Computer Science, Knowledge Representation, Learning and Expert Systems 214 Generating Abstraction Hierarchies presents a completely automated approach to generating abstractions for problem solving. The abstractions are generated using a tractable, domain-independent algorithm whose only inputs are the definition of a problem space and the problem to be solved and whose output is an abstraction hierarchy that is tailored to the particular problem. The algorithm generates abstraction hierarchies that satisfy the 'ordered monotonicity' property, which guarantees that the structure of an abstract solution is not changed in the process of refining it. An abstraction hierarchy with this property allows a problem to be decomposed such that the solution in an abstract space can be held invariant while the remaining parts of a problem are solved. The algorithm for generating abstractions is implemented in a system called ALPINE, which generates abstractions for a hierarchical version of the PRODIGY problem solver. Generating Abstraction Hierarchies formally defines this hierarchical problem solving method, shows that under certain assumptions this method can reduce the size of a search space from exponential to linear in the solution size, and describes the implementation of this method in PRODIGY. The abstractions generated by ALPINE are tested in multiple domains on large problem sets and are shown to produce shorter solutions with significantly less search than problem solving without using abstraction. Generating Abstraction Hierarchies will be of interest to researchers in machine learning, planning and problem reformation Computer Science Artificial Intelligence (incl. Robotics) Computer Science, general Computer science Artificial intelligence Erscheint auch als Druck-Ausgabe 9781461363804 https://doi.org/10.1007/978-1-4615-3152-4 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Knoblock, Craig A. 1962- Generating Abstraction Hierarchies An Automated Approach to Reducing Search in Planning Computer Science Artificial Intelligence (incl. Robotics) Computer Science, general Computer science Artificial intelligence |
| title | Generating Abstraction Hierarchies An Automated Approach to Reducing Search in Planning |
| title_auth | Generating Abstraction Hierarchies An Automated Approach to Reducing Search in Planning |
| title_exact_search | Generating Abstraction Hierarchies An Automated Approach to Reducing Search in Planning |
| title_full | Generating Abstraction Hierarchies An Automated Approach to Reducing Search in Planning by Craig A. Knoblock |
| title_fullStr | Generating Abstraction Hierarchies An Automated Approach to Reducing Search in Planning by Craig A. Knoblock |
| title_full_unstemmed | Generating Abstraction Hierarchies An Automated Approach to Reducing Search in Planning by Craig A. Knoblock |
| title_short | Generating Abstraction Hierarchies |
| title_sort | generating abstraction hierarchies an automated approach to reducing search in planning |
| title_sub | An Automated Approach to Reducing Search in Planning |
| topic | Computer Science Artificial Intelligence (incl. Robotics) Computer Science, general Computer science Artificial intelligence |
| topic_facet | Computer Science Artificial Intelligence (incl. Robotics) Computer Science, general Computer science Artificial intelligence |
| url | https://doi.org/10.1007/978-1-4615-3152-4 |
| work_keys_str_mv | AT knoblockcraiga generatingabstractionhierarchiesanautomatedapproachtoreducingsearchinplanning |