School of Computing and Mathematics, University of Huddersfield An Interactive Method for Inducing Operator Descriptions Lee McCluskey Beth Richardson.

Slides:



Advertisements
Similar presentations
SDL+ The Simplest, Useful Enhanced SDL-Subset The documentation is the design, the design is the system! Copyright © SDL Task Force Consortium.
Advertisements

Modelling with expert systems. Expert systems Modelling with expert systems Coaching modelling with expert systems Advantages and limitations of modelling.
Knowledge Engineering for Planning Domain Design Ron Simpson University of Huddersfield.
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Semantics Static semantics Dynamic semantics attribute grammars
AI – Week 17 Machine Learning Applied to AI Planning: LOCM Lee McCluskey, room 2/09
Opmaker2: Efficient Action Schema Acquisition T.L.McCluskey, S.N.Cresswell, N. E. Richardson and M.M.West The University of Huddersfield,UK
ISBN Chapter 3 Describing Syntax and Semantics.
An Integration of Program Analysis and Automated Theorem Proving Bill J. Ellis & Andrew Ireland School of Mathematical & Computer Sciences Heriot-Watt.
ICKEP International Competition for Knowledge Engineering in Planning - A PROPOSAL Lee McCluskey KE TCU.
Making Choices using Structure at the Instance Level within a Case Based Reasoning Framework Cormac Gebruers*, Alessio Guerri †, Brahim Hnich* & Michela.
Object Transition Sequences: A New Form of Abstraction for HTN Planners Lee McCluskey Computing Science Dept, The University.
Towards An Algebraic Formulation of Domain Definitions using Parameterised Machines T. L. McCluskey and R. M.Simpson School of Computing and Engineering.
School of Computing and Mathematics, University of Huddersfield The Induction of Operator Descriptions from Examples and Structural Domain Knowledge Lee.
GIPO II: HTN Planning in a Tool- supported Knowledge Engineering Environment Lee McCluskey Donghong Liu Ron Simpson Department of Computing and Mathematical.
Fall 2007CS 225 Introduction to Software Design Chapter 1.
Knowledge and Systems Research Group, University of Huddersfield B vs OCL: Comparing Specification Languages for Planning Domains Diane Kitchin, Lee McCluskey,
Knowledge Engineering for Automated Planning
Lee McCluskey, University of Huddersfield - EKAW'04 Knowledge Formulation for AI Planning Lee McCluskey Ron Simpson Artform research group Department of.
GIPO [Graphical Interface for Planning with Objects] Demonstration case-tool for Knowledge Engineering to support Domain Independent Planning Ron Simpson.
PDDL: A Language with a Purpose? Lee McCluskey Department of Computing and Mathematical Sciences, The University of Huddersfield.
Academic Advisor: Prof. Ronen Brafman Team Members: Ran Isenberg Mirit Markovich Noa Aharon Alon Furman.
School of Computing and Mathematics, University of Huddersfield Knowledge Engineering: Issues for the Planning Community Lee McCluskey Department of Computing.
University of Toronto Department of Computer Science © Steve Easterbrook. This presentation is available free for non-commercial use with attribution.
ICKEP International Competition for Knowledge Engineering in Planning Lee McCluskey PLANET Knowledge Engineering.
School of Computing and Mathematics, University of Huddersfield PDDL and other languages.. Lee McCluskey Department of Computing and Mathematical Sciences,
Informatics Research Group University of Huddersfield Tool Support for Planning and Plan Analysis within Domains embodying Continuous Change Lee McCluskey.
School of Computing and Mathematics, University of Huddersfield Week 21: Knowledge Acquisition / GIPO Lee McCluskey, room 2/09
Describing Syntax and Semantics
Using GIPO to support learning in knowledge acquisition and automated planning Lee McCluskey and Ron Simpson.
 Software Software  Program vs Software Products Program vs Software Products  Software Characteristics Software Characteristics  Software Crisis.
