메뉴 건너뛰기




Volumn 6, Issue 5, 2002, Pages 367-381

Selecting and scheduling observations of agile satellites

Author keywords

Agile satellite; Earth observing satellite; Mission management; Scheduling

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; IMAGE PROCESSING; ORBITS; SCHEDULING;

EID: 0039490362     PISSN: 12709638     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1270-9638(02)01173-2     Document Type: Article
Times cited : (428)

References (23)
  • 5
    • 0003611822 scopus 로고    scopus 로고
    • Improved linear programming bounds via column generation for daily scheduling of earth observation satellite
    • LIPN, Université 13 Paris Nord, January
    • V. Gabrel, Improved linear programming bounds via column generation for daily scheduling of earth observation satellite, Technical Report, LIPN, Université 13 Paris Nord, January 1999.
    • (1999) Technical Report
    • Gabrel, V.1
  • 6
    • 0031540345 scopus 로고    scopus 로고
    • A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
    • V. Gabrel, A. Moulet, C. Murat, V.T. Paschos, A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts, Ann. Oper. Res. 69 (1997) 115-134.
    • (1997) Ann. Oper. Res. , vol.69 , pp. 115-134
    • Gabrel, V.1    Moulet, A.2    Murat, C.3    Paschos, V.T.4
  • 8
    • 0028516246 scopus 로고
    • Maximizing the value of a space mission
    • N.G. Hall, M.J. Magazine, Maximizing the value of a space mission, European J. Oper. Res. 78 (1994) 224-241.
    • (1994) European J. Oper. Res. , vol.78 , pp. 224-241
    • Hall, N.G.1    Magazine, M.J.2
  • 11
    • 0000314222 scopus 로고    scopus 로고
    • Strategic directions in constraint programming
    • P. Van Hentenryck, V. Saraswat, Strategic directions in constraint programming, ACM Comput. Surveys 28 (4) (1996).
    • (1996) ACM Comput. Surveys , vol.28 , Issue.4
    • Van Hentenryck, P.1    Saraswat, V.2
  • 12
    • 4243532938 scopus 로고
    • Constraint logic programming: A survey
    • J. Jaffar, M. Maher, Constraint logic programming: A survey, J. Logic Programming 19/20 (1994) 503-582.
    • (1994) J. Logic Programming , vol.19-20 , pp. 503-582
    • Jaffar, J.1    Maher, M.2
  • 14
    • 84880665195 scopus 로고    scopus 로고
    • Exploiting a common property resource under a fairness constraint: A case study
    • Stockholm, Sweden
    • M. Lemaître, G. Verfaillie, N. Bataille, Exploiting a common property resource under a fairness constraint: A case study, in: Proc. 18th IJCAI-99, Stockholm, Sweden, 1999, pp. 206-211.
    • (1999) Proc. 18th IJCAI-99 , pp. 206-211
    • Lemaître, M.1    Verfaillie, G.2    Bataille, N.3
  • 15
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • A.K. Mackworth, B.C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence 25 (1985) 65-74.
    • (1985) Artificial Intelligence , vol.25 , pp. 65-74
    • Mackworth, A.K.1    Freuder, B.C.2
  • 16
    • 0002582645 scopus 로고
    • Valued constraint satisfaction problems: Hard and easy problems
    • Montréal, Québec
    • T. Schiex, H. Fargier, G. Verfaillie, Valued constraint satisfaction problems: hard and easy problems, in: Proc. IJCAI-95, Montréal, Québec, 1995, pp. 631-639.
    • (1995) Proc. IJCAI-95 , pp. 631-639
    • Schiex, T.1    Fargier, H.2    Verfaillie, G.3
  • 18
    • 0035501794 scopus 로고    scopus 로고
    • A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
    • M. Vasquez, J.-K. Hao, A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite, J. Comput. Optim. Appl. 20 (2) (2001) 137-157.
    • (2001) J. Comput. Optim. Appl. , vol.20 , Issue.2 , pp. 137-157
    • Vasquez, M.1    Hao, J.-K.2
  • 19
    • 0040519141 scopus 로고    scopus 로고
    • Upper bounds for the SPOTS daily photograph scheduling problem
    • to appear
    • M. Vasquez, J.-K. Hao, Upper bounds for the SPOTS daily photograph scheduling problem, J. Combinatorial Optim, 2002, to appear.
    • (2002) J. Combinatorial Optim
    • Vasquez, M.1    Hao, J.-K.2
  • 20
    • 0039333906 scopus 로고    scopus 로고
    • Dealing with uncertainty when managing an Earth observation satellite
    • Robotics, and Automation for Space (i-SAIRAS-99), Noordwijk, The Netherlands
    • G. Verfaillie, E. Bensana, C. Michelon-Edery, N. Bataille, Dealing with uncertainty when managing an Earth observation satellite, in: Proc. 5th International Symposium on Artificial Intelligence, Robotics, and Automation for Space (i-SAIRAS-99), Noordwijk, The Netherlands, 1999, pp. 205-207.
    • (1999) Proc. 5th International Symposium on Artificial Intelligence , pp. 205-207
    • Verfaillie, G.1    Bensana, E.2    Michelon-Edery, C.3    Bataille, N.4
  • 22
    • 0030368582 scopus 로고    scopus 로고
    • Russian doll search for solving constraint optimization problems
    • Portland, OR
    • G. Verfaillie, M. Lemaître, T. Schiex, Russian doll search for solving constraint optimization problems, in: Proc. AAAI-96, Portland, OR, 1996, pp. 181-187.
    • (1996) Proc. AAAI-96 , pp. 181-187
    • Verfaillie, G.1    Lemaître, M.2    Schiex, T.3
  • 23
    • 0033885012 scopus 로고    scopus 로고
    • Three scheduling algorithms applied to the Earth observing systems domain
    • WJ. Wolfe, S.E. Sorensen, Three scheduling algorithms applied to the Earth observing systems domain, Management Sci. 46 (1) (2000) 148-168.
    • (2000) Management Sci. , vol.46 , Issue.1 , pp. 148-168
    • Wolfe, W.J.1    Sorensen, S.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.