Cover Image

Line Coverage with Multiple Robots: Algorithms and Experiments

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Agarwal, Saurav, Akella, Srinivas
Format:	Preprint
Published:	2022
Subjects:	Robotics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning-Augmented Online TRP on a Line
by: Guragain, Swapnil, et al.
Published: (2026)

Forming Large Patterns with Local Robots in the OBLOT Model
by: Hahn, Christopher, et al.
Published: (2024)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
by: Mizutani, Yosuke, et al.
Published: (2024)

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
by: Gerlach, Raphael, et al.
Published: (2024)

A Space-Efficient Algebraic Approach to Robotic Motion Planning
by: Bentert, Matthias, et al.
Published: (2024)

Online Drone Coverage of Targets on a Line
by: Dobrev, Stefan, et al.
Published: (2026)

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
by: Philip, Allen George, et al.
Published: (2023)

Robust Out-of-Order Retrieval for Grid-Based Storage at Maximum Capacity
by: Geft, Tzvika, et al.
Published: (2026)

Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
by: Geft, Tzvika, et al.
Published: (2025)

A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation
by: Dutta, Ayan, et al.
Published: (2016)

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
by: Chandran, L. Sunil, et al.
Published: (2024)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
by: Garcia, Javier, et al.
Published: (2025)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
by: Dhar, Saurav, et al.
Published: (2024)

Optimizing Line Segment Inspection with Limited-Range Drones
by: Díaz-Báñez, José-Miguel, et al.
Published: (2026)

Obstacle-Free Path Planning for Autonomous Drones Using Floyd Algorithm
by: Yao, Edward
Published: (2024)

On the Line-Separable Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2023)

Algorithms for Halfplane Coverage and Related Problems
by: Wang, Haitao, et al.
Published: (2024)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2024)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
by: D'Angelo, Gianlorenzo, et al.
Published: (2025)

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
by: Fischer, Nick, et al.
Published: (2026)

Optimal Algorithms for Free Order Multiple-Choice Secretary
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2022)

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
by: Gawrychowski, Paweł, et al.
Published: (2024)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
by: Chen, Lin, et al.
Published: (2026)

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
by: Zheng, Da Wei, et al.
Published: (2023)

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
by: Li, Rao
Published: (2024)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
by: Abboud, Amir, et al.
Published: (2023)

FPT Approximations for Connected Maximum Coverage
by: Inamdar, Tanmay, et al.
Published: (2026)

Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments
by: Ansaripour, Matin, et al.
Published: (2024)

On the Power of Spatial Locality on Online Routing Problems
by: Guragain, Swapnil, et al.
Published: (2025)

A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
by: Philip, Allen George, et al.
Published: (2024)

Adapting Dijkstra for Buffers and Unlimited Transfers
by: Katkalo, Denys, et al.
Published: (2026)

Accelerating Probabilistic Response-Time Analysis: Revised Critical Instant and Optimized Convolution
by: Takahashi, Hiroto, et al.
Published: (2025)

Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements
by: Kumar, Manish, et al.
Published: (2026)

On the Exponential Growth of Geometric Shapes
by: Almalki, Nada, et al.
Published: (2023)

Early Pruning for Public Transport Routing
by: Rohovyi, Andrii, et al.
Published: (2026)

An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
by: Koo, Jaehyun
Published: (2024)

Dominating Set with Quotas: Balancing Coverage and Constraints
by: Chatterjee, Sobyasachi, et al.
Published: (2026)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
by: Zhao, Jingyang, et al.
Published: (2026)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
by: Inamdar, Tanmay, et al.
Published: (2024)

Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
by: Ene, Alina, et al.
Published: (2025)