Virtual Agent Navigation in Open Spaces using Iterative Shrinking Polygons

Haciomeroglu, M., Laycock, R. G. and Day, A. M. (2007) Virtual Agent Navigation in Open Spaces using Iterative Shrinking Polygons. In: Eurographics, 2007-09-03 - 2007-09-07.

Full text not available from this repository. (Request a copy)

Abstract

Populating an urban environment with a virtual crowd provides a dynamic element to an otherwise static scene; bringing the virtual environment to life. One of the fundamental components governing the fidelity of the scene is the realistic simulation of the crowd behaviour. To create a believable crowd simulation one group of methods considers constructing a graph covering the space available to the virtual agents and subsequently performing path planning to allow the agents to navigate their environment by traversing the edges of the graph. To avoid computationally expensive path planning algorithms there exists a tradeoff between the number of edges in the graph and the amount of available space which an agent can visit. In order to alleviate this problem we propose to compute the straight skeleton to provide an initial covering of the environment. This is subsequently augmented using iterative shrinking polygons to generate additional edges in the larger open spaces. The technique developed requires limited knowledge of the urban environment, processes the relevant information automatically and is illustrated in this paper to control the behaviour of a virtual crowd in real time.

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 18 May 2011 11:17
Last Modified: 25 Sep 2020 23:58
URI: https://ueaeprints.uea.ac.uk/id/eprint/23629
DOI:

Actions (login required)

View Item View Item