In-game adaptation of a navigation mesh cell path

Abstract

A fundamental requirement of non-player characters (NPCs) in today's computer games is to be able to move through a complex virtual world in an intelligent way. Pathfinding or path planning techniques are used by games developers to determine suitable routes, during gameplay, from a starting location to a goal position. These techniques make use of graphs to efficiently represent the game world. Navigation graphs can be created using different constructs, such as waypoints, navigation meshes and grids. Typically, path planning systems use the navigation graph to find the shortest path between locations and do not adapt in-game based on a player's experience of navigating a path. In previous works we have explored approaches to in-game action prediction and tactic adaptation through machine learning inspired approaches. In this paper we present an approach to the in-game adaptation of NPC movement using navigation mesh cells. The technique allows NPCs to adapt their routes through cells based on previous experience whilst also preserving smooth paths. The system is applied to FPS game scenarios using the Unity3D game engine. The results show that the technique offers a promising approach to the adaptation of NPC movement through navigation meshes.

Multimedia Concepts on Object Detection and Recognition with F1 Car Simulation Using Convolutional Layers

“…They also accept access to a database of segmented images, create category-independent object segmentation hypotheses and do the same thing we do. Previous methods focus on local bottom-up processing [20][21][22]. Multiple segments of the figure ground will provide multiple hypotheses for object regions.…”

A methodology to enable automatic 3D routing of aircraft Electrical Wiring Interconnection System

“…In the initialization step, a road map-based optimization method is adopted. Similar to a conventional GPS navigation system or a path finding process for computer games [17,18], this optimization method first builds a road map (i.e., a grid of nodes and connections) in the routing environment and then uses it to find a convenient path for the harnesses. Typical path finding methods/algorithms, such as those implemented in GPS route planners, however, are able to find only paths that have one origin and one destination.…”