Week 4: Introduction to AI Planning Lee McCluskey, room 2/07

Slides:



Advertisements
Similar presentations
Planning.
Advertisements

Knowledge Engineering for Planning Domain Design Ron Simpson University of Huddersfield.
REVIEW : Planning To make your thinking more concrete, use a real problem to ground your discussion. –Develop a plan for a person who is getting out of.
CSE391 – 2005 NLP 1 Planning The Planning problem Planning with State-space search.
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
CLASSICAL PLANNING What is planning ?  Planning is an AI approach to control  It is deliberation about actions  Key ideas  We have a model of the.
Software Requirements
Formal Modelling of Reactive Agents as an aggregation of Simple Behaviours P.Kefalas Dept. of Computer Science 13 Tsimiski Str Thessaloniki Greece.
Opmaker2: Efficient Action Schema Acquisition T.L.McCluskey, S.N.Cresswell, N. E. Richardson and M.M.West The University of Huddersfield,UK
1 Classical STRIPS Planning Alan Fern * * Based in part on slides by Daniel Weld.
AI – Week 23 – TERM 2 Machine Learning and Natural Language Processing Lee McCluskey, room 3/10
Multi-agent Planning Amin Atrash. Papers Dynamic Planning for Multiple Mobile Robots –Barry L. Brummit, Anthony Stentz OBDD-based Universal Planning:
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.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
Train Control Language Teaching Computers Interlocking By: J. Endresen, E. Carlson, T. Moen1, K. J. Alme, Haugen, G. K. Olsen & A. Svendsen Synthesizing.
Towards An Algebraic Formulation of Domain Definitions using Parameterised Machines T. L. McCluskey and R. M.Simpson School of Computing and Engineering.
Artificial Intelligence Chapter 11: Planning
The Semantic Web Week 18: Web Agents that can reason … Module Website: Practical this week:
Knowledge and Systems Research Group, University of Huddersfield B vs OCL: Comparing Specification Languages for Planning Domains Diane Kitchin, Lee McCluskey,
AI Week 22 Machine Learning Data Mining Lee McCluskey, room 2/07
Software Requirements
Experiences with an Architecture for Intelligent Reactive Agents By R. Peter Bonasso, R. James Firby, Erann Gat, David Kortenkamp, David P Miller, Marc.
Planning CSE 473. © Daniel S. Weld Topics Agency Problem Spaces Search Knowledge Representation Reinforcement Learning InferencePlanning Supervised.
1 CS 501 Spring 2005 CS 501: Software Engineering Lecture 10 Requirements 4.
AI – Week 5 An Introduction to AI Planning Lee McCluskey, room 2/07
PDDL: A Language with a Purpose? Lee McCluskey Department of Computing and Mathematical Sciences, The University of Huddersfield.
7M701 1 Software Engineering Software Requirements Sommerville, Ian (2001) Software Engineering, 6 th edition: Chapter 5
The Semantic Web Week 18: Part 4 Introduction to Web Services and Intelligent Web Agents Module Website: Practical.
AI – Week 8 AI + 2 Player Games Lee McCluskey, room 3/10
Software Requirements
Marakas: Decision Support Systems, 2nd Edition © 2003, Prentice-Hall Chapter Chapter 7: Expert Systems and Artificial Intelligence Decision Support.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
AUTOMATED PLANNING SOFTWARE: ENABLING TECHNOLOGY FOR (Intelligent) AUTONOMOUS AGENTS Lee McCluskey Professor of Software Technology, Dept of Informatics,
School of Computing and Mathematics, University of Huddersfield PDDL and other languages.. Lee McCluskey Department of Computing and Mathematical Sciences,
Chapter 12: Intelligent Systems in Business
Automated Planning and HTNs Planning – A brief intro Planning – A brief intro Classical Planning – The STRIPS Language Classical Planning – The STRIPS.
Software engineering Olli Alm Lecture 2: requirements, modelling & representation.
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
Week 6: PDDL, itSIMPLE and running “state of the art” planners Lee McCluskey, room 3/10
Ontologies Reasoning Components Agents Simulations Belief Update, Planning and the Fluent Calculus Jacques Robin.
Agent Model for Interaction with Semantic Web Services Ivo Mihailovic.
CHA2555 Week2: Knowledge Representation, Logic and Planning Lee McCluskey First term:
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
Lecture 7: Requirements Engineering
Efficient RDF Storage and Retrieval in Jena2 Written by: Kevin Wilkinson, Craig Sayers, Harumi Kuno, Dave Reynolds Presented by: Umer Fareed 파리드.
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.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Testing OO software. State Based Testing State machine: implementation-independent specification (model) of the dynamic behaviour of the system State:
University of Kurdistan Artificial Intelligence Methods (AIM) Lecturer: Kaveh Mollazade, Ph.D. Department of Biosystems Engineering, Faculty of Agriculture,
AI – Week 5 More on HEURISTICS and domain modelling Lee McCluskey, room 2/09
Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri CS 440 / ECE 448 Introduction to Artificial Intelligence.
Robust Planning using Constraint Satisfaction Techniques Daniel Buettner and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science.
Reinforcement Learning AI – Week 22 Sub-symbolic AI Two: An Introduction to Reinforcement Learning Lee McCluskey, room 3/10
Automatic Web Service Orchestration using AI Planners Antonio Kantek COMS E6125 Web Enhanced Information Management Professor Gail Kaiser.
Planning I: Total Order Planners Sections
Natural Language Processing AI Revision Lee McCluskey, room 2/07
Search Engine Optimization © HiTech Institute. All rights reserved. Slide 1 Click to edit Master title style What is Business Analysis Body of Knowledge?
Object-Oriented Software Engineering Practical Software Development using UML and Java Chapter 1: Software and Software Engineering.
Whole Test Suite Generation. Abstract Not all bugs lead to program crashes, and not always is there a formal specification to check the correctness of.
Artificial Intelligence, simulation and modelling.
AI – Week 3 An Introduction to AI Planning Lee McCluskey, room 3/10
1 Software Requirements Descriptions and specifications of a system.
CS220:INTRODUCTION TO SOFTWARE ENGINEERING CH1 : INTRODUCTION 1.
CHAPTER 1 Introduction BIC 3337 EXPERT SYSTEM.
Web Ontology Language for Service (OWL-S)
Course Logistics CS533: Intelligent Agents and Decision Making
Presentation transcript:

