Sciweavers

810 search results - page 55 / 162
» Solving Time-Dependent Planning Problems
Sort
View
GIS
2010
ACM
13 years 6 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
HPCN
1995
Springer
13 years 11 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
COR
2006
120views more  COR 2006»
13 years 8 months ago
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
Stefan Bertels, Torsten Fahle
IROS
2008
IEEE
126views Robotics» more  IROS 2008»
14 years 2 months ago
High-dimensional underactuated motion planning via task space control
Abstract— Kinodynamic planning algorithms have the potential to find feasible control trajectories which accomplish a task even in very nonlinear or constrained dynamical system...
Alexander C. Shkolnik, Russ Tedrake
KES
2004
Springer
14 years 1 months ago
Epistemic Logic and Planning
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
Shahin Maghsoudi, Ian Watson