Skip to content
Open access

Real-time adaptive incentive control via Stackelberg game for human–machine collaborative engineering systems

Aug 2026 · Engineering Research Express · Vol 8, pp. 165208 · 0 citations · 35 references
Physics

Abstract

This paper presents a real-time adaptive incentive-control framework for hybrid human–machine collaborative engineering systems, addressing human bounded rationality, cross-task policy transfer, and millisecond-level response under equilibrium constraints. An asymmetric two-level Stackelberg model combines prospect-theory value functions with quantal response to represent heterogeneous human and machine decision processes. An online meta-reinforcement learning algorithm enables rapid adaptation across tasks, while a fast-timescale event-triggered regulator provides practical convergence to a noise-dependent equilibrium neighborhood and excludes Zeno behavior. Simulation and hardware experiments with 24 human participants and four robotic agents cover assembly-line, warehouse-logistics, and emergency-rescue scenarios. The proposed method achieves task completion rates of 89.6%–92.7%, human compliance rates of 83.2%–87.4%, convergence in 450 episodes rather than 800 for MAML-RL, and zero-shot cross-scenario completion rates of 64.7%–68.9%. Event triggering reduces communication frequency from 200 to 54.3 Hz, with a 95th-percentile edge-inference latency of 27.1 ms. Ablation results support the separate contributions of prospect-based valuation, quantal response, and influence-factor correction. The evidence establishes prospective personalization for calibrated operators; transfer to previously unseen operators remains to be validated.

Read PDF

Similar papers

Sep 2026

A credit-based arbitration mechanism with finite-time fairness guarantees for autonomous multi-agent systems

A lightweight arbitration mechanism that guarantees bounded unfairness for autonomous agents in warehouse logistics and urban unmanned systems is proposed, providing a deterministic finite-time worst-case fairness guarantee that holds for every agent at every moment.

Hanan Solangi · 0 citations
Preprint Sep 2026

Multi-Agent Event-Triggered LQG Control under Shared Communication Constraints

Numerical results show that the proposed model predictive control (MPC) scheduler achieves the best trade-off between control performance and communication cost, while the auction-based scheduler attains performance close to MPC with substantially lower computational complexity.

Z. Hashemi, Dipankar Maity · 0 citations
Preprint Aug 2026

A Control-Theoretic Approach for Resource-Aware Consensus in Multi-Agent AI

A novel way is presented to characterize collective belief dynamics as a discrete-time switched system in which communication topologies have distinct consensus-contraction rates and token costs, and defines a consensus safe set that jointly captures agreement and resource feasibility.

James A. Flagg, E. Hernández-Vargas · 0 citations
Preprint Oct 2026

Approximate Feedback Nash Equilibria in Constrained Differential Games via Model Predictive Control with Upper Bound Guarantees

Physical human--machine interaction and other multi-agent control settings require decision-making policies that adapt online. Differential games provide a principled framework where each agent optimizes an individual objective while anticipating the other's response. The relevant solution concept in many applications...

Balint Varga, Karl Handwerker, Imre J. Rudas et al. · 0 citations
Open access Oct 2026

Distributed Multi-Robot Dynamic Task Allocation Based on the Improved Artificial Bee Colony Algorithm

The dynamic Multi-Robot Task Allocation (MRTA) problem presents a critical bottleneck in distributed control due to high communication overhead, single-point failure risks, and dynamic constraints. This paper proposes a fully decentralized Improved Artificial Bee Colony (I-ABC) algorithm integrated with Finite State Ma...

Qing-Ying Zhao, Bi-Cun Yang, Liang Han · 0 citations
#machine learning Preprint Oct 2026

Learning Rational Strategies for Temporal Objectives in Multi-Agent Systems

We study rational synthesis for stochastic multi-agent systems with unknown dynamics, where each agent is equipped with its own probabilistic temporal objective specified using Probabilistic Linear Temporal Logic on Finite Traces ($\mathsf{PLTL}_f}$). We impose solution concepts (e.g., Nash equilibrium, subgame-perfect...

Omar Adalat, Edwin Hamel-De le Court, Francesco Belardinelli · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.