Combinatorial optimization for spacecraft scheduling

Author

Scherer, William T. ; Rotman, Frank

Author_Institution

Dept. of Syst. Eng., Virginia Univ., Charlottesville, VA, USA

fYear

1992

fDate

10-13 Nov 1992

Firstpage

120

Lastpage

127

Abstract

The application of combinatorial optimization techniques to the automatic spacecraft scheduling problem is described. The problem is to search over the candidate sequences of experiments for a sequence that maximizes the value of the science conducted while minimizing constraint conflicts. Exploratory computational results indicate that pseudorandom research techniques, such as simulated annealing, generate viable sequences in reasonable times

Keywords

aerospace computing; optimisation; scheduling; candidate sequences; combinatorial optimization techniques; constraint conflicts; pseudorandom research techniques; science value; simulated annealing; spacecraft scheduling; Aerospace engineering; Computational modeling; Computer science; Downlink; Dynamic scheduling; NP-complete problem; Processor scheduling; Simulated annealing; Space vehicles; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Tools with Artificial Intelligence, 1992. TAI '92, Proceedings., Fourth International Conference on

Conference_Location

Arlington, VA

Print_ISBN

0-8186-2905-3

Type

conf

DOI

10.1109/TAI.1992.246364

Filename

246364

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3376316