Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 264-272

  Tsamardinos, Ioannis ^a   Pollack, Martha E ^a   Horty, John F ^b  

^a UNIVERSITY OF PITTSBURGH   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CONDITIONAL BRANCH; EXPERIMENTAL EVIDENCE; PERFORMANCE; SIMPLE TEMPORAL NETWORKS; TEMPORAL CONSTRAINTS; THREE PHASE; THREE PHASIS;

MERGING;

EID: 0011252767     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Bacchus, F., and Kabanza, F. 1996. Planning for tetnporally extended goals. In Proceedings of the 131h National Conferenceon Artificial Intelligence.
2. C.ormen, rr. 11.; Leiserson, C. E.; and Rivest, R. L. 1990. Introduction to Algorithms. C.ambridge, MA: MITPress.
3. C, urrie, K., and’rate, A. 1991. O-plan: The open planning architecture. Artificial Intelligence 52:49-86.
4. Dean, T. L., and McDermott, D. 1987. Temporal data base management.Artificial Intelligence 32:1-55.
5. Ghallab, M., and Laruelle, H. 1994. Representation and control in IxTeT, a temporal planner. In Proceedings of the Second International Conferenceon Artificial Intelligence Planning Systems (AIPS-94), 61-67.
6. Hammond, K. J. 1989. Case-Based Planning: Vieu’ing Planning as a Memory Task. New York: Academic Press.
7. Hanks, S., and Weld, D. S. 1992. Systemalic adaplation for case-based plmlning. In Proceedings of the First International Conference on AI Plam,im.l .5’!Is-terns. 96-105. Morgan Kaufmann.
8. Joslin, D., and Pollack, M. E. 1996. Is "early contmitment’ in plan generation ever a good idea? In Proceedingsof the Thirteenth National Conference, rtm’, o, Artificial bttelligence (AAAI). 1188 1193.
9. Kambhampati,S., arid Hendler, J. 1992. A valklaiion structure based theory of plan nmdilication and rcu.se. Artificial bztelligence 55{2):193-158.
10. Meiri, I. 1992. Temporal Reasoning: A ConMmintBased Approach. Ph.D. Dissertation, UCLA.
11. Muscettola, N. 1994. HSTS:Integrating planning and scheduling. In Zweben,M., and Pox, M. S., eds.. Intelligent Scheduling. San Francisco: MorganKauflnan. 169-212.
12. Nebel, B., and Koehler. J. 1995. Plan reuse vorsus plan generation: Atheoretical and empirical analysis. Artificial b2telligence 76:427454.
13. Onder, N., and Pollack, M. E. 1997. (’onl.ingency selection in plan generation. In Proceedingsof tht 4th European Confelvncc on Planning, 364-376.
14. Peot, M., and Smith, D. E. 1992. Conditkmal nonlin-. ear planning. In Proceedingsof the First lntermttional Conference on A I Planning Systems (AHJS-g2.). 18!) 197.
15. Pollack, M. E.; Tsamardinos,I.; and Ilorty, J. F. 1999. Adjustable autonomy for a plan management agenl. In I999 AAAISpring 5’ymposium on Agents u’ith Adjustable Autonomy.
16. Pryor, L., and Collins, G. 1996. Planning fbr contingencies: A decision-based approach. Journal of .4 rtificial Intelligence Research4:287.339.
17. Veloso, M. M., and Carbonell, J. G. 1994. C.ase-based reasoning in prodigy. In Michalski, R. S., and Teccuci, G., eds., MachineLearning: A Multislratcgy AI,proach, Volume II: Morgan Kaufmann. 52:1 548.
18. Vere, S. 1983. Planning in time: Windowsand dura tions for activities andgoals. IEEE Transaction on Pattern Analysis attd Machine Intelligene 5(3):246 267.
19. Vidal,’I’., and Ghallab, M. 1996. Dealing with ,ncertain durations in temporal constraint networks dedicated to planning. In The 12th EuropeanConfcrt nt.’c on Artificial Intelligence, 48-52.
20. Yang, Q. 1997. Intelligent Planning: A Decomposition and Abstraction Based Approach. NewYork: Springer.