← Search

Saptarshi Bandyopadhyay

4 accepted papers

2021

Fast Near-Optimal Heterogeneous Task Allocation via Flow Decomposition

ICRA 2021poster

Multi-robot systems are uniquely well-suited to performing complex tasks such as patrolling and tracking, information gathering, and pick-up and delivery problems, offering significantly higher performance than single-robot systems. A fundamental building block in most multi-robot systems is task al…

Cited by 3SourcecodeScholar
2017

Fast, On-line Collision Avoidance for Dynamic Vehicles Using Buffered Voronoi Cells

RA-L 2017

This letter presents a distributed collision avoidance algorithm for multiple dynamic vehicles moving in arbitrary dimensions. In our algorithm, each robot continually computes its buffered Voronoi cell (BVC) and plans its path within the BVC in a receding horizon fashion. We prove that our algorith

Cited by 278SourceScholar
2016

A probabilistic eulerian approach for motion planning of a large-scale swarm of robots

IROS 2016poster

We present a novel method for guiding a large-scale swarm of autonomous agents into a desired formation shape in a distributed and scalable manner. Our Probabilistic Swarm Guidance using Inhomogeneous Markov Chains (PSG-IMC) algorithm adopts an Eulerian framework, where the physical space is partiti…

Cited by 16SourceScholar