X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1
    Online Resource
    Online Resource
    Utilizing Problem Structure in Planning : A Local Search Approach (2003)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920532402882
    Format: XVIII, 254 p. , online resource.
    ISBN: 9783540396079
    Series Statement: Lecture Notes in Computer Science, 2854
    Content: Planning is a crucial skill for any autonomous agent, be it a physically embedded agent, such as a robot, or a purely simulated software agent. For this reason, planning, as a central research area of artificial intelligence from its beginnings, has gained even more attention and importance recently. After giving a general introduction to AI planning, the book describes and carefully evaluates the algorithmic techniques used in fast-forward planning systems (FF), demonstrating their excellent performance in many wellknown benchmark domains. In advance, an original and detailed investigation identifies the main patterns of structure which cause the performance of FF, categorizing planning domains in a taxonomy of different classes with respect to their aptitude for being solved by heuristic approaches, such as FF. As shown, the majority of the planning benchmark domains lie in classes which are easy to solve.
    Note: Planning: Motivation, Definitions, Methodology -- 1: Introduction -- 2: Planning -- A Local Search Approach -- 3: Base Architecture -- 4: Dead Ends -- 5: Goal Orderings -- 6: The AIPS-2000 Competition -- Local Search Topology -- 7: Gathering Insights -- 8: Verifying the h?+? Hypotheses -- 9: Supporting the hFF Hypotheses -- 10: Discussion -- Appendix A: Formalized Benchmark Domains -- Appendix B: Automated Instance Generation.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540202592
    Language: English
    DOI: 10.1007/b93903
    URL: http://dx.doi.org/10.1007/b93903
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 2
    Online Resource
    Online Resource
    Utilizing Problem Structure in Planning : A Local Search Approach (2003)
    Berlin : Springer
    Details
    UID:
    gbv_749171820
    Format: Online-Ressource (XIII, 251 p. Also available online) , digital
    Edition: Springer eBook Collection. Computer Science
    ISBN: 9783540396079 , 3540202595 , 9783540202592
    Series Statement: Lecture Notes in Computer Science 2854
    Content: Planning is a crucial skill for any autonomous agent, be it a physically embedded agent, such as a robot, or a purely simulated software agent. For this reason, planning, as a central research area of artificial intelligence from its beginnings, has gained even more attention and importance recently. After giving a general introduction to AI planning, the book describes and carefully evaluates the algorithmic techniques used in fast-forward planning systems (FF), demonstrating their excellent performance in many wellknown benchmark domains. In advance, an original and detailed investigation identifies the main patterns of structure which cause the performance of FF, categorizing planning domains in a taxonomy of different classes with respect to their aptitude for being solved by heuristic approaches, such as FF. As shown, the majority of the planning benchmark domains lie in classes which are easy to solve
    Note: Literaturverz. S. [243] - 247
    Additional Edition: ISBN 9783540202592
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662182208
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540202592
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Automatische Handlungsplanung ; Suchverfahren ; Heuristik ; Hochschulschrift
    DOI: 10.1007/b93903
    URL: lizenzpflichtig
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
  • 3
    Online Resource
    Online Resource
    Utilizing Problem Structure in Planning : A Local Search Approach (2003)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621548102882
    Format: XVIII, 254 p. , online resource.
    Edition: 1st ed. 2003.
    ISBN: 9783540396079
    Series Statement: Lecture Notes in Artificial Intelligence ; 2854
    Content: Planning is a crucial skill for any autonomous agent, be it a physically embedded agent, such as a robot, or a purely simulated software agent. For this reason, planning, as a central research area of artificial intelligence from its beginnings, has gained even more attention and importance recently. After giving a general introduction to AI planning, the book describes and carefully evaluates the algorithmic techniques used in fast-forward planning systems (FF), demonstrating their excellent performance in many wellknown benchmark domains. In advance, an original and detailed investigation identifies the main patterns of structure which cause the performance of FF, categorizing planning domains in a taxonomy of different classes with respect to their aptitude for being solved by heuristic approaches, such as FF. As shown, the majority of the planning benchmark domains lie in classes which are easy to solve.
    Note: Planning: Motivation, Definitions, Methodology -- 1: Introduction -- 2: Planning -- A Local Search Approach -- 3: Base Architecture -- 4: Dead Ends -- 5: Goal Orderings -- 6: The AIPS-2000 Competition -- Local Search Topology -- 7: Gathering Insights -- 8: Verifying the h?+? Hypotheses -- 9: Supporting the hFF Hypotheses -- 10: Discussion -- Appendix A: Formalized Benchmark Domains -- Appendix B: Automated Instance Generation.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662182208
    Additional Edition: Printed edition: ISBN 9783540202592
    Language: English
    DOI: 10.1007/b93903
    URL: https://doi.org/10.1007/b93903
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 4
    Book
    Book
    Utilizing problem structure in planning : a local search approach (2003)
    Berlin : Springer
    Details
    UID:
    gbv_371287030
    Format: XIII, 251 S. , Ill., graph. Darst.
    ISBN: 3540202595
    Series Statement: Lecture notes in computer science 2854
    Note: Literaturverz. S. [243] - 247 , Teilw. zugl.: Freiburg, Univ., Diss., 2002
    Additional Edition: Erscheint auch als Online-Ausgabe Hoffmann, Jörg, 1971 - Utilizing Problem Structure in Planning Berlin, Heidelberg : Springer Berlin Heidelberg, 2003 ISBN 9783540202592
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Automatische Handlungsplanung ; Suchverfahren ; Heuristik ; Hochschulschrift
    URL: Inhaltsverzeichnis
    URL: Verlagsangaben
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    UB Potsdam get availability status
  • 5
    Book
    Book
    Utilizing problem structure in planning : a local search approach (2003)
    Berlin [u.a.] : Springer-Verlag
    Details
    UID:
    kobvindex_ZLB13577198
    Format: XIII, 251 Seiten
    ISBN: 3540202595
    Series Statement: Lecture notes in computer science
    Language: English
    Keywords: Automatische Handlungsplanung ; Suchverfahren ; Heuristik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Berlin VÖBB/ZLB get availability status
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9783540102502?
Did you mean 9783540200512?
Did you mean 9783540005292?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages