mlsanityData to 7 Oct 2026

Learning Coordination Policies over Heterogeneous Graphs for Human-Robot Teams via Recurrent Neural Schedule Propagation

arXiv 2301.13279 ↗First posted 30 Jan 2023cs.AI cs.LG cs.MAcited by 5

Not on the map. Why?

Abstract (arXiv)

As human-robot collaboration increases in the workforce, it becomes essential for human-robot teams to coordinate efficiently and intuitively. Traditional approaches for human-robot scheduling either utilize exact methods that are intractable for large-scale problems and struggle to account for stochastic, time varying human task performance, or application-specific heuristics that require expert domain knowledge to develop. We propose a deep learning-based framework, called HybridNet, combining a heterogeneous graph-based encoder with a recurrent schedule propagator for scheduling stochastic human-robot teams under upper- and lower-bound temporal constraints. The HybridNet's encoder leverages Heterogeneous Graph Attention Networks to model the initial environment and team dynamics while accounting for the constraints. By formulating task scheduling as a sequential decision-making process, the HybridNet's recurrent neural schedule propagator leverages Long Short-Term Memory (LSTM) models to propagate forward consequences of actions to carry out fast schedule generation, removing the need to interact with the environment between every task-agent pair selection. The resulting scheduling policy network provides a computationally lightweight yet highly expressive model that is end-to-end trainable via Reinforcement Learning algorithms. We develop a virtual task scheduling environment for mixed human-robot teams in a multi-round setting, capable of modeling the stochastic learning behaviors of human workers. Experimental results showed that HybridNet outperformed other human-robot scheduling solutions across problem sizes for both deterministic and stochastic human performance, with faster runtime compared to pure-GNN-based schedulers.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 11 of its 37 references that are in the map. First posted on arXiv 30 Jan 2023.

Builds on

11 of 37 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2018How Powerful are Graph Neural Networks?cited by 4,355
  4. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
  5. 2018Attention, Learn to Solve Routing Problems!cited by 646
  6. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  7. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  8. 2018Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) Networkcited by 415
  9. 2016LSTM-based Encoder-Decoder for Multi-sensor Anomaly Detectioncited by 213
  10. 2018Online Planner Selection with Graph Neural Networks and Adaptive Schedulingcited by 13
  11. 2020Human-Robot Team Coordination with Dynamic and Latent Human Task Proficiencies: Scheduling with Learning Curvescited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 4; 2026: 1.

5 papers.