Optimal Maintenance Planning for Mission‐Oriented Systems Considering Dynamic Mission Duration

ABSTRACT In practical applications, systems often face variable mission durations influenced by dynamic factors such as maintenance personnel availability, environmental conditions, and real‐time operational demands. This paper proposes a condition‐based maintenance (CBM) strategy for mission‐oriented systems (MOS), addressing the complexities of stochastic mission durations and system degradation. We design a multistate system (MSS) reliability framework that explicitly models dynamic transitions between discrete performance states defined by mission profiles via a discrete‐time Markov chain (DTMC) and degradation levels via a Wiener process. Unlike traditional binary‐state models, our approach captures degradation state shifts influenced by mission duration, enabling adaptive maintenance policies for systems operating in multistate conditions. The maintenance optimization problem is formulated as a Markov decision process (MDP) via backward dynamic programming to minimize expected maintenance costs. Numerical simulations and sensitivity analyses validate the model's efficacy and adaptability in optimizing maintenance for unmanned aerial vehicles (UAVs). The findings underscore the importance of minimizing maintenance and inspection time, and tailoring strategies to mission characteristics and system costs.

Authors

Institutions

Publication Details

Journal
Naval Research Logistics (NRL)
Published
2026-03-11
DOI
https://doi.org/10.1002/nav.70064
Primary Topic
Reliability and Maintenance Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Maintenance Planning for Mission‐Oriented Systems Considering Dynamic Mission Duration

Xun Xiao, Yi Luo, Kai Li, Xiujie Zhao
Naval Research Logistics (NRL)
Reliability and Maintenance Optimization
article

Optimal Maintenance Planning for Mission‐Oriented Systems Considering Dynamic Mission Duration

Xun Xiao, Yi Luo, Kai Li, Xiujie Zhao
article en

Abstract

ABSTRACT In practical applications, systems often face variable mission durations influenced by dynamic factors such as maintenance personnel availability, environmental conditions, and real‐time operational demands. This paper proposes a condition‐based maintenance (CBM) strategy for mission‐oriented systems (MOS), addressing the complexities of stochastic mission durations and system degradation. We design a multistate system (MSS) reliability framework that explicitly models dynamic transitions between discrete performance states defined by mission profiles via a discrete‐time Markov chain (DTMC) and degradation levels via a Wiener process. Unlike traditional binary‐state models, our approach captures degradation state shifts influenced by mission duration, enabling adaptive maintenance policies for systems operating in multistate conditions. The maintenance optimization problem is formulated as a Markov decision process (MDP) via backward dynamic programming to minimize expected maintenance costs. Numerical simulations and sensitivity analyses validate the model's efficacy and adaptability in optimizing maintenance for unmanned aerial vehicles (UAVs). The findings underscore the importance of minimizing maintenance and inspection time, and tailoring strategies to mission characteristics and system costs.

Naval Research Logistics (NRL)
Tianjin University (CN), Chinese University of Hong Kong (HK), University of Otago (NZ), University of Hong Kong (HK)
Openalex Percentile: Top 34%
Reliability and Maintenance Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.