Sciweavers

232 search results - page 15 / 47
» Randomized Kinodynamic Planning
Sort
View
ICRA
2009
IEEE
169views Robotics» more  ICRA 2009»
14 years 4 months ago
Manipulation planning with Workspace Goal Regions
— We present an approach to path planning for manipulators that uses Workspace Goal Regions (WGRs) to specify goal end-effector poses. Instead of specifying a discrete set of goa...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
14 years 1 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 11 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
ICRA
1994
IEEE
97views Robotics» more  ICRA 1994»
14 years 2 months ago
Integrating Sensing, Task Planning, and Execution
Abstract-This paper deals with enhancing the level of autonomy in a robotic work cell. With that mission in mind, we present here an integrated framework for the sensing, the plann...
C. P. Tung, Avinash C. Kak
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
14 years 4 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