Reactive Behavior Modeling Decision Trees (GATE-561)

Slides:



Advertisements
Similar presentations
Reconstruction from Voxels (GATE-540)
Advertisements

DECISION TREES. Decision trees  One possible representation for hypotheses.
Contest format 5 hours, around 8-12 problems One computer running (likely)Linux, plus printer 3 people on one machine No cell phones, calculators, USB.
GATE Reconstruction from Point Cloud (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager.
GATE Reactive Behavior Modeling Neural Networks (GATE-561) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies Bilkent.
GATE Artificial Intelligence in Games (GATE-561) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies Bilkent University,
Artificial Intelligence in Game Design Intelligent Decision Making and Decision Trees.
GATE Reactive Behavior Modeling Fuzzy Logic (GATE-561) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies Bilkent University,
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
GATE Reconstruction from Polygon Soup (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager.
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 20 Instructor: Paul Beame.
GATE D Geometric Modeling and Processing (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager.
1 8. Safe Query Languages Safe program – its semantics can be at least partially computed on any valid database input. Safety is tied to program verification,
Decision Tree Algorithm
About ISoft … What is Decision Tree? Alice Process … Conclusions Outline.
Context-sensitive Analysis, II Ad-hoc syntax-directed translation, Symbol Tables, andTypes.
Covering Algorithms. Trees vs. rules From trees to rules. Easy: converting a tree into a set of rules –One rule for each leaf: –Antecedent contains a.
5/25/2005EE562 EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 16, 6/1/2005 University of Washington, Department of Electrical Engineering Spring 2005.
Introduction to Artificial Intelligence (AI) (GATE-561)
CS Integration Management (Part 6) Bilgisayar Mühendisliği Bölümü – Bilkent Üniversitesi – Fall 2009 Dr.Çağatay ÜNDEĞER Instructor Bilkent University,
GATE Common AI Architectures (GATE-561) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies Bilkent University, Computer.
Software Engineering Project Management (CS - 413)
Spreadsheets In today’s lesson we will look at:
Chapter 6 Decision Trees
Monté Carlo Simulation MGS 3100 – Chapter 9. Simulation Defined A computer-based model used to run experiments on a real system.  Typically done on a.
ID3 Algorithm Allan Neymark CS157B – Spring 2007.
Decision Trees.
Mohammad Ali Keyvanrad
Production Systems A production system is –a set of rules (if-then or condition-action statements) –working memory the current state of the problem solving,
State university of New York at New Paltz Electrical and Computer Engineering Department Logic Synthesis Optimization Lect19: Multi Level Logic Minimization.
The Advantages And Disadvantages Of Monitoring At Work
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Fires are a real danger even in modern apartment buildings. How much do people know about these situations? Do they know how to react? The critical question.
Project Management Components (Part 5)
Artificial Intelligence in Game Design N-Grams and Decision Tree Learning.
Copyright © 2010 SAS Institute Inc. All rights reserved. Decision Trees Using SAS Sylvain Tremblay SAS Canada – Education SAS Halifax Regional User Group.
Digital Communication Introduction to Grade 5. What is Digital Communication? Digital Communication is any message passed through digital devices Digital.
MACHINE LEARNING 10 Decision Trees. Motivation  Parametric Estimation  Assume model for class probability or regression  Estimate parameters from all.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View BDDs.
Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.
Verification & Validation By: Amir Masoud Gharehbaghi
DECISION TREE Ge Song. Introduction ■ Decision Tree: is a supervised learning algorithm used for classification or regression. ■ Decision Tree Graph:
SAFEWARE System Safety and Computers Chap18:Verification of Safety Author : Nancy G. Leveson University of Washington 1995 by Addison-Wesley Publishing.
COMP 2208 Dr. Long Tran-Thanh University of Southampton Decision Trees.
Advanced Task Engine Doing Cool Stuff with Cool stuff!
Outline Decision tree representation ID3 learning algorithm Entropy, Information gain Issues in decision tree learning 2.
CS 46B: Introduction to Data Structures July 23 Class Meeting Department of Computer Science San Jose State University Summer 2015 Instructor: Ron Mak.
1 Chapter 12: Indexing and Hashing Indexing Indexing Basic Concepts Basic Concepts Ordered Indices Ordered Indices B+-Tree Index Files B+-Tree Index Files.
Processor Organization and Architecture Module III.
Algorithms and Flowcharts
Team Member AI in an FPS and Goal Oriented Action Planning.
Artificial Intelligence in Game Design
Roadmap to Programming work, right, fast KISS
Fall 2009 B+ Tree Recitation
Simple Learning: Hebbian Learning and the Delta Rule
CIS 488/588 Bruce R. Maxim UM-Dearborn
Secondary Computing and ICT Curriculum
Alan Mishchenko UC Berkeley (With many thanks to Donald Knuth,
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Moral Compass Questions Rights and Responsibilities
Introduction to Data Structure
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Presentation transcript:

Reactive Behavior Modeling Decision Trees (GATE-561) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies Bilkent University, Computer Engineering & General Manager SimBT Inc. e-mail : cagatay@undeger.com Game Technologies Program – Middle East Technical University – Fall 2009

Outline Decision Trees

Decision Trees Rules are defined as a tree. Conditions are non-leaf nodes. Actions/decisions are leaf nodes. Decision trees can be learned (e.g. ID3).

Sample Inputs & Outputs Inputs (State variables) Safety (in danger, not safe, safe) See something (yes, no) Theat situation (firing at me, attacking me, escaping) Outputs (Actions) Fire at the threat Lay down rapidly Escape from threat Crouch and wait silently Walk around Sleep somewhere

Sample Instances For Learning If in danger, see something and threat firing at me then Fire at the threat (count = 2) then Lay down rapidly (count = 1) If in danger, see something and threat attacking me then Escape from threat (count = 1) then Fire at the threat (count = 1) If in danger, see something and threat escaping If not safe and see something then Crouch and wait silently (count = 1) If not safe and not see something then Walk around (count = 1) If safe then Sleep somewhere (count = 1)

A Sample Decision Tree Inputs (state variables) Outputs (actions)

Advantages A simple and compact representation. Easy to create and understand: Can also be represented as rules Decision trees can be learned.

Disadvantages Decision tree learning algorithm is complex (hard to be coded). Need as many examples as possible. Sensitive to the errors in instances, Learned decision trees may contain errors.

Manual Decision Trees Weapon WeaponUse: Firing Action WeaponUse: Ready WeaponUse: Pointing GunMunition: Filled || Almost Empty WeaponRange: In Fire Range Query Visibility: Not Do Treat See You? WeaponUsageConstraint: Dont Fire If Not Needed Action WeaponUse: Point WeaponUsageConstraint: Fire If See Any One Action WeaponUse: Fire Query Visibility: Do Treat See You? WeaponRange: Not In Fire Range GunMunition: Empty WeaponUse: Ready || Relax GunMunition: Filled Feeling: In Danger GunPower: Enough To Kill GunPower: Not Enough To Kill Query GunPower: Not Has Gun Enough To Kill?