A timeline algorithm for astronomy missions

Details A timeline algorithm for astronomy missions A timeline algorithm for astronomy missions

Apr 1975

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1975stin...7522216m&link_type=abstract

Unknown

Astronomy and Astrophysics

Astronomy

Algorithms, Mission Planning, Spaceborne Astronomy, Heuristic Methods, Mathematical Models, Scheduling, Sequencing

Scientific paper

An algorithm is presented for generating viewing timelines for orbital astronomy missions of the pointing (nonsurvey/scan) type. The algorithm establishes a target sequence from a list of candidate targets in a way which maximizes total viewing time. Two special cases are treated. One concerns dim targets which, due to lighting constraints, are scheduled only during the antipolar portion of each orbit. They normally require long observation times extending over several revolutions. A minimum slew heuristic is employed to select the sequence of dim targets. The other case deals with bright, or short duration, targets, which have less restrictive lighting constraints and are scheduled during the portion of each orbit when dim targets cannot be viewed. Since this process moves much more rapidly than the dim path, an enumeration algorithm is used to select the sequence that maximizes total viewing time.

Affiliated with

Also associated with

No associations

Rating

A timeline algorithm for astronomy missions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A timeline algorithm for astronomy missions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A timeline algorithm for astronomy missions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-949235