Autonomous mobile robots (AMRs) are increasingly used in modern intralogistics systems as complexity and performance requirements become more stringent. One way to increase performance is to improve the operation and cooperation of multiple robots in their shared environment. The paper addresses these problems with a method for off-line route planning and on-line route execution. In the proposed approach, pre-computation of routes for frequent pick-up and drop-off locations limits the movements of AMRs to avoid conflict situations between them. The paper proposes a reinforcement learning approach where an agent builds the routes on a given layout while being rewarded according to different criteria based on the desired characteristics of the system. The results show that the proposed approach performs better in terms of throughput and reliability than the commonly used shortest-path-based approach for a large number of AMRs operating in the system. The use of the proposed approach is recommended when the need for high throughput requires the operation of a relatively large number of AMRs in relation to the size of the space in which the robots operate.

In intralogistics, autonomous mobile robots (AMRs) operate without predefined paths, leading to complex traffic patterns and potential conflicts that impact system efficiency. This paper proposes a bio-inspired optimization method for autonomously generating spatial movement constraints for autonomous mobile robots (AMRs). Unlike traditional multi-agent pathfinding (MAPF) approaches, which focus on temporal coordination, our approach proactively reduces conflicts by adapting a weighted directed grid graph to improve traffic flow. This is achieved through four mechanisms inspired by ant colony systems: (1) a movement reward that decreases the weight of traversed edges, similar to pheromone deposition, (2) a delay penalty that increases edge weights along delayed paths, (3) a collision penalty that increases weights at conflict locations, and (4) an evaporation mechanism that prevents premature convergence to suboptimal solutions. Compared to the existing approaches, the proposed approach addresses the entire intralogistic problem, including plant layout, task distribution, release and dispatching algorithms, and fleet size. Its autonomous movement rule generation and low computational complexity make it well suited for dynamic intralogistic environments. Validated through physics-based simulations in Gazebo across three scenarios, a standard MAPF benchmark, and two industrial environments, the movement constraints generated using the proposed method improved the system throughput by up to 10% compared to unconstrained navigation and up to 4% compared to expert-designed solutions while reducing the need for conflict-resolution interventions.