810 search results - page 27 / 162 » Solving Time-Dependent Planning Problems |
AIPS
2007
13 years 10 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
FLAIRS
2008
13 years 10 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
AI
2011
Springer
13 years 3 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
FLAIRS
2009
13 years 6 months ago
2009
In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they...
IOR
2006
13 years 8 months ago
2006
We consider the problem of radiation therapy treatment planning for cancer patients. During radiation therapy, beams of radiation pass through a patient, killing both cancerous an...