86 citations · 251 across the 40 of their papers we have counts for
3 papers · 2 filters
Non-Blocking Batch A* (Technical Report)
Rishi Veerapaneni, Maxim Likhachev
Heuristic search has traditionally relied on hand-crafted or programmatically derived heuristics. Neural networks (NNs) are newer powerful tools which can be used to learn complex…
Effective Integration of Weighted Cost-to-go and Conflict Heuristic within Suboptimal CBS
Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev
Conflict-Based Search (CBS) is a popular multi-agent path finding (MAPF) solver that employs a low-level single agent planner and a high-level constraint tree to resolve conflicts.…
Enhanced Multi-Objective A* Using Balanced Binary Search Trees
Zhongqiang Ren, Richard Zhan, Sivakumar Rathinam +2
This work addresses a Multi-Objective Shortest Path Problem (MO-SPP) on a graph where the goal is to find a set of Pareto-optimal solutions from a start node to a destination in th…