Path searching method, electronic equipment and computer readable storage medium

Abstract

The embodiment of the invention provides a path search method, electronic equipment and a computer readable storage medium. The path search method comprises the following steps: acquiring resources on which path search depends; determining a clipping object according to the resources and a preset path search constraint; cutting the resource according to the cutting object to obtain a candidate path graph set; and performing path search in the candidate path diagram set according to a preset path requirement and a search rule. According to the scheme of the embodiment, more than 90% of the returned path meets the path search constraint, the effectiveness of the search path is improved, the path search range is greatly reduced, the search path can be quickly returned, and the path search efficiency is improved.

Description

Technical Field

[0001] The embodiments of the present disclosure relate to the field of path planning, and in particular to a path searching method, an electronic device and a computer-readable storage medium. Background Art

[0002] With the development of network technology, especially the advent of 5G (fifth-generation mobile communication technology), the complexity of the network has increased dramatically, the network structure has become more and more complex, and the path search has become more and more complex. It is necessary not only to meet basic constraints but also special constraints. Summary of the invention

[0003] Embodiments of the present disclosure provide a path search method, an electronic device, and a computer-readable storage medium.

[0004] In a first aspect, an embodiment of the present disclosure provides a path search method, which may include:

[0005] Get the resources that the path search depends on;

[0006] Determining a clipping object according to the characteristics of the resource and a preset path search constraint;

[0007] Clipping the resource according to the clipping object to obtain a candidate path atlas;

[0008] A path search is performed in the candidate path atlas according to preset path requirements and search rules.

[0009] In a second aspect, an embodiment of the present disclosure provides an electronic device, the electronic device comprising:

[0010] one or more processors;

[0011] A memory having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the path search method;

[0012] One or more input / output I / O interfaces are connected between the processor and the memory and are configured to implement information interaction between the processor and the memory.

[0013] In a third aspect, an embodiment of the present disclosure provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the path search method is implemented.

[0014] The disclosed embodiment determines a clipping object according to resources and preset path search constraints, and clips the resources according to the clipping object to filter the resources, thereby obtaining a candidate path atlas that satisfies the path search constraints. A path search is performed in the candidate path atlas according to the search rules, so that more than 90% of the returned paths satisfy the path search constraints, thereby improving the validity of the search path, greatly reducing the path search range, being able to quickly return the search path, and improving the path search efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] In the accompanying drawings of the embodiments of the present disclosure:

[0016] Figure 1 Business planning processes for relevant technologies;

[0017] Figure 2 This is the structural diagram of the pre-planning system ZXTOP510;

[0018] Figure 3 A flow chart of a path search method provided by an embodiment of the present disclosure;

[0019] Figure 4 A flow chart of a path search method provided by an embodiment of the present disclosure;

[0020] Figure 5 A block diagram of the electronic device provided in the embodiment of the present disclosure;

[0021] Figure 6 A block diagram of the computer-readable storage medium provided for an embodiment of the present disclosure. DETAILED DESCRIPTION

[0022] In order to enable those skilled in the art to better understand the technical solution of the present disclosure, the communication perception data processing method and computer-readable storage medium provided by the embodiments of the present disclosure are described in detail below in conjunction with the accompanying drawings.

[0023] The present disclosure will be described more fully below with reference to the accompanying drawings, but the embodiments shown may be embodied in different forms, and the present disclosure should not be construed as being limited to the embodiments set forth below. On the contrary, the purpose of providing these embodiments is to make the present disclosure thorough and complete, and will enable those skilled in the art to fully understand the scope of the present disclosure.

[0024] The accompanying drawings of the embodiments of the present disclosure are used to provide a further understanding of the embodiments of the present disclosure, and constitute a part of the specification, and are used together with the detailed embodiments to explain the present disclosure, and do not constitute a limitation of the present disclosure. By describing the detailed embodiments with reference to the accompanying drawings, the above and other features and advantages will become more apparent to those skilled in the art.

[0025] The present disclosure may be described with reference to plan views and / or cross-sectional views by means of ideal schematic views of the present disclosure. Therefore, the exemplary illustrations may be modified according to manufacturing techniques and / or tolerances.

[0026] In the absence of conflict, the various embodiments of the present disclosure and the various features therein may be combined with each other.

[0027] The terms used in the present disclosure are only used to describe specific embodiments and are not intended to limit the present disclosure. The term "and / or" as used in the present disclosure includes any and all combinations of one or more related enumerated items. The singular forms "one" and "the" as used in the present disclosure are also intended to include plural forms, unless the context clearly indicates otherwise. The terms "including", "made of..." as used in the present disclosure specify the presence of the features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or groups thereof.

