🔔 Scheduled Maintenance:The platform will undergo backend updates on July 1st, 2026, 2:00–4:00 AM UTC.
AJETAS
Back to Journal Table of Contents
Paper Code: AJETAS-2026-0088Open AccessResearch ArticlePeer Reviewed

Multi-Agent Cooperative Pathfinding in Shared Industrial Corridors

Arjun Mehta;Sarah Jenkins
Received: May 15, 2026Accepted: June 20, 2026Published: April 2026
Published inIEEE Transactions on Robotics
Volume & IssueVol. 15, Issue 2
DOI10.1109/TRO.2026.002591

Abstract & Keywords

Pathfinding for fleets of autonomous mobile robots inside narrow warehouses remains a scheduling bottleneck. We introduce a token-routing heuristic that coordinates routes dynamically. Results show a 25% throughput improvement over traditional grid reservations.

Index Keywords
Multi-Agent SystemsPathfindingRoboticsWarehouse Automation

Author Affiliations

Arjun MehtaCorresponding Author · Department of Computer Science & Engineering, IIT Bombay, India
Sarah JenkinsResearch Partner · Department of Computer Science & Engineering, IIT Bombay, India

References Listing (3)

  1. [1]K. R. Rao and J. Doe, "High-resolution convolutional modeling in thermal imaging systems," IEEE Trans. Image Process., vol. 31, pp. 210–222, Jan. 2024.
  2. [2]W. Liu, R. Chen, and M. Rossi, "Deep residual neural networks for noise-reduction and super-resolution edge rebuilding," Pattern Recognition, vol. 142, pp. 110-125, Oct. 2025.
  3. [3]S. Jenkins, "Cooperative token-heuristics inside warehousing routing grids," Int. J. Rob. Res., vol. 18, no. 4, pp. 450–467, May 2025.