Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty

Valicka, Christopher G.; Garcia, Deanna; Staid, Andrea; Watson, Jean-Paul; Hackebeil, Gabriel; Rathinam, Sivakumar; Ntaimo, Lewis

doi:10.1016/j.ejor.2018.11.043

Title: Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty

Full Record
Other Related Research

Abstract

We introduce the problem of scheduling observations on a constellation of remote sensors, to maximize the aggregate quality of the collections obtained. While automated tools exist to schedule remote sensors, they are often based on heuristic scheduling techniques, which typically fail to provide bounds on the quality of the resultant schedules. To address this issue, we first introduce a novel deterministic mixed-integer programming (MIP) model for scheduling a constellation of one to n satellites, which relies on extensive pre-computations associated with orbital propagators and sensor collection simulators to mitigate model size and complexity. Our MIP model captures realistic and complex constellation-target geometries, with solutions providing optimality guarantees. We then extend our base deterministic MIP model to obtain two-stage and three-stage stochastic MIP models that proactively schedule to maximize expected collection quality across a set of scenarios representing cloud cover uncertainty. Our experimental conclusions on instances of one and two satellites demonstrate that our stochastic MIP models yield significantly improved collection quality relative to our base deterministic MIP model. We further demonstrate that commercial off-the-shelf MIP solvers can produce provably optimal or near-optimal schedules from these models in time frames suitable for sensor operations.

Authors:

^[1]; Garcia, Deanna ^[1]; Staid, Andrea ^[1]; Watson, Jean-Paul ^[1]; Hackebeil, Gabriel ^[2]; Rathinam, Sivakumar ^[3];

^[3]

Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Univ. of Michigan, Ann Arbor, MI (United States)
Texas A & M Univ., College Station, TX (United States)

Publication Date:: Fri Nov 23 00:00:00 EST 2018

Research Org.:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

Sponsoring Org.:: USDOE National Nuclear Security Administration (NNSA)

OSTI Identifier:: 1524209

Report Number(s):: SAND-2016-9028J
Journal ID: ISSN 0377-2217; 647351

Grant/Contract Number:: AC04-94AL85000; NA0003525

Resource Type:: Accepted Manuscript

Journal Name:: European Journal of Operational Research

Additional Journal Information:: Journal Volume: 275; Journal Issue: 2; Journal ID: ISSN 0377-2217

Publisher:: Elsevier

Country of Publication:: United States

Language:: English

Subject:: 47 OTHER INSTRUMENTATION; Scheduling; Integer programming; Stochastic programming; Remote sensing; Weather uncertainty

Citation Formats


                    Valicka, Christopher G., Garcia, Deanna, Staid, Andrea, Watson, Jean-Paul, Hackebeil, Gabriel, Rathinam, Sivakumar, and Ntaimo, Lewis. Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty.  United States: N. p., 2018. 
Web.  doi:10.1016/j.ejor.2018.11.043.

Copy to clipboard


                    Valicka, Christopher G., Garcia, Deanna, Staid, Andrea, Watson, Jean-Paul, Hackebeil, Gabriel, Rathinam, Sivakumar, & Ntaimo, Lewis. Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty.  United States.  https://doi.org/10.1016/j.ejor.2018.11.043

Copy to clipboard


                    Valicka, Christopher G., Garcia, Deanna, Staid, Andrea, Watson, Jean-Paul, Hackebeil, Gabriel, Rathinam, Sivakumar, and Ntaimo, Lewis. Fri .  
"Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty".  United States.  https://doi.org/10.1016/j.ejor.2018.11.043.  https://www.osti.gov/servlets/purl/1524209.

