Virtual Character Target Tracking via Pre-computed Path Routing Matrix

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing VR scenes face inefficiencies in target tracking due to the need for complex action decisions and extensive calculations by virtual characters in dynamically changing environments, leading to low tracking efficiency.

Innovation Solution

A target tracking method that utilizes a pre-constructed semantics path and path routing matrix to allow virtual characters to quickly determine the next path node and make efficient decisions, reducing the complexity and calculation required for target tracking.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If the virtual character performs real-time path planning and complex action decisions in dynamically changing VR environments, then the target tracking can adapt to environmental changes, but the tracking efficiency decreases due to high computational complexity

Engineering Contradiction:
Improveadaptability to environmental changesVSAvoidtarget tracking efficiency
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent pre-calculates and stores path routing matrices before the virtual character enters the VR scene. These matrices contain pre-computed path planning information that can be quickly queried during target tracking without requiring real-time calculations. This preliminary preparation allows the system to maintain high tracking efficiency while still adapting to environmental changes through efficient matrix lookups rather than complex real-time computations

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent divides the continuous path planning problem into discrete path nodes and segments the routing information into matrix formats. By segmenting the VR environment into navigable path nodes and pre-calculating routing between them, the system transforms a complex continuous optimization problem into a series of simpler discrete lookups, significantly reducing computational complexity during target tracking while maintaining adaptability

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If the virtual character performs complex real-time calculations for path planning, then accurate navigation can be achieved, but the computational complexity increases leading to low tracking efficiency

Engineering Contradiction:
Improvenavigation accuracyVSAvoidcomputational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The system pre-calculates path routing matrices that contain all necessary navigation information before the virtual character enters the scene. These pre-computed matrices store optimal paths between all pairs of path nodes, eliminating the need for complex real-time calculations during target tracking. The virtual character simply queries the pre-stored matrix to determine the next path node, maintaining high navigation accuracy with minimal computational complexity

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates a simplified computational model by copying and storing path routing information in matrix format. Instead of performing complex geometric and optimization calculations in real-time, the system uses pre-computed matrix lookups that replicate the results of complex path planning algorithms. This copying approach maintains navigation accuracy while dramatically reducing the computational complexity required during target tracking operations

Inventive Principle:
Principle #26Copying

Data Source

PatentUS11803995B2Target tracking method and apparatus, terminal device, and storage medium
Publication Date: 2023.10.31 SHENZHEN INSTITUTE OF INFORMATION TECHNOLOGY
  • US11803995B2 patent drawing
  • US11803995B2 patent drawing

AI summary

This application discloses a target tracking method and apparatus, a terminal device, and a storage medium. The target tracking method includes: determining a path node nearest to the virtual character as a travelling node according to a starting position of the virtual character; moving toward the travelling node until arriving at the travelling node; determining a current next path node to be reached by the virtual character according to the path node where the virtual character is currently located, the path node currently nearest to a target being tracked and a pre-stored path routing matrix, here the path routing matrix is a matrix storing an optimal next path node from a first path node to a second path node; moving to the next path node to approach the target being tracked. Embodiments of this application can improve the target tracking efficiency of the virtual character in the VR scene.