Probabilistic State Machines to describe emotions Happy state Ironic state Unhappy state “you are beautiful” / ”Thanks for a compliment” “you are blonde!”

Slides:



Advertisements
Similar presentations
Workshop D: Lesson Planning
Advertisements

Project Title Here IEEE UCSD Overview Robo-Magellan is a robotics competition emphasizing autonomous navigation and obstacle avoidance over varied, outdoor.
The Computer as a Tutor. With the invention of the microcomputer (now also commonly referred to as PCs or personal computers), the PC has become the tool.
Let’s Get Talking! Lisa Drake, CCC-Sp. Terms Speech Sound Articulation.
Communicating in a Virtual Environment
QUANTUM ROBOTICS IN ROBOT THEATRE. Quantum Logic Binary Logic Fuzzy Logic Quantum Signals and Automata 0, 1 [0,1] Hilbert Space, Bloch Sphere.
First Midterm (takehome) Your name: total Try to write the responses to the questions as if you were writing a conference.
Theory of Event Expressions Tool to design motions directly from symbols. This theory is general enough to allow arbitrary motion to be symbolically described.
 INTRODUCTION  STEPS OF GESTURE RECOGNITION  TRACKING TECHNOLOGIES  SPEECH WITH GESTURE  APPLICATIONS.