[0028] Unless otherwise defined, all terms (including technical and scientific terms) used in this disclosure have the same meaning as commonly understood by those of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and this disclosure, and will not be interpreted as having an idealized or overly formal meaning unless explicitly defined in this disclosure.

[0029] The present disclosure is not limited to the embodiments shown in the drawings, but includes modifications of the configurations formed based on the manufacturing process. Therefore, the regions illustrated in the drawings have schematic properties, and the shapes of the regions shown in the drawings illustrate the specific shapes of the regions of the elements, but are not intended to be limiting.

[0030] With the development of network technology, especially the advent of 5G (fifth generation mobile communication technology), the complexity of the network has increased dramatically, the network structure has become more and more complex, and the path search has become more and more complex. It must not only meet basic constraints, but also meet special constraints. The service transmission path is the basis for ensuring the normal transmission of the service. Therefore, path search is an important part of network planning and has an important impact on the planning results.

[0031] Network service transmission must not only ensure the transmission of local services, but also the transmission of all network services. With the increase of network service volume, special requirements are gradually increasing, such as single-wave transmission requirements, wave-hopping transmission requirements, etc. Based on traditional path search methods such as Dijkstra and KSP (K Shortest Path, K shortest path algorithm), in order to find a path that meets the requirements, it is necessary to use an exhaustive path method. However, in a large-scale network environment, exhausting all paths is subject to time constraints, and only a certain number of paths may be obtained for verification, and the efficiency is low. Under the current system structure, proposing a path search solution that can meet traditional needs and quickly adapt to new needs has become a difficulty that needs to be overcome.

[0032] In order to solve the path search problem of complex networks, the embodiment of the present disclosure takes how to quickly filter out invalid resources (such as nodes and links) as a breakthrough point, and obtains a path search solution for searching for paths that meet the requirements under limited conditions. By determining the clipping object according to the resources and the preset path search constraints, and clipping the resources according to the clipping object, the resources are filtered, so that a candidate path atlas that meets the path search constraints can be obtained. In the candidate path atlas, a path search is performed according to the search rules, so that more than 90% of the returned paths meet the characteristic constraints, thereby improving the effectiveness of the search path, and greatly reducing the path search range. The search path can be quickly returned, and the path search efficiency is improved.

[0033] The path search method of the embodiment of the present disclosure can be implemented by any electronic device that needs to report an alarm, such as a terminal device or a server. The terminal device may include but is not limited to: a vehicle-mounted device, a user equipment (User Equipment, UE), a mobile device, a computing device, a wearable device, etc., for example, including but not limited to a cellular phone, a cordless phone, a personal digital assistant (Personal Digital Assistant, PDA), a portable computer, etc.

[0034] The path search method of the embodiment of the present disclosure may be implemented by a processor calling computer-readable program instructions stored in a memory, or may be implemented by a server.

[0035] The embodiments of the present disclosure can be used in any scenario where path search is required, especially in scenarios where there are special constraints that cannot be included in the traditional path search process. The embodiments of the present disclosure can effectively meet the path search in the scenario. The path search method of the embodiments of the present disclosure can be applied to, but not limited to, various application scenarios such as path search in the communication field, road planning (such as road construction, road navigation, etc.), and logistics scheduling. In a logistics scheduling system, if a dedicated line transportation is planned, the embodiments of the present disclosure can quickly plan a suitable scheduling route within the dedicated line; the embodiments of the present disclosure can also be used in special route navigation. If special route planning is required, the use of the embodiments of the present disclosure can improve the efficiency of path planning.

[0036] In the disclosed embodiment, it can be applied to the bidding support pre-planning system ZXTOP510, which has functions such as network design, planning and configuration, and can be called a network design and planning system. The disclosed embodiment can be applied to the planning module of the system. The planning module is divided into two parts: path planning and resource planning. First, the path planning needs to be completed, and then the resources are planned for the business on the planned path to complete the overall network planning. The planning results play a key role in the bidding. The business planning process is as follows Figure 1 As shown, first start the service, perform path search, and detect whether the searched path is available. If it is not available, it is determined that the service planning has failed. If it is available, verify the path site resources and detect whether the resources meet the requirements. If the requirements are met, it is determined that the service planning is successful. If the requirements are not met, it is determined that the service planning has failed. The embodiment of the present disclosure can be used for Figure 1 The path search part in the flowchart shown solves the problem that the search path returned does not meet the requirements under a limited number of conditions.

