Aug 2026· Proceedings of the VLDB Endowment· Vol 19, pp. 4622-4625· 1 citation· 5 references
TL;DR
This demo presents a fully functional lifelong conflict-aware AGV routing system built on the novel routing algorithm OHSMD optimized for warehouse scenarios using Sony's Toio™ Core Cube robots.
Abstract
Automated Guided Vehicles (AGVs) are the backbone of modern e-commerce warehouses, but the existing multi-agent pathfinding (MAPF) solutions fail to simultaneously satisfy the practical requirements of continuous space and time, lifelong and dynamic tasks, kinematic movement constraints, online responsiveness, and large-scale scalability in real-world deployments. This demo presents a fully functional lifelong conflict-aware AGV routing system built on our novel routing algorithm OHSMD optimized for warehouse scenarios. The system supports customizable warehouse map configuration, AGV kinematic parameter tuning, lifelong task scheduling, conflict-free path planning, interactive visualization, and physical validation using Sony's Toio™ Core Cube robots. Through this demo, the audience can intuitively experience the system's performance and verify the practical availability of our routing algorithms in industrial warehouse scenarios.
Large scale warehouse automation relies on efficient multi agent path finding (MAPF) to coordinate thousands of robots in structured environments. Existing MAPF algorithms primarily improve conflict resolution while representing warehouses as generic navigation graphs, overlooking their inherent geometric structure and...
HiRAD is proposed, a hierarchical RL framework for continuous-space AGV routing with real-time guarantees that reduces makespan by 45 percent to 63 percent and shortens end-to-end runtime.
Yun-Jie Huang, Rui-Zhong Wu, Meng-Xuan Zhang et al.· 0 citations
Robotic Mobile Fulfillment Systems (RMFS) have rapidly advanced in recent years, driven by the rise of e-commerce and the increasing adoption of robots in warehouses. Efficient path routing and task assignment are crucial for optimizing system performance. We propose a modified A* algorithm for robot path planning that...
M. Kurz, Ahmad Kokhahi· IISE Annual Conference &...· 0 citations
We present a tractable approach to grid-based multi-agent path planning for inspection tasks that minimizes task completion time. We require all agents to collectively inspect all targets while (i) maintaining a user-defined separation distance, (ii) returning to charging stations as needed, and (iii) avoiding obstacle...
Kento Tomita, V. Petrov, Keishi Nishikawa et al.· IEEE Robotics and Automation...· 0 citations
An obstacle-aware routing framework that combines a 1 m occupancy grid, A* shortest-path computation, and an Improved Mayfly Optimization Algorithm (IMOA) is developed, establishing routing-efficiency gains under the evaluated protocol.
Ze Yang, Xin-Ying Cheng, Hao-Min Wang· Sustainability· 0 citations
Smart manufacturing and logistics robots require integrated navigation capabilities. Optimized global routing, fast obstacle avoidance, and stable trajectory generation are all necessary. In this paper, we develop a hybrid path planner. An enhanced A* algorithm is combined with the Dynamic Window Approach (DWA). We int...
Xiao-Ming Zhang· ICST Transactions on Scalabl...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
