62 citations · 274 across the 22 of their papers we have counts for
7 papers · 1 filter
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…
Multi-objective Conflict-based Search Using Safe-interval Path Planning
Zhongqiang Ren, Sivakumar Rathinam, Maxim Likhachev +1
This paper addresses a generalization of the well known multi-agent path finding (MAPF) problem that optimizes multiple conflicting objectives simultaneously such as travel time an…
Multi-Objective Path-Based D* Lite
Zhongqiang Ren, Sivakumar Rathinam, Maxim Likhachev +1
Incremental graph search algorithms such as D* Lite reuse previous, and perhaps partial, searches to expedite subsequent path planning tasks. In this article, we are interested in…
MS*: A New Exact Algorithm for Multi-agent Simultaneous Multi-goal Sequencing and Path Finding
Zhongqiang Ren, Sivakumar Rathinam, Howie Choset
In multi-agent applications such as surveillance and logistics, fleets of mobile agents are often expected to coordinate and safely visit a large number of goal locations as effici…
Loosely Synchronized Search for Multi-agent Path Finding with Asynchronous Actions
Zhongqiang Ren, Sivakumar Rathinam, Howie Choset
Multi-agent path finding (MAPF) determines an ensemble of collision-free paths for multiple agents between their respective start and goal locations. Among the available MAPF plann…
Subdimensional Expansion for Multi-objective Multi-agent Path Finding
Zhongqiang Ren, Sivakumar Rathinam, Howie Choset
Conventional multi-agent path planners typically determine a path that optimizes a single objective, such as path length. Many applications, however, may require multiple objective…
A Conflict-Based Search Framework for Multi-Objective Multi-Agent Path Finding
Zhongqiang Ren, Sivakumar Rathinam, Howie Choset
Conventional multi-agent path planners typically compute an ensemble of paths while optimizing a single objective, such as path length. However, many applications may require multi…