Improving robustness of spacecraft downlink schedules

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 37, Issue 5, 2007, Pages 887-896

  Oddi, Angelo ^a   Policella, Nicola ^a  

^a INSTITUTE OF COGNITIVE SCIENCES AND TECHNOLOGIES   (Italy)

Author keywords

Max flow; Robustness; Scheduling; Uncertainty

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA PROCESSING; SATELLITE COMMUNICATION SYSTEMS; SPACE APPLICATIONS; UNCERTAINTY ANALYSIS;

DATA SETS; SPACECRAFT DOMAIN; SPACECRAFT DOWNLINK SCHEDULES;

SPACECRAFT;

EID: 34547979285     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2007.900661     Document Type: Article

References (8)

1. G. Verfaillie and M. Lemaitre, "Selecting and scheduling observations for agile satellites: Some lessons from the constraint reasoning community point of view," in Principles and Practice of Constraint Programming, 7th International Conference, CP 2001, Lecture Notes in Computer Science, vol. 2239, T. Walsh, Ed. New York: Springer-Verlag, 2001, pp. 670-684.
2. E. Bensana, M. Lemaitre, and G. Verfaillie, "Earth observation satellite management," Constraints: Int. J., vol. 4, no. 3, pp. 293-299, 1999.
3. A. Cesta, A. Oddi, G. Cortellessa, and N. Policella, "Automating the generation of spacecraft downlink operations in [s MARS EXPRESS s]: Analysis, algorithms and an interactive solution aid," ISTC-CNR [PST], Ital. Nat. Res. Council, Rome, Tech. Rep. MEXAR-TR-02-10, Jul. 2002.
4. A. Oddi,N. Policella, A. Cesta, and G. Cortellessa, "Generating high quality schedules for a spacecraft memory downlink problem," in Principles and Practice of Constraint Programming, 9th International Conference, CP 2003, Lecture Notes in Computer Science, vol. 2833, F. Rossi, Ed. New York: Springer-Verlag, 2003, pp. 570-584.
5. G. Cortellessa, A. Cesta, A. Oddi, and N. Policella, "User interaction with an automated solver. The Case of a mission planner," Psychol. J., vol. 2, no. 1, pp. 140-162, 2004.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
7. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum flow problem," J. ACM, vol. 35, no. 4, pp. 921-940, Oct. 1988.
8. D. Joslin and D. Clements, "Squeaky wheel' optimization," J. Artif. Intell. Res., vol. 10, pp. 353-373, 1999.