Anushtup Nandy

2 accepted papers

2025

Heuristic Search for Path Finding With Refuelling

Shizhe Zhao, Anushtup Nandy, Howie Choset, Sivakumar Rathinam, Zhongqiang Ren

RA-L 2025

This letter considers a generalization of the Path Finding (PF) problem with refuelling constraints referred to as the Gas Station Problem (GSP). Similar to PF, given a graph where vertices are gas stations with known fuel prices, and edge costs are the gas consumption between the two vertices, GSPs

Cited by 2 Source ↗Scholar ↗

2024

DMS*: Towards Minimizing Makespan for Multi-Agent Combinatorial Path Finding

Zhongqiang Ren, Anushtup Nandy, Sivakumar Rathinam, Howie Choset

RA-L 2024

Multi-Agent Combinatorial Path Finding (MCPF) seeks collision-free paths for multiple agents from their start to goal locations, while visiting a set of intermediate target locations in the middle of the paths. MCPF is challenging as it involves both planning collision-free paths for multiple agents

Cited by 7 Source ↗Scholar ↗