User Interface Design Chapter 11. Objectives  Understand several fundamental user interface (UI) design principles.  Understand the process of UI design.
Comparing Python and Visual Basic
Systems Analysis – Analyzing Requirements.  Analyzing requirement stage identifies user information needs and new systems requirements  IS dev team.
School of Computing and Mathematics, University of Huddersfield Computing Science: WEEK 17 Announcement: next few weeks… 9 nd Feb: Comparative Programming.
Describing Methodologies PART II Rapid Application Development*
Avalanche Internet Data Management System. Presentation plan 1. The problem to be solved 2. Description of the software needed 3. The solution 4. Avalanche.
Week 6: PDDL, itSIMPLE and running “state of the art” planners Lee McCluskey, room 3/10
1 Intelligent Systems ISCRAM 2013 Validating Procedural Knowledge in the Open Virtual Collaboration Environment Gerhard Wickler AIAI, University.
Author: James Allen, Nathanael Chambers, etc. By: Rex, Linger, Xiaoyi Nov. 23, 2009.
PLANSERVE - overview of an EU proposal for the “Future and Emerging Technologies” Program Lee McCluskey Artform Research.
LANGUAGE TRANSLATORS: WEEK 3 LECTURE: Grammar Theory Introduction to Parsing Parser - Generators TUTORIAL: Questions on grammar theory WEEKLY WORK: Read.
Validated Model Transformation Tihamér Levendovszky Budapest University of Technology and Economics Department of Automation and Applied Informatics Applied.
CSE 219 Computer Science III Program Design Principles.
1 CSC 222: Computer Programming II Spring 2004 See online syllabus at: Course goals:
ISBN Chapter 3 Describing Semantics -Attribute Grammars -Dynamic Semantics.
1 Introduction to Software Engineering Lecture 1.
Illustrations and Answers for TDT4252 exam, June
Slide 12.1 Chapter 12 Implementation. Slide 12.2 Learning outcomes Produce a plan to minimize the risks involved with the launch phase of an e-business.
UHD::3320::CH121 DESIGN PHASE Chapter 12. UHD::3320::CH122 Design Phase Two Aspects –Actions which operate on data –Data on which actions operate Two.
C++ and Ubuntu Linux Review and Practice CS 244 Brent M. Dingle, Ph.D. Game Design and Development Program Department of Mathematics, Statistics, and.
1 CMPT 275 High Level Design Phase Modularization.
Workforce Scheduling Release 5.0 for Windows Implementation Overview OWS Development Team.
Visualization in Problem Solving Environments Amit Goel Department of Computer Science Virginia Tech June 14, 1999.
Murielle Florins 1, Francisco Montero Simarro 2, Jean Vanderdonckt 1, Benjamin Michotte 1 1 Université catholique de Louvain 2 Universidad de Castilla-la-Mancha.
Software Engineering Issues Software Engineering Concepts System Specifications Procedural Design Object-Oriented Design System Testing.
©Ian Sommerville 2006Software Engineering, 8th edition. Chapter 4 Slide 1 Software Processes.
21/1/ Analysis - Model of real-world situation - What ? System Design - Overall architecture (sub-systems) Object Design - Refinement of Design.
Project Information Abstract Project Objectives The objective of this project is to: Create a visual designer that will allow inexperienced end- users.
Investigate Plan Design Create Evaluate (Test it to objective evaluation at each stage of the design cycle) state – describe - explain the problem some.
Analysis. This involves investigating what is required from the new system and what facilities are available. It would probably include:
Advanced Higher Computing Science The Project. Introduction Worth 60% of the total marks for the course Must include: An appropriate interface using input.
Modelling & Simulation of Semiconductor Devices Lecture 1 & 2 Introduction to Modelling & Simulation.
Human Computer Interaction Lecture 21 User Support
CSC 222: Object-Oriented Programming
CMPE 280 Web UI Design and Development August 29 Class Meeting
Problem Solving How do we attack a large problem?
Learning Relational Rules for Goal Decomposition
Generic Tasks In the 80’s, KB engineering used approaches like this:
ENERGY 211 / CME 211 Lecture 27 November 21, 2008.
Presentation transcript:

School of Computing and Mathematics, University of Huddersfield An Interactive Method for Inducing Operator Descriptions Lee McCluskey Beth Richardson Ron Simpson Department of Computing and Mathematical Sciences, The University of Huddersfield

School of Computing and Mathematics, University of Huddersfield Background n Acquiring and maintaining planning domains is acknowledged to be a major problem. Operators can be hard to construct and debug and planners are not built to help in debugging. n We want non-planning experts to use our planning technology. This requires a higher level interface than PDDL ‘code’ n Complex domains make these problems more acute

School of Computing and Mathematics, University of Huddersfield Thrust of this work.. To develop an induction method for creating planning operators that works.. n in complex hierarchical domains n in the context of an “acquisition method” supported by a planning engineering environment We draw from some previous (T.Grant, X.Wang) - our long term aim: The knowledge engineering method/tools should reduce the complexity of the creation process by abstracting away “mathematical details” and reusing “off the shelf” templates. Eventually it should be usable for non- planning-experts.

School of Computing and Mathematics, University of Huddersfield GIPO (papers in ECP’01, ISMIS’02) n An ‘open’ tools environment supporting domain acquisition and domain modelling integrated via a GUI around the Object Centred language OCL h language and associated method. Available free in Linux, Solaris and Windows. GIPO contains domain model editors, planners, a stepper, importer/exporter, animator, random task generator, static analysis tools - AND NOW an induction tool to ease Operator Acquisition

School of Computing and Mathematics, University of Huddersfield Opmaker - INPUTS Offline: Partial domain spec, got via GIPO or other acquisition method:- Objects, object classes (sorts), predicates, invariants Online: Training sequence, initial state, and user ‘clicks’. Example training sequence: pay_fees pk_3 commission truck_2 move truck_2 city1_cl1 city1_cl2 local_roads load_package pk_3 truck_2 city1_cl2 move truck_2 city1_cl2 city3_ts1 road_route_42 unload_package pk_3 truck_2 city3_ts1

