Planning systems and its’ applications in software engineering Saša Tošić, M. Ivanović Risan, 2007.

Slides:



Advertisements
Similar presentations
PhUSE 2010 Unit Testing and Code Coverage Assessment with SASUnit - Key Technologies for Development of reliable SAS Macros - HMS Analytical Software.
Advertisements

Learning Procedural Planning Knowledge in Complex Environments Douglas Pearson March 2004.
Knowledge Engineering for Planning Domain Design Ron Simpson University of Huddersfield.
SHOP2: An HTN Planning System Nau, D.S., Au, T.C., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D. and Yaman, F. (2003) "SHOP2: An HTN Planning System",
Abstraction and Modular Reasoning for the Verification of Software Corina Pasareanu NASA Ames Research Center.
FUP - Formal Unified Process MSc.Miroslav Líška Slovak University of Technology Faculty of Informatics and Information.
Time Constraints in Planning Sudhan Kanitkar
Tellabs Internal and Confidential Implementing Soak Testing for an Access Network Solution Presented by: Timo Karttunen Supervisor: Raimo Kantola.
Alternate Software Development Methodologies
Formal Specification of Topological Relations Erika Asnina, Janis Osis and Asnate Jansone Riga Technical University The 10th International Baltic Conference.
ELSE – eLearning in Software Engineering Stanimir Stoyanov, Distributed eLearning Center (DeLC), University of Plovdiv.
ProActive Task Manager Component for SEGL Parameter Sweeping Natalia Currle-Linde and Wasseim Alzouabi High Performance Computing Center Stuttgart (HLRS),
Model-Based Programming: Executable UML with Sequence Diagrams By Ruben Campos Cal State L.A. Computer Science Thesis Work Spring 2007.
SOFTWARE ENGINEERING ONTOLOGY A DEVELOPMENT METHODOLOGY Projects: eLSE & SELBO Iveta Georgieva.
SEERE, Neum 2009 Runtime verification of Java programs using ITL Vladimir Valkanov, Damyan Mitev Plovdiv, Bulgaria.
Knowledge and Systems Research Group, University of Huddersfield B vs OCL: Comparing Specification Languages for Planning Domains Diane Kitchin, Lee McCluskey,
GIPO [Graphical Interface for Planning with Objects] Demonstration case-tool for Knowledge Engineering to support Domain Independent Planning Ron Simpson.
Programming Languages Structure
School of Computing and Mathematics, University of Huddersfield PDDL and other languages.. Lee McCluskey Department of Computing and Mathematical Sciences,
Chapter 18 Testing Conventional Applications
Automated Planning and HTNs Planning – A brief intro Planning – A brief intro Classical Planning – The STRIPS Language Classical Planning – The STRIPS.
© 2006 Pearson Addison-Wesley. All rights reserved2-1 Chapter 2 Principles of Programming & Software Engineering.
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
MCA –Software Engineering Kantipur City College. Topics include  Formal Methods Concept  Formal Specification Language Test plan creation Test-case.
Automatic Software Testing Tool for Computer Networks ARD Presentation Adi Shachar Yaniv Cohen Dudi Patimer
MDC Open Information Model West Virginia University CS486 Presentation Feb 18, 2000 Lijian Liu (OIM:
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
Introduction to Jadex programming Reza Saeedi
WebFOCUS Developer Studio Update Dimitris Poulos Technical Director September 3, 2015 Copyright 2009, Information Builders. Slide 1.
Using Visual Logic To Teach A First Course In Programming Logic
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
Chapter 5 - Writing a Problem Domain Class Definition1 Chapter 5 Writing a Problem Domain Class Definition.
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.
Testovid - an environment for testing almost any aspect of student assignments I. Pribela, S. Tošić, M. Ivanović, Z. Budimac Risan, September 2007.
A Z Approach in Validating ORA-SS Data Models Scott Uk-Jin Lee Jing Sun Gillian Dobbie Yuan Fang Li.
Agent Model for Interaction with Semantic Web Services Ivo Mihailovic.
VERIFICATION OF ASPECT ORIENTED MODELS BY DON MARTIN JAYASHREE VENKIPURAM PATHANGI PIYUSH SRIVASTAVA REFERENCES F. Mostefaoui and J. Vachon,” Design level.
CHA2555 Week2: Knowledge Representation, Logic and Planning Lee McCluskey First term:
COP 3530 PROGRAM, FILE & DATA STRUCTURES Syllabus Syllabus Lab Information Lab Information Overrides Overrides Questions? Questions?
Voltage Control of Distribution Network Using an Artificial Intelligence Planning Method Jianing Cao 1 Keith Bell 1 Amanda Coles 2 Andrew Coles 2 1. Department.
Formalizing the Asynchronous Evolution of Architecture Patterns Workshop on Self-Organizing Software Architectures (SOAR’09) September 14 th 2009 – Cambrige.
Using Formal Verification to Exhaustively Verify SoC Assemblies by Mark Handover Kenny Ranerup Applications Engineer ASIC Consultant Mentor Graphics Corp.
1 Chapter Overview Preparing to Upgrade Performing a Version Upgrade from Microsoft SQL Server 7.0 Performing an Online Database Upgrade from SQL Server.
An Ontological Framework for Web Service Processes By Claus Pahl and Ronan Barrett.
CS Data Structures I Chapter 2 Principles of Programming & Software Engineering.
LHCb Software Week November 2003 Gennady Kuznetsov Production Manager Tools (New Architecture)
FDT Foil no 1 On Methodology from Domain to System Descriptions by Rolv Bræk NTNU Workshop on Philosophy and Applicablitiy of Formal Languages Geneve 15.
XML Grammar and Parser for WSOL Kruti Patel, Vladimir Tosic, Bernard Pagurek Network Management & Artificial Intelligence Lab Department of Systems & Computer.
The Category-Partition Method for Specifying and Generating Functional Tests. Thomas J. Ostrand and Marc J.Balcer [ CACM,1988 ]. Slides from Prof. Shmuel.
© 2006 Pearson Addison-Wesley. All rights reserved2-1 Chapter 2 Principles of Programming & Software Engineering.
Java™ How to Program, 9/e © Copyright by Pearson Education, Inc. All Rights Reserved.
© 2006 Pearson Addison-Wesley. All rights reserved 2-1 Chapter 2 Principles of Programming & Software Engineering.
Software Engineering and Object-Oriented Design Topics: Solutions Modules Key Programming Issues Development Methods Object-Oriented Principles.
CSI 3125, Preliminaries, page 1 SERVLET. CSI 3125, Preliminaries, page 2 SERVLET A servlet is a server-side software program, written in Java code, that.
UML for Behavior-Oriented Multi-Agent Simulations Christoph Oechslein, Franziska Klügl, Rainer Herrler, and Frank Puppe University Würzburg, Germany.
Concepts and Realization of a Diagram Editor Generator Based on Hypergraph Transformation Author: Mark Minas Presenter: Song Gu.
Tomás BarrosMonday, April 18, 2005FIACRE Toulouse p. 1 Behavioural Models for Hierarchical Components Tomás Barros, Ludovic Henrio and Eric Madelaine.
LOAD RUNNER. Product Training Load Runner 3 Examples of LoadRunner Performance Monitors Internet/Intranet Database server App servers Web servers Clients.
What’s a Computer?. The Basics A computer is a machine that manipulates data based on a list of instructions called a program.
Solvency II Tripartite template V2 and V3 Presentation of the conversion tools proposed by FundsXML France.
CSC 243 – Java Programming, Fall, 2008 Tuesday, September 30, end of week 5, Interfaces, Derived Classes, and Abstract Classes.
Learning Activity Management System - LAMS
Independent Study of Ontologies
Additive and Multiplicative Relationships
Real-Time Attack Detection in CPS
Chapter 6 Methods: A Deeper Look
بسمه تعالی کارگاه ارزشیابی پیشرفت تحصیلی
Testing versus instance generation
Chapter 8 Classes and Objects: A Deeper Look
Presentation transcript:

Planning systems and its’ applications in software engineering Saša Tošić, M. Ivanović Risan, 2007

Contents What are planning systems Agent planning package Planning systems and SE Example

What are planning systems? Action-based systems that generates plans Plan is a sequence of parameterized actions which transforms initial states into a goal state Planning formalisms and languages: Strips, ADL, PDDL … PDDL (planning domain definition language): standard planning language

Example Initial State Planning sequence Plan: A(x, y), B(x, y), C(x, y) Goal State Temporary states A(x, y)C(x, y)B(x,y)

What do we need? Planning instance Planning Domain Actions Predicates Functions Types Constants Planning problem Initial state of a system Goal (set of tasks to be achieved)

Actions in planning systems Name Parameters Preconditions Effects Duration (default 1) Cost, probability, …

APP – Agent planning package Developed at University in Novi Sad Helps to create intelligent agents Domain independent planning system for PDDL2.1 Written in Java in form of a Java package Enables plan creation and execution

APP – Agent planning package APP can handle several planning instances Generated plans are part of a planning instance

APP – Agent planning package Modules Data manipulation Plan searching Plan execution and monitoring Plan validation and verification

APP – Agent planning package Types of a plan SingleAction Serial plan Parallel plan Alternative plan Multiple plans Plans can be mixed

Modeling and model checking We can create a model of our software and check it Modeling Initial state must be modeled ( using objects, constants, predicates, functions…) One action in planning domain is one or more actions in our software

Model checking Planning systems can check if actions are modeled well Model checking How we can do something in our software? What is the plan for that goal? How we can detect errors? No plan (it is not possible to do it) Invalid plan

Example Initial State Planning sequence Plan: A(x, y), B(x, y), C(x, y) Goal State Temporary states A(x, y)C(x, y)B(x,y)

Example (action A :parameters (?x ?y – objects) :precondition (and (point ?x)) :effects (connected ?x ?y)) (action B :parameters (?x ?y – objects) :precondition (selected ?x ?y) :effects (connected ?x ?y))

Example (action C :parameters (?x ?y – objects) :precondition (connected ?x ?y) :effects (doneC)) Initial state: (point x) (point y) Goal: (doneC)

Example Plan generated by APP: no plan is found Reason: (action A :parameters (?x ?y – objects) :precondition (and (point ?x) (point ?y)) :effects (connected ?x ?y))

Example Plan generated by APP: A(x, y), C(x, y) Reason: (action A :parameters (?x ?y – objects) :precondition (and (point ?x) (point ?y)) :effects (selected ?x ?y))

Example Plan generated by APP: A(x, y), B(x, y), C(x, y) APP can automatically create plans for large number of goals

Conclusion Powerful tool for model checking Detects different kinds of errors Simulation of plan execution can help to detect errors

The End Thank you for your attention