liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Online Saturated Cost Partitioning for Classical Planning
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten. University of Basel, Switzerland.ORCID-id: 0000-0002-2498-8020
2021 (Engelska)Ingår i: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), AAAI Press, 2021, s. 317-321Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Cost partitioning is a general method for admissibly summing up heuristic estimates for optimal state-space search. Most cost partitioning algorithms can optimize the resulting cost-partitioned heuristic for a specific state. Since computing a new cost-partitioned heuristic for each evaluated state is usually too expensive in practice, the strongest planners based on cost partitioning over abstraction heuristics precompute a set of cost-partitioned heuristics before the search and maximize over their estimates during the search. This makes state evaluations very fast, but since there is no better termination criterion than a time limit, it requires a long precomputation phase, even for the simplest planning tasks. A prototypical example for this is the Scorpion planner which computes saturated cost partitionings over abstraction heuristics offline before the search. Using Scorpion as a case study, we show that by incrementally extending the set of cost-partitioned heuristics online during the search, we drastically speed up the planning process and even often solve more tasks.

Ort, förlag, år, upplaga, sidor
AAAI Press, 2021. s. 317-321
Serie
Proceedings of the International Conference on Automated Planning and Scheduling, ISSN 2334-0835, E-ISSN 2334-0843 ; 31
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:liu:diva-175143DOI: 10.1609/icaps.v31i1.15976ISBN: 978-1-57735-867-1 (tryckt)OAI: oai:DiVA.org:liu-175143DiVA, id: diva2:1545845
Konferens
31st International Conference on Automated Planning and Scheduling (ICAPS 2021), Guangzhou, China, Aug 2-13, 2021
Forskningsfinansiär
EU, Europeiska forskningsrådet, 817639EU, Horisont 2020, 952215Tillgänglig från: 2021-04-20 Skapad: 2021-04-20 Senast uppdaterad: 2025-11-17Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextLänk till konferensen / Link to proceedings

Sök vidare i DiVA

Av författaren/redaktören
Seipp, Jendrik
Av organisationen
Artificiell intelligens och integrerade datorsystemTekniska fakulteten
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 255 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf