CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–3: Fuzzy Inferencing: Inverted.

Slides:



Advertisements
Similar presentations
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 10– Club and Circuit Examples.
Advertisements

CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16- Prolog.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9,10,11- Logic; Deduction Theorem 23/1/09 to 30/1/09.
Fuzzy Inference and Defuzzification
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–5 and 6: Propositional Calculus.
CLASSICAL LOGIC and FUZZY LOGIC. CLASSICAL LOGIC In classical logic, a simple proposition P is a linguistic, or declarative, statement contained within.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 15, 16, 17- Completeness Proof; Self References and.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12- Completeness Proof; Self References and Paradoxes 16 th August,
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 7– Predicate Calculus and Knowledge Representation.
Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 11– Fuzzy Logic: Inferencing.
CS621: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–3: Some proofs in Fuzzy Sets and Fuzzy Logic 27 th July.
CS344 Artificial Intelligence Prof. Pushpak Bhattacharya Class on 6 Mar 2007.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 21– Predicate Calculus and Knowledge Representation 7 th September,
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus.
Mathematical Induction
CS621: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–4: Fuzzy Inferencing 29 th July 2010.
Artificial Intelligence Reasoning. Reasoning is the process of deriving logical conclusions from given facts. Durkin defines reasoning as ‘the process.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–2: Fuzzy Logic and Inferencing.
CS621: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–1: Introduction 22 nd July 2010.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 17, 18: Predicate Calculus 15.
Fuzzy Inference (Expert) System
Reasoning in Uncertain Situations
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 28– Interpretation; Herbrand Interpertation 30 th Sept, 2010.
Ming-Feng Yeh Fuzzy Control The primary goal of control engineering is to distill and apply knowledge about how to control a process so that the.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 30 Uncertainty, Fuizziness.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12- Completeness Proof; Self References and Paradoxes 16 th August,
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM]
Lógica difusa  Bayesian updating and certainty theory are techniques for handling the uncertainty that arises, or is assumed to arise, from statistical.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–4: Fuzzy Control of Inverted.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 38: Fuzzy Logic.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–7: (a) Formal System;(b) How to read research papers 3 rd August, 2010.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture /08/05 Prof. Pushpak Bhattacharyya Fuzzy Set (contd) Fuzzy.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9- Completeness proof; introducing knowledge representation.
Chapter 19. Fuzzy Reasoning
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: AI, Logic, and Puzzle Solving.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture 5 – 08/08/05 Prof. Pushpak Bhattacharyya FUZZY LOGIC & INFERENCING.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture /08/05 Prof. Pushpak Bhattacharyya Fuzzy Logic Application.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 35–Himalayan Club example; introducing Prolog.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture 16 – 09/09/05 Prof. Pushpak Bhattacharyya Soundness, Completeness,
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 32 Fuzzy Expert System.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–10: Soundness of Propositional Calculus 12 th August, 2010.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Prof. Pushpak Bhattacharyya, IIT Bombay1 CS 621 Artificial Intelligence Lecture /08/05 Prof. Pushpak Bhattacharyya Fuzzy Inferencing.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 4- Logic.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–6: Propositional calculus, Semantic Tableau, formal System 2 nd August,
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 5- Deduction Theorem.
CS621: Artificial Intelligence
CS344 : Introduction to Artificial Intelligence
CS621: Artificial Intelligence
CS 621 Artificial Intelligence Lecture 1 – 28/07/05
CS621: Introduction to Artificial Intelligence
CLASSICAL LOGIC and FUZZY LOGIC
Elementary Metamathematics
CS621: Artificial Intelligence
CS 621 Artificial Intelligence Lecture 4 – 05/08/05
Back to “Serious” Topics…
Fuzzy Inferencing – Inverted Pendulum Problem
Computer Security: Art and Science, 2nd Edition
Biointelligence Lab School of Computer Sci. & Eng.
CS621 : Artificial Intelligence
CS621: Artificial Intelligence
CS621: Artificial Intelligence
CS621: Artificial Intelligence
CS621 : Artificial Intelligence
CS344 : Introduction to Artificial Intelligence
Artificial Intelligence
CS 621 Artificial Intelligence Lecture /09/05 Prof
Presentation transcript:

CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–3: Fuzzy Inferencing: Inverted Pendulum

Inferencing Two methods of inferencing in classical logic Modus Ponens Given p and p  q, infer q Modus Tolens Given ~q and p  q, infer ~p How is fuzzy inferencing done?

A look at reasoning Deduction: p, p  q|- q Induction: p 1, p 2, p 3, …|- for_all p Abduction: q, p  q|- p Default reasoning: Non-monotonic reasoning: Negation by failure If something cannot be proven, its negation is asserted to be true E.g., in Prolog

Completeness and Soundness Completeness question Provability - Is the machine powerful enough to establish a fact? Soundness – Anything that is proved to be true is indeed true Truth - Is the fact true?

Fuzzy Modus Ponens in terms of truth values Given t(p)=1 and t(p  q)=1, infer t(q)=1 In fuzzy logic, given t(p)>=a, 0<=a<=1 and t(p  >q)=c, 0<=c<=1 What is t(q) How much of truth is transferred over the channel pq

Lukasiewitz formula for Fuzzy Implication t(P) = truth value of a proposition/predicate. In fuzzy logic t(P) = [0,1] t( ) = min[1,1 -t(P)+t(Q)] Lukasiewitz definition of implication

Use Lukasiewitz definition t(p  q) = min[1,1 -t(p)+t(q)] We have t(p->q)=c, i.e., min[1,1 -t(p)+t(q)]=c Case 1: c=1 gives 1 -t(p)+t(q)>=1, i.e., t(q)>=a Otherwise, 1 -t(p)+t(q)=c, i.e., t(q)>=c+a-1 Combining, t(q)=max(0,a+c-1) This is the amount of truth transferred over the channel p  q

Eg: If pressure is high then Volume is low Pressure/ Volume High Pressure ANDING of Clauses on the LHS of implication Low Volume

Fuzzy Inferencing Core The Lukasiewitz rule t( ) = min[1,1 + t(P) – t(Q)] An example Controlling an inverted pendulum θ = angular velocity Motor i=current

The goal: To keep the pendulum in vertical position (θ=0) in dynamic equilibrium. Whenever the pendulum departs from vertical, a torque is produced by sending a current ‘i’ Controlling factors for appropriate current Angle θ, Angular velocity θ. Some intuitive rules If θ is +ve small and θ. is –ve small then current is zero If θ is +ve small and θ. is +ve small then current is –ve medium

-ve med -ve small Zero +ve small +ve med -ve med -ve small Zero +ve small +ve med +ve small -ve small -ve med -ve small +ve small Zero Region of interest Control Matrix θ.θ. θ

Each cell is a rule of the form If θ is <> and θ. is <> then i is <> 4 “Centre rules” 1.if θ = = Zero and θ. = = Zero then i = Zero 2.if θ is +ve small and θ. = = Zero then i is –ve small 3.if θ is –ve small and θ. = = Zero then i is +ve small 4.if θ = = Zero and θ. is +ve small then i is –ve small 5. if θ = = Zero and θ. is –ve small then i is +ve small

Linguistic variables 1.Zero 2.+ve small 3.-ve small Profiles -ε-ε+ε+ε ε2 ε2 -ε2-ε2 -ε3-ε3 ε3ε3 +ve small -ve small 1 Quantity (θ, θ., i) zero

Inference procedure 1. Read actual numerical values of θ and θ. 2. Get the corresponding μ values μ Zero, μ (+ve small), μ (-ve small). This is called FUZZIFICATION 3. For different rules, get the fuzzy i values from the R.H.S of the rules. 4. “ Collate ” by some method and get ONE current value. This is called DEFUZZIFICATION 5. Result is one numerical value of i.

if θ is Zero and dθ/dt is Zero then i is Zero if θ is Zero and dθ/dt is +ve small then i is –ve small if θ is +ve small and dθ/dt is Zero then i is –ve small if θ +ve small and dθ/dt is +ve small then i is -ve medium -ε-ε+ε+ε ε2 ε2 -ε2-ε2 -ε3-ε3 ε3ε3 +ve small -ve small 1 Quantity (θ, θ., i) zero Rules Involved

Suppose θ is 1 radian and dθ/dt is 1 rad/sec μ zero (θ =1)=0.8 (say) μ +ve-small (θ =1)=0.4 (say) μ zero (dθ/dt =1)=0.3 (say) μ +ve-small (dθ/dt =1)=0.7 (say) -ε-ε+ε+ε ε2 ε2 -ε2-ε2 -ε3-ε3 ε3ε3 +ve small -ve small 1 Quantity (θ, θ., i) zero Fuzzification 1rad 1 rad/sec

Suppose θ is 1 radian and dθ/dt is 1 rad/sec μ zero (θ =1)=0.8 (say) μ +ve-small (θ =1)=0.4 (say) μ zero (dθ/dt =1)=0.3 (say) μ +ve-small (dθ/dt =1)=0.7 (say) Fuzzification if θ is Zero and dθ/dt is Zero then i is Zero min(0.8, 0.3)=0.3 hence μ zero (i)=0.3 if θ is Zero and dθ/dt is +ve small then i is –ve small min(0.8, 0.7)=0.7 hence μ -ve-small (i)=0.7 if θ is +ve small and dθ/dt is Zero then i is –ve small min(0.4, 0.3)=0.3 hence μ-ve-small(i)=0.3 if θ +ve small and dθ/dt is +ve small then i is -ve medium min(0.4, 0.7)=0.4 hence μ -ve-medium (i)=0.4

-ε-ε+ε+ε -ε2-ε2 -ε3-ε3 -ve small 1 zero Finding i Possible candidates: i=0.5 and -0.5 from the “zero” profile and μ=0.3 i=-0.1 and -2.5 from the “-ve-small” profile and μ=0.3 i=-1.7 and -4.1 from the “-ve-small” profile and μ= ve small -ve medium 0.7

-ε-ε+ε+ε -ve small zero Defuzzification: Finding i by the centroid method Possible candidates: i is the x-coord of the centroid of the areas given by the blue trapezium, the green trapeziums and the black trapezium ve medium Required i value Centroid of three trapezoids