rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Utilizing Problem Structure in Planning
    sub title: A Local Search Approach
  name:
    name part: Hoffmann, Jörg.
    role:
      role term: creator
    role:
      role term: author.
    role:
      role term: aut
    role:
      role term: http://id.loc.gov/vocabulary/relators/aut
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2003
    edition: 1st ed. 2003.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVIII, 254 p. online resource.
  abstract: 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.
  table of contents: 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.
  note: by Jörg Hoffmann.
  subject:
    topic: Artificial intelligence
  subject:
    topic: Algorithms
  subject:
    topic: Artificial Intelligence
  subject:
    topic: Algorithm Analysis and Problem Complexity
  classification: Q334-342
  classification: 006.3
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Artificial Intelligence ; 2854
  identifier: 9783540396079
  identifier: https://doi.org/10.1007/b93903
  record info:
    record creation date: 121227
    record change date: 20191024102025.0
    record identifier: 978-3-540-39607-9