Scheduling with probability and temporal constraints

Authors:
Bassam Baki;Maroua Bouzid
Affiliations:
GREYC, University of Caen, Caen;GREYC, University of Caen, Caen
Venue:
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Year:
2005

Citing 4
Cited 0

An algorithm for probabilistic least-commitment planning

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
The utility of planning

ACM SIGART Bulletin
Planning with sharable resource constraints

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning under continuous time and resource uncertainty: a challenge for AI

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an approach of temporal probabilistic task planning. Each task has a set of temporal constraints, a set of probabilities and a set of constant costs. Tasks are connected in an acyclic AND/OR Graph. Our planner constructs a plan formed by a subset of tasks chosen to be executed in order to achieve some goals, satisfy all constraints and has a high probability of execution during a minimal total time and with a reduced cost. This approach is one of the first techniques combining probability and time in planning using an AND/OR graph.