810 search results - page 31 / 162 » Solving Time-Dependent Planning Problems |
IJCAI
2007
13 years 9 months ago
2007
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a do...
AUSAI
2008
Springer
13 years 10 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
ECML
2006
Springer
13 years 12 months ago
2006
Springer
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...
AAAI
2007
13 years 10 months ago
2007
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...