Sciweavers

793 search results - page 87 / 159
» Analogical Path Planning
Sort
View
ICRA
2006
IEEE
70views Robotics» more  ICRA 2006»
14 years 2 months ago
Pushing using Compliance
— This paper addresses the problem of maneuvering an object by pushing it through an environment with obstacles. Instead of only pushing the object through open spaces, we also a...
Dennis Nieuwenhuisen, A. Frank van der Stappen, Ma...
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
14 years 2 months ago
Anytime RRTs
— 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...
Dave Ferguson, Anthony Stentz
AMAI
2000
Springer
14 years 15 days ago
Using topology for spatial reasoning
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...
Boi Faltings
IPPS
1998
IEEE
14 years 12 days ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
AAAI
2010
13 years 9 months ago
High-Quality Policies for the Canadian Traveler's Problem
We consider the stochastic variant of the Canadian Traveler's Problem, a path planning problem where adverse weather can cause some roads to be untraversable. The agent does ...
Patrick Eyerich, Thomas Keller, Malte Helmert