Scale-controllable effective path set generation method, device and equipment

By creating a Dial rule family in the traffic network and using the maximum flow algorithm, filtering and combining effective paths, the problem of difficult control of the number of effective path sets in the prior art is solved, and the efficiency and controllability of path planning are achieved.

CN119761604AActive Publication Date: 2025-04-04EAST CHINA NORMAL UNIV
5 Cites 0 Cited by

Patent Information

Application Number
CN202411814474.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-12-11
Publication Date
2025-04-04
Estimated Expiration
2044-12-11

AI Technical Summary

Technical Problem

The prior art is difficult to effectively control the number of effective path sets, resulting in impractical path allocation in traffic networks.

Method used

By creating a family of Dial rules, including rules getting farther away from the starting point and rules getting closer to the end point, selecting a rule as a compression rule, filtering sections that meet the rules in the traffic network, forming a sub-network, and using the maximum flow algorithm to determine the minimum edge cutting, combining the pre- and post-valid paths to generate an effective path set.

Benefits of technology

The control of the number of effective paths is realized, ensuring that the number of path sets has an upper bound, avoiding the problem of impractical path allocation, and improving the efficiency of path planning in the traffic network.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention discloses a scale-controllable effective path set generation method, device and equipment, and relates to the field of path planning. The method comprises the following steps: creating a Dial rule family for screening effective paths; selecting a rule from the Dial rule family as a compression rule, screening road sections meeting the compression rule in the traffic network, and forming a sub-network; using a maximum flow algorithm in the graph theory to determine the minimum edge cut from the starting point to the end point in the sub-network; determining a preposed effective path set meeting a rule of being farther and farther away from the starting point from the starting point to a preposed node of the minimum edge cut; determining a post effective path set satisfying a rule of being closer to the end point between the effective path sets from the post node of the minimum edge cut to the end point; and combining the front effective path in the front effective path set, the minimum edge cut and the rear effective path in the rear effective path set to obtain an effective path set from the starting point to the ending point. The number of effective paths can be controlled.
Need to check novelty before this filing date? Find Prior Art