@inproceedings {icaps16-199,
    track    = {​​​Applications Track},
    title    = {Optimal Scheduling of a Constellation of Earth-Imaging Satellites, for Maximal Data Throughput and Efficient Human Management},
    url      = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13173},
    author   = {Sean Augenstein and  Alejandra Estanislao and  Emmanuel Guere and  Sean Blaes},
    abstract = {A mixed-integer linear program (MILP) approach to scheduling a large constellation of Earth-imaging satellites is presented.  The algorithm optimizes the assignment of imagery collects, image data downlinks, and "health & safety" contacts, generating schedules for all satellites and ground stations in a network.  Hardware-driven constraints (e.g., the limited agility of the satellites) and operations-driven constraints (e.g., guaranteeing a minimum contact frequency for each satellite) are both addressed.  Of critical importance to the use of this algorithm in real-world operations, it runs fast enough to allow for human operator interaction and repeated rescheduling.  This is achieved by a partitioning of the problem into sequential steps for downlink scheduling and image scheduling, with a novel dynamic programming (DP) heuristic providing a stand-in for imaging activity in the MILP when scheduling the downlinks.},
    keywords = {}
}

{"_id":"GY9RKbEXDRBXvF7Aq","bibbaseid":"augenstein-estanislao-guere-blaes-optimalschedulingofaconstellationofearthimagingsatellitesformaximaldatathroughputandefficienthumanmanagement","downloads":0,"creationDate":"2016-03-09T03:04:32.871Z","title":"Optimal Scheduling of a Constellation of Earth-Imaging Satellites, for Maximal Data Throughput and Efficient Human Management","author_short":["Augenstein, S.","Estanislao, A.","Guere, E.","Blaes, S."],"year":null,"bibtype":"inproceedings","biburl":"icaps16.icaps-conference.org/papers.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","track":"​​​Applications Track","title":"Optimal Scheduling of a Constellation of Earth-Imaging Satellites, for Maximal Data Throughput and Efficient Human Management","url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13173","author":[{"firstnames":["Sean"],"propositions":[],"lastnames":["Augenstein"],"suffixes":[]},{"firstnames":["Alejandra"],"propositions":[],"lastnames":["Estanislao"],"suffixes":[]},{"firstnames":["Emmanuel"],"propositions":[],"lastnames":["Guere"],"suffixes":[]},{"firstnames":["Sean"],"propositions":[],"lastnames":["Blaes"],"suffixes":[]}],"abstract":"A mixed-integer linear program (MILP) approach to scheduling a large constellation of Earth-imaging satellites is presented. The algorithm optimizes the assignment of imagery collects, image data downlinks, and \"health & safety\" contacts, generating schedules for all satellites and ground stations in a network. Hardware-driven constraints (e.g., the limited agility of the satellites) and operations-driven constraints (e.g., guaranteeing a minimum contact frequency for each satellite) are both addressed. Of critical importance to the use of this algorithm in real-world operations, it runs fast enough to allow for human operator interaction and repeated rescheduling. This is achieved by a partitioning of the problem into sequential steps for downlink scheduling and image scheduling, with a novel dynamic programming (DP) heuristic providing a stand-in for imaging activity in the MILP when scheduling the downlinks.","keywords":"","bibtex":"@inproceedings {icaps16-199,\r\n track = {​​​Applications Track},\r\n title = {Optimal Scheduling of a Constellation of Earth-Imaging Satellites, for Maximal Data Throughput and Efficient Human Management},\r\n url = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13173},\r\n author = {Sean Augenstein and Alejandra Estanislao and Emmanuel Guere and Sean Blaes},\r\n abstract = {A mixed-integer linear program (MILP) approach to scheduling a large constellation of Earth-imaging satellites is presented. The algorithm optimizes the assignment of imagery collects, image data downlinks, and \"health & safety\" contacts, generating schedules for all satellites and ground stations in a network. Hardware-driven constraints (e.g., the limited agility of the satellites) and operations-driven constraints (e.g., guaranteeing a minimum contact frequency for each satellite) are both addressed. Of critical importance to the use of this algorithm in real-world operations, it runs fast enough to allow for human operator interaction and repeated rescheduling. This is achieved by a partitioning of the problem into sequential steps for downlink scheduling and image scheduling, with a novel dynamic programming (DP) heuristic providing a stand-in for imaging activity in the MILP when scheduling the downlinks.},\r\n keywords = {}\r\n}\r\n\r\n","author_short":["Augenstein, S.","Estanislao, A.","Guere, E.","Blaes, S."],"key":"icaps16-199","id":"icaps16-199","bibbaseid":"augenstein-estanislao-guere-blaes-optimalschedulingofaconstellationofearthimagingsatellitesformaximaldatathroughputandefficienthumanmanagement","role":"author","urls":{"Paper":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13173"},"metadata":{"authorlinks":{}},"html":""},"search_terms":["optimal","scheduling","constellation","earth","imaging","satellites","maximal","data","throughput","efficient","human","management","augenstein","estanislao","guere","blaes"],"keywords":[],"authorIDs":[],"dataSources":["iMkx859KiXcegwsin","EZtZjCTnxcdTTyeij"]}