810 search results - page 35 / 162 » Solving Time-Dependent Planning Problems |
CONSTRAINTS
2006
13 years 8 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...
MATES
2010
Springer
13 years 6 months ago
2010
Springer
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
AAAI
2010
13 years 9 months ago
2010
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
AIPS
1996
13 years 9 months ago
1996
We have been examining mixed-initiative planning systems in the context of command and control or logistical overview situations. In such environments, the human and the computer ...