tailieunhanh - Artificial Intelligence - Lecturer 12: Planning

Outline: Planning problem, state-space search, partial-order planning, planning graphs, planning with propositional logic. Planning is the task of determining a sequence of actions that will achieve a goal. Domain independent heuristics and strategies must be based on a domain independent representation. | Artificial Intelligence For HEDSPI Project Lecturer 12 - Planning Lecturers Thanh Huong Duc Khanh Dr. Hai V. Pham HUST 1 Outline Planning problem State-space search Partial-order planning Planning graphs Planning with propositional logic 2 2 1 Search vs. planning Consider the task get milk bananas and a cordless drill Standard search algorithms seem to fail miserably Planning problem Planning is the task of determining a sequence of actions that will achieve a goal. Domain independent heuristics and strategies must be based on a domain independent representation General planning algorithms require a way to represent states actions and goals STRIPS ADL PDDL are languages based on propositional or first-order logic Classical planning environment fully observable deterministic finite static and discrete. 2 Additional complexities Because the world is . Dynamic Stochastic Partially observable And because actions take time have continuous effects AI Planning background Focus on classical planning assume none of the above Deterministic static fully observable Basic Most of the recent progress Ideas often also useful for more complex problems 6