Computing Valid Intervals for Collections of Activities with Shared States and Resources

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

Volumn , Issue , 2000, Pages 339-346

  Knight, Russell ^a   Rabideau, Gregg ^a   Chien, Steve ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMPROVE PERFORMANCE; REAL PROBLEMS; SHARED RESOURCES; SHARED STATE; STATE CONSTRAINTS; SYNTHETIC PROBLEM;

ARTIFICIAL INTELLIGENCE;

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

References (15)

1. Cesta, Oddi S., and Smith S. 1998. “Profile-Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems.” Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, Pittsburgh, Pennsylvania, 1998, pp. 214-223.
2. Dechter, R., Meiri I., and Pearl J. 1991. “Temporal Constraint Networks,” Artificial Intelligence, 49, 1991, pp 61-95.
3. Drabble, B., and Tate A. 1984. “Use of Optimistic and Pessimistic Resource Profiles to Inform Search in an Activity Based Planner,” Proc. AIPS94.
4. Estlin, T., Chien, S., and Wang, X. 1997. “An Argument for an Integrated Hierarchical Task Network and Operator-based Approach to Planning,” in Recent Advances in AI Planning, S. Steel and R. Alami (eds.), Lecture Notes in Artificial Intelligence, Springer—Verlag, 1997, pp. 182-194.
5. Fukunaga, A., Rabideau, G., Chien, S., Yan, D. 1997. “Towards an Application Framework for Automated Planning and Scheduling,” Proceedings of the 1997 International Symposium on Artificial Intelligence, Robotics and Automation for Space, Tokyo, Japan, July 1997.
6. Kautz, H., and Selman B. 1996. “Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search." AAAI-96.
7. Laborie, P., Ghallab, M. 1995. “Planning with Sharable Resource Constraints,” Proc. IJCAI-95, 1643-1649
8. Lin, S. and Kernighan, B. 1973. “An Effective Heuristic for the Traveling Salesman Problem,” Operations Research Vol. 21, 1973.
9. Muscettola, N. 1993. “HSTS: Integrating Planning and Scheduling.” Intelligent Scheduling. Morgan Kaufmann, March 1993.
10. Rabideau, G., Chien, S., Backes, P., Chalfant, G., and Tso, K. 1999. “A Step Towards an Autonomous Planetary Rover,” Space Technology and Applications International Forum, Albuquerque, NM, February 1999.
11. Sherwood, R., Govindjee, A., Yan, D., Rabideau, G., Chien, S., Fukunaga, A. 1998. “Using ASPEN to Automate EO-1 Activity Planning,” Proceedings of the 1998 IEEE Aerospace Conference, Aspen, CO, March 1998.
12. Tate A., Drabble, B., and Dalton, J. 1996. “O-Plan: a Knowledge-based planner and its application to Logistics,” Advanced Planning Technology, Technological Achievements of the ARPA/RL Planning Initiative, AAAI Press, 1996, pp. 259-266.
13. Vidal, V., and Regnier, P., 1999. “Total Order Planning is More Efficient than we Thought.” Proceedings of the Sixteenth National Conference on Artificial Intelligence, AAAI Press, 1999, pp. 591-596.
14. Wilkins, D., 1998. “Using the SIPE-2 Planning System: A Manual for Version 4.22.” SRI International Artificial Intelligence Center, Menlo Park, CA, November 1998.
15. Zweben, M., Daun, B., Davis, E., and Deale, M., 1994. “Scheduling and Rescheduling with Iterative Repair,” in Intelligent Scheduling, Morgan Kaufman, San Francisco, 1994.