CN114239192A - Path searching method, electronic device and storage medium - Google Patents

Path searching method, electronic device and storage medium Download PDF

Info

Publication number
CN114239192A
CN114239192A CN202010943576.7A CN202010943576A CN114239192A CN 114239192 A CN114239192 A CN 114239192A CN 202010943576 A CN202010943576 A CN 202010943576A CN 114239192 A CN114239192 A CN 114239192A
Authority
CN
China
Prior art keywords
path
node
guide
network structure
target
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010943576.7A
Other languages
Chinese (zh)
Inventor
冯斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN202010943576.7A priority Critical patent/CN114239192A/en
Priority to PCT/CN2021/117429 priority patent/WO2022052986A1/en
Publication of CN114239192A publication Critical patent/CN114239192A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/04—Constraint-based CAD

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Geometry (AREA)
  • Marketing (AREA)
  • Mathematical Optimization (AREA)
  • Operations Research (AREA)
  • Evolutionary Computation (AREA)
  • Development Economics (AREA)
  • Computer Hardware Design (AREA)
  • Game Theory and Decision Science (AREA)
  • Pure & Applied Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Mathematical Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computational Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the application relates to the field of computers, in particular to a path searching method, electronic equipment and a storage medium. The method for fault location provided by the embodiment of the application comprises the following steps: the method for searching the path comprises the following steps: constructing a first network structure chart according to the network information of the network to be searched; acquiring a guide node of a first network structure diagram; generating a guide path according to the guide node, wherein the guide path is used for indicating the direction of path search; and generating a target path of the first network structure diagram according to the guide path. By adopting the path searching method in the embodiment, the speed and the accuracy of path searching can be improved.

Description