Week 4: Introduction to AI Planning Lee McCluskey, room 2/07

Artform Research Group Overview Intelligent (virtual) Agents are defined as.. Software programs capable of autonomous behaviour in dynamic unpredictable environments THAT IS – THEY CAN  PLAN to solve goals  Execute and monitor plans  Communicate/co-operate  Sense/Observe/Gather information  Adapt and Learn

Artform Research Group Example Applications AUTOMATIC CONTROL: of industrial processes, traffic, industrial robots, spacecraft, underwater robots Eg NASA’s Remote Agent Experiment CRISIS MANAGEMENT: in military applications, accidents, evacuations, forest fire fighting USER SUPPORT: for project planning, web search, web service composition SIMULATION: games software AI Planning has to be cost effective - makes plans more quickly than people? more reliable plans? more efficient plans?

Artform Research Group r1 r3 r5 r7 r4 r2 bracelet locket ring +Sword +Cudgel Key-1 r6 p45 Key-2 troll orc p57 p25 p35 p24 p47 Sample Goal = Boromir kills Troll Aragorn acquiresThe Ring p56 Aragorn Boromir +Knife shield spell golem lock-2 lock-1 p67 p12 8: MOVE_INTO_ROOM P67 BOROMIR R6 R7 9: MOVE_TO_PASSAGE P67 BOROMIR R7 10: EXCHANGE BOROMIR R7 P67 LOCKET KEY1 11: MOVE_INTO_ROOM P67 BOROMIR R7 R6 12: MOVE_TO_PASSAGE P56 BOROMIR R6 13: MOVE_INTO_ROOM P56 BOROMIR R6 R5 14: UNLOCK_PASSAGE BOROMIR R5 P25 KEY1 15: MOVE_TO_PASSAGE P25 ARAGORN R5 16: MOVE_INTO_ROOM P25 ARAGORN R5 R2 17: FIGHT_AND_KILL_MONSTER ARAGORN R2 P12 SHIELD SWORD ORC 18: MOVE_TO_PASSAGE P12 ARAGORN R2 19: MOVE_INTO_ROOM P12 ARAGORN R2 R1 20: PICK_UP_TREASURE ARAGORN R1 RING 0: MOVE_TO_PASSAGE P67 BOROMIR R7 1: MOVE_TO_PASSAGE P45 ARAGORN R4 2: MOVE_INTO_ROOM P45 ARAGORN R4 R5 3: GET_PROTECTION ARAGORN R5 SHIELD 4: MOVE_INTO_ROOM P67 BOROMIR R7 R6 5: KILL_SLEEPING_MONSTER BOROMIR R6 P56 KNIFE TROLL 6: PICK_UP_TREASURE BOROMIR R6 LOCKET 7: MOVE_TO_PASSAGE P67 BOROMIR R6 PLAN generated by AI is shown opposite (its not optimal!)

Artform Research Group Automated (AI) Planning The scope of ‘AI Planning’ is the synthesis (generation) and execution of PLANS. That is, AI Planners reason with actions and generate plans. NECESSARY INPUT: A representation of ACTIONS, OBJECTS, GOALS, INITIAL STATE (possibly: resources, agents, constraints,..) OUTPUT FROM AI PLANNING: PLANS - (partial) orderings of actions guaranteed to achieve the goals when applied to the initial state