[0037] like Figure 2 As shown, the system can include seven parts: engineering module, network module, business module, design module, planning module, configuration module and report module. Among them, the engineering module is used to complete the creation of the network and generate the basic engineering network. The basic engineering network contains sites and optical fibers, and supports the import and export of network projects, the import and export of existing network projects and other functions; the network module is mainly used to complete the basic configuration of the network, such as site equipment type configuration, etc.; the business module is used to complete the creation of services in the network, import and export and other functions; the design module is used to complete the design of network transmission links; the planning module is used to complete the business transmission path and required resource planning in the network; the configuration module is used to count the resource configuration generated by the business planning in the network; the report module is used to output the resources planned and configured in the network in the form of reports.

[0038] The following is a detailed introduction to the embodiments of the present disclosure.

[0039] The present disclosure provides a path search method. Figure 3 , Figure 4 As shown, the method may include steps S11-S14:

[0040] S11. Obtain resources that the path search depends on.

[0041] In the disclosed embodiment, the resource includes a node set and a link set in a preset search network; the node set can be N = {n1, n2, n3,.......}, and the link set can be L = {l1, l2, l3,......, li,......lj}, where i and j are both positive integers; the source and destination points of the search path are np to nq respectively (that is, the starting node and the ending node of the search path are np and nq respectively), and the node set and the link set are determined by the user.

[0042] S12: Determine the clipping object according to the resources and the preset path search constraints.

[0043] In the embodiments disclosed herein, considering that when the scale of the problem is large, in order to quickly find a solution to the problem, the scale of the problem can be reduced first. Therefore, in order to solve the limitations of the traditional path search algorithm under the current path planning system structure, inspired by the concept of clipping, the invalid interference resources (referred to as invalid resources) can be clipped first, and then the path search can be performed based on the clipped resources, which will greatly reduce the scope of the path search, thereby being able to quickly return to the search path and improve the efficiency of the path search.

[0044] In the embodiment of the present disclosure, the clipping object may include invalid resources that need to be clipped.

[0045] In the embodiment of the present disclosure, determining the clipping object according to the resources and the preset path search constraints includes:

[0046] Invalid resource characteristics are determined from the resources according to the path search constraints, and invalid resources are determined from the resources according to the invalid resource characteristics.

[0047] In the disclosed embodiment, the invalid resource refers to a resource that is not required as indicated by the path search constraint;

[0048] The invalid resource characteristics refer to resource characteristics corresponding to invalid resources among the resource characteristics corresponding to the resources.

[0049] In the embodiments of the present disclosure, for a communication path in the communication field, resource characteristics may include but are not limited to any one or more of the following: link channel (channel formed by wavelength on the link), link type, and subdivision characteristics.

[0050] In the embodiments of the present disclosure, the subdivision characteristics are characteristics for constraining node sets and link sets based on the determination of link channels and / or link types. The subdivision characteristics may include any one or more of the following: site type, relay, wave hopping, and resource phase (path construction may be divided into multiple phases of projects, and different resources may be set for use in different phases of projects).

[0051] In the disclosed embodiment, site type and relay are used to constrain node sets (specifically, nodes in the node set), and wave hopping and resource phase are used to constrain node sets and link sets (specifically, links in the link set).

[0052] In the embodiment of the present disclosure, based on the above resource characteristics, any one or more of the above resource characteristics may be constrained in the path search constraint, and therefore the invalid resource characteristics (i.e., the resource characteristics that need to be limited in this path search, which contain resources that are not required for the path search indicated by the path search constraint, i.e., invalid resources) may include but are not limited to any one or more of the following: link channel, link type, and subdivision characteristics, and the invalid resource characteristics may include any one or more of the subdivision characteristics.

[0053] In the embodiments of the present disclosure, for example, the path search constraints may include but are not limited to any one or more of the following:

[0054] Link channels maintain pre-assigned link channels in all links throughout the path;

[0055] Link types maintain pre-assigned link types across all links in the entire path;

[0056] Any one or more of the resource properties remain the same throughout the path.

[0057] In the embodiments of the present disclosure, for example, invalid resources may include any one or more of the following:

[0058] The link channels corresponding to the links included in the link set do not meet the path search constraint requirements;

[0059] The link types corresponding to the links included in the link set that do not meet the path search constraint requirements;

[0060] The resources corresponding to the segmentation features that do not meet the path search constraint requirements.

[0061] In an embodiment of the present disclosure, for example, if the first link channel is specified in advance in the path search constraint as the link channel required to be used in this path search, then the link channels other than the first link channel in the resource characteristic of the link channel corresponding to the resource belong to invalid resource characteristics, and the channels in the resource other than the first link channel are all invalid resources and need to be trimmed.

