Transport Task Linking for Shorter Robot Travel Distance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing transport management systems face inefficiencies when handling multiple transport tasks, as they do not effectively optimize the total travel distance for transport moving apparatuses, leading to suboptimal transport efficiency.
Innovation Solution
A transport management system that includes a reception section for receiving transport task information, a linkage section that generates linked-tasks information by linking transport tasks to minimize total travel distance, and an assignment section that assigns these linked tasks to transport moving apparatuses based on their current positions and task origins.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If transport tasks are assigned individually to transport moving apparatuses without linkage optimization, then the assignment process is simple, but the total travel distance increases and transport efficiency decreases
Solution Approach 1:
The patent combines multiple independent transport tasks into linked task sequences by identifying spatial and temporal relationships between tasks. The linkage section merges tasks that can be performed by the same apparatus in sequence, optimizing the overall travel distance while maintaining manageable complexity through systematic combination rules
Solution Approach 2:
The patent segments the overall task assignment problem into two distinct stages: first generating optimized linked-tasks information by combining compatible tasks, then assigning these linked tasks to apparatuses. This segmentation allows the system to handle complexity in manageable steps rather than attempting to optimize all assignments simultaneously
2Loss of time
If transport tasks are linked to minimize total travel distance, then transport efficiency improves, but the computational complexity and system complexity increase
Solution Approach 1:
The patent performs preliminary linkage generation before final task assignment. The linkage section pre-processes transport tasks to create optimized linked-tasks information that minimizes travel distance, so that when apparatuses are assigned tasks, the optimal routing has already been determined, reducing the need for complex real-time optimization
Solution Approach 2:
The linkage section acts as an intermediary component between the task reception section and the assignment section. It transforms raw transport tasks into optimized linked-tasks information, mediating the complexity by providing a structured intermediate representation that balances optimization goals with computational feasibility
3Quantity of substance
If multiple transport tasks are consolidated into linked tasks, then the number of apparatuses required decreases, but the complexity of task scheduling and assignment increases
Solution Approach 1:
The patent segments the scheduling complexity by separating the linkage generation function from the assignment function. The linkage section handles task consolidation independently, creating optimized task sequences, while the assignment section handles apparatus allocation based on these pre-optimized sequences. This segmentation reduces overall scheduling complexity compared to simultaneous optimization of both aspects
Data Source
AI summary
A transport management system includes: a reception section that receives p transport task information pieces indicating transport tasks, each of which has a point of origin and a point of destination; a linkage section that generates q (q<p) linked-tasks information pieces by linking the p transport task information pieces; and an assignment section that assigns the q linked-tasks information pieces to q transport robots, respectively. The linkage section generates the q linked-tasks information pieces such that a total travel distance becomes shorter, the total travel distance being the sum of travel distances of the q transport robots, the travel distances being required for the q transport robots to carry out the q linked-tasks information pieces, respectively.