Portland Cyber Theatre Marek Perkowski Graduate Seminar, Friday, May 7, 2004 Part 1.
Efficient Decomposition of Large Fuzzy Functions and Relations Marek Perkowski + Portland State University, Dept. Electrical Engineering, Portland, Oregon.
Learning in the Wild Satanjeev “Bano” Banerjee Dialogs on Dialog March 18 th, 2005 In the Meeting Room Scenario.
1 Lecture 33 Introduction to Artificial Intelligence (AI) Overview  Lecture Objectives.  Introduction to AI.  The Turing Test for Intelligence.  Main.
Towards Robot Theatre Marek Perkowski Department of Electrical and Computer Engineering, Portland State University, Portland, Oregon,
Robot Metaphors and Models. Animatronic “Robot” or device brain effectors.
Quantum Automata Formalism. These are general questions related to complexity of quantum algorithms, combinational and sequential.
1 Foundations of Software Design Lecture 1: Course Overview Intro to Binary and Boolean Marti Hearst SIMS, University of California at Berkeley.
Integration of Machine Learning, Quantum Networks and software- hardware methodology in humanoid robots Projects 2005: Interactive Robot Theatre as a future.
Synthesis and Test of Quantum Circuits Dr. Marek Perkowski and Dr. Xiaoyu Song Quantum Braitenberg Automata Robots use.
Intelligent Robotics and Embedded Systems Dr. Marek Perkowski and Dr. Douglas Hall
EECS 598: Background in Theory of Computation Igor L. Markov and John P. Hayes
Quantum Robot for Teenagers Arushi Raghuvanshi Yale Fan Michal Woyke Marek Perkowski Presentation at ISMVL 2007 May
Integration of Machine Learning, Quantum Networks and software-hardware methodology in humanoid robots Interactive Robot Theatre as a future toy Talk presented.
Quantum Behaviors: synthesis and measurement Martin Lukac Normen Giesecke Sazzad Hossain and Marek Perkowski Department of Electrical Engineering Portland.
Chapter 3: Methods of Inference Expert Systems: Principles and Programming, Fourth Edition.
Learning Programs Danielle and Joseph Bennett (and Lorelei) 4 December 2007.
SLIDES SET NUMBER 1.. Class 478/578: General 1 1.My name is Marek Perkowski 2.You can call my Marek, or Dr. Perkowski or whatever you like. 3.This class.
Towards Robot Theatre Marek Perkowski Department of Electrical and Computer Engineering, Portland State University, Portland, Oregon,
Efficient Decomposition of Large Fuzzy Functions and Relations.
Comprehension Strategy Routine Cards
Copyright R. Weber INFO 629 Concepts in Artificial Intelligence Fall 2004 Professor: Dr. Rosina Weber.
Fuzzy control of a mobile robot Implementation using a MATLAB-based rapid prototyping system.
Artificial Intelligence (AI) Addition to the lecture 11.
Behavior, Dialog and Learning The dialog/behavior has the following components: –(1) Eliza-like natural language dialogs based on pattern matching and.
CHAPTER 12 ADVANCED INTELLIGENT SYSTEMS © 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang.
THE NEW ERA OF LIFE. Introduction: Artificial Intelligence (AI) is the area of computer science focusing on creating machines that can engage on behaviors.
How necessary is it to use and interpret it?. Non-verbal Communication  Nonverbal communications is the process of communication through sending and.
INTRODUCTION TO MACHINE LEARNING. $1,000,000 Machine Learning  Learn models from data  Three main types of learning :  Supervised learning  Unsupervised.
CMPS 3223 Theory of Computation Automata, Computability, & Complexity by Elaine Rich ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Slides provided.
Effective Public Speaking Chapter # 3 Setting the Scene for Community in a Diverse Culture.
Facial Expressions of Android Robots. Maria Curie-Sklodowska.
Chapter 7. BEAT: the Behavior Expression Animation Toolkit
Explanation Facility دكترمحسن كاهاني
Getting the Language Right ITSW 1410 Presentation Media Software Instructor: Glenda H. Easter.
04/30/13 Last class: summary, goggles, ices Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1 Image: wordpress.com/2011/11/22/lig.
Combinational Problems: Unate Covering, Binate Covering, Graph Coloring and Maximum Cliques Example of application: Decomposition.
“Do NOW” “Do NOW” What is the Definition of Peer Pressure? What is the Definition of Peer Pressure? What is the difference between Direct and Indirect.
I Robot.
Homework 1 (with additional explanations) Intelligent Robotics 1, ECE 478/578 Deadline, October 15 This Homework is Group Project Will be incorporated.
ENTERFACE 08 Project 1 “MultiParty Communication with a Tour Guide ECA” Mid-term presentation August 19th, 2008.
MATH 224 – Discrete Mathematics
2. Regular Expressions and Automata 2007 년 3 월 31 일 인공지능 연구실 이경택 Text: Speech and Language Processing Page.33 ~ 56.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
ICS 252 Introduction to Computer Design Lecture 12 Winter 2004 Eli Bozorgzadeh Computer Science Department-UCI.
DO NOW: 1.State whether you agree or disagree with this statement-and tell me WHY- “Everyone learns the same way.” Be prepared to justify your answer.
Homework 1 Intelligent Robotics 1, ECE 478/578 Deadline, October 15 This Homework is Group Project Will be incorporated into your final project.
Universal Design for Learning (UDL) & Your Students … Do your students struggle with:  Reading?  Writing?  Achievement?  Appropriate behavior? UDL.
Thursday, Sept. 10 th 9:50-10:2010:20-10:5510:55-11:15 Study Hall & Finish the ROUGH DRAFT of your THANK YOU NOTE (this is a CW grade) [You will get your.
The RoboCup Standard Platform League : Soccer for robots Requires fast, stable, intelligent robots Robots wear out and are time consuming to work with.
Artificial Intelligence
Chapter 3: Methods of Inference
PROBABILISTIC AND LOGIC APPROACHES TO MACHINE LEARNING AND DATA MINING
Robot Metaphors and Models
Quantum Logic Quantum Logic Boolean Logic EXOR/AND Logic
Chapter 3: Methods of Inference
Review and Ideas for future Projects
Quantum Logic Quantum Logic Boolean Logic EXOR/AND Logic
Example of application: Decomposition
Robot Metaphors and Models
Homework 2 This homework is the first use of quantum gates. In lectures we learned about the following gates: inverter, Feynman (controlled NOT), Toffoli.
Presentation transcript:

Probabilistic State Machines to describe emotions Happy state Ironic state Unhappy state “you are beautiful” / ”Thanks for a compliment” “you are blonde!” / ”I am not an idiot” P=1 P=0.3 “you are blonde!” / Do you suggest I am an idiot?” P=0.7 Human speaks to robot Robot speaks to human (will be in italic in next slides)

Facial Behaviors of Maria Do I look like younger than twenty three? Maria asks:  “yes”  “no” Response from a human: Maria smiles Maria frowns In word spotting mode human responses are short

Probabilistic Grammars for performances Who? What? Where? Speak ”Professor Perky”, blinks eyes twice Speak “In the classroom”, shakes head P=0.1 Speak “Was drinking wine” P=0.1 P=0.3 P=0.5 Speak ”Professor Perky” Speak ”Doctor Lee” Speak “in some location”, smiles broadly Speak “Was singing and dancing” P=0.5 P=0.1 …. P=0.1 A complete behavior of a robot described as a probabilistic (quantum entangled) machine

Human-controlled modes of dialog/interaction Robot asks Human teaches Human commandsHuman asks Robot performs “Hello Maria” “Thanks, I have a question” “Thanks, I have a lesson” “Thanks, I have a command” “Lesson finished” “Questioning finished” “Command finished” “Stop performance” “Question” initialization This slide shows only human speech controls, no robot responses showing its state

The next slides will illustrate the following robot behaviors: Robot Initiated Conversation.Robot Initiated Conversation. Human-Initiated Conversation.Human-Initiated Conversation. Human asking.Human asking. Human teaching.Human teaching. Human verifying what robot learned.Human verifying what robot learned. Robot Performing (text, music, movements). Robot Performing (text, music, movements). Game Playing. Game Playing. Other robot behaviors:

Robot-Receptionist Initiated Conversation Robot What can I do for you? Human Robot asks This represents operation mode

Robot-Receptionist Initiated Conversation Robot What can I do for you? Human I would like to order a table for two Robot asks

Robot-Receptionist Initiated Conversation Robot Smoking or non- smoking? Human Robot asks

Robot-Receptionist Initiated Conversation Robot Smoking or non- smoking? Human I do not understand Robot asks

Robot-Receptionist Initiated Conversation Robot Do you want a table in a smoking or non-smoking section of the restaurant? Non-smoking section is near the terrace. Human Robot asks

Robot-Receptionist Initiated Conversation Robot Do you want a table in a smoking or non-smoking section of the restaurant? Non-smoking section is near the terrace. Human A table near the terrace, please Robot asks

Human-Initiated Conversation Robot Human Hello Maria Robot asks initialization

Human-Initiated Conversation Robot Human Hello Maria What can I do for you? Robot asks

Human-Asking Robot Human Question Human asks Question Robot asks

Human-Asking Robot Human Question Human asks Yes, you ask a question.

Human-Asking Robot Human What book wrote Lee? Human asks Yes, you ask a question.

Human-Asking Robot Human What book wrote Lee? Human asks I have no sure information.

Human-Asking Robot Human Try to guess. Human asks I have no sure information.

Human-Asking Robot Human Try to guess. Human asks Lee wrote book “Flowers”.

Human-Asking Robot Human This is not true. Human asks Lee wrote book “Flowers”.

Human-Teaching Robot Human Questioning finished Human teaches “Questioning finished” Robot asks Human asks Thanks, I have a lesson Human ends questioning

Human-Teaching Robot Human Questioning finished Human teaches “Questioning finished” Robot asks Human asks Thanks, I have a lesson Robot enters asking mode What can I do for you?

Human-Teaching Robot Human Thanks, I have a lesson Human teaches “Questioning finished” Robot asks Human asks Thanks, I have a lesson Human starts teaching What can I do for you?

Human-Teaching Robot Human Thanks, I have a lesson Yes Human teaches

Human-Teaching Robot Human I give you question- answer pattern Yes Human teaches

Human-Teaching Robot Human Question pattern: What book Smith wrote? Yes Human teaches

Robot Human Answer pattern: Smith wrote book “Automata Theory” Yes Human teaches Human-Teaching

Human-Teaching Robot Human Checking question: What book wrote Smith? Yes Human teaches

Human-Teaching Robot Human Checking question: What book wrote Smith? Smith wrote book “Automata Theory” Human teaches

Human-Teaching Robot Human I give you question- answer pattern Yes Human teaches

Human-Teaching Robot Human Question pattern: Where is room of Lee? Yes Human teaches

Human-Teaching Robot Human Answer pattern: Lee is in room 332 Yes Human teaches

Human-Checking what robot learned Robot Human Lesson finished Human asks Question Robot asks Human teaches “Lesson finished”

Human-Checking what robot learned Robot Human Lesson finished Human asks Question Robot asks Human teaches “Lesson finished” What can I do for you?

Human-Checking what robot learned Robot Human Question Human asks Question Robot asks Human teaches “Lesson finished” What can I do for you?

Human-Asking Robot Human Question Human asks Question Robot asks Human teaches “Lesson finished” Yes, you ask a question.

Human-Asking Robot Human What book wrote Lee? Human asks Yes, you ask a question.

Human-Asking Robot Human What book wrote Lee? Human asks I have no sure information.

Human-Asking Robot Human Try to guess. Human asks I have no sure information.

Human-Asking Robot Human Try to guess. Human asks Lee wrote book “Automata Theory” Observe that robot found similarity between Smith and Lee and generalized (incorrectly)

How we linked Behavior, Dialog and Learning The dialog/behavior has the following components: –(1) Eliza-like natural language dialogs based on pattern matching and limited parsing. Commercial products like Memoni, Dog.Com, Heart, Alice, and Doctor all use this technology, very successfully – for instance Alice program won the 2001 Turing competition. –This is a “conversational” part of the robot brain, based on pattern-matching, parsing and black-board principles. –It is also a kind of “operating system” of the robot, which supervises other subroutines.

(2) Subroutines with logical data base and natural language parsing (CHAT). –This is the logical part of the brain used to find connections between places, timings and all kind of logical and relational reasonings, such as answering questions about Japanese geography. (3) Use of generalization and analogy in dialog on many levels. –Random and intentional linking of spoken language, sound effects and facial gestures. –Use of Constructive Induction approach to help generalization, analogy reasoning and probabilistic generations in verbal and non-verbal dialog, like learning when to smile or turn the head off the partner. Behavior, Dialog and Learning

(4) Model of the robot, model of the user, scenario of the situation, history of the dialog, all used in the conversation. (5) Use of word spotting in speech recognition rather than single word or continuous speech recognition. (6) Avoidance of “I do not know”, “I do not understand” answers from the robot. –Our robot will have always something to say, in the worst case, over-generalized, with not valid analogies or even nonsensical and random. Behavior, Dialog and Learning

Generalization of the Ashenhurst- Curtis decomposition model

This kind of tables known from Rough Sets, Decision Trees, etc Data Mining

Decomposition is hierarchical At every step many decompositions exist

Constructive Induction: Technical Details U. Wong and M. Perkowski, A New Approach to Robot’s Imitation of Behaviors by Decomposition of Multiple-Valued Relations, Proc. 5 th Intern. Workshop on Boolean Problems, Freiberg, Germany, Sept , 2002, pp A. Mishchenko, B. Steinbach and M. Perkowski, An Algorithm for Bi-Decomposition of Logic Functions, Proc. DAC 2001, June 18-22, Las Vegas, pp A. Mishchenko, B. Steinbach and M. Perkowski, Bi- Decomposition of Multi-Valued Relations, Proc. 10 th IWLS, pp , Granlibakken, CA, June 12-15, IEEE Computer Society and ACM SIGDA.

Decision Trees, Ashenhurst/Curtis hierarchical decomposition and Bi-Decomposition algorithms are used in our software These methods create our subset of MVSIS system developed under Prof. Robert Brayton at University of California at Berkeley [2]. – The entire MVSIS system can be also used. The system generates robot’s behaviors (C program codes) from examples given by the users. This method is used for embedded system design, but we use it specifically for robot interaction. Constructive Induction

Additional Slides with Background

Ashenhurst Functional Decomposition Evaluates the data function and attempts to decompose into simpler functions. if A  B = , it is disjoint decomposition if A  B  , it is non-disjoint decomposition B - bound set A - free set F(X) = H( G(B), A ), X = A  B X

A Standard Map of function ‘z’ Bound Set Free Set a b \ c z Columns 0 and 1 and columns 0 and 2 are compatible column compatibility = 2 Explain the concept of generalized don’t cares

NEW Decomposition of Multi- Valued Relations if A  B = , it is disjoint decomposition if A  B  , it is non-disjoint decomposition F(X) = H( G(B), A ), X = A  B Relation A B X

Forming a CCG from a K-Map z Bound Set Free Set a b \ c Columns 0 and 1 and columns 0 and 2 are compatible column compatibility index = 2 C1C1 C2C2 C0C0 Column Compatibility Graph

Forming a CIG from a K-Map Columns 1 and 2 are incompatible chromatic number = 2 z a b \ c C1C1 C2C2 C0C0 Column Incompatibility Graph

A unified internal language is used to describe behaviors in which text generation and facial gestures are unified. This language is for learned behaviors. Expressions (programs) in this language are either created by humans or induced automatically from examples given by trainers. Constructive Induction

The integrated approach to robot vision and speech based dialogs

Open CV image processing software from Intel

Hidden Markov Model Based Face Recognition

Braitenberg Vehicles Two sensors two motors Many behaviors from simple rules Control can be a combinational mapping or automaton Combinational logic can be binary, multiple- valued, fuzzy and quantum. Automaton can be binary, multiple-valued, fuzzy, probabilistic, non-deterministic or quantum (entangled) This is a new concept in Machine Learning and Robotics

AND QUANTUM BREITENBERG FACES

Hadamard gate In standard computers probabilistic components are expensive and have aliasing. In quantum these are the cheapest gates and they are ideal random number generators.

Square Root of NOT Deterministic behaviors can be composed from probability waves. This does not happen outside quantum world. Square root controlled gate and its matrix Square root controlled hermitian and its matrix Two Square root gates composed to an inverter

Analysis of a Quantum Circuit. Matrices in Hilbert Space Analysis of a Quantum Circuit. Matrices in Hilbert Space

Kronecker Product for Quantum Circuit Analysis Parallel connection of gates requires Kronecker Product. Serial connection of gates (Previous slides) requires standard matrix multiplication.

Analysis of a Quantum Circuit Analysis of a Quantum Circuit

Conclusion. What did we learn (1) the more degrees of freedom the better the animation realism. (2) synchronization of spoken text and head (especially jaw) movements are important but difficult. (3) gestures and speech intonation of the head should be slightly exaggerated.

Conclusion. What did we learn(cont) (4) the sound should be laud to cover noises coming from motors and gears and for a better theatrical effect. (5) noise of servos can be also reduced by appropriate animation and synchronization. (6) best available ATR and TTS packages should be applied, especially those that use word spotting. (7) use puppet theatre experiences.

(8) because of a too slow learning, improved parameterized learning methods will be developed, but also based on constructive induction. (9) open question: funny versus beautiful. (10) either high quality voice recognition from headset or low quality in noisy room. YOU CANNOT HAVE BOTH WITH CURRENT ATR TOOLS. The bi-decomposer of relations and other useful software used in this project can be downloaded from Conclusion. What did we learn(cont)

Conclusion Monday, May 10, Intelligent Robotics Laboratory and Industrial Robotics Laboratory. Demo 10am- 2pm Thursday, May 13, Convention Center. Demo 10am- 2pm Sunday, June 6, PSU Balroom Smith Center. Competition and Demo 10am- 2pm Help needed. If you can program, interface PCs, know about networks, want to help with WWW Page, build robots, learn advanced theories, ……. You are welcome to the lab.