Drone Routing Problems Challenge

Drone routing problems (DRP) focus on optimizing routes for a fleet of drones to ensure efficient, timely, and cost-effective delivery of goods. The problem is formulated as a multi-agent path finding (MAPF) problem, aiming to compute collision-free, optimal paths that minimize the total travel time of all agents. While traditional MAPF research is typically conducted on 4-connected grid graphs, DRP extends this to a non-grid environment suited for drone delivery. This competition incorporates non-grid maps based on real-world environments and a gym-standard environment for benchmarking various pathfinding algorithms.

Authors

• Shiyao Ding Kyoto University
• Fumito Uwano Okayama University
• Hideki Aoyama Panasonic Holdings Corporation
• Donghui Lin Okayama University

Keywords

• Multi-Agent Path Finding
• Drone Delivery