18 citations · 32 across the 18 of their papers we have counts for
3 papers · 1 filter
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…
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…
S: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding
Kenny Chour, Sivakumar Rathinam, Ramamoorthi Ravi
We combine ideas from uni-directional and bi-directional heuristic search, and approximation algorithms for the Traveling Salesman Problem, to develop a novel framework for a Multi…