200 citations · 228 across the 18 of their papers we have counts for
9 papers · 1 filter
A Lightweight Traffic Map for Efficient Anytime LaCAM*
Bojie Shen, Yue Zhang, Zhe Chen +1
Multi-Agent Path Finding (MAPF) aims to compute collision-free paths for multiple agents and has a wide range of practical applications. LaCAM*, an anytime configuration-based solv…
Online Submission and Evaluation System Design for Competition Operations
Zhe Chen, Daniel Harabor, Ryan Hechnenberger +1
Research communities have developed benchmark datasets across domains to compare the performance of algorithms and techniques However, tracking the progress in these research areas…
Dynamic Replanning for Improved Public Transport Routing
Abdallah Abuaisha, Bojie Shen, Daniel Harabor +2
Delays in public transport are common, often impacting users through prolonged travel times and missed transfers. Existing solutions for handling delays remain limited; backup plan…
Anytime Single-Step MAPF Planning with Anytime PIBT
Nayesha Gandotra, Rishi Veerapaneni, Muhammad Suhail Saleem +3
PIBT is a popular Multi-Agent Path Finding (MAPF) method at the core of many state-of-the-art MAPF methods including LaCAM, CS-PIBT, and WPPL. The main utility of PIBT is that it i…
Parallelizing Multi-objective A* Search
Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith +2
The Multi-objective Shortest Path (MOSP) problem is a classic network optimization problem that aims to find all Pareto-optimal paths between two points in a graph with multiple ed…
Efficient Energy-Optimal Path Planning for Electric Vehicles Considering Vehicle Dynamics
Saman Ahmadi, Guido Tack, Daniel Harabor +2
The rapid adoption of electric vehicles (EVs) in modern transport systems has made energy-aware routing a critical task in their successful integration, especially within large-sca…
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding
Zhe Chen, Daniel Harabor, Jiaoyang Li +1
Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics that asks us to compute collision-free paths for a team of agents, all moving across a shared map. Although man…
Tracking Progress in Multi-Agent Path Finding
Bojie Shen, Zhe Chen, Muhammad Aamir Cheema +2
Multi-Agent Path Finding (MAPF) is an important core problem for many new and emerging industrial applications. Many works appear on this topic each year, and a large number of sub…
Enhanced Methods for the Weight Constrained Shortest Path Problem
Saman Ahmadi, Guido Tack, Daniel Harabor +2
The classic problem of constrained pathfinding is a well-studied, yet challenging, topic in AI with a broad range of applications in various areas such as communication and transpo…