Sciweavers

696 search results - page 57 / 140
» Planning for Network-Aware Paths
Sort
View
IROS
2009
IEEE
212views Robotics» more  IROS 2009»
14 years 3 months ago
Addressing pose uncertainty in manipulation planning using Task Space Regions
—We present an efficient approach to generating paths for a robotic manipulator that are collision-free and guaranteed to meet task specifications despite pose uncertainty. We ...
Dmitry Berenson, Siddhartha S. Srinivasa, James J....
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
14 years 3 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz
TSMC
1998
82views more  TSMC 1998»
13 years 8 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
CDC
2010
IEEE
116views Control Systems» more  CDC 2010»
13 years 4 months ago
Curvature-continuous trajectory generation with corridor constraint for autonomous ground vehicles
We present a practical path planning algorithm based on B
Ji-wung Choi, Renwick E. Curry, Gabriel Hugh Elkai...
HICSS
2003
IEEE
91views Biometrics» more  HICSS 2003»
14 years 2 months ago
Strategic Investment Planning by Using Dynamic Decision Trees
In this paper we shall represent strategic planning problems by dynamic decision trees, in which the nodes are projects that can be deferred or postponed for a certain period of t...
Péter Majlender