Path searching method, electronic device and storage medium
Technical Field
The embodiment of the application relates to the field of computers, in particular to a path searching method, electronic equipment and a storage medium.
Background
With the development of network technology, especially the arrival of 5G technology, the complexity of the network increases dramatically, the structure of the network becomes more and more complex, and the path search also becomes more and more complex. For example, in network traffic transmission, the searched path needs to guarantee not only the transmission of local traffic but also the transmission of all traffic of the network. As network traffic increases, special requirements, such as the increase of necessary constraints, all lead to the difficulty of path search. The disturbillus algorithm is currently used to find a transmissible path for all traffic. The search feature of the distesla algorithm is to expand outward centered on the starting point until it expands to the ending point.
However, the path searched by the algorithm of the distesla may not meet other constraints, such as not including a specific node; the paths returned one by one may be concentrated in a certain invalid direction, which results in repeated invalid searches, and reduces the search efficiency and accuracy of the path search.
Disclosure of Invention
The embodiment of the application mainly aims to provide a path searching method, an electronic device and a storage medium, which can improve the speed and accuracy of path searching.
In order to achieve the above object, an embodiment of the present application provides a method for path search, including: constructing a first network structure chart according to the network information of the network to be searched; acquiring a guide node of a first network structure diagram; generating a guide path according to the guide node, wherein the guide path is used for indicating the direction of path search; and generating a target path of the first network structure diagram according to the guide path.
In order to achieve the above object, an embodiment of the present application further provides an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of path searching described above.
To achieve the above object, an embodiment of the present application further provides a computer-readable storage medium storing a computer program, where the computer program is executed by a processor to implement the above path searching method.
According to the path searching method, the first network structure diagram is constructed according to the network information of the network to be searched, the guide path is generated by setting the guide node, and the guide path can indicate the path searching direction, so that the path searching direction can be corrected, repeated searching in an invalid direction is reduced, and the searching accuracy is improved; meanwhile, the search in the invalid direction is not required to be repeated, so that the search speed is increased, the search efficiency is improved, and the waste of search resources is reduced.
Drawings
Fig. 1 is a flowchart of a method of path searching provided in accordance with a first embodiment of the present invention;
fig. 2 is a flow chart of a method of path searching provided in accordance with a second embodiment of the present invention;
fig. 3 is a schematic diagram of a first network architecture in a path search method according to a second embodiment of the present invention;
fig. 4 is a block diagram of a structure of a network to be searched provided in a second embodiment according to the present invention;
fig. 5 is a flowchart of a method of path searching provided in accordance with a third embodiment of the present invention;
fig. 6 is a block diagram of the structure of an electronic apparatus provided in the fourth embodiment according to the present invention.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present application clearer, the embodiments of the present application will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that in the examples of the present application, numerous technical details are set forth in order to provide a better understanding of the present application. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments. The following embodiments are divided for convenience of description, and should not constitute any limitation to the specific implementation manner of the present application, and the embodiments may be mutually incorporated and referred to without contradiction.
The first embodiment of the present invention relates to a method for path search, the flow of which is shown in fig. 1:
step 101: and constructing a first network structure diagram according to the network information of the network to be searched.
Step 102: a bootstrap node of a first network structure graph is obtained.
Step 103: and generating a guide path according to the guide node, wherein the guide path is used for indicating the direction of path search.
Step 104: and generating a target path of the first network structure diagram according to the guide path.
According to the path searching method, the first network structure diagram is constructed according to the network information of the network to be searched, the guide path is generated by setting the guide node, and the guide path can indicate the path searching direction, so that the path searching direction can be corrected, repeated searching in an invalid direction is reduced, and the searching accuracy is improved; meanwhile, the search in the invalid direction is not required to be repeated, so that the search speed is increased, the search efficiency is improved, and the waste of search resources is reduced.
The second embodiment of the present invention relates to a method for path search, which is applied to an electronic device, such as a server, or is deployed at a server. The second embodiment is a specific description of the steps 101-104 in the first embodiment, and the flow thereof is specifically shown in fig. 2:
step 201: and constructing a first network structure diagram according to the network information of the network to be searched.
Specifically, the network to be searched may be a data transmission network in practical application, a scheduling network, or the like. The present application describes the path search method by taking a transmission network as an example. Acquiring site information of each site and connection information of each site in the network to be searched, taking each site as a node, and taking each site information as node information of a corresponding node; the connection information between the stations is used as an edge between the nodes, and the station information may include transmission rate, bandwidth, location information, and the like. And forming the first network structure chart according to the nodes, the node information and the edges.
Step 202: a bootstrap node of a first network structure graph is obtained.
There are various ways to acquire the bootstrap node, for example, a randomly acquired node is used as the bootstrap node; or acquiring a node corresponding to the designated label as a guide node.
Specifically, a node may be randomly selected from the first network structure diagram as a bootstrap node. Or may be a bootstrap node that acquires user specifications. The node information further includes label information of the node, where the label information is used to indicate an attribute of the node, for example, the label information a may be used to indicate that the node corresponding to the label information a is a regular node, and the label information B may indicate that the node corresponding to the label information B is a must-pass node; the designated label may be label information indicating that the node belongs to a must-pass node.
In another example, a pre-designated geographic area may be obtained, and nodes in the designated geographic area are searched, and one node in the designated geographic area is arbitrarily selected as a guidance node. For example, if the designated area is X, then a node may be randomly selected as a leading node in the X area.
The designated direction can also be acquired, and the nodes belonging to the designated direction can be randomly acquired as the guide nodes.
In another example, a node directly connected to the start node may also be obtained as a direct connection node; and acquiring the guide node from nodes except the direct connection node.
Specifically, a node directly connected to the start node is obtained as a direct node, for example, as shown in fig. 3, if the start node is a node a, and nodes directly connected to the node a are a node B, a node C, and a node D, then the node B, the node C, and the node D are used as the direct connection nodes, and the remaining nodes are a node E and a node F, then one of the node E and the node F may be selected as a guidance node. The selection mode may be the random selection mode described above, or may be obtained according to the designated tag.
Step 203: and acquiring an initial node and a target node of the path search.
The starting node and the target node of the path search may be determined according to the received search task, and the search task may be transmitted by other terminals or the current network.
Step 204: a first path from the start node to the lead node is searched, and a second path from the target node to the lead node is searched.
Specifically, a dijkstra algorithm may be employed to search for a first path from the start node to the lead node and to search for a second path from the target node to the lead node. For example, the starting node is marked as np, the target node is marked as nq, and the leading node is marked as nk; then, in the first network structure diagram, the dijkstra algorithm is used to search all paths from np to nk, and the searched path may be used as the first path. That is to say, in this example, the first path may include 1 path from the start node to the guidance node, or may include 2 or more paths from the start node to the guidance node, and the second path includes 1 path from the target node to the guidance node, or may include 2 or more paths from the target node to the guidance node.
Step 205: and acquiring a guide path from the first path and the second path according to a preset strategy.
In one example, the preset policy includes: and selecting the path with the least number of nodes. For example, if the preset policy is a path with the least number of nodes in the selected path; recording the initial node as np, the target node as nq and the guide node as nk; the first path comprises p1, p2, and p 3; the second path includes p4, p5, and p 6; according to the preset strategy, a path with the minimum number of nodes can be selected from the first path and marked as P1, and a path with the minimum number of nodes can be selected from the second path and marked as P2; and selecting the path with the least number of nodes from the P1 and the P2 as a guide path and recording the path as Pk. Of course, the path with the least number of nodes may be directly selected from p1, p2, p3, p4, p5, and p6 as the guiding path.
In another example, the predetermined policy includes selecting the path with the shortest path. For example, if the preset strategy is to select the path with the shortest path; recording the initial node as np, the target node as nq and the guide node as nk; the first path comprises p1, p2, and p 3; the second path includes p4, p5, and p 6; according to the preset strategy, the shortest path is selected from the first paths and marked as P1, and the shortest path is selected from the second paths and marked as P2; and selecting the path with the least number of nodes from the P1 and the P2 as a guide path, and recording the path as Pk. Of course, the shortest path can be directly selected from p1, p2, p3, p4, p5 and p6 as the guiding path.
Step 206: and acquiring nodes except the guide node in the guide path as filter nodes.
Specifically, each node in the guidance node is acquired, and nodes other than the guidance node are taken as filtering nodes. For example, the guiding path Pk includes nodes np, n1, n2, n3 and nk, respectively, wherein the guiding node is nk, and then np, n1, n2 and n3 are all used as filtering nodes.
Step 207: and deleting the filtering nodes from the first network structure diagram to generate a second network structure diagram.
Specifically, the filtering node may be deleted from the first network configuration diagram to generate the second network configuration diagram.
Step 208: and acquiring a third path from the guide node to a sink node in the second network structure diagram, wherein the sink node is a target node or an initial node.
Specifically, if the guiding path is a path from the starting node to the guiding node, determining that the destination node is a target node; and if the guide path is the path from the target node to the guide node, determining the sink node as the starting node. And searching a third path from the guide node to the host node by adopting a dijkstra algorithm, wherein other searching algorithms can be adopted for obtaining the third path in the second network structure diagram.
Step 209: and splicing the guide path and the third path to form a target path of the first network structure diagram.
Specifically, the guiding path and the third path are spliced, and the spliced path is used as a target path in the first network structure diagram.
The traditional Dijkstra algorithm searches paths easily in one direction infinitely, the paths meeting specific constraint conditions cannot be returned within a certain path quantity range, and the searching direction can be quickly determined by guiding nodes, so that the searching for many times in the invalid direction is avoided, the effective paths meeting special constraints can be quickly searched, and the path searching efficiency is improved. Meanwhile, in this example, a second network structure diagram is regenerated according to the guiding path, and the second network structure diagram is searched, in this example, the second network structure diagram adopts the traditional dijkstra to generate a third path, and by splicing the guiding path and the third path, the path search can reduce the search of invalid paths and combine the advantages of the dijkstra algorithm, so that the target path can be obtained quickly.
In this example, to facilitate understanding of the application scenario of the path search, a specific application scenario is described below. For example, the structure of a network design and planning system is shown in fig. 4, which includes: the system mainly comprises an engineering module, a network module, a business module, a design module, a planning module, a configuration module and a report module. The engineering module is used for completing the creation of a network and generating a basic engineering network, wherein the basic engineering network comprises sites and optical fibers and supports the import and export of network engineering; the network module is used for completing basic configuration of a network, such as site equipment type configuration and the like; the service module is used for completing the functions of creating, importing, exporting and the like of the service in the network; the design module is used for finishing the design of a network transmission link; the planning module is used for finishing the planning of service transmission paths and required resources in the network; the configuration module is used for counting the resource configuration generated by the service planning in the network; and the report module is used for outputting the network planning and the configured resources in a report form. The path searching method in this example may be applied to a planning module in the network design and planning system, and is used to search a data transmission path, so as to plan a reasonable data transmission path.
The third embodiment of the present invention relates to a method for searching a path, and the third embodiment of the present invention is a further improvement of the second embodiment, and the main improvement lies in that: before the guide path and the third path are spliced to form the target path of the first network structure diagram, whether the third path meets the constraint condition or not is judged. The third embodiment is shown in fig. 5:
step 301: and constructing a first network structure diagram according to the network information of the network to be searched.
Step 302: a bootstrap node of a first network structure graph is obtained.
Step 303: and acquiring an initial node and a target node of the path search.
Step 304: a first path from the start node to the lead node is searched, and a second path from the target node to the lead node is searched.
Step 305: and acquiring a guide path from the first path and the second path according to a preset strategy.
Step 306: and acquiring nodes except the guide node in the guide path as filter nodes.
Step 307: and deleting the filtering nodes from the first network structure diagram to generate a second network structure diagram.
Step 308: and acquiring a third path from the guide node to a sink node in the second network structure diagram, wherein the sink node is a target node or an initial node.
Steps 301 to 308 are substantially the same as steps 201 to 208 in the second embodiment, and will not be described herein again.
Step 309: judging whether the third path meets a preset constraint condition, if so, executing step 310; and if the judgment result indicates that the third path does not meet the constraint condition, returning to the step 302.
Specifically, preset constraint conditions, for example, respective must-pass nodes and the like, are acquired. If the third path does not satisfy the preset constraint condition, which indicates that the guiding path does not function as a correction searching path, the step 302 may be executed to re-acquire the guiding node.
It should be noted that, before determining whether the third path meets the preset constraint condition, the preset constraint condition may be updated. Because the guide path is determined, the constraint condition which is met by the guide path can be deleted from the preset constraint condition, and the preset constraint condition is updated; that is, when a path is searched in the second network configuration diagram, a path search is performed using a new constraint condition. For example, the preset constraints include: after the node a and the node B, if the node a has already passed through the guiding path, the updated constraint condition includes: through the node B.
If the third path has satisfied the preset constraint, step 310 is executed.
Step 310: and splicing the guide path and the third path to form a target path of the first network structure diagram.
Step 311: and detecting that the target path is a path from the target node to the initial node, and reversing the direction of the target path so that the target path is a path from the initial node to the target node.
Specifically, if there is directionality in the network to be searched, when it is detected that the target path is a path from the target node to the start node, the target path may be inverted so that the target path is a path from the start node to the target node.
In the path searching method in this example, before the guide path and the third path are spliced, the third path is verified, so that the validity of the third path can be ensured, and if the third path does not meet the preset constraint condition, the guide path does not have the function of correcting the searching direction, and the accuracy of path searching can be improved by reacquiring the guide node until an accurate guide node is acquired.
A fourth embodiment of the present invention relates to an electronic device, a block diagram of which is shown in fig. 6, the electronic device including: at least one processor 401; and a memory 402 communicatively coupled to the at least one processor 401; the memory 402 stores instructions executable by the at least one processor 401, and the instructions are executed by the at least one processor 401, so that the at least one processor 401 can execute the above-mentioned path searching method.
The memory and the processor are connected by a bus, which may include any number of interconnected buses and bridges, linking together one or more of the various circuits of the processor and the memory. The bus may also link various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor is transmitted over a wireless medium via an antenna, which further receives the data and transmits the data to the processor.
The processor is responsible for managing the bus and general processing and may also provide various functions including timing, peripheral interfaces, voltage regulation, power management, and other control functions. And the memory may be used to store data used by the processor in performing operations.
A fifth embodiment of the present invention relates to a computer-readable storage medium storing a computer program which, when executed by a processor, implements the above-described fault location method.
Those skilled in the art can understand that all or part of the steps in the method of the foregoing embodiments may be implemented by a program to instruct related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, etc.) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples for carrying out the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.