[0062] In an embodiment of the present disclosure, for example, if the first link type is specified in advance in the path search constraint as the link type required to be adopted in this path search, then the link types other than the first link type in the resource characteristic of the link type corresponding to the resource belong to invalid resource characteristics, and all links in the resource other than the first link type are invalid resources and need to be pruned.

[0063] In an embodiment of the present disclosure, for example, if it is specified in advance in the path search constraint that the site type in the resource characteristic remains consistent throughout the entire path and remains the first site type, then the site types other than the first site type in the resource characteristic of the site type corresponding to the resource are invalid resource characteristics, and all sites in the resource other than the sites included in the first site type are invalid resources and need to be trimmed.

[0064] In the disclosed embodiment, the path search constraint may be constraint information input by a user (for example, the user input requires that all links of the entire path use the same channel), or may be constraint information preset by a solution.

[0065] In the embodiments of the present disclosure, for paths in the fields of road planning, logistics scheduling, etc., resource characteristics may include but are not limited to any one or more of the following: path length, path type (such as highway, low-speed road, etc.) and subdivision characteristics.

[0066] In the embodiments of the present disclosure, the subdivision characteristics are characteristics for constraining the node set and the link set based on the path length and / or path type, and the subdivision characteristics may include any one or more of the following: site type, relay, jump rate (speed change) and resource phase (path construction can be divided into multiple phases of projects, and different resources can be set for projects in different phases).

[0067] In the disclosed embodiment, site type and relay are used to constrain node sets (specifically, nodes in the node set), and hop rate and resource phase are used to constrain node sets and link sets (specifically, links in the link set).

[0068] In the embodiment of the present disclosure, based on the above resource characteristics, any one or more of the above resource characteristics may be constrained in the path search constraint, and therefore the invalid resource characteristics (i.e., the resource characteristics that need to be limited in this path search, which contain resources that are not required for the path search indicated by the path search constraint, i.e., invalid resources) may include but are not limited to any one or more of the following: path length, path type, and subdivision characteristics, and the invalid resource characteristics may also include any one or more of the subdivision characteristics.

[0069] In the embodiments of the present disclosure, for example, the path search constraints may include but are not limited to any one or more of the following:

[0070] The path length remains within the pre-specified path length range;

[0071] The path type holds the pre-specified link type (e.g., highway);

[0072] Any one or more of the resource properties remain the same throughout the path.

[0073] In the embodiments of the present disclosure, for example, invalid resources may include any one or more of the following:

[0074] The path length does not meet the path search constraint requirements;

[0075] The path type does not meet the path search constraint requirements (for example, low-speed road);

[0076] Resource properties that do not meet the path search constraint requirements.

[0077] In an embodiment of the present disclosure, for example, if the path length range is specified in advance in the path search constraint as less than or equal to 100 kilometers, then the path length corresponding to the resource in the resource characteristic of the path length greater than 100 kilometers is an invalid resource characteristic, and the paths in the resource with corresponding path lengths greater than 100 kilometers are invalid resources and need to be trimmed.

[0078] In an embodiment of the present disclosure, for example, if the path type is specified as a highway in the path search constraint in advance, the path type corresponding to the low-speed road in the resource characteristic of the path type corresponding to the resource belongs to an invalid resource characteristic, and the low-speed roads in the resource are all invalid resources and need to be trimmed.

[0079] In an embodiment of the present disclosure, for example, if it is specified in advance in the path search constraint that the site type in the resource characteristic remains consistent throughout the entire path and remains the first site type, then the site types other than the first site type in the resource characteristic of the site type corresponding to the resource are invalid resource characteristics, and all sites in the resource other than the sites included in the first site type are invalid resources and need to be trimmed.

[0080] In the disclosed embodiment, the path search constraint may be constraint information input by the user (for example, the user input requires that the entire path is a highway and the path length is less than or equal to 100 kilometers), or it may be constraint information pre-set in the solution.

[0081] In the embodiments of the present disclosure, the trimming object (or filtering condition, i.e., the invalid resource characteristics and / or invalid resources to be trimmed) may not be limited to one. When there are multiple trimming objects, the trimming order may be determined by the priority set by the user (for example, which invalid resource characteristic is to be trimmed first, and / or which invalid resource of the same invalid resource characteristic is to be trimmed first). If the user has no explicit requirement, a default trimming order may be set, for example: trim the link channel first, and then trim the link type; trim the path length first, and then trim the path type.

[0082] In the disclosed embodiment, it is not recommended to have too many overlapping clipping objects during the clipping process, and it is recommended not to exceed 3.

