Tactical AI in Real Time Supervisor: Aleks Jakulin Crew: Damir Arh, Matija Jekovec, Mitja Luštrek Gregor Leban, Martin Žnidaršič, Uroš Čibej Translation:

Slides:



Advertisements
Similar presentations
Artificial Intelligence in Game Design
Advertisements

Soar and StarCraft By Alex Turner. What is StarCraft: Brood War? A Real-Time Strategy (RTS) computer game released in A sci-fi war simulation Continually.
7.1. O SCARS & A RTIFICIAL I NTELLIGENCE Interim awards and introduction to game AI.
AI Pathfinding Representing the Search Space
MANIFEST DESTINY 560group3 Abe Kim David Straily Jarrod Freeman Abdul Mod-Rokbi “The future of RTS games...”
Label Placement and graph drawing Imo Lieberwerth.
Half life 2/ Counter Strike: Source bot Charlie Cross CIS
CSE 380 – Computer Game Programming Pathfinding AI
Implementation and Study of a “Term” based Role Playing Game using Client Server Paradigm. Vaithiyanathan Sundaram.
Artificial Intelligence in Game Design Intelligent Decision Making and Decision Trees.
Artificial Intelligence in Game Design Introduction to Learning.
Artificial Intelligence in Game Design Hierarchical Finite State Machines.
1 AI for Computer Game Developers Finite state machines Path finding and waypoints A-Star path finding.
Network Management Overview IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
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.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Real-time Crowd Movement On Large Scale Terrains Speaker: Alvin Date:4/26/2004From:TPCG03.
Tactical and Strategic Reasoning  Covers…  Deducing tactical situations from sketchy (limited) information  Using tactical situations to make decisions.
The Greedy Wall Building algorithm Rami Khouri. Ideal definition of Wall Either keeps valuable assets in, or enemies out…mostly keep enemies out Impassable,
Dobrin / Keller / Weisser : Technical Communication in the Twenty-First Century. © 2008 Pearson Education. Upper Saddle River, NJ, All Rights Reserved.
Artificial Intelligence in Game Design Camera Control.
PROGRAMMING LANGUAGES The Study of Programming Languages.
SWARM INTELLIGENCE IN DATA MINING Written by Crina Grosan, Ajith Abraham & Monica Chis Presented by Megan Rose Bryant.
CSE 381 – Advanced Game Programming 3D Game Architecture.
Super Pong Andrew Dunsmore CSC436. Overview Purpose Design Specification Software Engineering.
Yingcai Xiao Artificial Intelligence in Game Development Yingcai Xiao.
Execution Control with If/Else and Boolean Functions
Artificial Intelligence in Game Design Problems and Goals.
Behavior Based Robotics: A Wall Following Behavior Arun Mahendra - Dept. of Math, Physics & Engineering, Tarleton State University Mentor: Dr. Mircea Agapie.
Networking Networking is done via a single component that is persistent in each machine’s game. This multiplayer manager component handles all Unity RPC.
VIDEO GAME PROGRAMMING Video Game Programming Junior – DigiPutt INSTRUCTOR TEACHER’S ASSISTANT.
Developing the Game Functionality Lesson 6. Exam Objective Matrix Skills/ConceptsMTA Exam Objectives Programming the Components Understand Components.
Othello Artificial Intelligence With Machine Learning
Introduction to AI Engine & Common Used AI Techniques Created by: Abdelrahman Al-Ogail Under Supervision of: Dr. Ibrahim Fathy.
The Design Document The Design Document Introduction Game Mechanics Artificial Intelligence Characters, Items, and Objects/Mechanisms Story.
Review IMGD Engine Architecture Types Broadly, what are the two architecture types discussed for game engines? What are the differences?
(Working Title)‏ 1. Introduction to the Game 2. Technical Details 3. Demo of the Prototype.
Submitted by: Giorgio Tabarani, Christian Galinski Supervised by: Amir Geva CIS and ISL Laboratory, Technion.
Motion Planning in Games Mark Overmars Utrecht University.
Artificial Intelligence in Game Design Dynamic Path Planning Algorithms.
Qualitative Spatial Analysis Chris Mansley. Qualitative Quantitative items are known, definable quantities (x,y) coordinates Remaining health Location.
Jumping, Climbing, and Tactical Reasoning Section 2.5 Tom Schaible CSE 497 – AI & Game Programming.
Artificial Intelligence in Game Design Complex Steering Behaviors and Combining Behaviors.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
Artificial intelligence IN NPCs. Early Role Playing games Npcs in early role playing games were very limited in terms of being “Intelligent”. For instance,
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.
Artificial Intelligence in Game Design Influence Maps and Decision Making.
Artificial Intelligence in Game Design Lecture 8: Complex Steering Behaviors and Combining Behaviors.
CSCE 552 Spring 2010 AI (III) By Jijun Tang. A* Pathfinding Directed search algorithm used for finding an optimal path through the game world Used knowledge.
Finite State Machines Logical and Artificial Intelligence in Games Lecture 3a.
CS320n –Visual Programming Execution Control with If / Else and Boolean Functions (Slides 6-2-1) Thanks to Wanda Dann, Steve Cooper, and Susan Rodger for.
Social Simulation of Rescue Teams' Dynamic Planning João Ulisses, Rosaldo J. F. Rossetti, João E. Almeida, Brígida Mónica Faria, presented by: Luis Paulo.
Review IMGD Engine Architecture Types Broadly, what are the two architecture types discussed for game engines? What are the differences?
Team Member AI in an FPS and Goal Oriented Action Planning.
Prof. Yu-Chee Tseng Department of Computer Science
On-Line Markov Decision Processes for Learning Movement in Video Games
Animation and Simulation Plus Interaction
Enemy and Friendly AIs Richard Gesick.
Aaron Camm, Jeff Huggins, Steve Moskal, Patrick Cardwell
Simple Techniques for Coordinated Behavior
CIS 487/587 Bruce R. Maxim UM-Dearborn
CIS 488/588 Bruce R. Maxim UM-Dearborn
CIS 488/588 Bruce R. Maxim UM-Dearborn
Agent-Centered Search
CIS 488/588 Bruce R. Maxim UM-Dearborn
TACTICAL MOVEMENT.
Computer Animation Algorithms and Techniques
Artificial Intelligence in Games Week 7
Othello Artificial Intelligence With Machine Learning
Presentation transcript:

