Sciweavers

696 search results - page 59 / 140
» Planning for Network-Aware Paths
Sort
View
IROS
2008
IEEE
91views Robotics» more  IROS 2008»
14 years 3 months ago
Replanning: A powerful planning strategy for hard kinodynamic problems
— A series of kinodynamic sampling-based planners have appeared over the last decade to deal with high dimensional problems for robots with realistic motion constraints. Yet, ofï...
Konstantinos I. Tsianos, Lydia E. Kavraki
ATMOS
2009
130views Optimization» more  ATMOS 2009»
13 years 10 months ago
Arc-Flags in Dynamic Graphs
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel ...
JVCA
2008
112views more  JVCA 2008»
13 years 9 months ago
Constraint-based motion synthesis for deformable models
We present a fast goal-directed motion synthesis technique that integrates sample-based planning methods with constraint-based dynamics simulation using a finite element formulati...
William Moss, Ming C. Lin, Dinesh Manocha
ICRA
2007
IEEE
132views Robotics» more  ICRA 2007»
14 years 3 months ago
Smooth Feedback for Car-Like Vehicles in Polygonal Environments
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
Stephen R. Lindemann, Steven M. LaValle
SARA
2007
Springer
14 years 3 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu