75 search results - page 11 / 15 » Path-Planning by Tessellation of Obstacles |
MIG
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. ...
MTA
2011
12 years 11 months ago
2011
This paper presents a novel approach for individual agent’s motion simulation in real-time virtual environments. In our model, we focus on addressing two problems: 1) the control...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
ICRA
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— We present a path planning algorithm for a polyhedral robot with six degrees of freedom (6DOF) and a static obstacle. The planner consists of a dual-tree RRT algorithm ...