HW5: Planning. PDDL Planning Domain Description Language Based on STRIPS with various extensions Originally defined by Drew McDermott (Yale) and others.

Slides:



Advertisements
Similar presentations
Planning.
Advertisements

In the name of God An Application of Planning An Application of PlanningJSHOP BY: M. Eftekhari and G. Yaghoobi.
CSE391 – 2005 NLP 1 Planning The Planning problem Planning with State-space search.
1 Planning Chapter CMSC 471 Adapted from slides by Tim Finin and Marie desJardins. Some material adopted from notes by Andreas Geyer-Schulz,
Hierarchical Task Network (HTN) Planning Hai Hoang 4/17/2007.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Causal-link Planning II José Luis Ambite. 2 CS 541 Causal Link Planning II Planning as Search State SpacePlan Space AlgorithmProgression, Regression POP.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Chapter 11 Planning Planning examples
State Transition Systems  linear planning  bounded model checking  conditional planning  model checking  state transition description languages: oPDDL.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Classical Planning via Plan-space search COMP3431 Malcolm Ryan.
IPC 2004 Probabilistic Planning Track Michael L. LittmanHåkan L. S. Younes Rutgers UniversityCarnegie Mellon University.
All rights reserved ©L. Manevitz Lecture 61 Artificial Intelligence Planning System L. Manevitz.
Strong Method Problem Solving
1 Chapter 16 Planning Methods. 2 Chapter 16 Contents (1) l STRIPS l STRIPS Implementation l Partial Order Planning l The Principle of Least Commitment.
Planning systems and its’ applications in software engineering Saša Tošić, M. Ivanović Risan, 2007.
Classical Planning via State-space search COMP3431 Malcolm Ryan.
CPSC 322 Introduction to Artificial Intelligence November 19, 2004.
Towards An Algebraic Formulation of Domain Definitions using Parameterised Machines T. L. McCluskey and R. M.Simpson School of Computing and Engineering.
Learning Applicability Conditions in AI Planning from Partial Observations Hankz Hankui Zhuo a, Derek Hao Hu a, Chad Hogg b, Qiang Yang a and Hector Munoz-Avila.
Planning CSE 473. © Daniel S. Weld Topics Agency Problem Spaces Search Knowledge Representation Reinforcement Learning InferencePlanning Supervised.
School of Computing and Mathematics, University of Huddersfield PDDL and other languages.. Lee McCluskey Department of Computing and Mathematical Sciences,
1 Pertemuan 17 Planning Matakuliah: T0264/Intelijensia Semu Tahun: Juli 2006 Versi: 2/1.
Modelling planning problems using PDDL
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
Dynamic Bayesian Networks CSE 473. © Daniel S. Weld Topics Agency Problem Spaces Search Knowledge Representation Reinforcement Learning InferencePlanningLearning.
Classical Planning via State-space search COMP3431 Malcolm Ryan.
A Comparative Analysis of PDDL-Based Planning Using Multiple AI Planners Rifat Sabbir Mansur ( ) Md. Arif Hasnat ( ), Md. Rafatul Amin ( )
Planning II CSE 573. © Daniel S. Weld 2 Logistics Reading for Wed Ch 18 thru 18.3 Office Hours No Office Hour Today.
1 CPN Tools Future work. 2 Overview Language extensions Manual simulation Analysis techniques Editing Other.
Engineering H192 - Computer Programming The Ohio State University Gateway Engineering Education Coalition Lect 3P. 1Winter Quarter Structured Engineering.
HW6: Planning. PDDL Planning Domain Description Language Based on STRIPS with various extensions Originally defined by Drew McDermott (Yale) and others.
Reusable Software Architectures Feature Modeling for Software Product Lines SEG 3202Nour EL-Kadri.
The Uncolor Wheel. Description: You are going to create the untypical, unexpected color wheel. You may have created a color wheel in the past that looks.
Week 6: PDDL, itSIMPLE and running “state of the art” planners Lee McCluskey, room 3/10
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Nonlinear Planning Lecture Module 9. Nonlinear Planning with Goal Set Generate a plan by doing some work on one goal, then some on another and then some.
State-Space Search and the STRIPS Planner Searching for a Path through a Graph of Nodes Representing World States.
Planning, page 1 CSI 4106, Winter 2005 Planning Points Elements of a planning problem Planning as resolution Conditional plans Actions as preconditions.
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
DBLink3 Reporting Software for Model 22 Personal Noise Dosemeter system.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
ECSE Software Engineering 1I HO 4 © HY 2012 Lecture 4 Formal Methods A Library System Specification (Continued) From Specification to Design.
Automated Planning Dr. Héctor Muñoz-Avila. What is Planning? Classical Definition Domain Independent: symbolic descriptions of the problems and the domain.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Engineering H192 - Computer Programming Gateway Engineering Education Coalition Lect 3P. 1Winter Quarter Structured Engineering Problem Solving and Logic.
Advanced Problem Solving Systems: Planning Lecture Module 8.
Introduction to Artificial Intelligence Class 1 Planning & Search Henry Kautz Winter 2007.
Graphplan/ SATPlan Chapter Some material adapted from slides by Jean-Claude Latombe / Lise Getoor.
1/16 Planning Chapter 11- Part1 Author: Vali Derhami.
Classical Planning Chapter 10 Mausam / Andrey Kolobov (Based on slides of Dan Weld, Marie desJardins)
AI – Week 5 More on HEURISTICS and domain modelling Lee McCluskey, room 2/09
What is different or special about this painting? Answer in your sketchbook folder When you finish, you may finish your sketchbook cover.
Mixing Complementary Colors to create neutrals. Complementary colors are directly across from one another on the color wheel. When mixed they get various.
Art Class for 1 st Grade with Ms. Jenzano Click the Paint Brush to Move on.
Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, CA
Classical Planning via State-space search
Learning Teleoreactive Logic Programs by Observation
HW3: Planning.
HW5: Planning.
Introduction Defining the Problem as a State Space Search.
Colors.
CSE P573 Introduction to Artificial Intelligence Class 1 Planning & Search INTRODUCE MYSELF Relative new faculty member, but 20 years in AI research.
Planning as Satisfiability with Blackbox
Mixing Colours… How Many Greens?
What Color is it?.
CSE (c) S. Tanimoto, 2002 State-Space Search
Chapter 2 Representations for Classical Planning
CSE (c) S. Tanimoto, 2004 State-Space Search
Presentation transcript:

