Search Results for author:
Found 3 papers, 0 papers with code
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search
In this work, we propose an oracle for conflict selection that results in smaller search tree sizes than the one used in previous work.
Learning to Select Nodes in Bounded Suboptimal Conflict-Based Search for Multi-Agent Path Finding
Multi-Agent Path Finding is an NP-hard problem that is difficult for current approaches to solve optimally.
Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests
Transportation service providers that dispatch drivers and vehicles to riders start to support both on-demand ride requests posted in real time and rides scheduled in advance, leading to new challenges which, to the best of our knowledge, have not been addressed by existing works.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
