paper-with-me

Papers

Multi-Agent Pointer Transformer: Seq-to-Seq Reinforcement Learning for Multi-Vehicle Dynamic Pickup-Delivery Problems

2025-11-21 · Zengyu Zou, Jingyuan Wang, Yixuan Huang, Junjie Wu arxiv

This paper addresses the cooperative Multi-Vehicle Dynamic Pickup and Delivery Problem with Stochastic Requests (MVDPDPSR) and proposes an end-to-end centralized decision-making framework based on sequence-to-sequence, named Multi-Agent Pointer Transformer (MAPT). MVDPDPSR is an extension of the vehicle routing problem and a spatio-temporal system optimization problem, widely applied in scenarios such as on-demand delivery. Classical operations research methods face bottlenecks in computational complexity and time efficiency when handling large-scale dynamic problems. Although existing reinforcement learning methods have achieved some progress, they still encounter several challenges: 1) Independent decoding across multiple vehicles fails to model joint action distributions; 2) The feature extraction network struggles to capture inter-entity relationships; 3) The joint action space is exponentially large. To address these issues, we designed the MAPT framework, which employs a Transformer Encoder to extract entity representations, combines a Transformer Decoder with a Pointer Network to generate joint action sequences in an AutoRegressive manner, and introduces a Relation-Aware Attention module to capture inter-entity relationships. Additionally, we guide the model's decision-making using informative priors to facilitate effective exploration. Experiments on 8 datasets demonstrate that MAPT significantly outperforms existing baseline methods in terms of performance and exhibits substantial computational time advantages compared to classical operations research methods.

📄 PDF Abstract BibTeX arXiv:2511.17435

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem

2023-04-19 · Yan Jin, Yuandong Ding, Xuanhao Pan, Kun He 외

Traveling Salesman Problem (TSP), as a classic routing optimization problem originally arising in the domain of transportation and logistics, has become a critical task in broader domains, such as manufacturing and biolo…

DecoderDeep Reinforcement LearningTraveling Salesman Problem

PLATO: Pointer Learner for Agent and Task Openness

2026-07-27 · Alireza Saleh Abadi, Leen-Kiat Soh, Daniel Alan Redder, Adam Eck 외 arxiv

Open agent systems (OASYS) are increasingly prevalent in real-world domains where the sets of agents and tasks change unpredictably over time. Such openness, including agent openness (AO) and task openness (TO), poses a …

Multi-agent Reinforcement LearningZero-shot GeneralizationGraph Neural Network

Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization

2024-09-05 · Federico Berto, Chuanbo Hua, Laurin Luttmann, Jiwoo Son 외

Combinatorial optimization problems involving multiple agents are notoriously challenging due to their NP-hard nature and the necessity for effective agent coordination. Despite advancements in learning-based methods, ex…

Combinatorial OptimizationComputational EfficiencyDecision MakingScheduling

Multimodal Transformer with Pointer Network for the DSTC8 AVSD Challenge

2020-02-25 · Hung Le, Nancy F. Chen

Audio-Visual Scene-Aware Dialog (AVSD) is an extension from Video Question Answering (QA) whereby the dialogue agent is required to generate natural language responses to address user queries and carry on conversations. …

Question AnsweringVideo Question Answering

Deep Learning Models for Automatic Summarization

2020-05-25 · Pirmin Lemberger

Text summarization is an NLP task which aims to convert a textual document into a shorter one while keeping as much meaning as possible. This pedagogical article reviews a number of recent Deep Learning architectures tha…

Deep Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1