Moving Object Routing Around Adjacent Exclusive Sections
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems for managing the operation of multiple moving objects in an area with predefined passages are inefficient and prone to deadlocks when adjacent moving objects perform work that hinders each other's movement.
Innovation Solution
A moving object operation management device that sets exclusive sections for working objects, generates selective operation instructions to bypass or wait for adjacent objects, and calculates arrival times using Dijkstra's algorithm to optimize path selection.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If moving objects are managed to work at specific places in predefined passages, then work efficiency is improved, but deadlocks occur when adjacent exclusive sections hinder each other's movement
Solution Approach 1:
The system performs preliminary actions by calculating both detour paths and shortest paths in advance, comparing arrival times before making decisions. This allows the management device to proactively prevent deadlocks by selecting paths that avoid future conflicts, rather than reacting after deadlocks occur.
Solution Approach 2:
The system dynamically adjusts path selection based on real-time conditions by comparing arrival times of different path options. The management device can switch between detour paths and shortest paths depending on the current state of exclusive sections and other moving objects, making the system adaptive to changing conditions.
2Loss of time
If moving objects take shortest paths to next destinations, then arrival time is reduced, but movement is hindered by adjacent exclusive sections
Solution Approach 1:
The system changes the path parameter dynamically by selecting between detour paths and shortest paths based on arrival time comparisons. When the shortest path would be hindered by exclusive sections, the system switches to alternative paths, optimizing the balance between travel time and movement freedom.
3Ease of operation
If detour paths are taken to avoid exclusive sections, then movement freedom is maintained, but arrival time increases
Solution Approach 1:
The system optimizes the detour path selection by comparing arrival times with shortest path alternatives. Not all detour paths are selected - only those that provide optimal arrival times compared to waiting for exclusive sections to be released. This minimizes the time penalty while maintaining movement freedom.
4Productivity
If multiple operation instructions are generated for adjacent moving objects, then path optimization is improved, but system complexity increases
Solution Approach 1:
The system segments the path planning problem into distinct components: detour path calculation, shortest path calculation, and arrival time comparison. By dividing the complex decision-making process into separate manageable segments, the system achieves optimal path selection without overwhelming complexity.
Solution Approach 2:
The management device acts as an intermediary that coordinates between multiple moving objects by generating appropriate operation instructions. It mediates conflicts between adjacent objects by selecting paths that minimize overall system interference, using arrival time comparisons as the mediation criterion.
Data Source
AI summary
A moving object operation management device is configured to set an exclusive section when a work of a certain moving object inhibits movement of a passage of another moving object, and to selectively issue a first operation instruction for moving one of the two moving objects to the next destination on a path bypassing the exclusive section for the other when the exclusive section for one of the two moving objects and the exclusive section for the other object are adjacent to each other and the movement on the shortest path to the next destination is inhibited by the other exclusive section, and a second operation instruction for moving one of the two moving objects to the next destination on the shortest path after the exclusive section for the other object is released, by comparing the arrival time to the one next destination when the instruction is followed.