Choosing objectives in over-subscription planning

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 393-401

  Smith, David E ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC INFORMATION; NASA PLANNING PROBLEM; OVER-SUBSCRIPTION PLANNING;

COSTS; GRAPH THEORY; SET THEORY; SPACE APPLICATIONS; TRAVELING SALESMAN PROBLEM;

PLANNING;

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

References (21)

1. Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90, 281-300.
2. Chien, S., Knight, R., Stechert, A., Sherwood, R., & Rabideau, G. 2000. Using Iterative Repair to Increase the Responsiveness of Planning and Scheduling for Autonomous Spacecraft. In Proc. 5th Intl. Conf. on Artificial Intelligence Planning and Scheduling (AIPS-00).
3. Do, M. & Kambhampati, S. 2002. Planning graph-based heuristics for cost-sensitive temporal planning. In Proc. 6th Intl. Conf. on AI Planning & Scheduling (AIPS-02).
4. Do, M. & Kambhampati, S. 2003. Sapa: a scalable multi-objective metric temporal planner. Journal of Artificial Intelligence Research 20.
5. Edelkamp, S. 2003. Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Intelligence Research 20.
6. Estlin, T., Fisher, F., Gaines, D., Chouinard, C., Schaffer, S. & Nesnas, I. 2002. Continuous planning and execution for an autonomous rover. In Proc. 3rd Intl. NASA Workshop on Planning and Scheduling for Space, Houston, TX.
7. Fox, M. & Long, D. 2001. Hybrid STAN: Identifying and Managing Combinatorial Optimisation Sub-problems in Planning. In Proc. of IJCAI-01.
8. Fox, M. & Long, D. 2003. PDDL 2.1: An extension to pddl for expressing temporal planning domains. Journal of Artificial Intelligence Research 20.
9. Gerevini, A., Saetti, A. & Serina, I. 2003. Planning through stochastic local search and temporal action graphs in LPG. Journal of Artificial Intelligence Research 20.
10. Hoffmann, J. and Nebel, B. 2001. The FF planning system: fast plan generation through heuristic search, Journal of Artificial Intelligence Research 14, 253-302.
11. Hoffman, J. 2003. The Metric-FF planning system: translating "ignoring delete lists" to numeric state variables. Journal of Artificial Intelligence Research 20.
12. Keller, C. 1989. Algorithms to solve the orienteering problem: a comparison, European J. Operational Research 41: 224-231.
13. Kramer, L. 2000. Generating a Long Range Plan for a New Class of Astronomical Observatories. In Proc. 2nd NASA Workshop on Planning and Scheduling for Space.
14. Kramer, L. & Giuliano, M. 1997. Reasoning About and Scheduling Linked HST Observations with Spike. In Proc. International Workshop on Planning and Scheduling for Space Exploration and Science, Oxnard, CA.
15. Kramer, L. & Smith, S. 2003. Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems. In Proc. of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03).
16. Long, D. & Fox, M. 2000. Extracting route-planning: first steps in automatic problem decomposition. In Proc. Workshop on Analysing and Exploiting Domain Knowledge, AIPS 2000, Breckenridge, Colorado.
17. Long, D. & Fox, M. 2001 Multi-Processor Scheduling Problems in Planning. In Proc. International Conference on AI (IC-AI'01), Las Vegas.
18. Long, D. & Fox, M. 2002 Generic Types in Planning. In Exploring AI in the New Millennium (eds B. Nebel and G. Lakemeyer), Morgan Kaufmann.
19. Long, D. & Fox, M. 2003. The 3rd International Planning Competition: results and analysis. Journal of Artificial Intelligence Research 20.
20. Nguyen, X. and Kambhampati, S. 2000. Extracting effective and admissible heuristics from the planning graph. In Proc. 17th National Conf. on AI (AAAI-00).
21. Potter, W. & Gasch, J. 1998. A photo album of earth: Scheduling Landsat 7 mission daily activities. In Proc. International Symposium on Space Mission Operations and Ground Data Systems.