Abstract Terrain Representation in Full Spectrum Command Ramesh Saran USC-ICT.

Slides:



Advertisements
Similar presentations
Artificial Intelligence in Game Design
Advertisements

Adam Miles. Transport Tycoon Deluxe (TTD): Written by Chris Sawyer for Microprose in Written almost entirely in Assembly language. Designed for.
Adam Miles.  Transport Tycoon Deluxe (TTD):  Written by Chris Sawyer for Microprose in  Written almost entirely in Assembly language.  Designed.
Novar iScope This demonstration is designed to show the features of the iScope software and graphics package.
CSE 380 – Computer Game Programming Pathfinding AI
CSE 381 – Advanced Game Programming Scene Management
MetaSim - design Version 1.0. Outline DrillSim Original design Plug and play requirements MetaSim Design Input Interfaces DrillSim Where are so far Future.
Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Introduction General Data Structures - Arrays, Linked Lists - Stacks & Queues - Hash Tables & Binary Search Trees - Graphs Spatial Data Structures -Why.
Chapter 7 Network Flow Models.
22 Building Simulation Models using ProModel. 23 Please Read Practice Model Shop Floor found on the next page.
Introduction General Data Structures - Arrays, Linked Lists - Stacks & Queues - Hash Tables & Binary Search Trees - Graphs Spatial Data Structures -Why.
Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.
Route Planning Vehicle navigation systems, Dijkstra’s algorithm, bidirectional search, transit-node routing.
1 Advanced Scene Management System. 2 A tree-based or graph-based representation is good for 3D data management A tree-based or graph-based representation.
Exposure In Wireless Ad-Hoc Sensor Networks S. Megerian, F. Koushanfar, G. Qu, G. Veltri, M. Potkonjak ACM SIG MOBILE 2001 (Mobicom) Journal version: S.
The Greedy Wall Building algorithm Rami Khouri. Ideal definition of Wall Either keeps valuable assets in, or enemies out…mostly keep enemies out Impassable,
Graph proportional relationships
Visibility Graphs and Cell Decomposition By David Johnson.
1 Game AI Path Finding. A Common Situation of Game AI A Common Situation of Game AI Path Planning Path Planning –From a start position to a destination.
Localisation & Navigation
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
AI in FPS. Contents FPS AI Architecture –Animation –Movement –Combat –Behavior Positioning strategy –Waypoint –Pinch Point.
1 The Use of Artificial Intelligence in the Computer Game Industry.
Path Planning Part I: Search Space Representation Part II: Table Lookup Path Finder Path III: Convincing Hunting Ref: AIWisdom 2.
Announcements Exam Friday. More Physical Storage Lecture 10.
Introduction to Computer Graphics Dr.Giorgos A. Demetriou Dr. Stephania Loizidou Himona Computer Science Department Frederick University.
PRESENTED BY – GAURANGI TILAK SHASHANK AGARWAL Collision Detection.
10.Introduction to Data-Parallel architectures TECH Computer Science SIMD {Single Instruction Multiple Data} 10.1 Introduction 10.2 Connectivity 10.3 Alternative.
Collaborative Visual Computing Lab Department of Computer Science University of Cape Town Graphics Topics in VR By Shaun Nirenstein.
Motion Planning in Games Mark Overmars Utrecht University.
Computer Science: A Structured Programming Approach Using C Trees Trees are used extensively in computer science to represent algebraic formulas;
WORLD NAVIGATION Don’t Fall Asleep Through These Topics  Tile Graphs  Points of Visibility  NavMesh  Path Smoothing  Hierarchical Pathfinding.
Group 8: Denial Hess, Yun Zhang Project presentation.
Topological Path Planning JBNU, Division of Computer Science and Engineering Parallel Computing Lab Jonghwi Kim Introduction to AI Robots Chapter 9.
SpaDaGIS Efficiency Issues in Multi-resolution Terrain Modeling Leila De FlorianiPaola Magillo Leila De Floriani * Paola Magillo Department of Computer.
© TMC Computer School HC20203 VRML HIGHER DIPLOMA IN COMPUTING Chapter 2 – Basic VRML.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
David Stotts Computer Science Department UNC Chapel Hill.
1Computer Sciences. 2 HEAP SORT TUTORIAL 4 Objective O(n lg n) worst case like merge sort. Sorts in place like insertion sort. A heap can be stored as.
Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.
Game Engine Design Quake Engine Presneted by Holmes 2002/12/2.
Chapter 4 ID 234 Building Codes Fall 2011 Means of Egress.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Facility Location and Network Design Models. Facility Location Assumptions Based on graph G=(V,E) Demand nodes, I  V, are known and fixed Set J  V of.
Beard & McLain, “Small Unmanned Aircraft,” Princeton University Press, 2012, Chapter 12: Slide 1 Chapter 12 Path Planning.
Windowing 290N: The Unknown Component Problem Lecture 10.
1 Introduction to Spatial Databases Donghui Zhang CCIS Northeastern University.

Great Theoretical Ideas In Computer Science
COMP Streams and File I/O
COGNITIVE APPROACH TO ROBOT SPATIAL MAPPING
Bounding Volume Hierarchies and Spatial Partitioning
Distance Computation “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presentation by Julie Letchner.
Bounding Volume Hierarchies and Spatial Partitioning
Mathematics & Path Planning for Autonomous Mobile Robots
CS 3343: Analysis of Algorithms
The connected word recognition problem Problem definition: Given a fluently spoken sequence of words, how can we determine the optimum match in terms.
Graph Operations And Representation
Spatial Databases: Digital Terrain Model
Definition in YOUR words Words associated with MIGRATION
Trees-2, Graphs Data Structures with C Chpater-6 Course code: 10CS35
Graph Operations And Representation
Spatial Databases: Digital Terrain Model
Two – One Problem Legal Moves: Slide Rules: 1s’ move right Hop
Multidimensional Search Structures
Two – One Problem Legal Moves: Slide Rules: 1s’ move right Hop
Chapter 9 Graph algorithms
Presentation transcript:

Abstract Terrain Representation in Full Spectrum Command Ramesh Saran USC-ICT

Terrain representation: Graphics vs. AI Graphics representation: –Polygons, textures, materials, scene graph,… AI representation: –Needs simpler and more abstract representation –Requires tactical annotations/hints for AI

Map Manager Manages the –Abstract Map Region annotation grids Indoor structure hierarchy –Dynamic Map Barriers: –Type, status, dimensions

Region annotation grids Uniform 2-D grid laid over the world Each tile has tactical annotations: –Networks Path node network Cover points network –Points obstacle, perimeter, corner, dominance, scramble

Indoor Structure Hierarchy Structure Store –64-bit Map-ID for each structure Room, Floor, Building & Exterior sections –Organized as a tree Root node is exterior world Leaf nodes are individual rooms –Stores information about Dimensions, tactical status, tactical annotations (network and point types used in grids)

Exit Store –Type: doorway, window, ladder, stairway –Dimensions –List of connected structures Stair-room list –List of Map-IDs of structures (rooms) with stairs Indoor Structure Hierarchy (cont)

A set of functions which perform map related computations for the AI Examples: –Are these two rooms connected? –Get nearest dominance point in the room –Get exit points for passed room based on location of teammates –Get room with outside exit that maximizes the distance from known enemy Map AI

I/O is the slowest in Soar Is migrating the abstract terrain representations to Soar’s internal storage feasible? Would that help in improving performance and/or expressive-power? FSC-Soar