Tactical AI in Real Time Supervisor: Aleks Jakulin Crew: Damir Arh, Matija Jekovec, Mitja Luštrek Gregor Leban, Martin Žnidaršič, Uroš Čibej Translation: A. Jakulin

Task real-time strategy objective: survive based on physical simulation computer assists the player (intelligence amplification instead of artificial intelligence) teams of AI units the player does not control individual unit’s behavior units perform team-allocated duties

Program Structure 1/2 Two separate applications: server client Client: graphics user interface server connection

Program Structure 2/2 Server: communication with clients physics pathfinding Hierarchical AI Strategic layer Team Unit (soldier)

Physical Model 1/3 Terrain: 2D map passable / impassable kvadratki continuous space and time map fully revealed to AI enemies only seen if at least one of units has visual contact

Physical Model 2/3 Unit properties: movement:  poses: walking, sneaking, crawling  movement speed dependent on orientation and health  separate movement direction and orientation 3 shooting modes  health-, speed- and orientation dependent view angle depends on speed of movement (F- 01)(F- 01)

Physical Model 3/3 Collision detection: unit collisions bullet collisions Raycasting: map intersections object intersections

Visibility Graph `expand’ the walls for unit radius visibility graph nodes are convex corners mutually visible corners are connected before pathfinding, insert start and goal points in the graph search with A* (F-02), heuristics (F-03) (F-02) (F-03)

“Boids” Basic rules: a unit tries to move towards the center of the team a unit tries to keep a minimum distance from walls and objects try to match team speed These Rules are too local!

Teams Units in different teams are separate from one another (F-04) (F-04) Significance: hierarchical pathfinding minimize team exposure maximize team cohesion formations

Teams: Pathfinding Player sets the goal point, team adjusts individual unit movement given the requirements (F-05) (F-05) Pathfinding requirements: safety accessibility proximity to goal team cohesion

Teams: Exposure Seek proximity of walls and corners, where the ratio between the visible `covered’ terrain and `uncovered’ terrain is minimal. Note: we ignore mobility

Teams: Cohesion It is more desirable for units of a team to remain close and cover the terrain together. (F-06) (F-06) Note: in reality it’s the ease of signaling and directed firepower that matter.

Finite State Machine Controls the units of a team simple – well-known concept readable – states are clearly separated extensible – simple to add new states and transitions adjustable – we choose to do whatever we please in a given state We have state-dependent weights, adjusting the boids model.

MDM FSM (F-07) (F-07) Seek cover idle prone init move advance attack retreat Mitja Luštrek, Damir Arh, Matija Jekovec

Maintaining Terrain Visibility During movement, the team leader is looking left and right, if there is no wall. (F-08) (F-08) Other units are trying to cover 360 degrees around the team. If there are enough units to cover everything, increase the coverage of `interesting’ areas. Interestingness of the area depends on proximity to walls and dangerous areas, tagged by the player. (F-09) (F-09) Danger area

Shooting Formation When enemy is spotted, everyone moves to face the enemy, or everyone goes into retreat. Units move to avoid shooting one another. Units seek positions with better coverage of the enemies.

Seeking a Safe Position If player gives no orders, team moves to a safe position. Seek proximity of cover. Seek good coverage. (F-10) (F-10)

GUM FSM (F-11) (F-11) cover assault normal init Gregor Leban, Uroš Čibej, Martin Žnidaršič

Determining Orientation Compute four viewing orientations for each unit. Orientations depend on openness of terrain and tagged danger areas. Pick the most important orientation that is not yet covered.

Assault When enemy is spotted, everyone faces it and assaults. Every unit picks the closest enemy and fires. Move if a friendly unit close near the firing direction. The player may adjust the formation during combat. High mobility during an attack.

Technical Details Development environment: Visual C++ Libraries: Simple DirectMedia Layer (SDL) Video for Windows (VFW) winsock 450 KB of code over lines in 110 files

Conclusions High computational load. Many parameters. Weight tuning is complex. Machine learning hard to use. Commercial games use simpler logic.