Stealth-Based Path Planning using Corridor Maps

R.J. Geraerts; E. Schager

Stealth-Based Path Planning using Corridor Maps

extern

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

A relatively new area within the field of path planning deals with computing a stealthy path for a character moving in a virtual environment. Besides efficiently obtaining a path that is collision-free, short and smooth, the added difficulty is that the path must have little or no exposure to observers. We propose a new algorithm for computing such a path in the plane, and show that real-time performance can be achieved.

Original language	English
Title of host publication	Computer Animation and Social Agents
Publication status	Published - 2010

Access to Document

Stealth CASA2010
Open Access (free)
Final published version, 384 KB

http://www.cs.uu.nl/~roland/motion_planning/stealth_corridor_map/index.html

Cite this

@inproceedings{fcb7e5ca460c41b9adcf94ed997318df,

title = "Stealth-Based Path Planning using Corridor Maps",

abstract = "A relatively new area within the field of path planning deals with computing a stealthy path for a character moving in a virtual environment. Besides efficiently obtaining a path that is collision-free, short and smooth, the added difficulty is that the path must have little or no exposure to observers. We propose a new algorithm for computing such a path in the plane, and show that real-time performance can be achieved.",

author = "R.J. Geraerts and E. Schager",

note = "Computer Animation and Social Agents",

year = "2010",

language = "English",

booktitle = "Computer Animation and Social Agents",

}

TY - GEN

T1 - Stealth-Based Path Planning using Corridor Maps

AU - Geraerts, R.J.

AU - Schager, E.

N1 - Computer Animation and Social Agents

PY - 2010

Y1 - 2010

N2 - A relatively new area within the field of path planning deals with computing a stealthy path for a character moving in a virtual environment. Besides efficiently obtaining a path that is collision-free, short and smooth, the added difficulty is that the path must have little or no exposure to observers. We propose a new algorithm for computing such a path in the plane, and show that real-time performance can be achieved.

AB - A relatively new area within the field of path planning deals with computing a stealthy path for a character moving in a virtual environment. Besides efficiently obtaining a path that is collision-free, short and smooth, the added difficulty is that the path must have little or no exposure to observers. We propose a new algorithm for computing such a path in the plane, and show that real-time performance can be achieved.

M3 - Conference contribution

BT - Computer Animation and Social Agents

ER -

Stealth-Based Path Planning using Corridor Maps

Abstract

Access to Document

Fingerprint

Cite this