z-logo
Premium
Natural path planning using wavelet noise in static environment
Author(s) -
Kumar Amit,
Ojha Aparajita
Publication year - 2012
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.1476
Subject(s) - computer science , wavelet , motion planning , path (computing) , noise (video) , aliasing , subdivision , algorithm , mathematical optimization , computer vision , artificial intelligence , mathematics , filter (signal processing) , robot , engineering , civil engineering , image (mathematics) , programming language
ABSTRACT In a constrained virtual environment, motion of a character has to be controlled with precision to avoid collisions. For modeling motion of a character representing some real‐life object, it is important to generate paths that look natural. A number of path planning algorithms have been introduced to solve real‐time path queries in an environment. However, in all such algorithms, a fixed path is returned always for the same start and goal positions in the environment. Recently, Perlin noise has been used to add variations to a path so that it appears more natural. However, because of pure random nature of Perlin noise function, often unnatural path occurs. In this paper, we present a new approach to natural path planning by adding wavelet noise to a path generated using subdivision‐based Corridor Map Method. Because wavelet noise is almost perfectly band limited and provides good details with minimal aliasing effects, the resulting path becomes smoother and more natural. Moreover, by appropriately choosing the levels of down/up sampling in the wavelet noise generation algorithm, frequency of wavelet noise can be adjusted. This serves as an effective tool in bringing variations in path as per the requirement. Copyright © 2012 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here