CFH12k Queued Observing Programme: Preliminary Description.
6. Decision trees.
The following decision trees illustrate algorithms used by the queued observing programme. Where appropriate, they will be automated within the database engine which will handle the catalogue of approved observations.
6.1. Compile list of viable fields.
This decision tree generates a list of fields, derived from the entire catalogue of science observations contained in the queue and not yet obtained, which are currently viable for execution. Viability takes no account of programme priority. This decision tree is run for each exposure to be obtained. The input time is that of the end of the current exposure.
The output of this tree is fed to the "Identify current best exposure" tree.
6.2. Identify (and execute) current best exposure.
From the list of viable science exposures, this tree determines which should be obtained next.
Web conversion by: Dr. T. M. C. Abbott,
tmca@cfht.hawaii.edu
Copyright © 1998, CFHT Corporation. All rights
reserved.
