Quantum-Assisted Optimization for Ergonomics-Aware Human–Robot Task Allocation in Human-Centric Manufacturing - A QUBO Formulation, Quantum-Annealing and QAOA Benchmark Against Classical Baselines

Abstract Industry 5.0 shifts the focus of manufacturing automation toward human well-being, not just efficiency or output. This means task-allocation systems now have to juggle production targets, ergonomic safety, and what the workforce can realistically handle. Here, we introduce what we call the Ergonomics-Aware Human–Robot Task Allocation (EA-HRTA) problem. Picture it as a complex assignment challenge: for every task, we have to consider execution cost, whether the person or robot has the right skills, the workload each can take on, and the total ergonomic strain humans can safely handle. We turn this challenge into a Quadratic Unconstrained Binary Optimization (QUBO) model, so it runs on both quantum-annealing machines and gate-model quantum computers. We lay out three key contributions: first, we develop a penalty-based QUBO model and show exactly how to set penalty weights so it actually works. Second, we roll out a complete system where the very same QUBO gets sent both to a D-Wave-style simulated-annealing sampler and to our own lightweight, dependency-free QAOA statevector simulator. Finally, we’ve built and open-sourced a benchmarking suite that lets you see how quantum solutions perform next to a quick, greedy heuristic and a full-scale CBC integer programming baseline.. Across 60 runs spanning problem sizes from 9 to 240 binary variables, quantum annealing maintains a 100% constraint-feasibility rate at every scale tested, matching classical baselines closely on small instances (within 2% of the exact optimum at N = 9) but exhibiting a solution-quality gap that widens to roughly 140% at N = 240 under fixed penalty weights and a fixed annealing schedule. QAOA achieves competitive cost values only at the smallest instance tested (N = 9) and loses feasibility entirely by N = 16, consistent with known near-term gate-model scalability limits. We report a warm-start ablation seeding the annealer with the greedy solution, which does not yield a consistent improvement, and use this negative result to motivate an adaptive-penalty and problem-decomposition research direction. Rather than claiming a present-day quantum advantage, this paper contributes a reusable ergonomics-aware QUBO formulation, a transparent and reproducible benchmark methodology for the human-centric manufacturing community, and an honest empirical map of where current quantum optimization methods stand relative to classical practice at realistic shop-floor problem sizes.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-13
DOI
https://doi.org/10.21203/rs.3.rs-11057389/v1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantum-Assisted Optimization for Ergonomics-Aware Human–Robot Task Allocation in Human-Centric Manufacturing - A QUBO Formulation, Quantum-Annealing and QAOA Benchmark Against Classical Baselines

Peter Nimbe, Bernard Kyiewu, Kingsford Donkor, Joshua Akowuje Weyori¹
5 links
Research Square
Quantum Computing Algorithms and Architecture
preprint

Quantum-Assisted Optimization for Ergonomics-Aware Human–Robot Task Allocation in Human-Centric Manufacturing - A QUBO Formulation, Quantum-Annealing and QAOA Benchmark Against Classical Baselines

Peter Nimbe, Bernard Kyiewu, Kingsford Donkor, Joshua Akowuje Weyori¹
preprint en

Abstract

Abstract Industry 5.0 shifts the focus of manufacturing automation toward human well-being, not just efficiency or output. This means task-allocation systems now have to juggle production targets, ergonomic safety, and what the workforce can realistically handle. Here, we introduce what we call the Ergonomics-Aware Human–Robot Task Allocation (EA-HRTA) problem. Picture it as a complex assignment challenge: for every task, we have to consider execution cost, whether the person or robot has the right skills, the workload each can take on, and the total ergonomic strain humans can safely handle. We turn this challenge into a Quadratic Unconstrained Binary Optimization (QUBO) model, so it runs on both quantum-annealing machines and gate-model quantum computers. We lay out three key contributions: first, we develop a penalty-based QUBO model and show exactly how to set penalty weights so it actually works. Second, we roll out a complete system where the very same QUBO gets sent both to a D-Wave-style simulated-annealing sampler and to our own lightweight, dependency-free QAOA statevector simulator. Finally, we’ve built and open-sourced a benchmarking suite that lets you see how quantum solutions perform next to a quick, greedy heuristic and a full-scale CBC integer programming baseline.. Across 60 runs spanning problem sizes from 9 to 240 binary variables, quantum annealing maintains a 100% constraint-feasibility rate at every scale tested, matching classical baselines closely on small instances (within 2% of the exact optimum at N = 9) but exhibiting a solution-quality gap that widens to roughly 140% at N = 240 under fixed penalty weights and a fixed annealing schedule. QAOA achieves competitive cost values only at the smallest instance tested (N = 9) and loses feasibility entirely by N = 16, consistent with known near-term gate-model scalability limits. We report a warm-start ablation seeding the annealer with the greedy solution, which does not yield a consistent improvement, and use this negative result to motivate an adaptive-penalty and problem-decomposition research direction. Rather than claiming a present-day quantum advantage, this paper contributes a reusable ergonomics-aware QUBO formulation, a transparent and reproducible benchmark methodology for the human-centric manufacturing community, and an honest empirical map of where current quantum optimization methods stand relative to classical practice at realistic shop-floor problem sizes.

Research Square
University of Energy and Natural Resources (GH)
Quantum Computing Algorithms and Architecture
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