%PDF-1.4 % 9 0 obj << /S /GoTo /D (Outline0.1) >> endobj 12 0 obj (Introduction to search algorithms for planning) endobj 13 0 obj << /S /GoTo /D (Outline0.1.1.3) >> endobj 16 0 obj (Search nodes \046 search states) endobj 17 0 obj << /S /GoTo /D (Outline0.1.2.8) >> endobj 20 0 obj (Search for planning) endobj 21 0 obj << /S /GoTo /D (Outline0.1.3.12) >> endobj 24 0 obj (Common procedures for search algorithms) endobj 25 0 obj << /S /GoTo /D (Outline0.2) >> endobj 28 0 obj (Uninformed search algorithms) endobj 29 0 obj << /S /GoTo /D (Outline0.2.1.17) >> endobj 32 0 obj (Breadth-first search without duplicate detection) endobj 33 0 obj << /S /GoTo /D (Outline0.2.2.19) >> endobj 36 0 obj (Breadth-first search with duplicate detection) endobj 37 0 obj << /S /GoTo /D (Outline0.2.3.21) >> endobj 40 0 obj (Random walk) endobj 41 0 obj << /S /GoTo /D (Outline0.3) >> endobj 44 0 obj (Heuristic search algorithms) endobj 45 0 obj << /S /GoTo /D (Outline0.3.1.23) >> endobj 48 0 obj (Heuristics: definition and properties) endobj 49 0 obj << /S /GoTo /D (Outline0.3.2.31) >> endobj 52 0 obj (Systematic heuristic search algorithms) endobj 53 0 obj << /S /GoTo /D (Outline0.3.3.43) >> endobj 56 0 obj (Heuristic local search algorithms) endobj 57 0 obj << /S /GoTo /D [58 0 R /Fit ] >> endobj 68 0 obj << /Length 1081 /Filter /FlateDecode >> stream xڵWK6Wh!×-4mlCЃc^ܕ,z_jlorEDFH(#r5'+h=92!ݟFۧ> yG!T ,%hY^z@A9Z+tFK d V\W)M#&!S aR"$L+@_EXA6:voK:WU&\(q)VsH" ã@KFmӵs;_]mi(0.>Bbnb僦!ޘ]obߖ\Nʟ~u$h _&Fp+]MύXñ~%b?]zUs) b`Z10(]# [DX8XEiPTQGȪ 0p
N{a=:A 4j2hHCf7hjZ^C#@otGxkpk$=֍7Ą`0#'0Gp=eөcjd@F2fŹ|Y ˟m-qGsӰA#?")