Claims (10)

1. A method of path searching, comprising:
constructing a first network structure chart according to the network information of the network to be searched;
acquiring a guide node of the first network structure diagram;
generating a guide path according to the guide node, wherein the guide path is used for indicating the direction of path search;
and generating a target path of the first network structure diagram according to the guide path.
2. The method of path search according to claim 1, wherein the generating a guidance path according to the guidance node comprises:
acquiring an initial node and a target node of path search;
searching for a first path from the start node to the lead node and searching for a second path from the target node to the lead node;
and acquiring a guide path from the first path and the second path according to a preset strategy.
3. The method of claim 2, wherein the generating the target path of the first network structure diagram according to the guiding path comprises:
acquiring nodes except the guide node in the guide path as filter nodes;
deleting the filtering node from the first network structure diagram to generate a second network structure diagram;
acquiring a third path from the guide node to a sink node in the second network structure diagram, wherein the sink node is the target node or the starting node;
and splicing the guide path and the third path to form a target path of the first network structure diagram.
4. The method of claim 3, wherein before said splicing the guide path and the third path to form the target path of the first network configuration map, the method further comprises:
judging whether the third path meets a preset constraint condition or not, and acquiring a judgment result;
if the judgment result indicates that the third path meets the constraint condition, executing the step of splicing the guide path and the third path to form a target path of the first network structure diagram;
and if the judgment result indicates that the third path does not meet the constraint condition, returning to the step of executing the step of obtaining the guide node of the first network structure diagram and generating the guide path until the regenerated third path meets the constraint condition.
5. The method of claim 3 or 4, wherein after said splicing the guiding path and the third path to form a target path of the first network structure diagram, the method further comprises:
and detecting that the target path is a path from the target node to the starting node, and reversing the direction of the target path so as to enable the target path to be a path from the starting node to the target node.
6. The method of claim 2, wherein the predetermined policy comprises: and selecting the path with the least number of nodes or selecting the path with the shortest path.
7. The method of claim 1, wherein the obtaining the bootstrap node of the first network structure diagram comprises:
taking the randomly acquired node as the guide node;
or acquiring a node corresponding to the designated label as the guide node.
8. The method of claim 2, wherein the obtaining the bootstrap node of the first network structure diagram comprises:
acquiring a node directly connected with the starting node as a direct connection node;
and acquiring the guide node from nodes except the direct connection node.
9. An electronic device, comprising: at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of path searching as claimed in any one of claims 1 to 8.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method of path search according to any one of claims 1 to 8.
CN202010943576.7A 2020-09-09 2020-09-09 Path searching method, electronic device and storage medium Pending CN114239192A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202010943576.7A CN114239192A (en) 2020-09-09 2020-09-09 Path searching method, electronic device and storage medium
PCT/CN2021/117429 WO2022052986A1 (en) 2020-09-09 2021-09-09 Path searching method, electronic device, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010943576.7A CN114239192A (en) 2020-09-09 2020-09-09 Path searching method, electronic device and storage medium

