TADA Transition Aligned Domain Analysis T J. Benton and Kartik Talamadupula and Subbarao Kambhampati.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Decision Structures - If / Else If / Else. Decisions Often we need to make decisions based on information that we receive. Often we need to make decisions.
Warm Up Example 1 Check whether the ordered pair is a solution of 2x – 3y > -2 a.(0,0) 2(0)-3(0)> -2 0> -2 True b.(0,1) 2(0)-3(1)> -2 -3> -2 False.
Language for planning problems
Cognitive Science Integrating a Closed World Planner with an Open World Robot: A Case Study 1 Kartik Talamadupula J. Benton Subbarao Kambhampati Dept.
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
Representing Boolean Functions for Symbolic Model Checking Supratik Chakraborty IIT Bombay.
Graphplan. Automated Planning: Introduction and Overview 2 The Dock-Worker Robots (DWR) Domain informal description: – harbour with several locations.
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.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
An LP-Based Heuristic for Optimal Planning Menkes van den Briel Department of Industrial Engineering Arizona State University
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
PLANNING Ivan Bratko Acknowledgement: Some of these slides were adapted from D. Nau’s course on planning.
Generating Plans in Concurrent, Probabilistic, Oversubscribed Domains Li Li and Nilufer Onder Department of Computer Science Michigan Technological University.
Time Constraints in Planning Sudhan Kanitkar
1 Partial Order Reduction. 2 Basic idea P1P1 P2P2 P3P3 a1a1 a2a2 a3a3 a1a1 a1a1 a2a2 a2a2 a2a2 a2a2 a3a3 a3a3 a3a3 a3a3 a1a1 a1a1 3 independent processes.
Enhancing Search for Satisficing Temporal Planning with Objective-driven Decisions J. Benton Patrick EyerichSubbarao Kambhampati.
Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning Menkes van den Briel Department of Industrial Engineering.
When is Temporal Planning Really Temporal? William Cushing Subbarao Kambhampati Special thanks to: J. Benton, Menkes van den Briel Mausam Daniel Weld.
Planning and Scheduling. 2 USC INFORMATION SCIENCES INSTITUTE Some background Many planning problems have a time-dependent component –  actions happen.
Statistical Probabilistic Model Checking Håkan L. S. Younes Carnegie Mellon University.
Automated Planning Introduction and Overview. Automated Planning: Introduction and Overview 2 Literature Malik Ghallab, Dana Nau, and Paolo Traverso.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
Cognitive Science 1 Kartik Talamadupula Subbarao Kambhampati J. Benton Dept. of Computer Science Arizona State University Paul Schermerhorn Matthias Scheutz.
Over-subscription Planning with Numeric Goals J. Benton Computer Sci. & Eng. Dept. Arizona State University Tempe, AZ Minh Do Palo Alto Research Center.
Finding Admissible Bounds for Over- subscribed Planning Problems J. Benton Menkes van den BrielSubbarao Kambhampati Arizona State University.
Planning Graph-based Heuristics for Cost-sensitive Temporal Planning Minh B. Do & Subbarao Kambhampati CSE Department, Arizona State University
Handling non-determinism and incompleteness. Problems, Solutions, Success Measures: 3 orthogonal dimensions  Incompleteness in the initial state  Un.
Concurrent Probabilistic Temporal Planning (CPTP) Mausam Joint work with Daniel S. Weld University of Washington Seattle.
A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems J. Benton Menkes van den BrielSubbarao Kambhampati Arizona.
Minh Do - PARC Planning with Goal Utility Dependencies J. Benton Department of Computer Science Arizona State University Tempe, AZ Subbarao.
Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework Thomas Vossen Leeds School of Business University of Colorado at Boulder.
Incentive-compatible Approximation Andrew Gilpin 10/25/07.
272: Software Engineering Fall 2012 Instructor: Tevfik Bultan Lecture 4: SMT-based Bounded Model Checking of Concurrent Software.
A Framework for Planning in Continuous-time Stochastic Domains Håkan L. S. Younes Carnegie Mellon University David J. MuslinerReid G. Simmons Honeywell.
An efficient distributed protocol for collective decision- making in combinatorial domains CMSS Feb , 2012 Minyi Li Intelligent Agent Technology.
Homework 1 ( Written Portion )  Max : 75  Min : 38  Avg : 57.6  Median : 58 (77%)
4.4 Equations as Relations
Chapter 7 Handling Constraints
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
COMP261 Lecture 7 A* Search. A* search Can we do better than Dijkstra's algorithm? Yes! –want to explore more promising paths, not just shortest so far.
Automated Planning Dr. Héctor Muñoz-Avila. What is Planning? Classical Definition Domain Independent: symbolic descriptions of the problems and the domain.
CSE473 Winter /04/98 State-Space Search Administrative –Next topic: Planning. Reading, Chapter 7, skip 7.3 through 7.5 –Office hours/review after.
Advanced Artificial Intelligence Lecture 2: Search.
Probabilistic Verification of Discrete Event Systems using Acceptance Sampling Håkan L. S. Younes Carnegie Mellon University.
CIS 842: Specification and Verification of Reactive Systems Lecture INTRO-Examples: Simple BIR-Lite Examples Copyright 2004, Matt Dwyer, John Hatcliff,
Efficient Automated Planning with New Formulations Ruoyun Huang Washington University in St. Louis.
Markov Decision Processes AIMA: 17.1, 17.2 (excluding ), 17.3.
By J. Hoffmann and B. Nebel
Impact Research 1 Deploying Wireless LANs for Business Benefit Summary Document.
Reinforcement Learning Introduction Passive Reinforcement Learning Temporal Difference Learning Active Reinforcement Learning Applications Summary.
6 Resource Utilization 4/28/2017 Teaching Strategies
A Schedule Optimization Tool for Destructive and Non-Destructive Vehicle Tests Jeremy Ludwig, Annaka Kalton, and Robert Richards Stottler Henke Associates,
Computer Science CPSC 322 Lecture 12 SLS wrap up, Forward Planning, Planning as CSP (Ch 8.2, 8.4) Slide 1.
Formal methods: Lecture
EQUATION IN TWO VARIABLES:
3 – Graphs of Inequalities (No Calculator)
Class #17 – Thursday, October 27
Problem solving Strategies
Graphplan/ SATPlan Chapter
Computer Science 111 Fundamentals of Computer Programming I
Solution Solution Checking Solutions of Inequalities
CIS 488/588 Bruce R. Maxim UM-Dearborn
Running example The 4-houses puzzle:
Class #19 – Monday, November 3
What are the following properties?
COMP108 Algorithmic Foundations Searching
Graphplan/ SATPlan Chapter
Graphplan/ SATPlan Chapter
COMP108 Algorithmic Foundations Searching
Presentation transcript:

