Least Commitment Planning Algorithm for Generating an Optimized Sequence of Satellite Commands
Original Publication Date: 1987-Sep-01
Included in the Prior Art Database: 2005-Feb-01
This article describes a method for dynamically calculating a plan of commands to change a system of equipment from one configuration to another without violating illegal configuration constraints and with a minimum of steps. This method solves the problem of generating and storing the large number of possible command sequences required to exhaustively encompass all the possible command sequences associated with a subsystem. An example of the problem addressed by this algorithm is depicted in Fig. 1. In this example, various pieces of satellite equipment are ON or OFF, namely, DCI-1 is OFF, MOD-1 is ON, and both HPAs are OFF. The goal is to turn HPA-2 ON. There is a constraint, however, which states that in order to turn an HPA ON, the active MOD must be OFF.