Publications (1)

Publication Number Publication Date
CN114239192A true CN114239192A (en) 2022-03-25

Family

ID=80630270

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010943576.7A Pending CN114239192A (en) 2020-09-09 2020-09-09 Path searching method, electronic device and storage medium

Country Status (2)

Country Link
CN (1) CN114239192A (en)
WO (1) WO2022052986A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117852731A (en) * 2023-12-06 2024-04-09 珠海市规划设计研究院 Multi-target point path searching method, system and medium for corner ripple thinking

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5720441B2 (en) * 2011-06-30 2015-05-20 富士通株式会社 Route search program, route search device, and route search method
CN103425753A (en) * 2013-07-24 2013-12-04 浙江大学 Method for searching for heuristic shortest path based on direction optimization
US9599483B2 (en) * 2015-06-24 2017-03-21 Futurewei Technologies, Inc. Region guided and change tolerant fast shortest path algorithm and graph preprocessing framework
CN108268971B (en) * 2017-12-06 2021-12-07 腾讯科技（深圳）有限公司 Path searching method, device, processor and electronic device
CN110967015B (en) * 2019-11-20 2021-11-12 中国人民解放军国防科技大学 Path planning method and system
CN111309004A (en) * 2019-12-06 2020-06-19 江苏南大电子信息技术股份有限公司 Mobile robot path planning method based on improved jumping point search algorithm

