Sciweavers

99 search results - page 5 / 20
» Fast Planning for Dynamic Preferences
Sort
View
WEA
2007
Springer
178views Algorithms» more  WEA 2007»
14 years 1 months ago
Engineering Fast Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
Peter Sanders, Dominik Schultes
ICRA
2003
IEEE
171views Robotics» more  ICRA 2003»
14 years 28 days ago
Motion planning for multiple mobile robots using dynamic networks
- A new motion planning framework is presented that enables multiple mobile robots with limited ranges of sensing and communication to maneuver and achieve goals safely in dynamic ...
Christopher M. Clark, Stephen M. Rock, Jean-Claude...
PUK
2000
13 years 9 months ago
Dynamic Scheduling of Progressive Processing Plans
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...
IJON
2006
52views more  IJON 2006»
13 years 7 months ago
Speed estimation with propagation maps
We propose a neural architecture that estimates the speed of motion. The basis is a two-dimensional map made of locally connected integrate-and-fire neurons, that propagates and i...
C. Rasche
JVCA
2008
112views more  JVCA 2008»
13 years 7 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