Multi-Object Route Estimation With Detours to Avoid Stops
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing route estimation systems for multiple mobile objects often prioritize the shortest route, which can lead to temporary stops and increased travel time when that route is occupied, resulting in suboptimal total movement costs.
Innovation Solution
The system generates time-series route candidates for both shortest and detour routes, calculates evaluation values for route assignment, travel distance, and collision, and compares these to estimate an optimum route that may include detours, using Ising optimization for efficient calculation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of stationary object
If the shortest route is selected for mobile objects, then the travel distance is minimized, but temporary stops occur when the route is occupied leading to increased travel time
Solution Approach 1:
The patent applies dynamics by making the route selection flexible and adaptive rather than fixed. The system dynamically evaluates both shortest and detour routes based on real-time conditions, allowing mobile objects to switch between route types. This dynamic approach resolves the contradiction by enabling the system to choose the shortest route when available (minimizing distance) while automatically selecting detour routes when conflicts occur (avoiding time loss from stops).
Solution Approach 2:
The patent changes the parameter of route selection from a static choice (only shortest route) to a variable parameter system that considers multiple route options. By introducing detour routes as an alternative parameter and using evaluation functions to weigh different factors (distance, time, collision risk), the system can adjust the optimal route based on current conditions, thereby resolving the contradiction between minimizing distance and avoiding time loss.
2Device complexity
If only the shortest route is considered, then the route selection process is simple, but the total movement cost increases due to collisions and stops
Solution Approach 1:
The patent applies preliminary action by pre-generating both shortest and detour routes before making the final selection. Instead of reacting to conflicts after they occur, the system prepares multiple route options in advance and evaluates them using cost functions. This preliminary evaluation of multiple routes allows the system to avoid collisions and stops before they happen, reducing total movement cost while keeping the complexity manageable through structured evaluation.
Solution Approach 2:
The patent implements feedback through evaluation functions that assess route options based on multiple criteria including distance, time, and collision risk. The system calculates total movement costs for different route combinations and uses this feedback to select the optimal route. This feedback mechanism ensures that the increased complexity of considering multiple routes translates into reduced total movement cost by avoiding inefficient shortest-route conflicts.
Data Source
AI summary
An optimum route of multiple mobile objects is estimated by: generating a time-series route candidate of a shortest route for each mobile object; generating a time-series route candidate of a detour route for each mobile object; calculating route assignment evaluation values for the shortest route and the detour route for each mobile object; calculating travel distance evaluation values for the shortest route and the detour route for each mobile object; calculating a route collision evaluation value of a combination for the shortest route and the detour route for each mobile object; and comparing a total value of the route assignment evaluation value, the travel distance evaluation value, and the route collision evaluation value for combinations of the time-series route candidates of the mobile objects, and estimating one of the combinations of the time-series route candidates of the mobile objects as the optimum route.