Abstract
Abstract
Abstract The surveillance of critical or hazardous indoor environments — warehouses, industrial facilities, and convenience stores — is often too risky or expensive for human operators, motivating coordinated multi-robot teams. This paper presents a decentralized pipeline for grid-based multi-robot surveillance: a density-weighted utility function chooses high-priority targets, an orientation-penalized variant of A* plans turn-efficient routes to them, a Linear Quadratic Regulator(LQR) tracks the resulting trajectories, and a three-tier collision-avoidance scheme — escalating from artificial potential fields to grid-aligned shape-navigation boundary tracing to a bounded local A* replan — coupled with a time/cost-based negotiation protocol keeps robots clear of static obstacles, dynamic obstacles, and each other. We demonstrate that the orientation-aware cost function preserves A* optimality using 2 different robot sample sizes. The orientation-aware planner decreased in-place turning by 70.19% over 40 randomized trials, matching or beating baseline A* in all 40 of the 40, and by 64.85% (N = 15) / 59.11% (N = 25) on the real targets utilized throughout, cutting real execution time under LQR monitoring by 25.13% (N = 15) / 21.60% (N = 25). Collision-avoidance escalation resolved 15 of 15 (N = 15) and 25 of 25 (N = 25) dynamic-obstacle encounters and negotiation resolved all 6 genuine timing conflicts found across both team sizes (1 of 105 pairs at N = 15, 5 of 300 at N = 25). The results show that the pipeline is a feasible and scalable method to multi-robot surveillance of congested interior settings, with the target-selection mechanism validated for team sizes from 5 to 30 robots and the full pipeline verified at two representative scales, N = 15 and N = 25.
Direct answer
What can I do from this paper page?
Use this page to scan "Decentralized Multi-Robot Warehouse Surveillance with Orientation-Aware Planning and Hybrid Collision Avoidance" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Robotic Path Planning Algorithms research, save the paper, or map adjacent work.
Research areas
Follow related topics
Citation
BibTeX
@article{Paidi2026Decentralized,
title = {Decentralized Multi-Robot Warehouse Surveillance with Orientation-Aware Planning and Hybrid Collision Avoidance},
author = {Praveen Paidi},
journal = {Research Square},
year = {2026},
doi = {10.21203/rs.3.rs-11245096/v1},
url = {https://doi.org/10.21203/rs.3.rs-11245096/v1}
}
FAQ
Using this paper in a discovery workflow
How do I find related work for this paper?
Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.
How can I keep up with new Robotic Path Planning Algorithms research papers?
Follow Robotic Path Planning Algorithms research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.
Can I cite this paper from this page?
This page includes a static BibTeX block for Decentralized Multi-Robot Warehouse Surveillance with Orientation-Aware Planning and Hybrid Collision Avoidance. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.
Follow this research in Scollr
Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.
Get the app