[0083] S13. Clip the resources according to the clipping object to obtain a candidate path atlas.

[0084] In the embodiment of the present disclosure, resources are clipped according to the clipping object to obtain a candidate path atlas, including:

[0085] Construct a path search main graph according to resources, and clip the path search main graph according to clipping objects to obtain a candidate path atlas; and / or,

[0086] The resources are directly clipped according to the clipping object, and the composition is performed according to the clipped resources to obtain a candidate path atlas.

[0087] In the embodiments of the present disclosure, resources are clipped based on the above-mentioned clipping objects, and the resource clipping methods may include but are not limited to: constructing a path search main graph, and clipping the graph based on the path search main graph; or directly clipping resources first, and then composing the graph after clipping; the above-mentioned two resource clipping methods may be selected either one or both resource clipping methods may be adopted.

[0088] In the embodiment of the present disclosure, constructing a path search main graph according to resources, clipping the path search main graph according to clipping objects, and obtaining a candidate path graph set may include:

[0089] A path search main graph is constructed using a node set and a link set; the path search main graph includes: multiple paths;

[0090] Cut out the paths corresponding to invalid resources from the main path search graph;

[0091] According to different parameters of resource characteristics retained in the clipped path search main graph, the clipped path search main graph is split into different fission graphs; the fission graph contains at least one candidate path;

[0092] All the obtained fission graphs constitute a candidate path graph set.

[0093] In the embodiment of the present disclosure, the main topology search graph G0 (referred to as the path search main graph) can be constructed using the node set N and the link set L. The graph G0 is copied as the basis for clipping, and the graph G0 is clipped based on the clipping object, and the path search main graph is fissioned.

[0094] In an embodiment of the present disclosure, for example, the fission process may include: trimming all links that do not satisfy 1 channel from the graph G0, generating an initial fission graph G01, the graph G01 consisting of a node set N and a link set L1 that satisfies 1 channel; 1 channel may contain multiple wavelength parameters, so for the graph G01 that satisfies 1 channel, it can be fissioned into a fission graph for different wavelength parameters, for example, if there are n (n is a positive integer) wavelengths, it can be fissioned into n fission graphs such as G11, G12, G13,..., G1n, etc. If there are new filtering conditions, fission can be continued on the basis of fission graphs G11, G12, G13, ..., G1n respectively. For example, for fission graph G11, all links that do not meet link type A are trimmed from graph G11 to generate fission graph G111 that meets link type A; for fission graph G12, all links that do not meet link type A are trimmed from graph G12 to generate fission graph G121 that meets link type A; ..., and so on, to obtain the final multiple fission graphs.

[0095] In the embodiment of the present disclosure, based on the above-mentioned trimming process, if trimming is only performed on the link channel, a set of all fission graphs satisfying 1 channel G01 = {G11, G12, G13, ..., G1n} can be obtained. Since each fission graph contains one or more candidate paths, the fission graph set can be called a candidate path graph set.

[0096] In an embodiment of the present disclosure, for example, the fission process may include: trimming all links that do not satisfy 3 channels from the graph G0, generating an initial fission graph G03, wherein the graph G03 is composed of a node set N and a link set L3 that satisfies 3 channels; 3 channels may contain multiple wavelength parameters, so for the graph G03 that satisfies 3 channels, it can be fissioned into a fission graph for different wavelength parameters, for example, if there are m (m is a positive integer) wavelengths, it can be fissioned into m fission graphs such as G31, G32, G33,..., G3m, etc. If there are new filtering conditions, fission can be continued on the basis of fission graphs G31, G32, G33, ..., G3n respectively. For example, for fission graph G31, all links that do not meet site type X are trimmed from graph G31 to generate fission graph G311 that meets site type X; for fission graph G32, all links that do not meet site type X are trimmed from graph G32 to generate fission graph G321 that meets site type X; ..., and so on, to obtain the final multiple fission graphs.

[0097] In the embodiment of the present disclosure, based on the above-mentioned trimming process, if trimming is only performed on the link channel, a set of fission graphs G03 = {G31, G32, G33, ..., G3m} that satisfy all 3 channels can be obtained. Since each fission graph contains one or more candidate paths, the fission graph set can be called a candidate path graph set.

