More Like this

1. Real and symmetric matrices

   https://doi.org/10.1215/00127094-2022-0076  

   Chen, Tsao-Hsien; Nadler, David (June 2023, Duke Mathematical Journal)
2. REAL AND SYMMETRIC MATRICES

   Chen, Tsao-Hsien; Nadler, David (May 2023, DUKE MATHEMATICAL JOURNAL)
3. Hurewicz images of real bordism theory and real Johnson–Wilson theories

   https://doi.org/10.1016/j.aim.2018.11.002  

   Li, Guchuan; Shi, XiaoLin Danny; Wang, Guozhen; Xu, Zhouli (January 2019, Advances in Mathematics)
4. Real and symmetric quasi-maps

   Chen, Tsao-Hsien; Nadler, David (October 2024, AMERICAN MATH SOCIETY)
5. Real-Time LaCAM for Real-Time MAPF

   https://doi.org/10.1609/socs.v18i1.35993  

   Liang, Runzhe; Veerapaneni, Rishi; Harabor, Daniel; Li, Jiaoyang; Likhachev, Maxim (July 2025, Proceedings of the International Symposium on Combinatorial Search)

   The vast majority of Multi-Agent Path Finding (MAPF) methods with completeness guarantees require planning full-horizon paths. However, planning full-horizon paths can take too long and be impractical in real-world applications. Instead, real-time planning and execution, which only allows the planner a finite amount of time before executing and replanning, is more practical for real-world multi-agent systems. Several methods utilize real-time planning schemes but none are provably complete, which leads to livelock or deadlock. Our main contribution is Real-Time LaCAM, the first Real-Time MAPF method with provable completeness guarantees. We do this by leveraging LaCAM in an incremental fashion. Our results show how we can iteratively plan for congested environments with a cutoff time of milliseconds while still maintaining the same success rate as full-horizon LaCAM. We also show how it can be used with a single-step learned MAPF policy. 

   more » « less