810 search results - page 53 / 162 » Solving Time-Dependent Planning Problems |
126
click to vote
EOR
2007
14 years 11 months ago
2007
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
SYNASC
2006
IEEE
15 years 5 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
102
click to vote
AIPS
2006
15 years 1 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
104
click to vote
STAIRS
2008
15 years 1 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...