TADA Transition Aligned Domain Analysis T J. Benton and Kartik Talamadupula and Subbarao Kambhampati

Motivation Multi-valued Variables (at truck-1 loc-1): false (at truck-1 loc-2): true (at truck-1 loc-3): false (at truck-1 loc-4): false (at truck-1 loc-5): false (at truck-1 loc-6): false locations: loc-1 … loc-6 truck: truck-1 (= (loc truck-1) loc-2) (and (at ?t ?loc1) (at ?t ?loc2)) (= (?loc1 ?loc2))

Motivation Action Interleaving Durative actions may execute concurrently with each other; need to model this to extract accurate heuristics 2 2 T T 1 1 l start (T,2) l start (T,2) l end (T,2) l end (T,2) ul start (T,1) ul start (T,1) ul end (T,1) ul end (T,1)

Motivation Lookahead during search, following a YAHSP- style approach

Deadline Goals with Utility Give an estimate of establishment time e T – as against the actual deadline e D Model reward or penalty in terms of their difference Reward = min(0, [R - k (e T – e D )]) – R is the reward accrued for achieving the deadline goal. – If achieved by time e D, full reward. Else diminishing reward until 0.

Example Problem I G truck package (load/unload) Causal Graph

Deadline Goals Example 2 2 T T package truck load start /unload start unload start load start unload end load end m start (1,2) m start (1,2) m end (1,2) m end (1,2) move start move end move start move end l start (T,2) l start (T,2) l end (T,2) l end (T,2) ul start (T,1) ul start (T,1) ul end (T,1) ul end (T,1) m start (2,1) m start (2,1) m end (2,1) m end (2,1) time counter t=0 t=10 P=14 t=22 t=26 deadline: t=20

FUTURE WORK International Planning Competition 2008 Tracks: Sequential Net-Benefit Temporal Problem decomposition for better analysis and more accurate estimates Considering a goal ordering based on causal dependencies in the domain

Summary Planning with multi-valued variables Domain Transition Graph representation Extended DTGs to handle durative actions Useful to estimate deadline establishment times; can be used for soft deadline goals with diminishing utility Implement a lookahead strategy for search Try to find a satisficing solution quickly Make effective use of action interleaving Handles net-benefit and temporal problems.