Agents that plan K. V. S. Prasad Notes for TIN171/DIT410 (Friday, 26 March 2010) Based on Nils Nilsson, “Artificial Intelligence: a new synthesis”, Morgan.

Slides:



Advertisements
Similar presentations
Language for planning problems
Advertisements

CSE391 – 2005 NLP 1 Planning The Planning problem Planning with State-space search.
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.
By David Sanders CS 430, Artificial Intelligence September 25, 2008.
Situation Calculus for Action Descriptions We talked about STRIPS representations for actions. Another common representation is called the Situation Calculus.
Plan Generation & Causal-Link Planning 1 José Luis Ambite.
September 26, 2012Introduction to Artificial Intelligence Lecture 7: Search in State Spaces I 1 After our “Haskell in a Nutshell” excursion, let us move.
Graphs CS3240, L. grewe.
Slide 1 Planning: Representation and Forward Search Jim Little UBC CS 322 October 10, 2014 Textbook §8.1 (Skip )- 8.2)
Planning CSE 473 Chapters 10.3 and 11. © D. Weld, D. Fox 2 Planning Given a logical description of the initial situation, a logical description of the.
1 Classical STRIPS Planning Alan Fern * * Based in part on slides by Daniel Weld.
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
CPSC 502, Lecture 11Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 11 Oct, 18, 2011.
Artificial Intelligence 2005/06
Artificial Intelligence Chapter 11: Planning
Planning CSE 473. © Daniel S. Weld Topics Agency Problem Spaces Search Knowledge Representation Reinforcement Learning InferencePlanning Supervised.
1 Solving Problems by Searching. 2 Terminology State State Space Initial State Goal Test Action Step Cost Path Cost State Change Function State-Space.
Handling non-determinism and incompleteness. Problems, Solutions, Success Measures: 3 orthogonal dimensions  Incompleteness in the initial state  Un.
CPSC 322, Lecture 17Slide 1 Planning: Representation and Forward Search Computer Science cpsc322, Lecture 17 (Textbook Chpt 8.1 (Skip )- 8.2) February,
Artificial Intelligence 2005/06 Planning: STRIPS.
CPSC 322, Lecture 17Slide 1 Planning: Representation and Forward Search Computer Science cpsc322, Lecture 17 (Textbook Chpt 8.1 (Skip )- 8.2) February,
Graphs & Graph Algorithms Nelson Padua-Perez Bill Pugh Department of Computer Science University of Maryland, College Park.
CS 188: Artificial Intelligence Spring 2006 Lecture 2: Queue-Based Search 8/31/2006 Dan Klein – UC Berkeley Many slides over the course adapted from either.
Automated Planning and HTNs Planning – A brief intro Planning – A brief intro Classical Planning – The STRIPS Language Classical Planning – The STRIPS.
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
AI Principles, Lecture on Planning Planning Jeremy Wyatt.
Planning II CSE 573. © Daniel S. Weld 2 Logistics Reading for Wed Ch 18 thru 18.3 Office Hours No Office Hour Today.
Solving problems by searching This Lecture Read Chapters 3.1 to 3.4 Next Lecture Read Chapter 3.5 to 3.7 (Please read lecture topic material before and.
CSE 473: Artificial Intelligence Spring 2014 Hanna Hajishirzi Problem Spaces and Search slides from Dan Klein, Stuart Russell, Andrew Moore, Dan Weld,
CSE 573 Artificial Intelligence Dan Weld Peng Dai
Made by: Maor Levy, Temple University  Probability expresses uncertainty.  Pervasive in all of Artificial Intelligence  Machine learning 
Chapter 11: Artificial Intelligence
Artificial Intelligence Lecture 9. Outline Search in State Space State Space Graphs Decision Trees Backtracking in Decision Trees.
Artificial Intelligence: Planning Lecture 6 Problems with state space search Planning Operators A Simple Planning Algorithm (Game Playing)
Artificial Intelligence and Robotics Ross Clark Trevor Sheehan.
Computing & Information Sciences Kansas State University Wednesday, 15 Oct 2008CIS 530 / 730: Artificial Intelligence Lecture 20 of 42 Wednesday, 15 October.
1 Solving problems by searching 171, Class 2 Chapter 3.
October 17, 2012Introduction to Artificial Intelligence Lecture 11: Knowledge Representation and Reasoning I 1Semantics In propositional logic, we associate.
Lecture 3: 18/4/1435 Searching for solutions. Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Lecture 2: 11/4/1435 Problem Solving Agents Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Robotics Club: 5:30 this evening
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Artificial Intelligence Chapter 10 Planning, Acting, and Learning Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Introduction to Artificial Intelligence Class 1 Planning & Search Henry Kautz Winter 2007.
Classical Planning Chapter 10 Mausam / Andrey Kolobov (Based on slides of Dan Weld, Marie desJardins)
Artificial Intelligence Lecture No. 6 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Chapter 10 Planning, Acting, and Learning. 2 Contents The Sense/Plan/Act Cycle Approximate Search Learning Heuristic Functions Rewards Instead of Goals.
Computing & Information Sciences Kansas State University Monday, 23 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 25 of 42 Monday, 23 October.
Computing & Information Sciences Kansas State University Friday, 20 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 24 of 42 Friday, 20 October.
Search in State Spaces Problem solving as search Search consists of –state space –operators –start state –goal states A Search Tree is an efficient way.
Planning I: Total Order Planners Sections
The situation calculus K. V. S. Prasad Notes for TIN171/DIT410 (Friday, 26 March 2010) Based on Nils Nilsson, “Artificial Intelligence: a new synthesis”,
Artificial Intelligence 2004 Planning: Situation Calculus Review STRIPS POP Hierarchical Planning Situation Calculus (John McCarthy) situations.
February 9, 2016Introduction to Artificial Intelligence Lecture 5: Perception & Action 1 Frege Notes In order to use many of the Java math functions in.
Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, CA
Lecture 2: Problem Solving using State Space Representation CS 271: Fall, 2008.
Artificial Intelligence Chapter 7 Agents That Plan Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Biointelligence Lab School of Computer Sci. & Eng. Seoul National University Artificial Intelligence Chapter 8 Uninformed Search.
state space representation
Plan Agents Chapter 7..
Finite Automata a b A simplest computational model
CS344 : Introduction to Artificial Intelligence
Planning José Luis Ambite.
Planning CSE 573 A handful of GENERAL SEARCH TECHNIQUES lie at the heart of practically all work in AI We will encounter the SAME PRINCIPLES again and.
Haskell Tips You can turn any function that takes two inputs into an infix operator: mod 7 3 is the same as 7 `mod` 3 takeWhile returns all initial.
Artificial Intelligence Chapter 7 Agents That Plan
Prof. Pushpak Bhattacharyya, IIT Bombay
Presentation transcript:

Agents that plan K. V. S. Prasad Notes for TIN171/DIT410 (Friday, 26 March 2010) Based on Nils Nilsson, “Artificial Intelligence: a new synthesis”, Morgan Kaufmann Publishers, 1998

Agents that plan Memory vs computation State-space graphs Searching explicit state spaces Feature-based state spaces

Memory vs computation Reactive agents – Do very little computation actions selected by designer, or by learning, or genes – implemented in tables, or rules, or circuits – need lots of memory – Designer must anticipate all situation/reaction – Can the agent compute what the designer would? Agent would then need more time but less space

Computations by the agent Designer must specify these – not carry them out – E.g., predict the consequences of possible actions If these can be learnt, or evolved – Agent does things designer did not anticipate To predict consequences, agent must model – World – actions

World states and actions Blocks world, make (ABC) from (A)(B)(C) World modelled iconically Actions by before-after pairs – move(A,B) takes (A)(B)(C) to (AB)(C) Takes (A)(BC) to (ABC) Doesn't apply to (BA)(C) So we can look ahead one step. To goal?

State-space graphs Nodes = world states Arcs = actions (A)(B)(C) –move(A,B)--> (AB)(C) – In blocks world, all actions reversible (AB)(C) –move(A,T)-->(A)(B)(C) – Where T is the table – So agent can see: to go from (A)(B)(C) to (ABC) do move(B,C), move(A,B)

Plan = path in state-space graph Any of the nodes can be the goal Sequence of actions needed (the plan) – Becomes path from initial to goal Assumptions – Can represent all relevant world states and actions – No uncertainty in effect of actions – No other agent to change state Then no sensor needed while acting

Searching explicit state-spaces Start node is labelled 0 Propagate numbers in waves along arcs – So arc labelled 3 has 3 step path back to initial – Wave go breadth-first; other sequences possible Continue till you hit the goal For single goal, can also back from goal to init

Feature-based state spaces Nodes now labelled by features – Feature = logical proposition Then what are actions? – STRIPS says an action is a triple Precondition (what must be true for action to be possible) Add list (what features become true after action) Delete list (what features become false after action) We are no longer in iconic world states!