Maze Solving Using Deep Q-Network. - Anushtup Nandy; Subash Seshathri; Abhishek Sarkar (AIR, 2023)

Heuristic Search for Path Finding with Refuelling. - Anushtup Nandy; Zhongqiang Ren; Sivakumar Rathinam; Howie Choset (CoRR, 2023)

DMS*: Minimizing Makespan for Multi-Agent Combinatorial Path Finding. - Zhongqiang Ren; Anushtup Nandy; Sivakumar Rathinam; Howie Choset (CoRR, 2023)

DMS*: Towards Minimizing Makespan for Multi-Agent Combinatorial Path Finding. - Zhongqiang Ren; Anushtup Nandy; Sivakumar Rathinam; Howie Choset (IEEE Robotics Autom. Lett., 2024)

Heuristic Search for Path Finding With Refuelling. - Shizhe Zhao; Anushtup Nandy; Howie Choset; Sivakumar Rathinam; Zhongqiang Ren (IEEE Robotics Autom. Lett., 2025)