[0098] In the disclosed embodiment, for example, the fission process may include: cutting out all paths that do not satisfy path type 1 (such as highways) from graph G0, generating an initial fission graph G04, graph G04 containing all paths that satisfy path type 1; paths that satisfy path type 1 may contain multiple lanes, so for graph G04 that satisfies path type 1, it can be fissioned into a fission graph for different lane parameters, for example, if there are q (q is a positive integer) wavelengths, it can be fissioned into q fission graphs such as G41, G42, G43,..., G4q. If there are new filtering conditions, fission can be continued based on the fission graphs G41, G42, G43, ..., G4q respectively. For example, for the fission graph G41, all paths that do not meet the path length range requirements are trimmed from graph G41 to generate a fission graph G411 that meets the path length range requirements; for the fission graph G42, all paths that do not meet the path length range requirements are trimmed from graph G42 to generate a fission graph G421 that meets the path length range requirements; ... and so on, to obtain the final multiple fission graphs.

[0099] In the embodiment of the present disclosure, based on the above-mentioned trimming process, if trimming is only performed on the path type, a set of fission graphs G04 = {G41, G42, G43, ..., G4q} that satisfy all 3 channels can be obtained. Since each fission graph contains one or more candidate paths, the fission graph set can be called a candidate path graph set.

[0100] In the embodiment of the present disclosure, resources are directly clipped according to the clipping object, and a graph is composed according to the clipped resources to obtain a candidate path atlas, including:

[0101] Prune nodes corresponding to invalid resources from a node set, and / or prune links corresponding to invalid resources from a link set;

[0102] According to different parameters of resource characteristics corresponding to the resources retained by the pruned node set and / or link set, the remaining node set and link set are formed into different fission graphs; the fission graph contains at least one candidate path;

[0103] All the obtained fission graphs constitute a candidate path graph set.

[0104] In the disclosed embodiment, for example, based on the node set N and the link set L, the links that do not satisfy 1 channel can be cut from the link set L to obtain the cut node set N and link set L' having the required channel characteristics, and the cut node set N and link set L' can be used to form a fission graph that satisfies the 1 channel characteristics; wherein 1 channel may contain multiple wavelength parameters, so for the node set N and link set L' that satisfy 1 channel, a fission graph can be constructed for different wavelength parameters, for example, if there are k (k is a positive integer) wavelengths, k fission graphs such as G1, G2, G3, ..., Gk can be constructed respectively, and a fission graph set G = {G1, G2, G3, ..., Gk} that satisfies all 1 channels can be obtained. Since each fission graph contains one or more candidate paths, the fission graph set can be called a candidate path graph set.

[0105] S14. Performing a path search in a candidate path atlas according to preset path requirements and search rules.

[0106] In the embodiment of the present disclosure, the search rules may include but are not limited to: balanced search and / or concentrated search;

[0107] The balanced search includes: traversing each fission graph in the candidate path graph set, and searching for a path that meets the preset path requirements from each fission graph;

[0108] The concentrated search includes: starting from the first fission graph in the candidate path graph set, executing the following search scheme: stopping the search after searching a path that meets the preset path requirements from the currently searched fission graph, and continuing the search for the next fission graph if at least one path that meets the preset path requirements is not found in the currently searched fission graph, until a path that meets the preset path requirements is found, and then stopping the search.

[0109] In the embodiment of the present disclosure, a preset path requirement may be determined before performing a path search. The preset path requirement may include but is not limited to:

[0110] For path search in the communication field: the number of paths to be searched (for example, Z paths need to be searched), signal-to-noise ratio, etc.

[0111] For path search in areas such as road planning and logistics scheduling: the number of paths required to be searched (for example, Z paths need to be searched), quality, etc.

[0112] In the embodiments of the present disclosure, the search rules may include but are not limited to balanced search and / or concentrated search. The balanced search and concentrated search may be performed separately or in combination.

[0113] In an embodiment of the present disclosure, for example, a balanced search may be to traverse a candidate path graph set G = {G1, G2, G3, ..., Gk}, starting from G1 and ending at Gk, searching for the same number of paths from np to nq (i.e., paths from node np to node nq) in each graph, and the number of paths searched in each fission graph is (Z / k) + 1; for example, if 10 paths need to be searched, and there are currently 10 fission graphs in the candidate path graph set, then one path may be searched from each fission graph respectively.

[0114] In the embodiment of the present disclosure, for example, the concentrated search starts from G1 and searches for all paths from np to nq in G1. If the number meets the required number Z, Z paths are returned. If the required number is not met, the search continues in G2, and so on, until Z paths are searched.

[0115] In the embodiment of the present disclosure, the method may further include: implementing the above-mentioned search rules based on a traditional path search algorithm.

[0116] In the embodiments of the present disclosure, traditional path search algorithms may include but are not limited to Dijkstra and KSP (K Shortest Path) algorithms, and the above-mentioned search rules may be implemented by these traditional path search algorithms.

