Sciweavers

793 search results - page 46 / 159
» Analogical Path Planning
Sort
View
IJCAI
1989
13 years 9 months ago
Solving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
Mark S. Boddy, Thomas Dean
IROS
2008
IEEE
117views Robotics» more  IROS 2008»
14 years 2 months ago
Kinodynamic motion planning with hardware demonstrations
Abstract— This paper provides proof-of-concept that stateof-the-art sampling-based motion planners that are tightly integrated with a physics-based simulator can compute paths th...
Ioan Alexandru Sucan, Jonathan F. Kruse, Mark Yim,...
ICRA
2009
IEEE
106views Robotics» more  ICRA 2009»
14 years 2 months ago
On-line time-optimal path tracking for robots
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...
Diederik Verscheure, Moritz Diehl, Joris De Schutt...
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 8 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
13 years 5 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev