Transfer Vehicle Route Coding for Low-Memory Guide Path Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing automatic transfer systems face challenges in efficiently updating travel routes for changing or expanding guide paths, particularly when using control devices with low processing capability and limited memory, as they require significant time and effort, and struggle with backward movement and increased memory demands.
Innovation Solution
The system employs a guide path structure with multiple order channels and position codes specified by combinations of numbers corresponding to the maximum order, allowing the transfer vehicle to move forward and backward without needing extensive route recalculations, using a program that calculates routes based on these codes, thus reducing computational load and memory requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If Dijkstra's algorithm is used to calculate travel route from each stop position to another stop position, then the travel route can be calculated dynamically, but the processing load becomes heavy and cannot be executed by control devices with low processing capability
Solution Approach 1:
The patent segments the guide path into multiple channels with hierarchical ordering (first-order channel, second-order channels, k-th order channels). Each branch point is assigned a channel order and position number, creating a structured segmentation that simplifies route calculation. This segmentation allows the control device to navigate by comparing position codes rather than performing complex pathfinding algorithms, significantly reducing processing load while maintaining adaptability.
Solution Approach 2:
The patent performs preliminary action by pre-assigning position codes to all branch points and stop positions during system setup. These position codes encode the hierarchical channel structure and sequential order, so that when the transfer vehicle needs to travel between points, the control device only needs to compare pre-assigned codes rather than calculate routes dynamically. This preliminary coding structure enables low-processing devices to execute route calculations efficiently.
2Adaptability or versatility
If the number of branches of the guide path increases, then the guide path can serve more stop positions, but the number of digits of the number assigned to the branch point increases and requires larger memory capacity
Solution Approach 1:
The patent segments the positioning information into multiple hierarchical levels: channel order (first-order, second-order, k-th order) and position number within each channel. This segmentation allows the system to handle an arbitrary number of branches by adding more channels at appropriate orders rather than increasing the number of digits in a single identifier. The hierarchical structure efficiently encodes large numbers of stop positions using a compact representation that minimizes memory requirements.
Solution Approach 2:
The patent transitions from a one-dimensional numbering system to a multi-dimensional hierarchical coordinate system. Instead of using a single increasing number that requires more digits as branches increase, the system uses multiple dimensions: channel order level and position number within channel. This dimensional transformation allows the system to accommodate exponentially more stop positions without proportionally increasing the information storage requirement, as the hierarchical structure compresses the representation of complex path configurations.
3Device complexity
If conventional numbering methods are used without considering backward movement, then the numbering system remains simple, but a detour is required to move toward a stop position where the transfer vehicle has passed
Solution Approach 1:
The patent applies dynamics by making the position code interpretation context-dependent on the vehicle's current direction of travel. The position numbers within each channel are assigned in sequential order from the start point, and the control device dynamically determines whether to move forward (increasing position number) or backward (decreasing position number) based on the target position code comparison. This dynamic interpretation of the same numbering system enables efficient bidirectional movement without requiring separate numbering schemes for each direction, maintaining simplicity while eliminating detours.
Data Source
AI summary
An automatic transfer system includes a guide path, a transfer vehicle, and a program for calculation of a travel route of the transfer vehicle. Each of a plurality of branch points and a plurality of stop positions included in the guide path is assigned with any one of position codes specified by a combination of three numbers, which is a number of pieces corresponding to a maximum order of channels included in the guide path. Each of three numbers specifying the position code is determined on the basis of a channel including a branch point or a stop position corresponding to the position code and on the basis of a sequential order of the branch point or the stop position from a start point of the channel.