[0117] In the embodiments of the present disclosure, although the traditional path search algorithm has the advantage of searching for paths, in order to meet specific constraints, it is necessary to optimize the path to be selected based on the advantages of the path search. Through the embodiments of the present disclosure, the upper-layer processing of the resources constituting the path is realized, so that the traditional path search algorithm can play its advantages at the bottom layer, thereby integrating the embodiments of the present disclosure with the traditional path search algorithm, which can not only meet traditional needs in path search, but also quickly adapt to new needs.

[0118] In the embodiment of the present disclosure, after performing a path search in the candidate path atlas according to a preset search rule, the following steps may also be included:

[0119] The paths searched from the candidate path set according to the search rule are stored in a preset path list;

[0120] Detecting whether the path list storing the candidate paths meets the preset list requirements;

[0121] In the case where the path list does not meet the list requirements, the candidate paths in the path list are processed according to the list requirements, and the processed path list is returned as the search result;

[0122] In the case where the path list meets the list requirements, the path list storing the candidate paths is returned as the search result.

[0123] In the disclosed embodiment, for example, by traversing the candidate path graph set G = {G1, G2, G3, ..., Gk}, a set of np to nq path lists PL = {PL1, PL2, PL3, ..., PLk} returned in different fission graphs is obtained. The np to nq path lists returned by different fission graphs are sorted into a list PLf; the path list PLf is returned to complete the path search.

[0124] In the embodiment of the present disclosure, before returning the path list PLf, it can be determined whether the path list PLf meets the preset list requirements. If the preset list requirements are met, the process ends; if the preset list requirements are not met, the path list PLf is checked and the list PLf is processed; for example, if the length of PLf is less than Y, the path list PLf is returned directly; if the length is greater than or equal to Y, the first Y paths of the path list PLf are taken and returned.

[0125] In the embodiments of the present disclosure, at least the following advantages are included:

[0126] 1. The embodiments of the present disclosure include "cutting" and "fusion" theories. The core of the cutting theory is to cut invalid resources, so that effective resources are more concentrated and the scope of the solution is narrowed. The core of the fusion theory is to integrate different methods to give full play to their respective advantages. The specific problem solved by the "cutting" theory is the cutting of resources, cutting invalid resources and narrowing the scope of resources. By narrowing the scope of resources, the probability of traditional algorithms returning to valid paths is increased, avoiding wasting time within the scope of invalid resources. The specific problem solved by the "fusion" theory is to integrate the advantages of resource management and traditional path searching, giving full play to the greater advantages to achieve the effect of "1+1>2".

[0127] 2. Since traditional path search algorithms cannot sink some constraints for verification and cannot quickly return paths that meet the constraints within a certain range of path numbers, the disclosed embodiment scheme can perform path search in a graph that meets the characteristic constraints by filtering or trimming resources in the constraint pre-verification. More than 90% of the returned paths meet the characteristic constraints, thereby improving the efficiency of path search. Moreover, the disclosed embodiment scheme not only meets the characteristic requirements, but also gives play to the advantages of traditional path search algorithms and can quickly obtain effective paths that meet the constraints.

[0128] The present disclosure also provides an electronic device 100, such as Figure 5 As shown, the electronic device 100 includes:

[0129] One or more processors 101;

[0130] A memory 102, on which one or more programs are stored. When the one or more programs are executed by the one or more processors 101, the one or more processors 101 implement the path search method;

[0131] One or more input / output I / O interfaces 103 are connected between the processor 101 and the memory 102 and are configured to implement information interaction between the processor 101 and the memory 102 .

[0132] Among them, the processor 101 is a device with data processing capabilities, including but not limited to a central processing unit (CPU) and the like; the memory 102 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH); the I / O interface (read-write interface) 103 is connected between the processor 101 and the memory 102, and can realize information interaction between the processor 101 and the memory 102, including but not limited to a data bus (Bus) and the like.

[0133] In some embodiments, the processor 101 , the memory 102 , and the I / O interface 103 are connected to each other via a bus 104 , and further connected to other components of the computing device.

[0134] In the embodiment of the present disclosure, the electronic device may include but is not limited to: a power supply device, such as a communication power supply device.

[0135] The present disclosure also provides a computer-readable storage medium 200, such as Figure 6 As shown, a computer program is stored on the computer-readable storage medium 200, and the path search method is implemented when the computer program is executed by the processor.

[0136] Those skilled in the art will appreciate that all or some of the functional modules / units disclosed above may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0137] In hardware implementations, the division between functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation.

[0138] Some physical components or all physical components may be implemented as software executed by a processor, such as a central processing unit (CPU), a digital signal processor or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-temporary medium) and a communication medium (or temporary medium). As known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data). Computer storage media include, but are not limited to, random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH) or other disk storage; read-only compact disk (CD-ROM), digital versatile disk (DVD) or other optical disk storage; magnetic cassettes, magnetic tapes, disk storage or other magnetic storage; any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0139] The present disclosure has disclosed example embodiments, and although specific terms are employed, they are used and should be interpreted only in a general illustrative sense and not for limiting purposes. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly stated, features, characteristics, and / or elements described in conjunction with a particular embodiment may be used alone or in combination with features, characteristics, and / or elements described in conjunction with other embodiments. Therefore, those skilled in the art will appreciate that various changes in form and detail may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims

1. A path search method, characterized in that: The method comprises: Get the resources that the path search depends on; Determining a clipping object according to the resource and a preset path search constraint; Clipping the resource according to the clipping object to obtain a candidate path atlas; A path search is performed in the candidate path atlas according to preset path requirements and search rules.

2. The path search method according to claim 1, characterized in that: The clipping object includes invalid resources that need to be clipped; The determining the clipping object according to the resource and the preset path search constraint includes: Determining invalid resource characteristics from the resources according to the path search constraint, and determining the invalid resource from the resources according to the invalid resource characteristics; Wherein, the invalid resources refer to resources that are not required as indicated by the path search constraint; The invalid resource characteristic refers to the resource characteristic corresponding to the invalid resource among the resource characteristics corresponding to the resources.

3. The path search method according to claim 2, characterized in that: The resources include a set of nodes and a set of links in a preset search network; The path search constraint is a constraint imposed on the node set and / or the link set according to any one or more of the resource characteristics; The resource characteristics include any one or more of the following: link channel, link type and subdivision characteristics; the subdivision characteristics are characteristics for constraining the node set and the link set based on the link channel and / or the link type, and the subdivision characteristics include any one or more of the following: site type, relay, wave hopping and resource phase-in.

4. The path search method according to claim 2, characterized in that: The step of clipping the resource according to the clipping object to obtain a candidate path atlas includes: Constructing a path search main graph according to the resources, clipping the path search main graph according to the clipping object, and obtaining the candidate path graph set; and / or, The resources are directly clipped according to the clipping object, and a composition is performed according to the clipped resources to obtain the candidate path atlas.

5. The path search method according to claim 4, characterized in that: The resources include a node set and a link set; The step of constructing a path search main graph according to the resources, and clipping the path search main graph according to the clipping object to obtain the candidate path graph set includes: The node set and the link set are used to construct the path search main graph; the path search main graph includes: multiple paths; Cutting the path corresponding to the invalid resource from the path search main graph; fissioning the cut path search main graph into different fission graphs according to different parameters of resource characteristics retained by the cut path search main graph; the fission graph contains at least one candidate path; The candidate path atlas is formed by all the fission graphs obtained.

6. The path search method according to claim 4, characterized in that: The resources include a node set and a link set; the step of directly clipping the resources according to the clipping object, and composing a graph according to the clipped resources to obtain the candidate path graph set includes: Pruning the nodes corresponding to the invalid resources from the node set, and / or pruning the links corresponding to the invalid resources from the link set; According to different parameters of resource characteristics corresponding to the resources retained by the pruned node set and / or link set, the remaining node set and link set are used to form different fission graphs; the fission graph contains at least one candidate path; The candidate path atlas is formed by all the fission graphs obtained.

7. The path search method according to claim 1, characterized in that: The search rules include: balanced search and / or concentrated search; The balanced search includes: traversing each fission graph in the candidate path graph set, and searching for a path that meets the preset path requirements from each fission graph; The centralized search includes: starting from the first fission graph in the candidate path graph set, executing the following search scheme: stopping the search after searching a path that meets the preset path requirement from the currently searched fission graph, and continuing to search the next fission graph if at least one path that meets the preset path requirement is not found in the currently searched fission graph, until a path that meets the preset path requirement is found, and then stopping the search; The path requirement includes: the number of paths and / or the signal-to-noise ratio.

8. The path search method according to claim 7, characterized in that: The method further comprises: The search rules are implemented based on a traditional path search algorithm.

9. An electronic device, characterized in that: The electronic device comprises: one or more processors; A memory having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the path search method according to any one of claims 1 to 8; One or more input / output I / O interfaces are connected between the processor and the memory and are configured to implement information interaction between the processor and the memory.

10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the path search method according to any one of claims 1 to 8.

Images