Salvato in:
Dettagli Bibliografici
Autori principali: Eddy, Duncan, Yel, Esen, Passmore, Emma, Egan, Niles, Armour, Grayson, Asmar, Dylan M., Kochenderfer, Mykel J.
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:https://arxiv.org/abs/2603.12340
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915866607616000
author Eddy, Duncan
Yel, Esen
Passmore, Emma
Egan, Niles
Armour, Grayson
Asmar, Dylan M.
Kochenderfer, Mykel J.
author_facet Eddy, Duncan
Yel, Esen
Passmore, Emma
Egan, Niles
Armour, Grayson
Asmar, Dylan M.
Kochenderfer, Mykel J.
contents Managing announced task completion times is a fundamental control problem in project management. While extensive research exists on estimating task durations and task scheduling, the problem of when and how to update completion times communicated to stakeholders remains understudied. Organizations must balance announcement accuracy against the costs of frequent timeline updates, which can erode stakeholder trust and trigger costly replanning. Despite the prevalence of this problem, current approaches rely on static predictions or ad-hoc policies that fail to account for the sequential nature of announcement management. In this paper, we formulate the task announcement problem as a Partially Observable Markov Decision Process (POMDP) where the control policy must decide when to update announced completion times based on noisy observations of true task completion. Since most state variables (current time and previous announcements) are fully observable, we leverage the Mixed Observability MDP (MOMDP) framework to enable more efficient policy optimization. Our reward structure captures the dual costs of announcement errors and update frequency, enabling synthesis of optimal announcement control policies. Using off-the-shelf solvers, we generate policies that act as feedback controllers, adaptively managing announcements based on belief state evolution. Simulation results demonstrate significant improvements in both accuracy and announcement stability compared to baseline strategies, achieving up to 75\% reduction in unnecessary updates while maintaining or improving prediction accuracy.
format Preprint
id arxiv_https___arxiv_org_abs_2603_12340
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Optimizing Task Completion Time Updates Using POMDPs
Eddy, Duncan
Yel, Esen
Passmore, Emma
Egan, Niles
Armour, Grayson
Asmar, Dylan M.
Kochenderfer, Mykel J.
Systems and Control
Artificial Intelligence
Managing announced task completion times is a fundamental control problem in project management. While extensive research exists on estimating task durations and task scheduling, the problem of when and how to update completion times communicated to stakeholders remains understudied. Organizations must balance announcement accuracy against the costs of frequent timeline updates, which can erode stakeholder trust and trigger costly replanning. Despite the prevalence of this problem, current approaches rely on static predictions or ad-hoc policies that fail to account for the sequential nature of announcement management. In this paper, we formulate the task announcement problem as a Partially Observable Markov Decision Process (POMDP) where the control policy must decide when to update announced completion times based on noisy observations of true task completion. Since most state variables (current time and previous announcements) are fully observable, we leverage the Mixed Observability MDP (MOMDP) framework to enable more efficient policy optimization. Our reward structure captures the dual costs of announcement errors and update frequency, enabling synthesis of optimal announcement control policies. Using off-the-shelf solvers, we generate policies that act as feedback controllers, adaptively managing announcements based on belief state evolution. Simulation results demonstrate significant improvements in both accuracy and announcement stability compared to baseline strategies, achieving up to 75\% reduction in unnecessary updates while maintaining or improving prediction accuracy.
title Optimizing Task Completion Time Updates Using POMDPs
topic Systems and Control
Artificial Intelligence
url https://arxiv.org/abs/2603.12340