School of Computing and Mathematics, University of Huddersfield Opmaker - OUTPUT: A set of Operators/Methods in OCL h Induced Method (HTN operator) has the following structure: - Preconditions - Transitions (Strucural Specification of Op) - Static Constraints - Decomposition (Procedural Specification of Op) - Temporal Constraints

School of Computing and Mathematics, University of Huddersfield Example Training Sequence produces.. (pay_fees(Pk_3),[],[sc(package,Pk_3,[uncertified(Pk_3)] => [waiting(Pk_3),certified(Pk_3)])], []). (commission(Truck_2),[],[sc(truck,Truck_2,[moveable(Truck_2),available(Truck_2)] => [moveable(Truck_2),busy(Truck_2)])], []). (move(Truck_2,City1_cl1,City1_cl2,Local_roads),[],[sc(truck,Truck_2,[at(Truck_2,C ity1_cl1),route_available(Local_roads),connects(Local_roads,City1_cl1,City1_cl 2),in_city(City1_cl1,City1),in_city(City1_cl2,City1)] => [at(Truck_2,City1_cl2)])], []). (load_package(Pk_3,Truck_2,City1_cl2),[se(truck,Truck_2,[at(Truck_2,City1_cl2), moveable(Truck_2),busy(Truck_2)])],[sc(package,Pk_3,[waiting(Pk_3),certified( Pk_3)] => [loaded(Pk_3,Truck_2),certified(Pk_3)])], []). (unload_package(Pk_3,Truck_2,City3_ts1),[],[sc(package,Pk_3,[loaded(Pk_3,Truc k_2),certified(Pk_3)] => [waiting(Pk_3),certified(Pk_3)]),sc(truck,Truck_2,[at(Truck_2,City3_ts1),moveab le(Truck_2),busy(Truck_2)] => [at(Truck_2,City3_ts1),moveable(Truck_2),available(Truck_2)])], []).

School of Computing and Mathematics, University of Huddersfield Example Training Sequence produces.. method(move_package_local(Pk_3,Truck_2), % dynamic constraints [], % list of necessary transitions [sc(package,Pk_3,[at(Pk_3,City1_cl2),uncertified(Pk_3)] => [at(Pk_3,City3_ts1),waiting(Pk_3),certified(Pk_3)]), sc(truck,Truck_2,[at(Truck_2,City1_cl1),moveable(Truck_2),available(Truck_2)] => [at(Truck_2,City3_ts1),moveable(Truck_2),available(Truck_2)])], % static constraints[ route_available(Road_route_42) connects(Road_route_42,City1_cl2,City3_ts1) connects(Road_route_42,City3_ts1,City1_cl2) route_available(Local_roads) connects(Local_roads,City1_cl1,City1_cl2) in_city(City1_cl1,City1) in_city(City1_cl2,City1)], % temporal constraints [before(1,2),before(2,3),before(3,4),before(4,5),before(5,6)], % decomposition[ pay_fees(Pk_3), commission(Truck_2), move(Truck_2,City1_cl1,City1_cl2,Local_roads), load_package(Pk_3,Truck_2,City1_cl2), move(Truck_2,City1_cl2,City3_ts1,Road_route_42), unload_package(Pk_3,Truck_2,City3_ts1)]).

School of Computing and Mathematics, University of Huddersfield RESULTS: “FLAT” DOMAIN MODELS n The Hiking Domain: as shown in paper - a partial domain model was created, then a full operator set was generated by Opmaker, passing all local and global validation checks in the GIPO system. The resulting model was fed into Hoffman’s FF which solved the general hiking problem. This was all done in approximately 1 day’s development. n Other “Flat” domains: Briefcase World, Rocket World and Tyre World: full operator sets induced with little difference to hand-crafted

School of Computing and Mathematics, University of Huddersfield RESULTS: Hierarchical domains Results for Translog and Drum Store showed up problems: n inaccurate constraints: opmaker embodies a simple induction algorithm for generating constraints. The constraint set may therefore need refining. n inaccurate pre-conditions: especially in the hierarchical case, the LHS is not so easy to generate accurately. n undergeneralised parameters: The rule of generalising constants to variables in the object's primitive sorts is sometimes too restrictive. For example, the load_package induced operator in the Translog worlds was only applicable to loading packages into trucks if the training example used involved trucks.

School of Computing and Mathematics, University of Huddersfield Future Work n Induction of recursive hierarchical operators, with more distinctive HTM features (e.g. more conditional filters) n integration of induction method for hierarchical models into GIPO n use of theory refinement to debug initial operator set n evaluation with novice users (students) ongoing

School of Computing and Mathematics, University of Huddersfield Conclusions Opmaker relies on the following cues to help induce operators: n a partial domain model of object sort and behaviour n the completeness and coherence of the example sequences of operators n high level user input, when necessary, in the form of one `click' indicating a choice of substate class DEMONSTRATION: GIPO’s TOOLS INCLUDING OPMAKER INDUCING FLAT OPERATORS