Copy to clipboard


                    
@article{osti_1524209,

  title        = {Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty},

  author       = {Valicka, Christopher G. and Garcia, Deanna and Staid, Andrea and Watson, Jean-Paul and Hackebeil, Gabriel and Rathinam, Sivakumar and Ntaimo, Lewis},

  abstractNote = {We introduce the problem of scheduling observations on a constellation of remote sensors, to maximize the aggregate quality of the collections obtained. While automated tools exist to schedule remote sensors, they are often based on heuristic scheduling techniques, which typically fail to provide bounds on the quality of the resultant schedules. To address this issue, we first introduce a novel deterministic mixed-integer programming (MIP) model for scheduling a constellation of one to n satellites, which relies on extensive pre-computations associated with orbital propagators and sensor collection simulators to mitigate model size and complexity. Our MIP model captures realistic and complex constellation-target geometries, with solutions providing optimality guarantees. We then extend our base deterministic MIP model to obtain two-stage and three-stage stochastic MIP models that proactively schedule to maximize expected collection quality across a set of scenarios representing cloud cover uncertainty. Our experimental conclusions on instances of one and two satellites demonstrate that our stochastic MIP models yield significantly improved collection quality relative to our base deterministic MIP model. We further demonstrate that commercial off-the-shelf MIP solvers can produce provably optimal or near-optimal schedules from these models in time frames suitable for sensor operations.},

  doi          = {10.1016/j.ejor.2018.11.043},

  journal      = {European Journal of Operational Research},

  number       = 2,

  volume       = 275,

  place        = {United States},

  year         = {Fri Nov 23 00:00:00 EST 2018},

  month        = {Fri Nov 23 00:00:00 EST 2018}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

https://doi.org/10.1016/j.ejor.2018.11.043

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 17 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Dynamic Multi-Sensor Multi-Mission Optimal Planning Tool

Technical Report Valicka, Christopher G. ; Rowe, Stephen ; Zou, Simon X. ; ...

Remote sensing systems have firmly established a role in providing immense value to commercial industry, scientific exploration, and national security. Continued maturation of sensing technology has reduced the cost of deploying highly-capable sensors while at the same time increased reliance on the information these sensors can provide. The demand for time on these sensors is unlikely to diminish. Coordination of next-generation sensor systems, larger constellations of satellites, unmanned aerial vehicles, ground telescopes, etc. is prohibitively complex for existing heuristicsbased scheduling techniques. The project was a two-year collaboration spanning multiple Sandia centers and included a partnership with Texas A&M University. Wemore »« less
https://doi.org/10.2172/1562409

Full Text Available
PySP : modeling and solving stochastic mixed-integer programs in Python.

Conference Woodruff, David L ; Watson, Jean-Paul

Although stochastic programming is a powerful tool for modeling decision-making under uncertainty, various impediments have historically prevented its widespread use. One key factor involves the ability of non-specialists to easily express stochastic programming problems as extensions of deterministic models, which are often formulated first. A second key factor relates to the difficulty of solving stochastic programming models, particularly the general mixed-integer, multi-stage case. Intricate, configurable, and parallel decomposition strategies are frequently required to achieve tractable run-times. We simultaneously address both of these factors in our PySP software package, which is part of the COIN-OR Coopr open-source Python project for optimization.more »« less
Approximate Mixed-Integer Programming Solution with Machine Learning Technique and Linear Programming Relaxation

Conference Lin, Xinming ; Hou, Zhangshuan ; Ren, Huiying ; ...

Security constrained unit commitment (SCUC) is solved in the day-ahead electricity market to determine electricity generation schedule for the following date. The associated mixed integer programming (MIP) problem is known computationally hard. Heuristics like rounding can be computationally efficient for solving large MIP problems however often produces lower quality solutions due to discrepancy between MIP solution and linear programming relaxation (LPR) solution, i.e., variables taking different discrete values between MIP and LPR solutions. In this work, we applied the machine learning-based algorithms—Classification and Regression Tree (CART) model and random forest (RF) model—to obtain an LPR-based approximation that close to anmore »« less
https://doi.org/10.1109/ICSGSC.2019.00-11
A two-stage stochastic optimization model for scheduling electric vehicle charging loads to relieve distribution-system constraints

Journal Article Wu, Fei ; Sioshansi, Ramteen - Transportation Research, Part B: Methodological

Electric vehicles (EVs) hold promise to improve the energy efficiency and environmental impacts of transportation. However, widespread EV use can impose significant stress on electricity-distribution systems due to their added charging loads. This paper proposes a centralized EV charging-control model, which schedules the charging of EVs that have flexibility. This flexibility stems from EVs that are parked at the charging station for a longer duration of time than is needed to fully recharge the battery. The model is formulated as a two-stage stochastic optimization problem. The model captures the use of distributed energy resources and uncertainties around EV arrival timesmore »« less
Cited by 63
https://doi.org/10.1016/j.trb.2017.05.002

Full Text Available
Scheduling optimal system operation using mixed integer programming

Conference Kazemersky, P M ; Turnage, J C ; Prince, B E

From nuclear utilities planning methods symposium; Chattanooga, Tennessee (16 Jan 1974). In collection of papers presented at the nuclear utilities planning methods symposium. The mid-range problem of scheduling optimal system operation may be conceptually viewed as being composed of two subdivisions. For the first subdivision, a model was developed which deals with the allocation of energy and/or refueling dates to units on the system for a desired time period (planning horizon). Mixed integer programming is used as the technique of minimization in this model. The second subdivision encompasses the modeling of a nuclear power reactor core. This is a necessarymore »« less

Similar Records