High Performance Techniques for Space Mission Scheduling

October 1994

High Performance Techniques for Space Mission Scheduling

Authors:

Stephen Smith

Abstract:

In this paper, we summarize current research at Carnegie Mellon University aimed at development of high performance techniques and tools for space mission scheduling. Similar to prior research in opportunistic scheduling, our approach assumes the use of dynamic analysis of problem constraints as a basis for heuristic focusing of problem solving search. This methodology, however, is grounded in representational assumptions more akin to those adopted in recent temporal planning research, and in a problem solving framework which similarly emphasizes constraint posting in an explicitly maintained solution constraint network. These more general representational assumptions are necessitated by the predominance of state-dependent constraints in space mission planning domains, and the consequent need to integrate resource allocation and plan synthesis processes. First, we review the space mission problems we have considered to date and indicate the results obtained in these application domains. Next, we summarize recent work in constraintposting scheduling procedures, which offer the promise of better future solutions to this class of problems
@conference{Smith-1994-13772,
author = {Stephen Smith},
title = {High Performance Techniques for Space Mission Scheduling},
booktitle = {Proceedings of 3rd International Symposium on Artificial Intelligence, Robotics, and Automation for Space (iSAIRAS '94)},
year = {1994},
month = {October},
pages = {419 - 422},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.