Rectilinear Building Path Search With Minimum Turns
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional shortest path search algorithms in rectilinear polygon environments fail to efficiently calculate the minimum link between buildings, neglecting the number of turns, which affects time consumption, and lack methods for building-to-building paths.
Innovation Solution
A method is developed to expand segment-point and segment-segment minimum link and shortest path search problems to building-to-building paths by dividing environments into areas and using sweep line algorithms, constructing data structures, and applying algorithms to calculate minimum links and paths efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional shortest path search algorithms are used, then the shortest path distance is calculated, but the number of links (turns) is not minimized, resulting in increased time consumption
Solution Approach 1:
The patent segments the path search problem into two distinct optimization objectives: minimizing path distance and minimizing the number of links (turns). By treating these as separate but concurrent optimization targets, the algorithm can evaluate multiple candidate paths and select the one that optimally balances both criteria, rather than merely returning an arbitrary shortest path with potentially excessive turns.
Solution Approach 2:
The patent introduces a dynamic evaluation mechanism that adjusts path selection based on real-time calculation of both distance and link count. The algorithm dynamically computes the number of links for each candidate path and uses this information to rank and select paths, making the path selection process adaptive to the specific geometric characteristics of the environment rather than relying on static or arbitrary choices.
2Productivity
If arbitrary paths are returned when multiple shortest paths exist, then calculation is simplified, but paths with more links are selected, increasing time consumption
Solution Approach 1:
The patent implements a feedback mechanism where the algorithm calculates and compares the number of links for each candidate shortest path. This link count information feeds back into the path selection process, allowing the algorithm to systematically identify and select the path with minimum links among all shortest paths, rather than making arbitrary selections that may suboptimally increase travel time.
3Adaptability or versatility
If minimum link and shortest path is calculated between given two points, then turn optimization is achieved, but building-to-building path methods are lacking
Solution Approach 1:
The patent develops a universal path search framework that can handle multiple types of path queries: point-to-point, point-to-building, and building-to-building. By formulating a generalized approach that treats buildings as composite structures with multiple entry/exit points, the algorithm can adaptively solve different path search problems using the same core methodology, thereby achieving minimum link optimization across diverse应用场景 without requiring separate specialized algorithms for each case.
Data Source
AI summary
The present disclosure relates to a method for searching for the shortest path having a minimum link between buildings in a rectilinear polygon obstacle environment, which has been implemented to calculate the shortest path having a minimum link, among the shortest paths based on a Manhattan distance from one building to another building, when buildings are given in a rectilinear polygon obstacle environment. According to the present disclosure, in searching for the shortest path having a minimum link between two buildings, a more efficient data structure can be used in terms of an execution time and memory. A building-building minimum link and shortest path search problem can be solved through only the addition of very small operations by using the segment-point minimum link and shortest path search algorithm which can be easily expanded to the building-building minimum link and shortest path search problem.