The struggle for respect in a Planning Centric World… Stephen Smith Carnegie Mellon University.

Slides:



Advertisements
Similar presentations
Slides of the Invited Talk at the CAEPIA Workshop on Planning, Scheduling and Temporal Reasoning (Held on November 11, 2003 by Alexander Nareyek) Note.
Advertisements

Lecture 7 Multi-Agent Systems Lecture 7 University “Politehnica” of Bucarest Adina Magda Florea
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Branch-and-Bound In this handout,  Summary of branch-and-bound for integer programs Updating the lower and upper bounds for OPT(IP) Summary of fathoming.
Code Generation Steve Johnson. May 23, 2005Copyright (c) Stephen C. Johnson The Problem Given an expression tree and a machine architecture, generate.
Carnegie Mellon ICAPS Sept, 2007 Benchmark Problems for Oversubscribed Scheduling Laura V. Barbulescu and Laurence A. Kramer and Stephen F. Smith.
Building a SOA roadmap for your enterprise Presented by Sanjeev Batta Architect, Cayzen Technologies.
1 9. S EQUENCING C ONSTRUCTION T ASKS Objective: To understand the problem of sequencing tasks in a manufacturing system, and the methods of finding optimal.
PLANNING IN AI. Determine the set of steps that are necessary to achieve a goal Some steps might be conditional, i.e., they are only taken when a set.
Martha Garcia.  Goals of Static Process Scheduling  Types of Static Process Scheduling  Future Research  References.
Planning Chapter 10.
Planning Planning is fundamental to “intelligent” behaviour. E.g.
All rights reserved ©L. Manevitz Lecture 61 Artificial Intelligence Planning System L. Manevitz.
Planning Russell and Norvig: Chapter 11 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/ home.htm.
1 Classical STRIPS Planning Alan Fern * * Based in part on slides by Daniel Weld.
Scheduling with uncertain resources Search for a near-optimal solution Eugene Fink, Matthew Jennings, Ulaş Bardak, Jean Oh, Stephen Smith, and Jaime Carbonell.
CPSC 322 Introduction to Artificial Intelligence November 19, 2004.
CPSC 322, Lecture 11Slide 1 Constraint Satisfaction Problems (CSPs) Introduction Computer Science cpsc322, Lecture 11 (Textbook Chpt 4.0 – 4.2) January,
Planning Russell and Norvig: Chapter 11. Planning Agent environment agent ? sensors actuators A1A2A3.
CPSC 322 Introduction to Artificial Intelligence November 26, 2004.
Intro to AI Fall 2002 © L. Joskowicz 1 Introduction to Artificial Intelligence LECTURE 12: Planning Motivation Search, theorem proving, and planning Situation.
1 Pertemuan 17 Planning Matakuliah: T0264/Intelijensia Semu Tahun: Juli 2006 Versi: 2/1.
Threshold Voltage Assignment to Supply Voltage Islands in Core- based System-on-a-Chip Designs Project Proposal: Gall Gotfried Steven Beigelmacher 02/09/05.
Job Shop Reformulation of Vehicle Routing Evgeny Selensky University of Glasgow
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
PLANNING Partial order regression planning Temporal representation 1 Deductive planning in Logic Temporal representation 2.
European Network of Excellence in AI Planning Project Overview Recent Developments & Future Work Susanne Biundo University of.
Assessing the effectiveness of compliance strategies in three Australian MPAs David J. Lloyd Southern Cross University R.J. Payne Lakehead University.
WMS systems manage and coordinate several independent subtasks. The coordination problems get even more serious when the subtasks are performed on separate.
1 Outline:  Outline of the algorithm  MILP formulation  Experimental Results  Conclusions and Remarks Advances in solving scheduling problems with.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Homework 1 ( Written Portion )  Max : 75  Min : 38  Avg : 57.6  Median : 58 (77%)
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Sarah Strachan.  Classroom Management includes a structured environment with schedules, routines, and consistent behavior expectations.
Automated Assistant for Crisis Management Reflective Agent with Distributed Adaptive Reasoning RADAR.
Carnegie Mellon SMU/SIM-TECH Workshop on Trends in P/S – Sept 11, 2008 Constraint-Based Scheduling Adapted from slides by Stephen F. Smith.
Teaching Software Testing as a Problem-based Learning Course Stephanie Ludi Software Engineering Dept. Rochester Institute of Technology
1 Search vs. planning Situation calculus STRIPS operators Search vs. planning Situation calculus STRIPS operators.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
Guided Learning for Role Discovery (GLRD) Presented by Rui Liu Gilpin, Sean, Tina Eliassi-Rad, and Ian Davidson. "Guided learning for role discovery (glrd):
Multi-Agent Planning Brad Clement Artificial Intelligence Group Jet Propulsion Laboratory California Institute of Technology
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)
PP500: Public Administration and Management Unit 3 Professor Jamie Scripps
Scheduling McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
HOW TO WRITE AN ABSTRACT. An abstract is a summary of a completed research project or paper. A well-written abstract will make the reader want to learn.
The situation calculus K. V. S. Prasad Notes for TIN171/DIT410 (Friday, 26 March 2010) Based on Nils Nilsson, “Artificial Intelligence: a new synthesis”,
OPTIMIZATION PROBLEMS OF ELECTRIC POWER SUPPLY Томский политехнический университет.
Test Plans Test Driven Development – Unit test plan first Code coverage Automated Regression built as you go Debug is easier Serves as system doc – Still.
Consumer Behavior.
Jobshop scheduling.
Scheduling with Constraint Programming
Planning, Execution, & Information Gathering
Solver & Optimization Problems
Classical Planning via Plan-space search
740: Computer Architecture First Assignments to Complete
CS344 : Introduction to Artificial Intelligence
Majors Level- Reflections on Module Development
L11. Planning Agents and STRIPS
Scheduling with uncertain resources Search for a near-optimal solution
Preparing for the Technology needs of the CCSS
CPSC 322 Introduction to Artificial Intelligence
Lecture Twelve Chapter Ten
Applying Use Cases (Chapters 25,26)
CS344 : Introduction to Artificial Intelligence
Chapter 2 Representations for Classical Planning
Russell and Norvig: Chapter 11 CS121 – Winter 2003
Prof. Pushpak Bhattacharyya, IIT Bombay
NKOS Workshop Denver, CO June 11, 2005
Presentation transcript:

