Maria Fox
Abstract
Partial orders are an essential supporting component of non-linear, constraint-posting planning algorithms. However, managing partial orders represents and expensive overhead in plan construction and development. Simple solutions are only suitable for very small planning problems involving tens rather than hundreds of partially ordered elements. For more sophisticated planning languages allowing the representation of point-based intervals and abstraction it is necessary to manage far larger sets of temporal elements. In this paper is presented an approach and algorithm, TEMPMAN, for the management of partial orders which exploits the typical properties of planned partial orders to achieve a significantly better performance than existing solutions to this problem.
- J. F. Allen and L. Schubert. The trains project. Technical Report 91-1, Dept. of Computer Science, University of Rochester, NY, 1991.Google Scholar
Cross Ref
- R. Arthur and J. Stillman. Temporal reasoning for planning and scheduling. Technical report, AI Laboratory, General Electric Research and Development Centre, 1992.Google Scholar
- T. Dean and D. McDermott. Temporal database management. Artificial Intelligence, 32:1--55, 1987. Google ScholarDigital Library
- R. Fikes and N. Nilsson. STRIPS: A new approach to the application of theorem-proving to problem-solving. Artificial Intelligence, 2:189--208, 1971.Google ScholarCross Ref
- M. Fox and D. Long. Hierarchical planning using abstraction. IEE Proc. on Control Theory and Applications, 142:197--210, 1995.Google ScholarCross Ref
- A. Gerevini and L. Schubert. Efficient temporal reasoning through timegraphs. In Proceedings of IJCAI-93, Chambery, France, pages 648--654, 1993.Google Scholar
- A. Gerevini and L. Schubert. Efficient algorithms for qualitative reasoning about time. Artificial Intelligence, 74:2:207--248, 1995. Google ScholarDigital Library
- H. Kautz and P. Ladkin. Integrating metric and qualitative temporal reasoning. In Proceedings of 9th National Conference on AI (AAAI-91), 1991.Google Scholar
- J. Koomen. The timelogic temporal reasoning system. Technical Report 231, Computer Science Department, University of Rochester, New York, 1989.Google Scholar
- J. S. Penberthy and D. S. Weld. UCPOP: A sound and complete partial order planner for ADL. In Proceedings of KR-92, the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pages 103--114, 1992.Google Scholar
- E. D. Sacerdoti. The non-linear nature of plans. In Proceedings of 4th IJCAI, 1974.Google Scholar
- A. Tate. Project planning using a hierarchic non-linear planner. Technical report, Department of Artificial Intelligence, University of Edinburgh, 1976.Google Scholar
- D. Wilkins. Practical planning: extending the classical AI paradigm. Addison-Wesley, 1988. Google ScholarDigital Library
- E. Yampratoom and J. F. Allen. Performance of temporal reasoning systems. SIGART Bulletin, 4:3, 1995. Google ScholarDigital Library
Index Terms
- An efficient algorithm for managing partial orders in planning
Recommendations
Planning horizons for manpower planning
The purpose of manpower planning is to get a better matching between manpowerrequirement and manpower availability. The difficult part of manpower planning is to get reliable forecasts for future manpower requirement. It is important, therefore, to know ...
Comments