134 search results - page 12 / 27 » Randomized Query Processing in Robot Path Planning |
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
ICRA
2009
IEEE
13 years 5 months ago
2009
IEEE
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— This paper proposes the kinodynamic gait planning for humanoid robots where both kinematics and dynamics of the system are considered. We can simultaneously plan both t...
ICRA
2009
IEEE
14 years 2 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...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused...