Qualitative Spatial Analysis Chris Mansley. Qualitative Quantitative items are known, definable quantities (x,y) coordinates Remaining health Location.

Slides:



Advertisements
Similar presentations
Chapter 09 AI techniques in different game genres (Puzzle/Card/Shooting)
Advertisements

Artificial Intelligence in Game Design
Wall Building for RTS Games Patrick Schmid. Age of Empires.
Heuristic Search techniques
A New World Or People Keep Telling Me This is Ambitious By Jeremiah Lewis.
1 CO Games Development 2 Week 15 Terrain Analysis Gareth Bellaby.
Multi-tiered AI Patrick Schmid. Multi-tiered AI We already saw a presentation about this topic Remember Ke‘s presentation? Short recap.
CST203-2 Database Management Systems Lecture 7. Disadvantages on index structure: We must access an index structure to locate data, or must use binary.
Pathfinding Basic Methods.
CSE 380 – Computer Game Programming Pathfinding AI
HMAX Models Architecture Jim Mutch March 31, 2010.
Space Rescue Chad Seippel Cory VanHooser. Story 2050 brand new International Space Station Distress call from ISS about “alien attack” No further communication.
Artificial Intelligence in Game Design Intelligent Decision Making and Decision Trees.
Multi-agent Planning Amin Atrash. Papers Dynamic Planning for Multiple Mobile Robots –Barry L. Brummit, Anthony Stentz OBDD-based Universal Planning:
MOBILE BUDGET PLANNER & SHOPPING ASSISTANT Intuitive and on-the-go approach to budgeting Andrew Okoh Dr. Marko Popovic Kwan Hong Lee.
Artificial Intelligence in Game Design Hierarchical Finite State Machines.
Using Cellular Automata and Influence Maps in Games
RED DEAD REVOLVER Artificial Intelligence Critique By Mitchell C. Dodes CIS 588.
Introduction General Data Structures - Arrays, Linked Lists - Stacks & Queues - Hash Tables & Binary Search Trees - Graphs Spatial Data Structures -Why.
Introduction General Data Structures - Arrays, Linked Lists - Stacks & Queues - Hash Tables & Binary Search Trees - Graphs Spatial Data Structures -Why.
1 SMART ANTENNA TECHNIQUES AND THEIR APPLICATION TO WIRELESS AD HOC NETWORKS JACK H. WINTERS /11/13 碩一 謝旻欣.
Strategies for Implementing Dynamic Load Sharing.
Lecture 07: Terrain Analysis Geography 128 Analytical and Computer Cartography Spring 2007 Department of Geography University of California, Santa Barbara.
Tactical AI in Real Time Supervisor: Aleks Jakulin Crew: Damir Arh, Matija Jekovec, Mitja Luštrek Gregor Leban, Martin Žnidaršič, Uroš Čibej Translation:
Neural Networks Slides by Megan Vasta. Neural Networks Biological approach to AI Developed in 1943 Comprised of one or more layers of neurons Several.
Tactical and Strategic Reasoning  Covers…  Deducing tactical situations from sketchy (limited) information  Using tactical situations to make decisions.
Xavier Otero Keil.  Animation  Control characters body  makes sure that animation fits situation  handles requests to perform actions  Combat  Possibly.
Artificial Intelligence in Game Design Event and Sense Management.
Pathfinding: Search Space Representations Chapter 2.1 Dan Bader.
Artificial Intelligence in Game Design Problems and Goals.
Game AI versus AI What is the difference between Game AI an AI? Can this difference be overcome? What is an attack Kung-Fu style? Discuss some alternatives.
Networking Networking is done via a single component that is persistent in each machine’s game. This multiplayer manager component handles all Unity RPC.
Artificial Intelligence in Game Design
AI Game Programming Wisdom 2 Chapter 3.3
August 31, 2005 Game Developer Conference Europe Killzone’s AI: Dynamic Procedural Tactics Guerrilla Games - 1 Killzone’s AI: Dynamic Procedural Tactics.
Hashing Chapter 20. Hash Table A hash table is a data structure that allows fast find, insert, and delete operations (most of the time). The simplest.
Ch 7.1: Using a Spatial Database for Runtime Spatial Analysis.
Artificial Intelligence in Game Design
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Artificial Intelligence in Game Design Complex Steering Behaviors and Combining Behaviors.
WORLD NAVIGATION Don’t Fall Asleep Through These Topics  Tile Graphs  Points of Visibility  NavMesh  Path Smoothing  Hierarchical Pathfinding.
Artificial intelligence
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
Random Map Generation and Transport Unit AI for Strategy Games By Russell Kuchar.
Intelligent Database Systems Lab N.Y.U.S.T. I. M. Externally growing self-organizing maps and its application to database visualization and exploration.
Neural Network Implementation of Poker AI
Artificial Intelligence for Games Finite State Machines
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
AI Evaluation David Nowell CIS 588 2/14/05 Baldur’s Gate.
F.E.A.R. Game AI Evaluation by Robert Rak. What is F.E.A.R. ? FEAR is a First Person Shooter game Player takes on the role of an elite strike force team.
Introduction to Models Lecture 8 February 22, 2005.
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
1 CO Games Development 1 Week 3 Game Agents 2 Gareth Bellaby.
Administrative: “Create New Game” Project Apply the principles of Iterative Design –First run of games in class: March 28 th in class Short document describing:
Qualitative Spatial Analysis Part 2 Chris Mansley.
1 CO Games Development 1 Week 9 - part 2 Pathfinding Considerations Gareth Bellaby.
1 A Methodology for automatic retrieval of similarly shaped machinable components Mark Ascher - Dept of ECE.
1 CO Games Development 2 Week 13 Influence Maps Gareth Bellaby.
2013 Section Meeting Coaching Workshop Maximizing Coaching Moments with Young Players.
Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 1 Authors : Siming Liu, Christopher Ballinger, Sushil Louis
Goal-Oriented Game AI Purpose and Utilizations Research Organized by: Evan Schipellite.
Team Member AI in an FPS and Goal Oriented Action Planning.
Sourcing Event Tool Kit Multiline Sourcing, Market Baskets and Bundles
Movement in a full and dynamic environment using a limited influence map Paulo Lafeta Ferreira Artificial Intelligence for Games – CS 580 Professor: Steve.
CMSC201 Computer Science I for Majors Lecture 11 – Program Design
Pathfinding Over Streaming Terrain
RECAP CSE 397/497 Topics on AI and Computer Game Programming
Ch 7.1: Using a Spatial Database for Runtime Spatial Analysis
Artificial Intelligence in Games Week 7
Presentation transcript:

