Matthew J. Robbins
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Matthew J. Robbins has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Brian J. Lunday
Air Force Institute of Technology
17 shared publications - Phillip R. Jenkins
Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson Air Force Base, OH, USA
10 shared publications - Sheldon H. Jacobson
Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, USA
7 shared publications - Richard. F. Deckro
Future Operations Investigation Laboratory, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson Air Force Base, OH, USA
3 shared publications James F. Morris
Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, USA
2 shared publications- Joseph M. Liles2 shared publications
Latest Publications
- Open Access
- 8 July 2026
- Published by Elsevier in SSRN Electronic Journal
Simulation-Based Digital Twin for Airline Disruption Recovery Using Synthetic Network and Passenger Data
Airline operations are subject to disruptions that degrade schedule reliability and passenger service. The integrated airline recovery problem mitigates disruptions through coordinated recovery decisions involving aircraft, flights, and passengers, but practical solution approaches require detailed operational and itinerary data that are often unavailable or incomplete in public sources. Recovery methods must also operate within stringent real-time constraints to be viable within an Airline Operations Control Center, particularly when embedded in event-driven, enterprise-level digital twin architectures.This study presents an airline data-generation methodology and an experimental digital-twin-based recovery framework coupled with a simulation-driven solution approach. The data-generation methodology produces realistic airline traffic volumes and passenger connectivity patterns using spatial and temporal network characteristics, enabling large-scale experimentation without reliance on proprietary airline datasets. The framework models event-driven communication between an emulated physical airline system and a digital decision-support layer, synchronizing operational updates, generating recovery windows, evaluating candidate recovery actions, and returning prescriptive schedule updates.Computational experiments across multiple airline network structures and disruption scenarios demonstrate that the framework consistently generates feasible recovery solutions within a one-minute operational decision window, including a large-scale scenario representative of a major airline. Results show limited flight cancellations and passenger displacement, while recovery behavior varies with network structure and disruption type. These findings demonstrate the feasibility of communication-triggered, simulation-based recovery for time-critical decision support and provide a foundation for future enterprise-level airline digital twin research.
- 8 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSimulation-Based Digital Twin for Airline Disruption Recovery Using Synthetic Network and Passenger Data
Airline operations are subject to disruptions that degrade schedule reliability and passenger service. The integrated airline recovery problem mitigates disruptions through coordinated recovery decisions involving aircraft, flights, and passengers, but practical solution approaches require detailed operational and itinerary data that are often unavailable or incomplete in public sources. Recovery methods must also operate within stringent real-time constraints to be viable within an Airline Operations Control Center, particularly when embedded in event-driven, enterprise-level digital twin architectures.This study presents an airline data-generation methodology and an experimental digital-twin-based recovery framework coupled with a simulation-driven solution approach. The data-generation methodology produces realistic airline traffic volumes and passenger connectivity patterns using spatial and temporal network characteristics, enabling large-scale experimentation without reliance on proprietary airline datasets. The framework models event-driven communication between an emulated physical airline system and a digital decision-support layer, synchronizing operational updates, generating recovery windows, evaluating candidate recovery actions, and returning prescriptive schedule updates.Computational experiments across multiple airline network structures and disruption scenarios demonstrate that the framework consistently generates feasible recovery solutions within a one-minute operational decision window, including a large-scale scenario representative of a major airline. Results show limited flight cancellations and passenger displacement, while recovery behavior varies with network structure and disruption type. These findings demonstrate the feasibility of communication-triggered, simulation-based recovery for time-critical decision support and provide a foundation for future enterprise-level airline digital twin research.
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Decision Analysis
- Vol. 23 (1) , 11-27
Bayesian Graph Traversal
This research considers Bayesian decision-analytic approaches toward the traversal of an uncertain graph. Namely, a traveler progresses over a graph in which rewards are gained upon a node’s first visit, and costs are incurred for every edge traversal. The traveler knows the graph’s adjacency matrix and the starting position but does not know the rewards and costs. The traveler is a Bayesian who encodes his beliefs about these values using a Gaussian process prior and who seeks to maximize his expected utility over these beliefs. Adopting a decision-analytic perspective, we develop sequential decision-making solution strategies for this coupled information-collection and network-routing problem. We show that the problem is NP-hard and derive properties of the optimal walk. These properties provide heuristics for the traveler’s problem that balance exploration and exploitation. We provide a practical case study focused on the use of unmanned aerial systems for public safety and empirically study policy performance in myriad Erdös–Rényi settings. Funding: This work was supported by the Office of Naval Research [Grant 6000012277] and the Air Force Office of Scientific Research [Grant 21RT0867].
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Decision Analysis
- Vol. 23 (1) , 11-27
Bayesian Graph Traversal
This research considers Bayesian decision-analytic approaches toward the traversal of an uncertain graph. Namely, a traveler progresses over a graph in which rewards are gained upon a node’s first visit, and costs are incurred for every edge traversal. The traveler knows the graph’s adjacency matrix and the starting position but does not know the rewards and costs. The traveler is a Bayesian who encodes his beliefs about these values using a Gaussian process prior and who seeks to maximize his expected utility over these beliefs. Adopting a decision-analytic perspective, we develop sequential decision-making solution strategies for this coupled information-collection and network-routing problem. We show that the problem is NP-hard and derive properties of the optimal walk. These properties provide heuristics for the traveler’s problem that balance exploration and exploitation. We provide a practical case study focused on the use of unmanned aerial systems for public safety and empirically study policy performance in myriad Erdös–Rényi settings. Funding: This work was supported by the Office of Naval Research [Grant 6000012277] and the Air Force Office of Scientific Research [Grant 21RT0867].
- 21 September 2022
- Published by Springer Nature
- p. 1-7
Military and Security Applications: Medical Evacuation
- 21 September 2022
- Published by Springer Nature
- p. 1-7
Military and Security Applications: Medical Evacuation
- 20 June 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 305 (3) , 1435-1449
Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- 20 June 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 305 (3) , 1435-1449
Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- 7 May 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 203
An approximate dynamic programming approach for solving an air combat maneuvering problem
- 7 May 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 203
An approximate dynamic programming approach for solving an air combat maneuvering problem
- 1 January 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 33 (1) , 2-26
Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies
Military medical planners must consider how aerial medical evacuation (MEDEVAC) assets will be dispatched when preparing for and supporting high-intensity combat operations. The dispatching authority seeks to dispatch MEDEVAC assets to prioritized requests for service, such that battlefield casualties are effectively and efficiently transported to nearby medical-treatment facilities. We formulate and solve a discounted, infinite-horizon Markov decision process (MDP) model of the MEDEVAC dispatching problem. Because the high dimensionality and uncountable state space of our MDP model renders classical dynamic programming solution methods intractable, we instead apply approximate dynamic programming (ADP) solution methods to produce high-quality dispatching policies relative to the currently practiced closest-available dispatching policy. We develop, test, and compare two distinct ADP solution techniques, both of which utilize an approximate policy iteration (API) algorithmic framework. The first algorithm uses least-squares temporal differences (LSTD) learning for policy evaluation, whereas the second algorithm uses neural network (NN) learning. We construct a notional, yet representative planning scenario based on high-intensity combat operations in southern Azerbaijan to demonstrate the applicability of our MDP model and to compare the efficacies of our proposed ADP solution techniques. We generate 30 problem instances via a designed experiment to examine how selected problem features and algorithmic features affect the quality of solutions attained by our ADP policies. Results show that the respective policies determined by the NN-API and LSTD-API algorithms significantly outperform the closest-available benchmark policies in 27 (90%) and 24 (80%) of the problem instances examined. Moreover, the NN-API policies significantly outperform the LSTD-API policies in each of the problem instances examined. Compared with the closest-available policy for the baseline problem instance, the NN-API policy decreases the average response time of important urgent (i.e., life-threatening) requests by 39 minutes. These research models, methodologies, and results inform the implementation and modification of current and future MEDEVAC tactics, techniques, and procedures, as well as the design and purchase of future aerial MEDEVAC assets.
- 1 January 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 33 (1) , 2-26
Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies
Military medical planners must consider how aerial medical evacuation (MEDEVAC) assets will be dispatched when preparing for and supporting high-intensity combat operations. The dispatching authority seeks to dispatch MEDEVAC assets to prioritized requests for service, such that battlefield casualties are effectively and efficiently transported to nearby medical-treatment facilities. We formulate and solve a discounted, infinite-horizon Markov decision process (MDP) model of the MEDEVAC dispatching problem. Because the high dimensionality and uncountable state space of our MDP model renders classical dynamic programming solution methods intractable, we instead apply approximate dynamic programming (ADP) solution methods to produce high-quality dispatching policies relative to the currently practiced closest-available dispatching policy. We develop, test, and compare two distinct ADP solution techniques, both of which utilize an approximate policy iteration (API) algorithmic framework. The first algorithm uses least-squares temporal differences (LSTD) learning for policy evaluation, whereas the second algorithm uses neural network (NN) learning. We construct a notional, yet representative planning scenario based on high-intensity combat operations in southern Azerbaijan to demonstrate the applicability of our MDP model and to compare the efficacies of our proposed ADP solution techniques. We generate 30 problem instances via a designed experiment to examine how selected problem features and algorithmic features affect the quality of solutions attained by our ADP policies. Results show that the respective policies determined by the NN-API and LSTD-API algorithms significantly outperform the closest-available benchmark policies in 27 (90%) and 24 (80%) of the problem instances examined. Moreover, the NN-API policies significantly outperform the LSTD-API policies in each of the problem instances examined. Compared with the closest-available policy for the baseline problem instance, the NN-API policy decreases the average response time of important urgent (i.e., life-threatening) requests by 39 minutes. These research models, methodologies, and results inform the implementation and modification of current and future MEDEVAC tactics, techniques, and procedures, as well as the design and purchase of future aerial MEDEVAC assets.