2 citations · 3 across the 3 of their papers we have counts for
4 papers
Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation
Junfeng Wu, Jiaqi Chen, Hongkun Lyu +2
Multi-Agent Path Finding (MAPF) is a problem that requires computing collision-free paths for a set of agents from their start locations to designated goal locations. The problem h…
Parallel Point-to-Point Shortest Paths and Batch Queries
Xiaojun Dong, Andy Li, Yan Gu +1
We propose Orionet, efficient parallel implementations of Point-to-Point Shortest Paths (PPSP) queries using bidirectional search (BiDS) and other heuristics, with an additional fo…
CBS with Continuous-Time Revisit
Andy Li, Zhe Chen, Danial Harabor +1
Multi-Agent Path Finding in Continuous Time (\mapfr) extends the classical MAPF problem by allowing agents to operate in continuous time. Conflict-Based Search with Continuous Time…
Mini-Giants: "Small" Language Models and Open Source Win-Win
Zhengping Zhou, Lezhi Li, Xinxi Chen +1
ChatGPT is phenomenal. However, it is prohibitively expensive to train and refine such giant models. Fortunately, small language models are flourishing and becoming more and more c…