Decentralized Railway Track Element Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing safety methods for track networks do not optimize the allocation of route elements for vehicles in terms of time, leading to inefficient use of resources and potential conflicts.
Innovation Solution
A decentralized safety method that allocates route elements through three procedural steps: entry permit, registration, and marking, ensuring that route elements are used in a time-optimized and demand-optimized manner by preventing conflicts and allowing vehicles to use route elements based on availability and user requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single request system is used for allocating track elements to vehicles, then the system complexity is reduced, but the allocation time increases and efficiency decreases
Solution Approach 1:
The patent segments the allocation process into three distinct request types (authorization request, registration request, marking request), each serving a specific function in the route element allocation process. This segmentation allows parallel processing of different allocation aspects, reducing overall allocation time while maintaining systematic control.
Solution Approach 2:
The system dynamically adapts the allocation process by using different request types based on the specific allocation scenario. The track elements can respond differently to authorization requests versus registration requests, enabling flexible and efficient resource allocation without requiring a completely different system architecture.
2Device complexity
If track elements are allocated without a structured multi-step process, then the allocation process is simpler, but conflicts between vehicles increase and resource utilization decreases
Solution Approach 1:
The system performs preliminary actions by first granting authorization before proceeding to registration and marking. This preliminary authorization step ensures that conflict detection and resolution occur early in the process, preventing resource conflicts before they manifest, thereby improving overall resource utilization.
Solution Approach 2:
The multi-step request process incorporates feedback mechanisms where each request type provides specific information back to the track element. The track element can respond to each request type with appropriate status information, enabling real-time conflict detection and resolution, which improves resource utilization by preventing allocations that would cause conflicts.
3Extent of automation
If a decentralized allocation system is used without structured request types, then the system is more autonomous, but time optimization and conflict resolution become difficult
Solution Approach 1:
The system optimizes decentralized allocation by changing the parameter of request structuring. By defining three distinct request types with specific purposes, the system maintains decentralized autonomy while enabling time-optimized processing. Each request type can be handled independently and in parallel, improving allocation efficiency without centralizing control.
Data Source
Figure 1a
Figure 1b
Figure 2
AI summary
The invention relates to a safety method for a railway network (1) which is divided into track segments (G1, G2, ..., Gq) by track elements (S1, S2, ..., Sp) and can be traveled by vehicles (Z1, Z2, ..., Zr), in which method the vehicles (Z1, Z2, ..., Zr) request steps (B, R, M), from selections of the track elements, for assignment as a travel path element, and in which method each (Si, where i = 1 to p) of the selected track elements automatically assigns itself as a travel path element for each vehicle (Zm, where m = 1 to r) that requests the steps for assignment as a travel path element, under predetermined conditions. For temporal optimization of the assignment of the track elements as travel path elements, the respective track element automatically assigns itself to the respective vehicle, in that in reaction to a first request (ABZmSi, where m = 1 to r and i = 1 to p) of the respective vehicle (Zm, where m = 1 to r) in a demand type (F1; F2; F3; F4; f1; f2) requested by the respective vehicle, the track element carries out its approval (B) as a travel path element for the respective vehicle (Zm, where m = 1 to r); in reaction to a second request (ARZmSi, where m = 1 to r and i = 1 to p) of the respective vehicle (Zm, where m = 1 to r), the track element carries out its registration (R) as a travel path element for the respective vehicle; and in reaction to a third request (AMZmSi, where m = 1 to r and i = 1 to p) of the respective vehicle (Zm, where m = 1 to r), the track element carries out its marking (M) as a travel path element for the respective vehicle.