no code implementations • 23 May 2022 • Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev
In this paper, we show that, contrary to prevailing CBS beliefs, a weighted cost-to-go heuristic can be used effectively alongside the conflict heuristic in two possible variants.
1 code implementation • 11 Oct 2021 • Dhruv Mauria Saxena, Tushar Kusnur, Maxim Likhachev
A fine discretisation allows for better approximations of the continuous search space, but makes the search for a solution more computationally costly.
no code implementations • 25 Aug 2019 • Tushar Kusnur, Shohin Mukherjee, Dhruv Mauria Saxena, Tomoya Fukami, Takayuki Koyama, Oren Salzman, Maxim Likhachev
We evaluate our framework in simulation as well as the real world.