Sciweavers

476 search results - page 49 / 96
» Randomized Robot Navigation Algorithms
Sort
View
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
14 years 2 months ago
Online ZMP sampling search for biped walking planning
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
Jinsu Liu, Manuela M. Veloso
IROS
2006
IEEE
143views Robotics» more  IROS 2006»
14 years 1 months ago
3D Field D: Improved Path Planning and Replanning in Three Dimensions
— We present an interpolation-based planning and replanning algorithm that is able to produce direct, lowcost paths through three-dimensional environments. Our algorithm builds u...
Joseph Carsten, Dave Ferguson, Anthony Stentz
ICRA
2010
IEEE
265views Robotics» more  ICRA 2010»
13 years 6 months ago
A generalization of the metric-based Iterative Closest Point technique for 3D scan matching
— Scan matching techniques have been widely used to compute the displacement of robots. This estimate is part of many algorithms addressing navigation and mapping. This paper add...
Leopoldo Armesto, Javier Minguez, Luis Montesano
ICRA
2010
IEEE
128views Robotics» more  ICRA 2010»
13 years 6 months ago
A game-theoretic procedure for learning hierarchically structured strategies
— This paper addresses the problem of acquiring a hierarchically structured robotic skill in a nonstationary environment. This is achieved through a combination of learning primi...
Benjamin Rosman, Subramanian Ramamoorthy
RAS
2002
119views more  RAS 2002»
13 years 7 months ago
Exploration method using harmonic functions
Harmonic functions provide optimal potential maps for robot navigation in a previously explored static environment. Here we investigate the performance of an algorithm for explora...
Edson Prestes e Silva Jr., Paulo Martins Engel, Ma...