810 search results - page 1 / 162 » Solving Time-Dependent Planning Problems |
IJCAI
1989
13 years 5 months ago
1989
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...
ICTAI
2009
IEEE
13 years 2 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
WEA
2010
Springer
13 years 9 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
JUCS
2008
13 years 4 months ago
2008
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
ACST
2006
13 years 6 months ago
2006
In the last years, there has been an increased investigation of efficient algorithms to solve problems of great scale. The main restriction of the traditional methods, like finite...