Mobile Robot Traffic Coordination for Deadlock-Free Transitions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for managing mobile robot traffic are not robust, reliable, and scalable, particularly in large heterogeneous fleets with uncertainty, temporary obstacles, and overlapping navigation graphs, often requiring manual intervention and global synchronization.
Innovation Solution
A method and system for managing mobile robot traffic that determines blocked transitions based on the configurations of other robots, using a look-up table to associate configurations with blocked transitions, and segments configurations into subsets to allow independent movements, forecasting future paths to detect and avoid deadlocks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multi-agent pathfinding methods are used to solve traffic deadlocks, then deadlock safety is incorporated into route calculation, but the methods require distinct waiting nodes for every agent and reduce flexibility
Solution Approach 1:
The patent introduces a traffic management system that acts as an intermediary between mobile robots, coordinating their movements and resolving deadlocks centrally rather than requiring each robot to have pre-assigned waiting nodes. This mediator approach maintains deadlock safety while allowing robots to operate without rigid pre-assignment constraints.
Solution Approach 2:
The system dynamically determines blocked transitions based on current robot configurations and positions, rather than using static pre-assigned waiting nodes. This dynamic approach allows the traffic management system to adapt to changing conditions while maintaining deadlock prevention.
2Reliability
If priority inheritance with backtracking is used to avoid deadlocks, then conflict safety is assured, but the traffic area must conform to a specific layout with a central main area and tree-like graphs
Solution Approach 1:
The traffic management system is designed to work with arbitrary traffic area layouts rather than requiring specific structures like central main areas and tree-like graphs. The system universally applies blocked transition determination based on robot configurations, making it adaptable to any layout while maintaining conflict safety.
3Productivity
If conflict-based search is used for optimal multi-agent pathfinding, then optimal solutions are found, but execution time reaches impractical regions with growing amounts of agents
Solution Approach 1:
The patent segments the problem by determining blocked transitions for each robot based on the configurations of other robots individually, rather than computing global optimal paths for all agents simultaneously. This segmentation reduces computational complexity and execution time while maintaining solution quality.
4Reliability
If global space-time solution based MAPF approaches are used, then deadlock safety is guaranteed, but all edges must be executable backwards and time window invalidation invalidates the whole solution
Solution Approach 1:
Each mobile robot independently determines blocked transitions based on the configurations of other robots, without requiring global synchronization or validation of time windows. This self-service approach maintains deadlock safety while eliminating the complex constraints of bidirectional edge execution and time window validity.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The present invention relates to a method for managing traffic in an area traversed by a plurality of mobile robots, wherein each of the plurality of mobile robots is configured to attain one of a plurality of allowed configurations, each of the plurality of mobile robots being further configured to change the configuration by making one of a plurality of allowed transitions, wherein the method comprises determining a blocked transition of a second mobile robot based, at least in part, on a configuration of a first mobile robot. The present invention also relates to a system for carrying out the method, and to a corresponding computer program product.