Sök i LIBRIS databas

  Utökad sökning


Sökning: onr:"swepub:oai:DiVA.org:liu-59900" > Admissible Heuristi...

  • Haslum, Patrik,Linköpings universitet, KPLAB - Laboratoriet för kunskapsbearbetning, Linköpings universitet, Tekniska högskolan (författare)

Admissible Heuristics for Optimal Planning

  • Artikel/kapitelEngelska2000


  • LIBRIS-ID:oai:DiVA.org:liu-59900
  • 10.1609/aimag.v21i4.1536doi
  • urn:nbn:se:liu:diva-59900urn

Ingår i deldatabas


  • Ämneskategori:kon swepub-publicationtype
  • Ämneskategori:ref swepub-contenttype


  • <p>There is an error in the paper: the condition for commutativity of actions (section "Commutativity Pruning") must also include that neither action adds a precondition of the other. Thus, commutativity is not the same as Graphplan-style "non-interference".</p>
  • 2
  • Published
  • hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state recomputing the heuristic in every state, while hspr does a regression search from the goal computing a suitable representation of the heuristic only once. Both planners have shown good performance, often producing solutions that are competitive in time and number of actions with the solutions found by Graphplan and sat planners. hsp and hsp r, however, are not optimal planners. This is because the heuristic function is not admissible and the search algorithms are not optimal. In this paper we address this problem. We formulate a new admissible heuristic for planning, use it to guide an ida search, and empirically evaluate the resulting optimal planner over a number of domains. The main contribution is the idea underlying the heuristic that yields not one but a whole family of polynomial and admissible heuristics that trade accuracy for efficiency. The formulation is general and sheds some light on the heuristics used in hsp and Graphplan, and their relation. It exploits the factored (Strips) representation of planning problems, mapping shortest-path problems in state-space into suitably defined shortest-path problems in atom-space. The formulation applies with little variation to sequential and parallel planning, and problems with different action costs.

Ämnesord och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Geffner, Héctor,Universidad Simón Bolivar, Venezuela(SwePub:) (författare)
  • Linköpings universitet.Institutionen för datavetenskap.KPLAB - Laboratoriet för kunskapsbearbetning.(SwePub:liu)2162 (creator_code:org_t)
  • Linköpings universitet.Tekniska högskolan.(SwePub:liu)1751 (creator_code:org_t)

Sammanhörande titlar

  • Ingår i:Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS)AAAI Press978-1-57735-111-5s. 140-149


Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Haslum, Patrik
Geffner, Héctor
Om ämnet
och Data och informa ...
och Datavetenskap da ...
Artiklar i publikationen
Proceedings of t ...
Av lärosätet
Linköpings universitet

Sök utanför SwePub

pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy