Bidirectional Route Weighting for Moving Object Congestion Avoidance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems struggle to efficiently manage and prevent congestion and collisions among multiple moving objects in a shared movement environment, particularly when paths allow movement in both directions, without causing unnecessary delays or inefficiencies.
Innovation Solution
An information processing apparatus that generates routes for moving objects by adjusting weights on movement paths based on congestion adjustment parameters, updating weights dynamically to reduce congestion in specific directions, and generating movement plans to avoid collisions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If dedicated movement paths are provided in advance to avoid contention between moving objects, then collision avoidance is improved, but route flexibility and adaptability deteriorate
Solution Approach 1:
The patent implements dynamic route planning where movement paths and weights are adjusted in real-time based on current system state. The routing algorithm dynamically assigns weights to different paths and updates these weights as moving objects traverse the environment, allowing the system to adapt to changing conditions while maintaining collision avoidance through centralized control.
Solution Approach 2:
The system changes the parameter of path weights dynamically. Each movement path is assigned a weight that can be modified based on congestion levels, object priorities, and real-time conditions. This parameter change enables flexible routing decisions without requiring dedicated fixed paths for each object.
2Adaptability or versatility
If movement paths allow movement in both directions for efficiency, then route versatility is improved, but congestion and contention risks worsen
Solution Approach 1:
The patent applies different weight values to different directions of the same movement path based on local conditions. The routing algorithm can assign higher weights to less congested directions and lower weights to congested directions, allowing bidirectional paths to be used efficiently while preventing congestion through localized weight adjustments.
Solution Approach 2:
The system implements feedback mechanisms where the weight of movement paths is updated based on the actual usage and congestion observed. As moving objects traverse paths, the system receives feedback about path utilization and adjusts weights accordingly, preventing congestion from developing while maintaining route versatility.
3Productivity
If route planning is done in advance for multiple moving objects, then operational efficiency is improved, but ability to handle dynamic changes and avoid congestion worsens
Solution Approach 1:
The system performs preliminary route planning by pre-calculating weights for movement paths based on predicted traffic patterns and operational requirements. This preliminary action enables efficient route selection while maintaining the flexibility to adjust weights dynamically as actual conditions differ from predictions.
Solution Approach 2:
The patent transitions from static advance planning to dynamic route optimization. The system continuously updates path weights based on real-time congestion data and re-calculates routes as needed, combining the efficiency of pre-planning with the adaptability of real-time adjustments.
Data Source
AI summary
The present embodiments relate to an information processing apparatus for generating a route for a moving object. The apparatus includes a processing circuitry configured to generate a route for a first moving object including one or more of a plurality of movement paths, each of which allows movement in a first direction and a second direction opposite to the first direction, based on a first weight in the first direction and a second weight in the second direction associated with each movement path; update at least one of the first weight and the second weight for a movement path included in the route for the first moving object based on a movement direction of the first moving object; and generate a route for a second moving object based on the updated at least one of the first weight and the second weight.