Also Published As

Publication number Publication date
WO2022052986A1 (en) 2022-03-17

Similar Documents

Publication Publication Date Title
CN108681565B (en) Block chain data parallel processing method, device, equipment and storage medium
CN111006682A (en) Navigation route planning method and device, electronic equipment and storage medium
CN111312352B (en) Data processing method, device, equipment and medium based on block chain
CN105550225A (en) Index construction method and query method and apparatus
WO2022012576A1 (en) Path planning method and apparatus, path planning device, and storage medium
CN109508912B (en) Service scheduling method, device, equipment and storage medium
CN104079623A (en) Method and system for controlling multilevel cloud storage synchrony
CN114239192A (en) Path searching method, electronic device and storage medium
CN114003775A (en) Graph data processing and querying method and system
CN116055381A (en) Routing table updating method and device based on many-core system and electronic equipment
CN113108806A (en) Path planning method, device, equipment and medium
CN112559483A (en) HDFS-based data management method and device, electronic equipment and medium
CN115470108A (en) Gateway route testing method and device for vehicle, electronic equipment and storage medium
CN114693220A (en) Algorithm warehouse management method and system based on digital twin DaaS platform
US20230072145A1 (en) Method, terminal device and medium for screening gradient points, method and system for calculating gradient
CN110782215B (en) Goods source determining method, device, equipment and storage medium
CN109978678B (en) Parameter management method and related equipment
CN115188190B (en) Updating method and device of traffic data processing mode and vehicle-road cooperative system
CN116644215B (en) Data updating method and system of cross-organization structure
CN114199227B (en) Navigation path planning method and device
CN110347711B (en) Fragment storage graph database query method and device
CN112685175B (en) Construction method and device of service topological graph and computer readable storage medium
CN116737088B (en) Object migration method and device, electronic equipment and storage medium
US20240219196A1 (en) System and method for validating high-definition maps
CN112422306B (en) Method and device for configuring optical network relay

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination