Fatigue and Task Load Dependent Decision Referrals for Joint Binary Classification in Human-Automation Teams

We consider a human-automation team jointly solving binary classification tasks over multiple time stages. At each stage, the automation observes the data for a batch of classification tasks, classifies a subset of them and refers the others to the human. The human’s performance depends on task load and fatigue, where fatigue is modeled as a controlled Markov process dependent on the past task loads. We formulate the automation’s problem of deciding which tasks to refer as a Markov decision process and present a sampling-based approximate dynamic program that leverages task independence across time and the structure of the recently obtained single-stage optimal allocation policy. We then present a numerical study comparing our solution against a baseline policy that does not explicitly account for fatigue dynamics.

Authors

Institutions

Publication Details

Journal
IEEE Control Systems Letters
Published
2025-01-01
DOI
https://doi.org/10.1109/lcsys.2025.3581647
Primary Topic
Human-Automation Interaction and Safety
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fatigue and Task Load Dependent Decision Referrals for Joint Binary Classification in Human-Automation Teams

Aditya Mahajan, Jérôme Le Ny, Raihan Seraj
IEEE Control Systems Letters
Human-Automation Interaction and Safety
article

Fatigue and Task Load Dependent Decision Referrals for Joint Binary Classification in Human-Automation Teams

Aditya Mahajan, Jérôme Le Ny, Raihan Seraj
article en

Abstract

We consider a human-automation team jointly solving binary classification tasks over multiple time stages. At each stage, the automation observes the data for a batch of classification tasks, classifies a subset of them and refers the others to the human. The human’s performance depends on task load and fatigue, where fatigue is modeled as a controlled Markov process dependent on the past task loads. We formulate the automation’s problem of deciding which tasks to refer as a Markov decision process and present a sampling-based approximate dynamic program that leverages task independence across time and the structure of the recently obtained single-stage optimal allocation policy. We then present a numerical study comparing our solution against a baseline policy that does not explicitly account for fatigue dynamics.

IEEE Control Systems LettersVol. 9
Group for Research in Decision Analysis (CA), Polytechnique Montréal (CA), McGill University (CA)
Ministère de la Défense Nationale
Peace, Justice and strong institutions
Openalex Percentile: Top 84%
Human-Automation Interaction and Safety
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.