CS344 : Introduction to Artificial Intelligence

Slides:



Advertisements
Similar presentations
CS344 : Introduction to Artificial Intelligence
Advertisements

CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 15, 16: Perceptrons and their computing power 6 th and.
Planning Chapter 10.
All rights reserved ©L. Manevitz Lecture 61 Artificial Intelligence Planning System L. Manevitz.
Sussman anomaly - analysis The start state is given by: ON(C, A) ONTABLE(A) ONTABLE(B) ARMEMPTY The goal by: ON(A,B) ON(B,C) This immediately leads to.
Planning Russell and Norvig: Chapter 11 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/ home.htm.
Slide 1Fig. 10.1, p.293. Slide 2Fig. 10.1a, p.293.
Slide 1Fig. 5.1, p.113. Slide 2Fig. 5.1a, p.113 Slide 3Fig. 5.1b, p.113.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete random variables Probability mass function Distribution function (Secs )
1 Lecture 12 example (from slides prepared by Prof. J. Rosenchein)
P Fig. 6-1, p. 193 Fig. 6-2, p. 193 Fig. 6-3, p. 195.
CS 188: Artificial Intelligence Fall 2009 Lecture 19: Hidden Markov Models 11/3/2009 Dan Klein – UC Berkeley.
CS 140L Lecture 7 Transformation between Mealy and Moore Machines Professor CK Cheng CSE Dept. UC San Diego.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search.
Combined Lecture CS621: Artificial Intelligence (lecture 25) CS626/449: Speech-NLP-Web/Topics-in- AI (lecture 26) Pushpak Bhattacharyya Computer Science.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 21- Forward Probabilities and Robotic Action Sequences.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
CS344 : Introduction to Artificial Intelligence
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 25: Perceptrons; # of regions;
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 26- Reinforcement Learning for Robots; Brain Evidence.
CS460/IT632 Natural Language Processing/Language Technology for the Web Lecture 3 (10/01/06) Prof. Pushpak Bhattacharyya IIT Bombay Statistical Formulation.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 19: Interpretation in Predicate.
CS344: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 20,21: Application of Predicate Calculus.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 31: Feedforward N/W; sigmoid.
CS : Speech, NLP and the Web/Topics in AI Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture-17: Probabilistic parsing; inside- outside probabilities.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 35–HMM; Forward and Backward Probabilities 19 th Oct, 2010.
CS621: Artificial Intelligence
CS621 : Artificial Intelligence
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 32: sigmoid neuron; Feedforward.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search 17 th August, 2010.
Hidden Markov Models (HMMs) –probabilistic models for learning patterns in sequences (e.g. DNA, speech, weather, cards...) (2 nd order model)
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 33,34– HMM, Viterbi, 14 th Oct, 18 th Oct, 2010.
CS621: Artificial Intelligence Pushpak Bhattacharyya Computer Science and Engineering Department IIT Bombay Lecture 19: Hidden Markov Models.
CS : NLP, Speech and Web-Topics-in-AI Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 38-39: Baum Welch Algorithm; HMM training.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 23- Forward probability and Robot Plan; start of plan.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 6-7: Hidden Markov Model 18.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 3: Search, A*
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–6: Propositional calculus, Semantic Tableau, formal System 2 nd August,
CS623: Introduction to Computing with Neural Nets (lecture-18) Pushpak Bhattacharyya Computer Science and Engineering Department IIT Bombay.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 5- Deduction Theorem.
CS344: Introduction to Artificial Intelligence (associated lab: CS386)
Pushpak Bhattacharyya CSE Dept., IIT Bombay
Combined Lecture CS621: Artificial Intelligence (lecture 19) CS626/449: Speech-NLP-Web/Topics-in-AI (lecture 20) Hidden Markov Models Pushpak Bhattacharyya.
Hidden Markov Models (HMMs)
Introduction Contents Sungwook Yoon, Postdoctoral Research Associate
CS : Speech, NLP and the Web/Topics in AI
CS621: Artificial Intelligence
CS344 : Introduction to Artificial Intelligence
Hidden Markov Models (HMMs)
CS 188: Artificial Intelligence Spring 2007
CS621: Artificial Intelligence
CS344 : Introduction to Artificial Intelligence
CS621: Artificial Intelligence
CS344 : Introduction to Artificial Intelligence
CS621: Artificial Intelligence
CS621: Artificial Intelligence
CS621: Artificial Intelligence
CS344 : Introduction to Artificial Intelligence
Russell and Norvig: Chapter 11 CS121 – Winter 2003
CS : NLP, Speech and Web-Topics-in-AI
Hidden Markov Models By Manish Shrivastava.
CS344 : Introduction to Artificial Intelligence
CS621 : Artificial Intelligence
CS621: Artificial Intelligence
CS 140L Lecture 7 Transformation between Mealy and Moore Machines
CS621: Artificial Intelligence Lecture 22-23: Sigmoid neuron, Backpropagation (Lecture 20 and 21 taken by Anup on Graphical Models) Pushpak Bhattacharyya.
Prof. Pushpak Bhattacharyya, IIT Bombay
Prof. Pushpak Bhattacharyya, IIT Bombay
CS621: Artificial Intelligence Lecture 18: Feedforward network contd
CS621: Artificial Intelligence Lecture 17: Feedforward network (lecture 16 was on Adaptive Hypermedia: Debraj, Kekin and Raunak) Pushpak Bhattacharyya.
Presentation transcript:

CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 22- Forward probability and Robot Plan

Robotic Blocks World on(B, table) on(A, table) on(C, A) hand empty Robot hand Robot hand A C B A B C START GOAL on(B, table) on(A, table) on(C, A) hand empty clear(C) clear(B) on(C, table) on(B, C) on(A, B) hand empty clear(A)

Mapping the problem to probabilistic framework Exhaustively enumerate the states Enumerate the operators Define probabilities of transition P(Ok,sj|si) {probability of going from state si to sj with the output Ok which can be a robotic action}

State Transition C A B A B C C B B A C A unstack(C), putdown(C) START Robot hand Robot hand C A B unstack(C), putdown(C) A B C START pickup(B), stack(B,A) pickup(C), stack(C,B) C Robot hand B B A C A GOAL

States for Blocks world problem Total 22 states Hand – empty No column (1 state) 2-blk-column (6 states) 3-blk-column (6 states) Hand – holding Block A in Hand – no column (1 state), 2-blk-column (2 states) Block B in Hand – no column (1 state), 2-blk-column(2 states) Block C in Hand – no column (1 state), 2-blk-column(2 states)

State space and operators State space = {s1,s2, … , s22} Operators pick up A (PA), pick up A (PB), pick up A (PC) put down(DA), put down(DB), put down(DC) stack(x , y) – total 6 operators i.e. TAB, TAB, TCB, TBC, TCA, TAC unstack (x) – UA, UB, UC

Probabilistic Automaton This gives a probabilistic automaton where probability values are specified between every states for each operator. We need to learn total 22C2 (states) * 15 (operators) different probability values, e.g., P(PA, s2 | s1) = 0.3, P(DC, s5| s2), …

Formula for Operator Sequence Probability Forward Algorithm to calculate operator sequence probability. e.g. seq = UC DC PB TBA PC TCB P(seq) = P(UC DC PB TBA PC TCB ) (marginalization, probability of seq with 6th state = si ) = ∑ P(UC DC PB TBA PC TCB, s6 = si) 21 i = 0

Back to HMM

A Simple HMM r q a: 0.2 a: 0.3 b: 0.2 b: 0.1 a: 0.2 b: 0.1 b: 0.5

The forward probabilities of “bbba” Time Ticks 1 2 3 4 5 INPUT ε b bb bbb bbba 1.0 0.2 0.05 0.017 0.0148 0.0 0.1 0.07 0.04 0.0131 P(w,t) 0.3 0.12 0.057 0.0279