教系统何时自动处理任务,平衡人力与机器人成本。
Learning When to Automate: Queue Control in Human-AI Service Systems

- 用置信区间+队列感知策略动态分配机器人资源。
- 理论证明可实现近似最优误差,且人工队列稳定不堆积。
- 适合需要人机协作的客服、支持系统场景。
我们研究一个混合人机服务系统:任务按顺序到达,经由自动化聊天机器人和必要时的人工客服两阶段处理。共存在 $T$ 个依次到达的任务,分为 $K$ 种异质类型。决策者需决定为聊天机器人分配多少资源,其成功概率因类型而异且初始未知。未能被机器人解决的任务进入对应类型的人工服务队列,由服务速率未知的人类客服处理。该模型体现了核心权衡:过度依赖自动化会增加机器人开销,但能缓解人工拥堵;反之则可能压垮人工。本文提出UCB-DPP策略,结合上置信界与漂移加惩罚控制,在学习系统未知参数的同时做出队列感知决策。理论证明,该策略实现后悔率 $ ilde{ m O}(K oot{T})$,并保证人工队列均值速率稳定。在合成实例上的模拟表明,该策略显著优于自然基线。
原文摘要 · Abstract (English)
We study a human-AI service system in which tasks arrive sequentially and are processed through a two-stage architecture: an automated chatbot followed, when necessary, by a human agent. We consider $T$ sequentially arriving tasks, each belonging to one of $K$ heterogeneous types. For each task the decision maker chooses how many resources to allocate to the chatbot, whose type-dependent success probabilities are initially unknown. Tasks not resolved by the chatbot enter type-dependent human-service queues, where they are processed by a human agent with unknown service rates. This model captures a central tradeoff in hybrid service systems: relying more on automation reduces human congestion but increases chatbot costs, while insufficient automation may overload the human agent. We propose the UCB-DPP policy, which combines Upper Confidence Bounds with Drift-Plus-Penalty control to learn the unknown parameters of the system while making queue-aware decisions. We prove that UCB-DPP achieves regret $\widetilde{\mathcal{O}}(K\sqrt{T})$ and guarantees mean-rate stability of the human-service queues. Simulations on synthetic instances show that the proposed policy outperforms natural baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。