Les ressources et la planification temporelle

RESUME : Dans les planificateurs temporels optimaux modernes, nombreux sont ceux qui ne gerent pas les ressources, pour les autres, les resultats obtenus sont tres limites pour les problemes avec ressources ainsi que pour les problemes sans ressources. Pour cette raison, on s’est interesse dans cet article a effectuer des modifications dans un planificateur temporel optimal performant CPT, qui ne gere pas les ressources dans sa version initiale pour lui donner la capacite de prendre en consideration les ressources consommables et renouvelables tout en gardant ses performances dans la recherche des plans valides qui s’executent dans un temps minimal. Pour ce faire, on a procede a la description des differentes contraintes liees aux ressources que la nouvelle version du planificateur doit prendre en consideration et on a propose des methodes pour resoudre les eventuels conflits generes par les actions qui consomment ou generent la meme ressource. ABSTRACT: The most of recent temporal planners are not able to manage resources or gives very poor results in temporal planning even with and without resources. For this reason, we try in this paper to give modifications in a powerful optimal temporal planner called CPT (that initially cannot manage resources) to give it the capacity to consider both consumable and renewable resources and we will try to conserve the performance of this planner to find valid optimal temporal plans. We start by fixing different resource constraints that we will use, and we will propose efficient methods to resolve conflicts eventually generated by action consuming or generating the same resource.

[1]  Hector Geffner,et al.  Heuristic Planning with Time and Resources , 2014 .

[2]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[3]  François Laburthe,et al.  CLAIRE: combining sets, search and rules to better express algorithms , 1999, Theory and Practice of Logic Programming.

[4]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

[5]  Hector Geffner,et al.  Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..

[6]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[7]  Denyse Baillargeon,et al.  Bibliographie , 1929 .

[8]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[9]  Subbarao Kambhampati,et al.  Improving Temporal Flexibility of Position Constrained Metric Temporal Plans , 2003, ICAPS.

[10]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[11]  Hector Geffner,et al.  Solving Simple Planning Problems with More Inference and No Search , 2005, CP.

[12]  Ivan Serina,et al.  Fast Planning in Domains with Derived Predicates: An Approach Based on Rule-Action Graphs and Local Search , 2005, AAAI.

[13]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[14]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[15]  Abdallah Elkhyari Outils d'aide à la décision pour des problèmes d'ordonnancement dynamiques. (Decision support techniques for dynamic scheduling problems) , 2003 .

[16]  Sophie Demassey,et al.  Méthodes hybrides de programmation par contraintes et programmation linéaire pour le problème d'ordonnancement de projet à contraintes de ressources. (Hybrid Constraint Programming-Integer Linear Programming approaches for the Resource-Constrained Project Scheduling Problem) , 2003 .