GPU-Accelerated Game AI Navigation Planning

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current methods for simulating autonomous navigation and planning of multiple agents in games face computational complexity due to each agent being a dynamic obstacle, leading to intractable problems in real-time environments, especially when trying to avoid collisions and achieve realistic crowd motion.

Innovation Solution

A graphics processor with parallel processing architecture, capable of accelerating navigational planning AI processes, uses a search algorithm like A* to perform global navigation planning and local collision avoidance, leveraging SIMD architecture and GPU capabilities for efficient computation and memory management.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If centralized techniques are used to consider the sum of all agents as a single agent, then global path planning is achieved, but problem complexity becomes prohibitively high as the number of agents increases

Engineering Contradiction:
Improveglobal path planning completenessVSAvoidcomputational complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the navigation problem into two distinct components: global path planning (using A* search) and local collision avoidance (using continuous dynamic potential fields). This segmentation allows each component to be solved independently with appropriate algorithms, avoiding the combinatorial explosion of centralized approaches while maintaining completeness of global planning and effectiveness of local avoidance.

Inventive Principle:
Principle #1Segmentation

2Device complexity

If decoupled planners are used to distribute computation across agents, then computational complexity is reduced, but coordination space is required that may not always guarantee completeness

Engineering Contradiction:
Improvecomputational complexityVSAvoidpath planning completeness
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent segments the navigation problem into two distinct components: global path planning (using A* search) and local collision avoidance (using continuous dynamic potential fields). This segmentation allows each component to be solved independently with appropriate algorithms, avoiding the combinatorial explosion of centralized approaches while maintaining completeness of global planning and effectiveness of local avoidance.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces continuous dynamic potential fields as an intermediary mechanism that mediates between individual agent decisions and global coordination requirements. The potential fields provide implicit coordination without requiring explicit communication or centralized control, allowing distributed agents to achieve coherent group behavior while maintaining computational efficiency and planning completeness.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Stability of the object's composition

If per-particle energy minimization with continuum perspective is used, then smooth and realistic crowd motion is achieved, but ability to express computation in parallel becomes constrained

Engineering Contradiction:
Improvecrowd motion smoothnessVSAvoidparallel computation capability
Core Design Contradiction:
Stability of the object's compositionVSProductivity

Solution Approach 1:

The patent segments the navigation problem into two distinct components: global path planning (using A* search) and local collision avoidance (using continuous dynamic potential fields). This segmentation allows each component to be solved independently with appropriate algorithms, avoiding the combinatorial explosion of centralized approaches while maintaining completeness of global planning and effectiveness of local avoidance.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent uses discrete agents that copy and adapt the continuous potential field framework rather than directly simulating continuous particle dynamics. Each agent independently evaluates the potential field at its current position and computes its acceleration, allowing parallel computation while maintaining the smooth motion characteristics of continuous models through the mathematical formulation of the potential fields.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS8200594B1System, method, and computer program product for accelerating a game artificial intelligence process
Publication Date: 2012.06.12 NVIDIA CORP
  • US8200594B1 patent drawing
  • US8200594B1 patent drawing
  • US8200594B1 patent drawing

AI summary

A system, method, and computer program product are provided for accelerating a game artificial intelligence process. In one embodiment, a graphics processor is provided, the graphics processor being capable of accelerating a game artificial intelligence process. In another embodiment, a graphics processor is provided, the graphics processor being capable of accelerating a navigational planning artificial intelligence process.