activity
20102026
most citedDiscrete Partitioning and Coverage Control for Gossiping Robots

100 citations · 161 across the 9 of their papers we have counts for

collaborators
Showing cs.ROShow all

6 papers · 1 filter

cs.RO2026

Model-Free Adaptive Parameter Tuning for Efficient Multi-Robot Warehouse Operations

Pratap Tokekar, Mouhacine Benosman, Rahul Chandan +3

Robotic Fulfillment Centers (FCs) store inventory on shelves (pods) arranged in dense blocks. Retrieving a target pod that is buried deep in a block requires moving obstructing pod…

cs.RO2025★ 1 cited

Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)

Usman A. Khan, Mouhacine Benosman, Wenliang Liu +2

In this paper, we propose a novel methodology for path planning and scheduling for multi-robot navigation that is based on optimal transport theory and model predictive control. We…

cs.RO2025

DeepFleet: Multi-Agent Foundation Models for Mobile Robots

Ameya Agaskar, Sriram Siva, William Pickering +18

We introduce DeepFleet, a suite of foundation models designed to support coordination and planning for large-scale mobile robot fleets. These models are trained on fleet movement d…

cs.RO2016★ 5 cited

The ACRV Picking Benchmark (APB): A Robotic Shelf Picking Benchmark to Foster Reproducible Research

Jürgen Leitner, Adam W. Tow, Jake E. Dean +15

Robotic challenges like the Amazon Picking Challenge (APC) or the DARPA Challenges are an established and important way to drive scientific progress. They make research comparable…

cs.RO2010★ 100 cited

Discrete Partitioning and Coverage Control for Gossiping Robots

Joseph W. Durham, Ruggero Carli, Paolo Frasca +1

We propose distributed algorithms to automatically deploy a team of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary non-convex envi…

cs.RO2010

Pairwise Optimal Discrete Coverage Control for Gossiping Robots

Joseph W. Durham, Ruggero Carli, Francesco Bullo

We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic Lloyd appr…