Effective approaches for partial satisfaction (over-subscription) planning

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 562-569

  Van Den Briel, Menkes ^a   Sanchez, Romeo ^a   Do, Minh B ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARTIAL SATISFACTION PLANNING; PLANING SCENARIOS; PLANNING PROBLEMS; STATE-SPACE HEURISTIC PLANNER;

COMPUTER SIMULATION; COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; SATELLITES; SCHEDULING;

PLANNING;

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

References (20)

1. Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90:281-300.
2. Boutilier, C, Dean, T., and Hanks, S. 1999. Decision-Theoretic Planning: Structural assumptions and computational leverage. In JAIR 11 (p. 1-94)
3. Bylander, T. 1994. The computational complexity of prepositional STRIPS planning. In AIJ 69(1-2):165-204.
4. Do, M. and Kambhampati, S. 2003. Sapa: a multi-objective metric temporal planer. In JAIR 20 (p. 155-194)
5. Do, M. and Kambhampati, S. 2001. Planning as Constraint Satisfaction: Solving the planning graph by compiling it into CSP. In AIJ 132(2):151-182.
6. Frank, J.; Jonsson, A.; Morris, R.; and Smith, D. 2001. Planning and scheduling for fleets of earth observing satellites. In Sixth Int. Symp. on Artificial Intelligence, Robotics, Automation & Space.
7. Globus, A.; Crawford, J.; Lohn, J.; and Pryor, A. 2003. Scheduling earth observing sateliites with evolutionary algorithms. In Proc. Int. Conf. on Space Mission Challenges for Infor. Tech.
8. Hoffmann, J. and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. In JAIR 14 (p.253-302).
9. Kautz, H., and Selman, B. 1999b. Blackbox: Unifying Sat-based and Graph-based planning. In Proc. of IJCAI-99.
10. Kramer, L. and Giuliano, M. 1997. Reasoning about and scheduling linked HST observations with Spike. In Proc. of Int. Workshop on Planning and Scheduling for Space.
11. Kramer, L. A., and Smith, S. 2003. Maximizing flexibility: A retraction heuristic for oversubscribed scheduling problems. In Proc. of IJCAI-03.
12. Long, D., and Fox, M. 1999. Efficient implementation of the plan graph in STAN. In JAIR 10:87-115.
13. Long, D. and Fox, M. 2003. The 3rd International Planning Competition: Results and analysis. In JAIR 20 (p.1-59).
14. Nguyen, X., Kambhampati, S., and Nigenda, R. 2001. Planning graph as the basis for deriving heuristics for plan synthesis by State Space and CSP search. In AIJ 135 (p.73-123).
15. Potter, W. and Gasch, J. 1998. A photo album of Earth: Scheduling Landsat 7 mission daily activities. In Proc. of SpaceOps.
16. Sanchez, R., and Kambhampati, S. 2003. Altalt-p: Online parallelization of plans with heuristic state search. In JAIR 19 (p.631-657).
17. Smith, D. 2003. The Mystery talk. Planet Summer School
18. Smith, D. 2004. Choosing objectives in Over-Subscription planning. In Proc. of ICAPS-04.
19. Vossen, T., Ball, M., and Nau, D. 1999. On the use of integer programming models in ai planning. In Proc. of IJCAI-99
20. Williamson, M., and Hanks, S. 1994. Optimal planning with a Goal-Directed utility model. In Proc. of AIPS-94.