Artform Research Group Planning vs Scheduling Although these activities are similar, the difference is identified as follows: “Scheduling is the allocation of actions (processes) to resources (processors) whereas.. Planning involves deciding which particular actions to use and in which order to use them in”

Artform Research Group Usual (abstract) Architecture of Planners DOMAIN MODEL PLANNING ENGINE INTERFACE

Artform Research Group Simple Planning Domain Models Domain models typically contain 1. Types or classes of objects 2. Actions (represented by Operators) that change state of objects A TASK associated with a domain model is defined by: 1. An INITIAL STATE 2. GOAL(S)

Artform Research Group Environmental Assumptions In simple ‘applications’ we ASSUME: finite world (rather than infinite) deterministic actions (rather than non- deterministic) completely observable (rather than partially observable) instantaneous (rather than durative actions) unchanging, closed world (rather than open, dynamic world) infinite resources

Artform Research Group Environmental Assumptions The “FRAME PROBLEM” is a source of concern in AI planning – the logic of stating what is not affected by an action Often we assume an action satisfies the RULE of DEFAULT PERSISTENCE: If an action specification does not specify that a fact / object changes then it does not change.. things persist by default

Artform Research Group Languages for writing Domain Models… Literal Based: The “Planner Domain Definition Language” (PDDL) is the most commonly used language to communicate Planning Domain Models and associated Tash Descriptions Object-Centred: At Huddersfield we have pioneered the use of “object based” languages – the simple blocks world domain model is object centred.

Artform Research Group The Modelling of States A STATE represents a situation or snapshot of an application. This is sometimes called a WORLD STATE, STATES of a literal-based domain model are most simply defined as conjunctions of ground predicates (like a relational database for each state) In a object-centred domain model, as well as world states, dynamic OBJECTS have their own state also (sometimes called ‘substate’). A world state therefore conisists of a conjunction of the substates of each object.

Artform Research Group The Modelling of Actions This is CENTRAL to planning. In a literal based domain model, actions are modelled as PRE and POST conditions in the form of PRECONDITION SET ADD SET DELETE SET In an object-centred domain model, we use a more structured form: PREVAIL CONDITION NECESSARY OBJECT TRANSITIONS CONDITIONAL OBJECT TRANSITIONS

Artform Research Group Operator Schema - exs op(pick_up_off_table(X,G,T), [ ], [trans(X, [clear(X),on_table(X,T)],[lifted(X)]), trans(G, [empty(G)],[grips(G,X)]) ], [ ]). op(move(R,A,B), % prevail [condition(A,[can_fly(A,B)])], % necessary [ trans(R,[position(R,A), fuel_full(R)], [position(R,B), fuel_empty(R)] ) ], % conditional [ ]). Name+parameters Prevail Necessary Transitions Conditional Transitions

Artform Research Group Problems (aka Tasks) task1 :- start( [ condition(a,[on_table(a,t)]) ], [ state(g, [empty(g)]), state(a, [clear(a),on(a,b)]), state(b, [on_table(b,t)]), state(c,[clear(c), on_table(c,t)]) ] ). task1 :- start( [ condition(r2,[position(r2,paris)]) ], [ state(c1,[at(c1,london)]), state(c2,[at(c2,london)]), state(c3,[at(c3,london)]), state(c4,[at(c4,london)]), state(r1,[position(r1,london),fuel_full(r1)]), state(r2,[position(r2,london),fuel_full(r2)]), state(london, [can_fly(london,paris),can_fly(london,jfk)]), state(paris, [can_fly(paris,london),can_fly(paris,jfk)]), state(jfk, [can_fly(jfk,paris),can_fly(jfk,london)]) ] ). Goal Condition(s) Initial State

Artform Research Group PLANS Are what planners generate. They are orders of instantiated operator schemas. They should be: CORRECT - preconditions are satisfied COMPLETE - achieve the final goal OPTIMAL - no shorter or more efficient plan exists A simple task or planning problem is defined by: - An INITIAL STATE - A GOAL - A set of OPERATOR schema

Artform Research Group PLANS- examples [condition(a,[on_table(a,t2)]), condition(b,[on(b,c)]), condition(d,[lifted(d)])] achieved by sequence [pick_up_off_block(a,b,g,t1), put_down_on_table(a,g,t2), pick_up_off_table(b,g,t1), put_down_on_block(b,c,g,t), pick_up_off_table(d,g,t)] [condition(c1,[at(c1,jfk)]),condition(c2,[at(c2,paris)])] achieved by sequence [load(c1,r1,london),move(r1,london,jfk), load(c2,r2,london),move(r2,london,paris), unload(c2,r2,paris),unload(c1,r1,jfk)]

Artform Research Group Conclusions Plan domain model languages are logic-like formal specification languages for capturing the physics of a domain Traditionally planning domains contain things like objects, states, operators, constraints.

Artform Research Group Resource For one of the fastest and most used planners in the world (FF) google “FF planner homepage download”