HW5: Planning

PDDL Planning Domain Description Language Based on STRIPS with various extensions Originally defined by Drew McDermott (Yale) and others Used in the biennial International Planning Competition (IPC) series Many planners use it as a standard input

PDDL Representation A task specified via two files: domain file and problem file Problem file gives objects, initial state, and goal state Domain file gives predicates and operators; these may be re-used for different problem files Domain file corresponds to the transition system, the problem files constitute instances in that system

Blocks Word Domain File (define (domain hw5) (:requirements :strips) (:constants red green blue yellow) (:predicates (on ?x ?y) (on-table ?x) (block ?x) … (clean ?x)) (:action pick-up :parameters (?obj1) :precondition (and (clear ?obj1) (on-table ?obj1) (arm-empty)) :effect (and (not (on-table ?obj1)) (not (clear ?obj1)) (not (arm-empty)) (holding ?obj1))) … more actions...)

Blocks Word Problem File (define (problem 00) (:domain hw5) (:objects A B C) (:init (arm-empty) (block A) (color A red) (on-table A) (block B) (on B A) (block C) (on C B) (clear C)) (:goal (and (on A B) (on B C))))

Blackbox planner Blackbox planner converts STRIPS-like problems into Boolean satisfiability problems Input given in PDDL (domain and problem) Solves with a variety of satisfiability engines Open source; executables for Linux, Mac, Windows from –Do blackbox -help for options –Installed on gl as ~finin/pub/blackbox

Blackbox planner > git clone … > cd hw5; ls domain.pddl p00.pddl p0.pddl p1.pddl p2.pddl p3.pddl p4.pddl README.md session.txt > ~finin/pub/blackbox -o domain.pddl -f p00.pddl blackbox version Loading domain file: domain.pddl Loading fact file: p00.pddl... Begin plan 1 (unstack c b) 2 (put-down c) 3 (unstack b a) 4 (stack b c) 5 (pick-up a) 6 (stack a b) End plan... Total elapsed time: 0.01 seconds...

(1) Extend the domain: new objects Paint sprayers. Each sprayer can only paint in one color (e.g., red, green, blue). Paint cans. A paint can holds only only color of paint. Brushes. A brush can either be clean or loaded with paint of a particular color. Water bucket. A water bucket is used to wash brushes.

(2) Extend the domain: new actions painting an object with a sprayer painting an object with a brush and can loading a brush with paint of a given color washing a brush, making it clean

Action preconditions To paint an object, it must be on the table and clear Painting with a sprayer: just pick it up and spray To paint something a color with a brush, it must be loaded with paint of that color. To load paint bush with a color, you must be holding brush, brush must be clean and there must be a paint can with that color that is clear. When a brush is loaded with a color it is not clean. To wash a brush, making it clean, you must have a water bucket that has nothing on it (i.e., is clear) and you have to be holding the brush

Problem p1.ppd ;; There is only one block, A, which is on the table. A can with ;; red paint is on the table. There is a clean brush on the ;; table. Our goal is to have A be red and the arm empty. (define (problem 1) (:domain hw6) (:objects.... ) (:init (arm-empty)... block A on the table with nothing on it a red paint can on the table with nothing on it a clean brush is on the table with nothing on it... ) (:goal (and (arm-empty)... A is red … )))