1 CO2301 - Games Development 1 Week 1 Introduction to AI Gareth Bellaby.

Slides:



Advertisements
Similar presentations
AI Pathfinding Representing the Search Space
Advertisements

1 CO Games Development 2 Week 15 Terrain Analysis Gareth Bellaby.
Artificial Intelligence for Games Patrick Olivier & John Shearer
Knowledge Representation Chapter 4. 2 What is KR? R. Davis, H. Schrobe, P. Szolovits (1993): 1.A surrogate 2.A set of ontological commitments 3.A fragmentary.
Robotics Versus Artificial Intelligence. Search. SearchSearch “All AI is search” “All AI is search”  Game theory  Problem spaces Every problem is a.
CSE 380 – Computer Game Programming Pathfinding AI
Bart Selman CS CS 475: Uncertainty and Multi-Agent Systems Prof. Bart Selman Introduction.
A Brief History of Artificial Intelligence
CPSC 322 Introduction to Artificial Intelligence October 29, 2004.
Artificial Intelligence Austin Luczak, Katie Regin, John Trawinski.
November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.
CS 357 – Intro to Artificial Intelligence  Learn about AI, search techniques, planning, optimization of choice, logic, Bayesian probability theory, learning,
Robotics Versus Artificial Intelligence. Search. SearchSearch “All AI is search” “All AI is search”  Game theory  Problem spaces Every problem is a.
Chapter 5.4 Artificial Intelligence: Pathfinding.
CS5201 Intelligent Systems (2 unit) Semester II Lecturer: Adrian O’Riordan Contact: is office is 312, Kane
Leroy Garcia 1.  Artificial Intelligence is the branch of computer science that is concerned with the automation of intelligent behavior (Luger, 2008).
Dr Rong Qu Module Introduction.
CSE (c) S. Tanimoto, 2008 Introduction 1 CSE 415 Introduction to Artificial Intelligence Winter 2008 Instructor: Steve Tanimoto
1 CO Games Concepts Week 24 Preparation for next year Gareth Bellaby.
Artificial Intelligence (AI) Addition to the lecture 11.
1 CO Games Development 1 Week 5 Deriving a "look at" function + Graph Theory Gareth Bellaby.
Chapter 5.4 Artificial Intelligence: Pathfinding.
Lecture 5 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Artificial Intelligence Dr. Paul Wagner Department of Computer Science University of Wisconsin – Eau Claire.
Artificial Intelligence: Its Roots and Scope
Lecture 1 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Artificial Intelligence Lecture 9. Outline Search in State Space State Space Graphs Decision Trees Backtracking in Decision Trees.
1 CO Games Development 1 Week 6 Introduction To Pathfinding + Crash and Turn + Breadth-first Search Gareth Bellaby.
1 CO Games Development 1 Week 11 Search Methods Gareth Bellaby.
CO1301: Games Concepts Dr Nick Mitchell (Room CM 226) Material originally prepared by Gareth Bellaby.
CO Games Development 1 Week 12 Interpolation, Path Smoothing & Splines
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Games Development 2 Review & Revision Strategy CO3301 End of Semester 1.
1 CO Games Development 1 Week 2 Game Agents Gareth Bellaby.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 11: Artificial Intelligence Computer Science: An Overview Tenth Edition.
Artificial Intelligence IES 503 Asst. Prof. Dr. Senem Kumova Metin.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Chapter 1 –Defining AI Next Tuesday –Intelligent Agents –AIMA, Chapter 2 –HW: Problem.
1 CO Games Development 1 Week 13 - Revision Lecture AI Revision Gareth Bellaby.
1 Intro to Artificial Intelligence COURSE # CSC384H1F Fall 2008 Sonya Allin Note: many slides drawn from/inspired by Andrew Moore’s lectures at CMU and.
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.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
1 CO Games Development 1 Week 3 Game Agents 2 Gareth Bellaby.
1 CO Games Development 1 Week 4 Finite State Machines + Maths Gareth Bellaby.
1 CO Games Development 1 Week 8 A* Gareth Bellaby.
A Brief History of AI Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
February 11, 2016Introduction to Artificial Intelligence Lecture 6: Search in State Spaces II 1 State-Space Graphs There are various methods for searching.
CO1301: Games Concepts Dr Nick Mitchell (Room CM 226) Material originally prepared by Gareth Bellaby.
1 CO Games Development 1 Week 9 - part 2 Pathfinding Considerations Gareth Bellaby.
Lecture 2: Problem Solving using State Space Representation CS 271: Fall, 2008.
1 CO Games Development 2 Week 13 Influence Maps Gareth Bellaby.
Maestro AI Vision and Design Overview Definitions Maestro: A naïve Sensorimotor Engine prototype. Sensorimotor Engine: Combining sensory and motor functions.
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
CO Games Development 2 Week 20 Production Systems
Artificial Intelligence
Artificial intelligence (AI)
CHAPTER 1 Introduction BIC 3337 EXPERT SYSTEM.
Games Development 2 semester 1 Review & Revision
Artificial Intelligence (CS 461D)
CO Games Development 2 Week 19 Extensions to Finite State Machines
Course Instructor: knza ch
CO Games Development 2 Week 24 - Revision Lecture AI Revision
KNOWLEDGE REPRESENTATION
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.
CO Games Concepts Week 25 Preparation for next year
CO Games Development 1 Week 8 Depth-first search, Combinatorial Explosion, Heuristics, Hill-Climbing Gareth Bellaby.
CO Games Concepts Week 12 Collision Detection
COMP3710 Artificial Intelligence Thompson Rivers University
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
AI Application Session 12
Presentation transcript:

1 CO Games Development 1 Week 1 Introduction to AI Gareth Bellaby

2 Topics 1.Introductory material 2.Complexity and Knowledge Representation 3.Knowledge Representation

3 Topic 1 Introductory material

4 Characteristics of the Second Year Possibly the most difficult of the three years. A lot of material to learn. But getting to the heart of the material.

5 Resources If you haven't already got these you must buy: Rabin, Steve, (ed.), (2005), Game Development, Charles River Media. ISBN-13: van Verth, James, (2008), Essential Mathematics For Games & Interactive Applications: A Programmer's Guide Book, 2nd ed., Morgan Kaufmann. ISBN-13: The maths book has an associated web site:

6 Resources The other two books I recommend for the module are: Russell, Stuart & Norvig, Peter, (2003), Artificial Intelligence: A Modern Approach, (International Edition), Pearson Education. ISBN-13: Ahlquist, John, (2007), Game Development Essentials: Game Artificial Intelligence, Delmar. ISBN-13:

7 Others Resources Many good textbooks about AI - look in the library. Games AI Wisdom series. Edited by Steve Rabin. Game Programming Gems, Edited by Mark DeLoura and others

8 AI in the module Movement Targeting Basics of turning, avoidance, patrolling Pathfinding Software agents - main model used for FPS, racing type games, or for bots. Finite State Machines

9 AI Overview 1.Introduction to AI, Knowledge and Representation 2.Game Agents 1 3.Game Agents 2 (Sensing: Vision and Hearing) 4.Finite State Machines + Maths 5.LookAt + Graph Theory 6.Introduction to Pathfinding, Crash and Turn, Breadth-First search 7.Second year project week - no classes

10 AI Overview 8.Depth-First search, Combinatorial Explosion, Heuristics, Hill-climbing 9.Best-First, Dijstra's algorithm. Distances, graphs and lines 10.A* 11.Search methods 12.Interpolation (Path Smoothing, splines) 13.Pathfinding Considerations (Final comments on algorithms, Representations 14.Revision. Planning, resistance, threats, etc??

11 Topic 2 Complexity and Knowledge Representation

12 What is AI? Phrase invented by John McCarthy in However, earlier thinkers already examining, e.g. Turing. Decision making, automation, artificial minds... a rag-bag of unrelated problems? What is intelligence? The definition of AI is an ongoing debate which reflects the nature of the subject. Games - by way of contrast: a practical approach to AI.

13 Representation & Reasoning There are a variety of knowledge representation methods. Most AI is based on symbol manipulation, i.e. a set of symbols with a set of procedures for operating on them. Knowledge is representation and the methods for manipulating it. Facts are the things we want to represent. Representations of the facts are what are being manipulated.

14 Knowledge Representation Representation matters a great deal. A poor representation can make things impossibly difficult. A good representation can make reasoning easier. One important topic of game AI is pathfinding. Imagine movement around a level in a game. Describe the level using the coordinates of the walls, position of objects, etc. Use collision detection to calculate whether the agent is blocked. Such a poor representation would lead to complex and difficult calculations.

15 Knowledge Representation A simplified representation of the world is used, e.g. A square grid with only horizontal and vertical movement. Waypoints interconnected by lines. Regions. It is difficult to reason about the real world.

16 Map design The AI developer should work closely with the level designer. This relationship may include the artists as well. Change the design of the level to work with the AI. Simplify the world - don't include features which are difficult to navigate. Convex is better than concave.

17 Halo Articles can be found here: Damian Isla (AI Engineering Lead) "Halo AI Retrospective: 8 Years of Work on 30 Seconds of Fun"

18 Halo

19 Halo

20 Halo

21 Halo

22 Halo Video. Action sped up to twice normal speed.

23 Topic 3 Knowledge Representation

24 Knowledge Representation A good representation can make reasoning not only correct but trivial. Example: the mutilated chess board problem. A normal chess board has had two squares in opposite corners removed. Can you cover all the remaining squares exactly with dominoes? Each domino covers two square. No overlapping of dominoes, either on each other or over the boundary is allowed.

25 Board Representation (1)

26 Board Representation (2)

27 Board Representation (3) Number of black squares = 30 Number of white squares = 32

28 Knowledge Representation The third representation method directly suggests the answer, along with the additional specification that each domino must cover exactly one black and one white square. The second method is (typically) better than the first. Representation therefore can make a big difference. If the representation is not good, a program may not be able to produce the desired results.

29 Knowledge Representation Good systems should have: 1.Representational adequacy. 2.Inferential adequacy. 3.Inferential efficiency. 4.Acquisitional efficiency. Perhaps not possible to optimise all four.

30 Knowledge Representation A set of facts can be represented in a database. However, a database has very low inferential capabilities. It might be possible to use an inference engine (cf. Data Mining). Database: static, flat, homogenous, passive. Knowledge Base: flexible, layered, heterogeneous, active.