Research map / Multi-agent systems and games / Human-AI and goal-conditioned
Optimization of Multi-Agent Flying Sidekick Traveling Salesman Problem over Road Networks
Ruixiao Yang, Chuchu Fan
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use Set TSP instead of standard TSP in phase 2 (ablation) | MST partition · Complete Manhattan |C|=150 | delivery cost: 30.94 -> 28.05 | Improved |
| use Set TSP instead of TSP (ablation) | NN partition · Complete Manhattan |C|=150 | delivery cost: 33.78 -> 30.85 | Improved |
| use Set TSP instead of TSP (ablation) | NN partition · Complete Manhattan |C|=150 | runtime (s): 99.01 -> 115.01 | Hurt |
| use set-based distance in phase 1 with standard TSP (ablation) | MST partition · Complete Manhattan |C|=150 | delivery cost: 30.94 -> 30.87 | No clear effect |
| use set-based distance in phase 1 with Set TSP (ablation) | MST partition · Complete Manhattan |C|=150 | delivery cost: 28.05 -> 27.89 | Improved |
| use MST instead of NN partition (ablation) | phase 1 · Complete Manhattan |C|=150 | delivery cost: 33.78 -> 30.94 | Improved |
| three-phase method vs best baseline | Ours · Complete Manhattan |C|=150 | delivery cost: 57.08 -> 27.89 | Improved |
| three-phase method vs best baseline | Ours · Boston |C|=150 | delivery cost: 162.12 -> 99.64 | Improved |
| increase drone range r from 0.5 to 1.5 km (ablation) | Ours · Complete Manhattan |C|=100 | delivery cost and runtime | Mixed |
Closest papers by meaning
- Hybrid-Balance GFlowNet for Solving Vehicle Routing Problems (NeurIPS 2025 · similarity 0.83)
- Inapproximability of Optimal Multi-Agent Pathfinding Problems (AAAI 2025 · similarity 0.82)
- DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem (AAAI 2025 · similarity 0.82)
- Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI 2024 · similarity 0.82)
- Equity-Transformer: Solving NP-Hard Min-Max Routing Problems as Sequential Generation with Equity Context (AAAI 2024 · similarity 0.82)
- Large-Scale Multi-Robot Coverage Path Planning via Local Search (AAAI 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
