A SCHEDULING TECHNIQUE OF PLANS WITH PROBABILITY AND TEMPORAL CONSTRAINTS

Bassam Baki, Maroua Bouzid

Abstract

In this paper, we address the problem of scheduling plans with probability and temporal constraints. We illustrate our problem with an AND/OR graph, where we try to find a plan of tasks that satisfies all temporal constraints and precedence relations between tasks, has a high probability of execution, a minimal cost and a reduced time. Each task has a set of temporal constraints, a set of probabilities and a set of constant costs. Our planner uses the temporal constraint propagation technique to simplify the resolution of a given problem.^ We describe one approach to deal with a problem that has paid a little attention of planing community. This problem is to combine temporal and probabilistic planning.

References

  1. Baki, B., Beynier, A., Bouzid, M., and Mouaddib, A. (2004). Temporal Probabilistic Task Planning in an Emergency Service. In Complex Systems Intelligence and Modern Technological Applications, CSIMTA-04, pages 427-434.
  2. Bresina, J. and Washington, R. (2000). Expected Utility Distributions for Flexible Contingent Execution. In Proceedings of the AAAI-2000 Workshop: Representation Issues for Real-World Planning Systems.
  3. Bresina, J. L., Dearden, R., Meuleau, N., Ramakrishnan, S., Smith, D. E., and Washington, R. (2002). Planning Under Continuous Time and Resource Uncertainty: A Challenge for AI. In AIPS Workshop on Planning for Temporal Domains, pages 91-97.
  4. Dean, T., Kaelbling, L., Kirman, J., and Nicholson, A. (1993). Planning With Deadlines in Stochastic Domains. In Proceedings of the 11th National Conference on Artificial Intelligence, pages 574-579. AAAI.
  5. Draper, D., Hanks, S., and Weld, D. (1994). Probabilistic Planning with Information Gathering and Contingent Execution. In Proceedings of the Second International Conference on AI Planning Systems, AIPS-94, pages 31-63.
  6. Ghallab, M. and Laruelle, H. (1994). Representation and Control in IxTeT, a Temporal Planner. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, AIPS-94, pages 61-67.
  7. Kushmerick, N., Hanks, S., and Weld, D. (1994). An Algorithm for Probabilistic Least-Commitment Planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence,AAAI-94, pages 1073-1078.
  8. Laborie, P. and Ghallab, M. (1995). Planning with Sharable Resource Constraints. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95, pages 1643-1651.
  9. Lemai, S. and Ingrand, F. (2004). Interleaving Temporal Planning and Execution in Robotics Domains. In AAAI, pages 617-622.
  10. Pemberton, J. C. and Greenwald, L. G. (2002). On the Need for Dynamic Scheduling of Imagings Satellites. In Proceedings of the American Society for Photogrammetry and Remote Sensing, ASPRS-02.
  11. Zilberstein, S. (1995). The Utility of Planning. SIGART Bulletin, 6(1):42-47.
Download


Paper Citation


in Harvard Style

Baki B. and Bouzid M. (2005). A SCHEDULING TECHNIQUE OF PLANS WITH PROBABILITY AND TEMPORAL CONSTRAINTS . In Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 972-8865-29-5, pages 77-84. DOI: 10.5220/0001169300770084


in Bibtex Style

@conference{icinco05,
author={Bassam Baki and Maroua Bouzid},
title={A SCHEDULING TECHNIQUE OF PLANS WITH PROBABILITY AND TEMPORAL CONSTRAINTS},
booktitle={Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2005},
pages={77-84},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001169300770084},
isbn={972-8865-29-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - A SCHEDULING TECHNIQUE OF PLANS WITH PROBABILITY AND TEMPORAL CONSTRAINTS
SN - 972-8865-29-5
AU - Baki B.
AU - Bouzid M.
PY - 2005
SP - 77
EP - 84
DO - 10.5220/0001169300770084