Qualitative Spatial Analysis Chris Mansley

Qualitative Quantitative items are known, definable quantities (x,y) coordinates Remaining health Location of units Qualitative items are much more intangible but intimately related to qualitative items By decoupling the two, more general code/ideas can be used about the AI

An example Trafficablity Given a map and an echelon Restricted (Impassible) Restricted (Passable) Unrestricted Mobility Corridors Avenues of Approach

Example (cont.)

Motivations Game worlds are increasingly more complex NPC must be able to reason about them in an intelligent fashion Dynamic environments Makes scripting less of an option Leads to more problems

Two Implementations Spatial Database Driven by the dynamic environments associated with FPS Terrain Analysis Needed a realistic way to analyze strategic value in RTS

Conventional Methods Conventional Spatial Ideas NPCs are guided by “hints” placed in the level by designers Offline analysis of level to build a data structure the NPCs can use to interact with the environment

AI Nodes

Conventional Methods (cont.) Flaws Only works for static environments! May be difficult with random maps

Spatial Databases 2-D Grid overlaid on the game world Each cell can have many layers of data Can be thought of as several grids laid on top of one another

Spatial Databases Search layer Occupancy layer Openness layer

Data Layers Openness Layer (Static) Cover Layer (Static) Area Search Layer (Dynamic) Area Occupancy Layer (Dynamic) Line-of-Fire Layer (Dynamic) Light Level Layer (Dynamic)

Using Layers Layers can be combine to form desirability layers for different scenarios Combat Desirability Openness Occupancy Cover

Using Layers (cont.) Benefits Implicitly coordinate multiple AI units Generate multiple movements for different actions

Using Layers (cont.) Drawbacks Does not handle 3-D environments easily Simple Solution – break 3-D environment into smaller grids Potentially processor intensive Streamline resolution of grid to get best possible results

Calculating Desirability Cover layer Occupancy layer Openness layer Desirability layer =

Openness Layer A cell containing a wall or blocking object contains a zero All other cells contain a one The zero is propagated to neighboring cells to be able to determine proximity to the wall

Openness Layer (cont.) Solid Wall

Area Occupancy Layer Similar to fog-of-war feature from RTS Nonzero values are placed where the unit is located That value is propagated to the neighboring cells

Area Occupancy Layer (cont.)

Line-of-Fire Layer Useful with ranged weapons Helps AI avoid shooting each other Has a nonzero value in each cell in the direction of fire

Line-of-Fire (cont.)

Light Level Dynamic lighting is an important part of modern games Visibility/area lighting can be taken into account by NPCs The layer has the light intensity at any cell

Area Search Layer In many “sneaker” games, the NPCs spend time searching for the player Once searched, the area layer contains true or some nonzero value Over time that layer can decay, so the NPC will research it if necessary

Thief: Deadly Shadows

References AI Game Programming Wisdom 2 Forbus, K., “How Qualitative Spatial Reasoning Can Improve Strategy Game AIs”, IEEE Intelligent Systems, July/August 2002 Thief: Deadly Shadows, Ion Storm/Eidos Interactive 2004