The struggle for respect in a Planning Centric World… Stephen Smith Carnegie Mellon University

AI Scheduling – the struggle for respect …  1990s – Formation of research community  The Period of Basic Disconnect  Int. Conference on AI Planning Systems (AIPS)  European Conference on Planning (ECP)  Perspectives:  There is a restricted class of planning problems concerned with synchronizing plans in time (mostly uninteresting from the standpoint of stacking blocks)  Is scheduling about core techniques or about solving application problems?

AI Scheduling – the struggle for respect …  – Recognition  AIPS changed its name to Int. Conf. on AI Planning and Scheduling  I got a paper accepted in ECP!  Perspectives  Increasing recognition that most real planning problems must worry about situating actions in time and making good use of scarce resources  Consideration of integration frameworks  But majority view of scheduling is really still as a black box component of a larger planning system

AI Scheduling – the struggle for respect …  2003 onward – Age of Acceptance (?)  Less work in the planning community on inventing planning techniques to solve scheduling problems  At ICAPS 2004, we actually held a workshop on how planning might be used to solve scheduling subproblems  More emphasis on common core technologies: temporal reasoning, search

What is Planning and Scheduling?  Planning - Synthesis of action sequences to achieve goals (what to do)  Scheduling - Assignment of resources and times to actions to maximize performance (how and when) OP 1,1 OP 1,2 OP 1,3 OP 2,1 OP 2,2 R1 R2 rd 1 dd 1 dd 2 rd 2 st(i) + p(i) ≤ st(j), where p(i) is the processing time of op i st(i) + p(i) ≤ st(j) ∨ st(j) + p(j) ≤ st(i) rd(j) ≤ st(i) for each op i of job j Minimize ∑ |c(j) - dd(j)| ij R i j on(b,t) on(g,t) on(r,g) on(b,r) on(g,r) clear(b) clear(r) stack(b,r) stack(g,b) putdown(r) clear(g) clear(x) clear(y) on(x,?) preconds ¬on(x,?) on(x,y) clear(?) postconds stack(x,y) clear(x) on(x,?) preconds ¬on(x,?) on(x,t) postconds clear(?) putdown(x) Planning Scheduling durative actions, temporal reasoning maximizing # of goals achieved, # of soft constraints satisfied resources action selection from pre-computed resource & process alternatives resource setup and state constraints In recent years, the distinction has started to blur: OP 1,1 OP 2,2 OP 1,3 OP 1,2 R2 R1 OP 2,1