lecture10

Lecture10 - Planning as Search page 1 of 9 Artificial Intelligence Search-Based Planning Russell and Norvig Chapter 11

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Planning as Search; page 1 of 9 Artificial Intelligence Search-Based Planning Russell and Norvig - Chapter 11 http://www.ldc.usb.ve/~hector/reports/hsp-aij.ps Planning as Heuristic Search, Bonet and Geffner see also Planning as Search; page 2 of 9 AIPS-98 Planning Competition Round Round 1 Round 2 Planner BLACKBOX HSP IPP STAN BLACKBOX HSP IPP STAN Av. Time 1.49 35.48 7.40 55.41 2.46 25.87 17.37 1.33 Solved 63 82 63 64 8 9 11 7 Shortest 55 61 49 47 6 5 8 4 Planning as Search; page 3 of 9 Planning as Search perform a regular A* search from the start state the only problem is to come up with a good heuristic function initial state At(Home) goal state operators Sells(SM, Bananas) Sells(HWS, Drill) Sells(SM, Milk) At(Home) Go(here, there) Precond: At(here) Effect: At(there) AND NOT At(here) Buy(x, store) Precond: At(store) and Sells(store,x) Effect: Have(x) Have(Bananas) Have(Milk) Have(Drill) Planning as Search; page 4 of 9 Planning as Search perform a regular A* search from the start state...
View Full Document

This note was uploaded on 02/14/2010 for the course CSCI 561 at USC.

Page1 / 9

Lecture10 - Planning as Search page 1 of 9 Artificial Intelligence Search-Based Planning Russell and Norvig Chapter 11

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online