21 citations · 26 across the 9 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2025
WinkTPG: An Execution Framework for Multi-Agent Path Finding Using Temporal Reasoning
Jingtian Yan, Stephen F. Smith, Jiaoyang Li
Planning collision-free paths for a large group of agents is a challenging problem in many real-world applications. While recent advances in Multi-Agent Path Finding (MAPF) have sh…
cs.AI2024★ 1 cited
Optimal Task Assignment and Path Planning using Conflict-Based Search with Precedence and Temporal Constraints
Yu Quan Chong, Jiaoyang Li, Katia Sycara
The Multi-Agent Path Finding (MAPF) problem entails finding collision-free paths for a set of agents, guiding them from their start to goal locations. However, MAPF does not accoun…
cs.AI2024★ 4 cited
Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution
Yifan Su, Rishi Veerapaneni, Jiaoyang Li
The Multi-Agent Path Finding (MAPF) problem involves planning collision-free paths for multiple agents in a shared environment. The majority of MAPF solvers rely on the assumption…