EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Optimal Control of Network Routing Under Blameless Constraints: A Convex Approach

Trazon Jimerson, Claus Danielson, Daniel Calderone, Meeko Oishi

IEEE Open Journal of Control Systems · 2026 · 5 · 179-190

DOI: 10.1109/ojcsys.2026.3675413 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Open Journal of Control Systems, 2026. Verfasst von Trazon Jimerson und 3 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation, NSF.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In disaster scenarios, rescue plans must optimally allocate limited resources to maximize the number of feasible rescues. Full evacuation is often infeasible due to constraints such as limited fuel, time, or transportation capacity, making it crucial that allocations respect pre-established ethical priorities. These priorities are enforced through lexicographically ordered terminal sets. In this paper, we introduce the notion of blamelessness to network routing, which ensures routing plans yield terminal solutions in the highest feasible priority set. We model disaster response as a network routing problem, minimizing fuel usage while satisfying given ethical and physical constraints. First, we derive conditions on the cost function of a linear program (lp) to produce blameless but sub-optimal plans. Next, we formulate a two-stage lp that minimizes network routing cost subject to terminal priority set constraints. Finally, we show that a convex combination of blameless and optimal routing objectives always exists, allowing use of a single convex lp to produce plans that are resource-optimal subject to being blameless. Disaster rescue simulations are used to empirically study the sensitivity of blamelessness and network optimality to the convex-combination parameter. Routes must respect triage-based ethical priorities while minimizing network cost under a finite time horizon, limited route availability, and transportation capacity constraints.

Förderung

  • National Science Foundation
  • NSF

Zitieren

APA

Jimerson, T., Danielson, C., Calderone, D., & Oishi, M. (2026). Optimal Control of Network Routing Under Blameless Constraints: A Convex Approach. IEEE Open Journal of Control Systems, 5, 179-190. https://doi.org/10.1109/ojcsys.2026.3675413

Vancouver

Jimerson T, Danielson C, Calderone D, Oishi M. Optimal Control of Network Routing Under Blameless Constraints: A Convex Approach. IEEE Open Journal of Control Systems. 2026;5:179-190. doi:10.1109/ojcsys.2026.3675413

BibTeX
@article{Jimerson2026,
  author = {Jimerson, Trazon and Danielson, Claus and Calderone, Daniel and Oishi, Meeko},
  title = {Optimal Control of Network Routing Under Blameless Constraints: A Convex Approach},
  journal = {IEEE Open Journal of Control Systems},
  year = {2026},
  volume = {5},
  pages = {179--190},
  doi = {10.1109/ojcsys.2026.3675413}
}
Kostenlos starten →