3 citations · 7 across the 5 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2022★ 2 cited
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…
cs.AI2021★ 3 cited
Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding
Lakshay Virmani, Zhongqiang Ren, Sivakumar Rathinam +1
Multi-Agent Path Finding (MAPF) finds conflict-free paths for multiple agents from their respective start to goal locations. MAPF is challenging as the joint configuration space gr…