Dynamic Multi-Robot Task Allocation in Multi-Floor Hospitals: An Urgency-Aware Auction Framework

Multi-robot hospital delivery involves coordinating the transport of medical supplies across different floors while accommodating dynamically arriving requests and urgent delivery demands. Inter-floor elevator transfers and the need to serve multiple destinations make task allocation dependent not only on robot assignments but also on the composition and execution order of delivery queues. To address these challenges, this paper proposes a Greedy Coalition Auction Algorithm (GCAA) for dynamic task allocation in multi-floor hospitals. The algorithm constructs capacity-limited task queues through marginal-utility-based bidding, accounting for the travel costs associated with serving multiple destinations in a single delivery trip. The scheduling framework combines batch queue construction with online task adjustment. Newly arriving ordinary tasks are considered in subsequent allocation opportunities, while urgent requests trigger a preemption-and-rollback procedure that releases affected unfinished assignments for later scheduling. Experiments conducted in a multi-floor hospital simulation environment evaluate GCAA against adapted task-allocation methods and examine its performance under different workloads and hospital layouts. The results indicate that batch queue construction improves overall delivery timeliness, while urgent-task preemption supports timely responses to emergency requests at the expense of some ordinary-task performance. GCAA achieves favorable results relative to the adapted CBBA and DSTA methods on several measures, although the adapted ADA method achieves better overall service and travel performance. These findings illustrate the trade-offs between routine delivery efficiency and urgent-task response in dynamic multi-robot hospital scheduling.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-19
DOI
https://doi.org/10.21203/rs.3.rs-11532793/v1
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Dynamic Multi-Robot Task Allocation in Multi-Floor Hospitals: An Urgency-Aware Auction Framework

Suli Zou, He Zhao, Yongfei Ma, Zhishen Zhou et al.
2 links
Research Square
Advanced Manufacturing and Logistics Optimization
preprint

Dynamic Multi-Robot Task Allocation in Multi-Floor Hospitals: An Urgency-Aware Auction Framework

Suli Zou, He Zhao, Yongfei Ma, Zhishen Zhou, Xutao Chen, Yupeng Zou, Xuejin Zhu, Yujie Li, Qifan He
preprint en

Abstract

Multi-robot hospital delivery involves coordinating the transport of medical supplies across different floors while accommodating dynamically arriving requests and urgent delivery demands. Inter-floor elevator transfers and the need to serve multiple destinations make task allocation dependent not only on robot assignments but also on the composition and execution order of delivery queues. To address these challenges, this paper proposes a Greedy Coalition Auction Algorithm (GCAA) for dynamic task allocation in multi-floor hospitals. The algorithm constructs capacity-limited task queues through marginal-utility-based bidding, accounting for the travel costs associated with serving multiple destinations in a single delivery trip. The scheduling framework combines batch queue construction with online task adjustment. Newly arriving ordinary tasks are considered in subsequent allocation opportunities, while urgent requests trigger a preemption-and-rollback procedure that releases affected unfinished assignments for later scheduling. Experiments conducted in a multi-floor hospital simulation environment evaluate GCAA against adapted task-allocation methods and examine its performance under different workloads and hospital layouts. The results indicate that batch queue construction improves overall delivery timeliness, while urgent-task preemption supports timely responses to emergency requests at the expense of some ordinary-task performance. GCAA achieves favorable results relative to the adapted CBBA and DSTA methods on several measures, although the adapted ADA method achieves better overall service and travel performance. These findings illustrate the trade-offs between routine delivery efficiency and urgent-task response in dynamic multi-robot hospital scheduling.

Research Square
Beijing Institute of Technology (CN), China University of Petroleum, East China (CN)
Advanced Manufacturing and Logistics 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.

Laika access coming soon