Sciweavers

476 search results - page 60 / 96
» Randomized Robot Navigation Algorithms
Sort
View
IBPRIA
2005
Springer
14 years 1 months ago
Monte Carlo Localization Using SIFT Features
The ability of finding its situation in a given environment is crucial for an autonomous agent. While navigating through a space, a mobile robot must be capable of finding its lo...
Arturo Gil, Óscar Reinoso, Maria Asunci&oac...
ICRA
2009
IEEE
152views Robotics» more  ICRA 2009»
14 years 2 months ago
Reachability-guided sampling for planning under differential constraints
— 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...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
14 years 29 days ago
Linear time vehicle relocation in SLAM
Abstract— In this paper we propose an algorithm to determine the location of a vehicle in an environment represented by a stochastic map, given a set of environment measurements ...
José Neira, Juan D. Tardós, Jos&eacu...
IROS
2009
IEEE
195views Robotics» more  IROS 2009»
14 years 2 months ago
Appearance contrast for fast, robust trail-following
— We describe a framework for finding and tracking “trails” for autonomous outdoor robot navigation. Through a combination of visual cues and ladar-derived structural inform...
Christopher Rasmussen, Yan Lu, Mehmet Kocamaz
IROS
2006
IEEE
121views Robotics» more  IROS 2006»
14 years 1 months ago
Planning and Acting in Uncertain Environments using Probabilistic Inference
— An important problem in robotics is planning and selecting actions for goal-directed behavior in noisy uncertain environments. The problem is typically addressed within the fra...
Deepak Verma, Rajesh P. N. Rao