Position-based information processing method and device

Abstract

The embodiment of the invention discloses a position-based information processing method and device. According to the embodiment of the invention, the method comprises the steps: obtaining the urban road network data, and carrying out the road network partitioning of an urban road network according to the urban road network data, so as to determine a multi-level road network partitioning structure; road network layering is carried out on each basic road network unit in a basic level road network partition structure in the multi-level road network partition structure to determine a road network layered structure corresponding to each basic road network unit, and a road network fusion data structure is constructed according to the multi-level road network partition structure and each road network layered structure; and when a route planning request is received, planning a target route according to the road network fusion data structure. Wherein the subarea fine granularity of the basic level road network subarea structure in the multi-level road network subarea structure is the highest. Therefore, the route calculation service is provided by combining the road network partitioning technology and the road network layering technology, and the route calculation method and device can meet the relevant requirements of the instant distribution scene for the route calculation efficiency and quality.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of data processing, in particular to a location-based information processing method and device. BACKGROUND

[0002] The instant delivery scenario is a logistics service scenario with high timeliness requirements. Compared with the traditional delivery scenario, the instant delivery scenario requires the delivery personnel to deliver the goods purchased by the user to the user within a certain time. To this end, the instant delivery scenario usually has high requirements for the route calculation efficiency and quality of the provided route calculation service. However, the current route calculation service is usually provided based on road network partitioning technology or road network layering technology. The route calculation service provided based on the road network partitioning technology or the road network layering technology has its own limitations, which cannot meet the related requirements of the instant delivery scenario for the route calculation efficiency and quality. SUMMARY

[0003] Therefore, the embodiments of the present application provide a location-based information processing method and device to meet the related requirements of the instant delivery scenario for the route calculation efficiency and quality.

[0004] In a first aspect, the embodiments of the present application aim to provide a location-based information processing method, which comprises: obtaining city road network data; performing road network partitioning on the city road network according to the city road network data to determine a multi-level road network partitioning structure, wherein the multi-level road network partitioning structure comprises a basic-level road network partitioning structure, the basic-level road network partitioning structure has the highest partitioning granularity in the multi-level road network partitioning structure, and the basic-level road network partitioning structure comprises a plurality of basic road network units; performing road network layering on each basic road network unit to determine a road network layering structure corresponding to each basic road network unit; constructing a road network fusion data structure according to the multi-level road network partitioning structure and each road network layering structure; in response to receiving a route planning request, planning a target route according to the road network fusion data structure.

[0005] In a second aspect, the embodiments of the present application aim to provide a location-based information processing device, which comprises: a data obtaining unit configured to obtain city road network data; The road network partition unit is configured to perform road network partition on the urban road network according to the urban road network data, to determine a multi-level road network partition structure, wherein the multi-level road network partition structure comprises a basic-level road network partition structure, and the basic-level road network partition structure has the highest partition granularity in the multi-level road network partition structure, and the basic-level road network partition structure comprises a plurality of basic road network units; The road network layering unit is configured to perform road network layering on each of the basic road network units, to determine a road network layering structure corresponding to each of the basic road network units; The data structure fusion unit is configured to construct a road network fusion data structure according to the multi-level road network partition structure and the road network layering structures. The route determination unit is configured to, in response to receiving a route planning request, plan a target route according to the road network fusion data structure.

[0006] In a third aspect, an embodiment of the present application aims to provide a computer-readable storage medium having computer program instructions stored thereon, the computer program instructions, when executed by a processor, implementing the method of the first aspect.

[0007] In a fourth aspect, an embodiment of the present application aims to provide an electronic device, the device comprising: a memory configured to store one or more computer program instructions; a processor configured to execute the one or more computer program instructions to implement the method of the first aspect.

[0008] In a fifth aspect, an embodiment of the present application aims to provide a computer program product, which, when running on a computer, causes the computer to execute the method of the first aspect.

[0009] An embodiment of the present application can obtain urban road network data, perform road network partition on the urban road network according to the urban road network data to determine a multi-level road network partition structure, perform road network layering on each of the basic road network units in the basic-level road network partition structure in the multi-level road network partition structure to determine a road network layering structure corresponding to each of the basic road network units, construct a road network fusion data structure according to the multi-level road network partition structure and the road network layering structures, and then, in response to receiving a route planning request, plan a target route according to the road network fusion data structure. The basic-level road network partition structure has the highest partition granularity in the multi-level road network partition structure. Thus, by combining road network partition technology and road network layering technology to provide route calculation services, an embodiment of the present application can meet the related requirements of instant delivery scenarios for route calculation efficiency and quality. BRIEF DESCRIPTION OF DRAWINGS

[0010] The above and other objects, features and advantages of the present application will become more apparent from the following description when taken in conjunction with the accompanying drawings, in which: Figure 1 A schematic diagram of an application system of the information processing method of the embodiment of the present application; Figure 2 A flowchart of the information processing method of the embodiment of the present application; Figure 3 A schematic diagram of a single-layer road network partition structure of the embodiment of the present application; Figure 4 A schematic diagram of a single-layer road network partition structure of the embodiment of the present application; Figure 5 A schematic diagram of shortcut information of the embodiment of the present application; Figure 6 A flowchart of a shortcut information determination method of the embodiment of the present application; Figure 7 A schematic diagram of a road network hierarchical structure of the embodiment of the present application; Figure 8 A flowchart of a road network hierarchical structure determination method of the embodiment of the present application; Figure 9 A schematic diagram of a road network fusion data structure of the embodiment of the present application; Figure 10 A flowchart of a route planning method of the embodiment of the present application; Figure 11 A flowchart of a bidirectional search method of the embodiment of the present application; Figure 12 A flowchart of a forward search method of the embodiment of the present application; Figure 13 A flowchart of a reverse search method of the embodiment of the present application; Figure 14 A flowchart of a first search node determination method of the embodiment of the present application; Figure 15 A flowchart of a second search node determination method of the embodiment of the present application; Figure 16 A flowchart of a target hierarchical road network partition structure determination method of the embodiment of the present application; Figure 17 A schematic diagram of a target route of the embodiment of the present application; Figure 18 A flowchart of a road network updating method of the embodiment of the present application; Figure 19 A schematic diagram of an information processing device of the embodiment of the present application; Figure 20 A schematic diagram of an electronic device of the embodiment of the present application. DETAILED DESCRIPTION

[0011] The present application is described in the following based on examples, but the present application is not limited to these examples only. In the following detailed description of the present application, some specific details are described in detail. The present application can also be fully understood without the description of these details by those skilled in the art. In order to avoid obscuring the essence of the present application, well-known methods, processes, procedures, elements and circuits are not described in detail.

[0012] In addition, those of ordinary skill in the art should understand that the drawings provided herein are for illustrative purposes only and are not necessarily drawn to scale.

[0013] Unless the context clearly requires otherwise, throughout the description, the words "comprise", "comprising", and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in the sense of "including, but not limited to".

[0014] In the description of the present application, it is to be understood that the terms "first", "second" and the like are used only for the purpose of description and are not to be construed as indicating or implying relative importance. In addition, in the description of the present application, unless otherwise stated, the meaning of "a plurality of" is two or more.

[0015] The solutions described in the specification and examples, if involving personal information processing, will be processed on the premise of legal basis (for example, obtaining the consent of the subject of personal information, or being necessary for the performance of a contract, etc.), and only within the prescribed or agreed range. Users who refuse to process personal information other than the necessary information required for basic functions will not affect the user's use of basic functions.

[0016] The technical solutions of the present application can be applied to the transaction and distribution service of instant e-commerce platforms, such as Taobao flash shopping, Taofxian, Eleme takeout and retail, etc.

[0017] Figure 1 The application system of the information processing method of the embodiment of the present application is shown in the figure. As shown in the figure, the application system includes a terminal 11, a task server 12 and a line calculation server 13. Figure 1

[0018] ​In this embodiment, terminal 11 and task server 12 are devices requesting route calculation services. Terminal 11 and task server 12 can interact with route calculation server 13 to instruct it to provide route calculation services. Optionally, terminal 11 can be any type of terminal device, such as a smartphone, tablet, wearable device, or laptop held by a user, delivery person, or merchant. Task server 12 can be a task server used to process corresponding tasks in the order delivery process. Further, after obtaining route information, terminal 11 and task server 12 can provide corresponding services to users, delivery persons, or merchants based on the route information, or process corresponding tasks based on the route information.

[0019] The line computing server 13 is a general-purpose data processing device used to provide computing or application services. In this embodiment, the line computing server 13 can be used to construct a road network fusion data structure and provide line computing services to the terminal 11 and the task server 12 based on the road network fusion data structure. Optionally, the line computing server 13 can be a single computer, a cluster of multiple computers, or a cloud server that flexibly adjusts computing resources through cloud technology; this application does not impose any limitations on this. Furthermore, the line computing server 13 can be a server used to provide line computing services alone, or a server used to provide line computing services and other services simultaneously; this application does not impose any limitations on this.

[0020] Specifically, in Figure 1 In the application system shown, before providing route calculation services to terminal 11 and task server 12, route calculation server 13 can first acquire urban road network data, and then partition the urban road network according to the urban road network data to determine a multi-level road network partition structure. Next, it further partitions each basic road network unit within the basic level road network partition structure (the finest level of the multi-level road network partition structure) to determine the corresponding road network layer structure, thereby constructing a road network fusion data structure based on the multi-level road network partition structure and each road network layer structure. After constructing the fusion data structure, route calculation server 13 can begin receiving route calculation requests sent by terminal 11 or task server 12, and upon receiving a route calculation request, it plans the target route for terminal 11 or task server 12 according to the fusion data structure.

[0021] It is intended to illustrate that, in the embodiment of the application, when the route calculation server 13 provides the route calculation service to the terminal 11 or the task server 12, the multi-level road network partition structure in the road network fusion data structure can be used to support the route calculation server 13 to quickly determine the part of the route in the target route in a query manner, and each road network layer structure in the road network fusion data structure can be used to guide the route generation direction of the route calculation server 13 to assist the server to generate the route. Therefore, by combining the road network partition technology and the road network layering technology to provide the route calculation service, the embodiment of the application can meet the related requirements of the instant delivery scene for the efficiency and quality of the route calculation.

[0022] Optionally, the route calculation server 13 and the terminal 11 or the task server 12 can be connected through a wireless communication network to realize data interaction. The wireless communication network can include any one or a combination of 5G mobile communication network technology (5th-Generation, 5G) system, long term evolution (long term evolution, LTE) system, global system for mobile communication (Global System for Mobile Communication, GSM), Bluetooth (Bluetooth, BT), Wireless Fidelity (Wireless Fidelity, Wi-Fi), Code Division Multiple Access (Code Division Multiple Access, CDMA) network, wideband code division multiple access (wideband code division multiple access, WCDMA) network, long range wireless communication (Long Range, Lora) technology or Zigbee protocol (Zigbee).

[0023] Figure 2 The flowchart of the information processing method of the embodiment of the application is shown. It should be understood that, Figure 2 The execution subject of the information processing method shown can be the route calculation server (hereinafter referred to as the server) in the above embodiment. As shown in the above embodiment, Figure 2 As shown, the information processing method can specifically include the following steps: Step S100, acquiring city road network data.

[0024] Specifically, the server can acquire city road network data. The city road network can be a city road network. The city road network data can be a data set describing the city road network. The city road network data can include road-related information of each road in the city road network, such as road position, road shape, road attribute, and road topology relationship.

[0025] Optionally, in step S100, the server can acquire the urban road network data by receiving uploading data. Alternatively, the server can also acquire the urban road network data by querying the data published by the server on the urban road network website, which is not limited in the present application.

[0026] In step S200, the urban road network is divided into road network partitions according to the urban road network data to determine a multi-level road network partition structure.

[0027] Specifically, after acquiring the urban road network data, the server can divide the urban road network into road network partitions according to the urban road network data to determine a multi-level road network partition structure.

[0028] It is to be explained that, in the embodiments of the present application, dividing the urban road network into road network partitions can mean that the server divides the urban road network into regions at different partition granularities in multiple levels. The multi-level road network partition structure can be understood as the result of dividing the urban road network into regions in multiple levels. Different levels of road network partition structures in the multi-level road network partition structure can correspond to different partition granularities. That is, each level of road network partition structure in the multi-level road network partition structure can be regarded as the result of dividing the urban road network into regions at the corresponding partition granularity.

[0029] It is to be emphasized that, in the embodiments of the present application, when the urban road network is divided into regions in multiple levels, in addition to the first division operation which can be directly performed by the server on the urban road network, each subsequent division operation can be further performed by the server on the regions divided in the last division operation (specifically, the regions which do not meet the requirements of the partition granularity) at a higher partition granularity.

[0030] Figure 3 And Figure 4 is a schematic diagram of the single-level road network partition structure in the embodiments of the present application. It should be understood that, Figure 3 And Figure 4 The single-level road network partition structure shown in FIGS. Figure 3 And Figure 4As shown, the single-layer road network partition structure 31 and the single-layer road network partition structure 41 can be regarded as the results of regional division of the urban road network in different partition granularities. The single-layer road network partition structure 41 corresponds to a higher partition granularity than the single-layer road network partition structure 31, and the single-layer road network partition structure 41 can be obtained by further dividing the area blocks in the single-layer road network partition structure 31 in a higher partition granularity by the server (the area block C in the single-layer road network partition structure 31 is directly determined as C1 in the single-layer road network partition structure 41 because it meets the partition granularity requirement).

[0031] It should be understood that in the embodiments of the present application, the partition granularity can be used to determine the size of the area blocks and the number of the area blocks when the server divides the urban road network. The higher the partition granularity, the smaller the size of the area blocks and the more the number of the area blocks when the server divides the urban road network. The lower the partition granularity, the larger the size of the area blocks and the less the number of the area blocks when the server divides the urban road network. For example, Figure 3 and Figure 4 As shown, compared with the single-layer road network partition structure 31, the size of the area blocks in the single-layer road network partition structure 41 is smaller and the number of the area blocks is more.

[0032] Optionally, in the embodiments of the present application, the partition granularities corresponding to the road network partition structures of different levels can be pre-set by relevant personnel, and the present application does not limit this. In addition, the setting method of different partition granularities can be realized by adjusting the relevant parameters in the regional division algorithm used by the server.

[0033] Optionally, when the urban road network is divided into any level of area, the regional division algorithm used by the server can include the Inertial Flow algorithm and the PUNCH (Partitioning Using Natural Cluster Hierarchies) algorithm, and the present application does not limit this. The Inertial Flow algorithm can identify the areas with close traffic connection by quantifying the "accessibility" or "mobility convenience" between different locations in the area, and divide the area according to the identification result, so as to divide the road network into multiple areas. The PUNCH algorithm can identify the sparse connection area (i.e. the area with low density of edges) in the road network, and divide the area according to the sparse connection area as the boundary, so as to divide the road network into multiple areas.

[0034] Optionally, in addition to directly performing multiple regional division operations to determine the multi-level road network partition structure, in some embodiments, the server can also first perform regional division on the city road network at the highest granularity, and then perform multi-level regional fusion on this basis to determine the multi-level road network partition structure, and the present application does not limit this.

[0035] Further, after determining the multi-level road network partition structure, the server can also determine the corresponding shortcut information for each level of the multi-level road network partition structure. The shortcut information can be used to represent the intra-cell shortcut and inter-cell shortcut in the corresponding level of the road network partition structure. The intra-cell shortcut can specifically refer to the shortcut between the boundary nodes of the same road network cell. The inter-cell shortcut can specifically refer to the shortcut between the boundary nodes of different road network cells. It is to be explained that for any level of the road network partition structure, the road network cell can refer to the region block divided inside it. The boundary node of the road network cell can refer to the road node that must pass through to enter the road network cell, which can be located at the boundary region of the road network cell and used to support the entry and exit of relevant objects (such as pedestrians and / or vehicles) into the road network cell. The shortcut can refer to the road segment connecting the boundary nodes.

[0036] Figure 5 The schematic diagram of the shortcut information of the embodiment of the present application is shown in FIG. 5. It should be understood that, Figure 5 The black solid dot shown in FIG. 5 is used to represent the boundary node. As Figure 5 shown, for the single-level road network partition structure 51, the single-level road network partition structure 51 can have corresponding shortcut information. The shortcut information can be used to represent the intra-cell shortcut (i.e., shortcuts a1a2, b1b2, c1c2 and d1d2) and the inter-cell shortcut (i.e., shortcuts a1b1, b2c1, c2d2 and d1a2) in the single-level road network partition structure 51.

[0037] It is to be explained that in the embodiment of the present application, the shortcut information corresponding to each level of the road network partition structure can be used for the server to query, so that the server can determine part of the route by querying the shortcut information corresponding to the corresponding level of the road network partition structure when providing the route calculation service, thereby reducing the calculation amount of the server in the process of providing the route calculation service.

[0038] Figure 6 The flowchart of the shortcut information determination method of the embodiment of the present application is shown in FIG. 6. It should be understood that for any level of the road network partition structure in the multi-level road network partition structure, the server can determine the corresponding shortcut information by performing the shortcut information determination method as Figure 6 shown in FIG. 6. As Figure 6 shown, the shortcut information determination method can specifically include the following steps: Step S110, determining, in the urban road network, a road segment as an inter-cell shortcut, if the road segment has a road segment start point and a road segment end point in different road network cells in the current hierarchical road network partition structure.

[0039] Specifically, the server can traverse road segments in the urban road network. During the traversal, the server can determine a road segment as an inter-cell shortcut, if the road segment has a road segment start point and a road segment end point in different road network cells in the current hierarchical road network partition structure. The current hierarchical road network partition structure can be a single-layer road network partition structure for which the corresponding shortcut information is currently to be determined.

[0040] Step S120, determining boundary nodes of each of the road network cells according to the inter-cell shortcuts.

[0041] Specifically, after the inter-cell shortcuts are determined, the server can determine boundary nodes of each of the road network cells according to the inter-cell shortcuts. It should be understood that in the embodiments of the present application, the nodes can specifically refer to road segment ends or corresponding traffic junctions of road segments. Here, the boundary nodes can specifically refer to road segment start points and road segment end points of the road segments determined as inter-cell shortcuts.

[0042] Optionally, in the embodiments of the present application, each of the boundary nodes can be further determined as an entry node and / or an exit node according to different supported passing attributes. The entry node can refer to a boundary node that can support a relevant object to enter a road network cell. The exit node can refer to a boundary node that can support a relevant object to leave a road network cell. It is desirable to be explained that for a boundary node that can support a relevant object to enter and leave a road network cell at the same time, it can be determined as an entry node and an exit node at the same time.

[0043] Step S130, determining intra-cell shortcuts of each of the road network cells according to the boundary nodes.

[0044] Specifically, after the boundary nodes of each of the road network cells are determined, the server can determine intra-cell shortcuts of each of the road network cells according to the boundary nodes.

[0045] Optionally, in step S130, for each of the road network cells, the server can specifically calculate passing routes between each of the entry nodes and each of the exit nodes of the road network cell, and determine the calculated passing routes as intra-cell shortcuts.

[0046] Step S300, performing road network layering on each of the basic road network cells respectively to determine a road network hierarchical structure corresponding to each of the basic road network cells.

[0047] Specifically, the single-layer road network zoning structure with the highest granularity in the multi-level road network zoning structure can be called the basic-level road network zoning structure. In this step, the server can perform road network layering on each basic road network unit within the basic-level road network zoning structure to determine the road network layering structure corresponding to each basic road network unit.

[0048] Furthermore, in this embodiment of the invention, for any basic road network unit, the road network layer structure corresponding to the basic road network unit may include multiple unit nodes (including boundary nodes and nodes located inside the unit) within the basic road network unit, and the multiple unit nodes can be arranged in the road network layer structure according to the importance of the nodes.

[0049] Figure 7 This is a schematic diagram of a road network layered structure according to an embodiment of the present invention. It is intended to clarify that, for ease of understanding the relationship between the multi-level road network zoning structure and the road network layered structure, it is assumed here... Figure 4 The single-layer road network zoning structure 41 shown is the basic-level road network zoning structure, while Figure 7 The road network hierarchical structure 71 shown can be viewed as the road network hierarchical structure corresponding to the basic road network unit B1 in the single-layer road network partition structure 41. It should be understood that... Figure 7 The elliptical patterns shown can be used to represent unit nodes. A line connecting any two elliptical patterns indicates a connectivity relationship between them. The numbers inside the elliptical patterns can represent the arrangement of unit nodes within the road network's hierarchical structure. For example... Figure 7 As shown, the road network hierarchical structure 71 may include multiple unit nodes within the basic road network unit B1, and the multiple unit nodes can be arranged according to their importance within the road network hierarchical structure.

[0050] It should be noted that, in this embodiment of the invention, the multiple unit nodes included in the road network hierarchical structure may specifically be a subset of the unit nodes retained after simplifying all unit nodes within the basic road network unit. Furthermore, the arrangement order of the unit nodes in the road network hierarchical structure can be used to guide the server's route generation direction when providing route calculation services, thereby assisting the server in route generation. Therefore, this embodiment of the invention can further reduce the computational load on the server during the route calculation service provision process.

[0051] Figure 8 This is a flowchart illustrating a method for determining the road network hierarchical structure according to an embodiment of the present invention. It should be understood that by performing methods such as... Figure 8 The shortcut information determination method shown allows the server to determine the corresponding road network hierarchical structure for each basic road network unit within the basic-level road network partition structure, thus implementing step S300 above. For example... Figure 8As shown, the road network layered structure determination method can specifically include the following steps: In step S310, for each of the basic road network units, the node importance of each unit node in the basic road network unit is determined.

[0052] Specifically, for each basic road network unit in the basic level road network partition structure, the server can determine the node importance of each unit node in the basic road network unit. The node importance can refer to the importance of the unit node in the urban road network.

[0053] In step S320, according to the node importance, the unit node sorting and unit node shrinking are performed on each of the basic road network units, so as to determine the road network layered structure corresponding to each of the basic road network units.

[0054] Specifically, after determining the node importance of each unit node in each basic road network unit, the server can perform unit node sorting and unit node shrinking on each basic road network unit according to the node importance, so as to determine the road network layered structure corresponding to each basic road network unit.

[0055] It is to be explained that, in the embodiment of the present application, the unit node sorting and unit node shrinking of the basic road network unit can specifically refer to sorting each unit node in the basic road network unit according to the node importance, and then shrinking the last unit node (i.e., the unit node with low node importance) according to the sorting result, so as to remove this part of unit nodes and delete the inter-node edges (i.e., the road segments between nodes) related to this part of unit nodes in the data structure, and then add the corresponding shortest shortcut for the affected node pair (i.e., the two unit nodes that need to be connected through the unit node).

[0056] Optionally, in the embodiment of the present application, in order to ensure that the finally obtained road network layered structure can be limited within a certain scale, and in order to ensure that the quality of the finally obtained road network layered structure can meet the requirements, the server performs multiple node shrinking operations, and in each node shrinking operation, the server can only select a corresponding number (for example, 1 or 3) of unit nodes for node shrinking.

[0057] It is to be explained that, since the node shrinking operation can cause the importance of the unit node to change, after each node shrinking operation, the server usually needs to re-determine the node importance of each unit node currently retained, and re-perform node sorting according to the newly determined node importance.

[0058] Optionally, in the embodiment of the present application, in order to avoid the increase of the calculation amount caused by repeatedly performing the node importance degree determination operation and the sorting operation, the server can traverse the unit nodes according to the sorting result in the order from low to high node importance degree when performing the node contraction operation each time. Wherein, the server can determine the node importance degree of each unit node separately when traversing it. Further, if the node importance degree of the unit node changes, the server can update the sorting position of the unit node in the sorting result and continue the traversal. If the node importance degree of the unit node does not change, the server can select the unit node as the unit node to be contracted currently and stop the traversal to start the node contraction of the unit node. Thus, the embodiment of the present application can avoid frequently performing the node importance degree determination operation and the sorting operation, thereby reducing the calculation amount of the server.

[0059] Optionally, in the embodiment of the present application, the evaluation method of the node importance degree can be set and adjusted by the server according to the actual demand of the relevant personnel, and the present application does not limit it. Illustratively, as one setting method, the node importance degree of the unit node can be determined by the server according to the number of the contracted adjacent nodes of the unit node, the node service coverage range and the node contraction benefit of the unit node. Wherein, the node service coverage range of the unit node can be determined by the server by calculating the Thiessen polygon area of each unit node, and the node contraction benefit of the unit node can be determined by the server by calculating the difference between the number of the shortest shortcuts to be added and the number of the edges to be deleted when contracting the unit node.

[0060] Step S400, constructing a road network fusion data structure according to the multi-level road network partition structure and each road network hierarchical structure.

[0061] Specifically, after determining the multi-level road network partition structure and the road network hierarchical structure corresponding to each basic road network unit in the basic-level road network partition structure, the server can construct a road network fusion data structure according to the multi-level road network partition structure and each road network hierarchical structure.

[0062] Figure 9 A schematic diagram of the road network fusion data structure of the embodiment of the present application. As shown in FIG. 4, the road network fusion data structure includes a multi-level road network partition structure and a plurality of road network hierarchical structures corresponding to the basic road network units in the basic-level road network partition structure. Figure 9As shown, the server can obtain the road network fusion data structure 91 by fusing the multi-level road network partition structure 911 and the plurality of road network hierarchical structures 912. Each of the plurality of road network hierarchical structures in the multi-level road network partition structure 911 can include a plurality of road network units. In addition, each of the plurality of road network hierarchical structures in the multi-level road network partition structure 911 can have corresponding shortcut information (as shown by the dashed lines and solid lines connecting the road network units in the figure, in which the dashed lines represent intra-unit shortcuts and the solid lines represent inter-unit shortcuts). It is to be understood that, in the multi-level road network partition structure 911, the road network hierarchical structure at level one is the basic-level road network partition structure. Each of the plurality of road network hierarchical structures 912 can correspond to a respective basic road network unit in the basic-level road network partition structure.

[0063] It is to be understood that, in the embodiments of the present application, the road network partition structures at levels other than level five can be determined by the server by further regionally dividing the road network units in the road network partition structure at the previous level. For example, the road network unit 3_0, the road network unit 3_1, and the road network unit 3_2 in the road network partition structure at level four can be determined by the server by further regionally dividing the road network unit 4_0 in the road network partition structure at level five with a higher partition granularity. For another example, the road network unit 2_1, the road network unit 2_2, and the road network unit 2_3 in the road network partition structure at level three can be determined by the server by further regionally dividing the road network unit 3_1 in the road network partition structure at level four. It is to be understood that, when regionally dividing the road network partition structure at any level, the server can not regionally divide the road network units in the road network partition structure at the level that already satisfy the partition granularity requirement. For example, the road network unit 3_0 in the road network partition structure at level four can be directly determined by the server as the road network unit 2_0 in the road network partition structure at level three.

[0064] It is to be understood that, Figure 9 The road network fusion data structure shown is only a schematic content for easy understanding, and in actual application, each content included in the road network fusion data structure 91 can be embodied as related data stored in a computer, which is not limited herein.

[0065] Step S500, in response to receiving the line planning request, planning a target line according to the road network fusion data structure.

[0066] Specifically, after constructing the road network fusion data structure, the server can start receiving the line planning request sent by the terminal device, and when receiving the line planning request, plan a target line according to the road network fusion data structure.

[0067] Figure 10This is a flowchart of a route planning method according to an embodiment of the present invention. It should be understood that by executing... Figure 10 The route planning method shown allows the server to plan the target route based on the road network fusion data structure, that is, to implement step S500 above. For example... Figure 10 As shown, the route planning method may specifically include the following steps: Step S510: Determine the starting point and ending point of the route according to the route planning request.

[0068] Specifically, the server can determine the starting point and ending point of a route based on the route planning request.

[0069] Step S520: Determine the starting road network unit where the starting point of the line is located and the ending road network unit where the ending point of the line is located in the plurality of basic road network units.

[0070] Specifically, after determining the starting point and the ending point of the route, the server can determine the starting point road network unit where the starting point is located and the ending point road network unit where the ending point is located from multiple basic road network units.

[0071] Step S530: In response to detecting that the starting point road network unit and the ending point road network unit are different basic road network units, the target route is planned according to the multi-level road network zoning structure and each of the road network layer structures.

[0072] Specifically, after determining the starting road network unit and the ending road network unit, if it is detected that the starting road network unit and the ending road network unit are different basic road network units, the server can plan the target route according to the multi-level road network zoning structure and the hierarchical structure of each road network.

[0073] Optionally, in step S530, as one implementation method, the server can specifically perform bidirectional search based on the multi-level road network partition structure and the hierarchical structure of each road network to plan the target route.

[0074] Figure 11 This is a flowchart of a bidirectional search method according to an embodiment of the present invention. It should be understood that by executing... Figure 11 The bidirectional search method shown allows the server to perform a bidirectional search based on the multi-level road network zoning structure and the hierarchical structure of each road network to plan the target route, that is, to implement the above step S530. For example... Figure 11 As shown, the bidirectional search method may specifically include the following steps: Step S531: Using the starting point of the route as the search starting point, perform a forward search based on the multi-level road network partition structure and each of the road network layer structures.

[0075] Specifically, the server can take the line start point as a search start point, and perform forward search according to the multi-level road network partition structure and the road network layer structure.

[0076] Figure 12 A flowchart of the forward search method of the embodiment of the application is shown. It should be understood that by performing the forward search method as shown in Figure 12 the server can perform forward search according to the multi-level road network partition structure and the road network layer structure, that is, implement the step S531 shown in the above. As shown in Figure 12 the forward search method can specifically include the following steps: Step S5311, judging whether the current search node is in the start point road network unit.

[0077] Specifically, the server can first judge whether the current search node is in the start point road network unit. If yes, the server can perform step S5312. If no, the server can perform step S5315.

[0078] Step S5312, judging whether the current search node is an exit node of the start point road network unit.

[0079] Specifically, when it is judged and confirmed that the current search node is in the start point road network unit, the server can further judge whether the current search node is an exit node of the start point road network unit. If yes, the server can perform step S5313. If no, the server can perform step S5317.

[0080] Step S5313, determining a next search node according to the multi-level road network partition structure.

[0081] Specifically, when it is judged and confirmed that the current search node is in the start point road network unit, but the current search node is an exit node of the start point road network unit, the server can determine a next search node according to the multi-level road network partition structure. Also, when it is judged and confirmed that the current search node is not in the start point road network unit and the end point road network unit, the server can determine a next search node according to the multi-level road network partition structure.

[0082] It should be understood that the specific implementation manner of the server determining a next search node according to the multi-level road network partition structure will be uniformly described later, and will not be described in more details here.

[0083] Step S5314, judging whether a forward search termination condition is satisfied.

[0084] Specifically, each time a next search node is determined, the server can determine whether a forward search termination condition is satisfied. If so, the server can stop executing the iteration procedure and output the result. If not, the server can return and re-execute step S5311. The forward search termination condition can be set to include a case where the forward search process meets the backward search process at the same node or a case where the forward search process searches to the line endpoint.

[0085] Step S5315: Determine whether the current search node is in the endpoint road network unit.

[0086] Specifically, when it is determined that the current search node is not in the start point road network unit, the server can further determine whether the current search node is in the endpoint road network unit. If so, the server can execute step S5316. If not, the server can execute step S5313.

[0087] Step S5316: Determine a next search node according to the road network hierarchical structure corresponding to the endpoint road network unit.

[0088] Specifically, when it is determined that the current search node is in the endpoint road network unit, the server can determine a next search node according to the road network hierarchical structure corresponding to the endpoint road network unit.

[0089] It should be understood that the specific implementation manner of the server determining a next search node according to the road network hierarchical structure corresponding to the endpoint road network unit will be uniformly described later, and will not be described in detail here.

[0090] Step S5317: Determine a next search node according to the road network hierarchical structure corresponding to the start point road network unit.

[0091] Specifically, when it is determined that the current search node is in the start point road network unit and the current search node is not the exit node of the start point road network unit, the server can determine a next search node according to the road network hierarchical structure corresponding to the start point road network unit.

[0092] It should be understood that the specific implementation manner of the server determining a next search node according to the road network hierarchical structure corresponding to the start point road network unit will be uniformly described later, and will not be described in detail here.

[0093] Step S532: Perform backward search according to the multi-level road network partition structure and each road network hierarchical structure, with the line endpoint as a search start point.

[0094] Specifically, the server can perform backward search according to the multi-level road network partition structure and each road network hierarchical structure, with the line endpoint as a search start point.

[0095] Figure 13A flowchart of the reverse search method of the embodiments of the present application. It should be understood that by executing the reverse search method as shown in Figure 13 The server can perform reverse search according to the multi-level road network partition structure and the road network layer structure, i.e., implement the step S532, as shown in Figure 13 The reverse search method can specifically include the following steps, as shown in Step S5321, judging whether the current search node is in the terminal road network unit.

[0096] Specifically, the server can first judge whether the current search node is in the terminal road network unit. If yes, the server can execute the step S5322. If no, the server can execute the step S5325.

[0097] Step S5322, judging whether the current search node is the entry node of the terminal road network unit.

[0098] Specifically, when it is judged that the current search node is in the terminal road network unit, the server can further judge whether the current search node is the entry node of the terminal road network unit. If yes, the server can execute the step S5323. If no, the server can execute the step S5327.

[0099] Step S5323, determining the next search node according to the multi-level road network partition structure.

[0100] Specifically, when it is judged that the current search node is in the terminal road network unit, but the current search node is the entry node of the terminal road network unit, the server can determine the next search node according to the multi-level road network partition structure. In addition, when it is judged that the current search node is not in the starting road network unit and the terminal road network unit, the server can determine the next search node according to the multi-level road network partition structure.

[0101] It should be understood that the specific implementation of the server determining the next search node according to the multi-level road network partition structure will be described later, and will not be described here in more detail.

[0102] Step S5324, judging whether the reverse search termination condition is met.

[0103] Specifically, the server can judge whether the reverse search termination condition is met every time the next search node is determined. If yes, the server can stop executing the iterative process and output the result. If no, the server can return and re-execute the step S5321. The reverse search termination condition can be set to include that the reverse search process meets the forward search process at the same node or the reverse search process searches to the starting point of the line.

[0104] Step S5325, judging whether the current search node is in the start point road network unit.

[0105] Specifically, when judging that the current search node is not in the end point road network unit, the server can further judge whether the current search node is in the start point road network unit. If yes, the server can execute step S5326. If no, the server can execute step S5323.

[0106] Step S5326, determining the next search node according to the road network hierarchical structure corresponding to the start point road network unit.

[0107] Specifically, when judging that the current search node is in the start point road network unit, the server can determine the next search node according to the road network hierarchical structure corresponding to the start point road network unit.

[0108] It should be understood that the specific implementation manner of the server determining the next search node according to the road network hierarchical structure corresponding to the start point road network unit will be uniformly described later, and will not be repeated here.

[0109] Step S5327, determining the next search node according to the road network hierarchical structure corresponding to the end point road network unit.

[0110] Specifically, when judging that the current search node is in the end point road network unit and the current search node is not the entry node of the end point road network unit, the server can determine the next search node according to the road network hierarchical structure corresponding to the end point road network unit.

[0111] It should be understood that the specific implementation manner of the server determining the next search node according to the road network hierarchical structure corresponding to the end point road network unit will be uniformly described later, and will not be repeated here.

[0112] It should be understood that the above step S531 and step S532 can be executed by the server at the same time.

[0113] Step S533, determining the target route according to the forward search result and the backward search result.

[0114] Specifically, after determining the forward search result and the backward search result, the server can determine the target route according to the forward search result and the backward search result.

[0115] Optionally, in step S533, if it is detected that the complete route is included in the forward search result and the backward search result, the server can determine the complete route with the shortest distance and / or the shortest time consumption in the forward search result and the backward search result as the target route. If it is detected that the incomplete route (i.e., the partial route) is included in the forward search result and the backward search result, the server can splice each incomplete route to determine the target route.

[0116] Optionally, in the above process, no matter whether the next search node is determined according to the road network hierarchical structure corresponding to the starting point road network unit or the road network hierarchical structure corresponding to the ending point road network unit, the server can implement by executing the same method flow.

[0117] Figure 14 The flowchart of the first search node determination method of the embodiment of the application is shown. It should be understood that by executing the first search node determination method as shown in Figure 14 the server can determine the next search node according to the road network hierarchical structure corresponding to the starting point road network unit or the road network hierarchical structure corresponding to the ending point road network unit, that is, implement any one of the above steps S5316, S5317, S5326 or S5327. As shown in Figure 14 the first search node determination method can specifically include the following steps: Step S53161, determining a candidate node set in the plurality of adjacent unit nodes of the current search node according to the road network hierarchical structure.

[0118] Specifically, the server can screen in the plurality of adjacent unit nodes of the current search node according to the road network hierarchical structure, thereby obtaining the candidate node set. Wherein, the candidate node set can be set to include the adjacent unit nodes with higher node importance than the current search node in the forward search process. The candidate node set can be set to include the adjacent unit nodes with lower node importance than the current search node in the reverse search process.

[0119] Step S53162, determining the next search node in the candidate node set.

[0120] Specifically, after determining the candidate node set, the server can determine the next search node in the candidate node set.

[0121] Optionally, in step S53162, the server can specifically determine the next search node in the candidate node set according to the location and connectivity of each candidate node, and the application does not limit the specific way of selecting the next search node by the server.

[0122] Thus, by guiding the server to search the unit nodes in the order from high to low in terms of the node importance in the forward search process and guiding the server to search the unit nodes in the order from low to high in terms of the node importance in the reverse search process, the embodiments of the present application can guide the route generation direction of the server by using the road network hierarchical structures in the road network fusion data structure to assist the server to generate the route, thereby reducing the calculation amount of the server in the route calculation service providing process.

[0123] It is to be understood that, in the embodiments of the present application, in order to ensure that the server can correctly search the exit node or the entry node of the basic road network unit, the node importance of the exit node and the entry node of each basic road network unit can be separately set by the server. Illustratively, as a setting manner, the node importance of the exit node of each basic road network unit can be set to be the lowest, and the node importance of the entry node of each basic road network unit can be set to be the highest.

[0124] Figure 15 The flowchart of the second search node determination method of the embodiments of the present application is shown in FIG. 13B. It should be understood that, by executing the second search node determination method as shown in FIG. 13B, the server can determine the next search node according to the multi-level road network partition structure, that is, implement the step S5313 or the step S5323 described above. As shown in FIG. 13B, the second search node determination method can specifically include the following steps. Figure 15 Figure 15 The flowchart of the target level road network partition structure determination method of the embodiments of the present application is shown in FIG. 14B. It should be understood that, by executing the target level road network partition structure determination method as shown in FIG. 14B, the server can determine the target level road network partition structure in the multi-level road network partition structure, that is, implement the step S53131 described above. As shown in FIG. 14B, the target level road network partition structure determination method can specifically include the following steps.

[0125] Specifically, the server can determine the target level road network partition structure in the multi-level road network partition structure. The target level road network partition structure can be a single-level road network partition structure determined by the server according to the boundary node search result of the start point road network unit in the forward search process and the boundary node search result of the end point road network unit in the reverse search process.

[0126] Figure 16 The flowchart of the target level road network partition structure determination method of the embodiments of the present application is shown in FIG. 14B. It should be understood that, by executing the target level road network partition structure determination method as shown in FIG. 14B, the server can determine the target level road network partition structure in the multi-level road network partition structure, that is, implement the step S53131 described above. As shown in FIG. 14B, the target level road network partition structure determination method can specifically include the following steps. Figure 16 Figure 16 The flowchart of the target level road network partition structure determination method of the embodiments of the present application is shown in FIG. 14B. It should be understood that, by executing the target level road network partition structure determination method as shown in FIG. 14B, the server can determine the target level road network partition structure in the multi-level road network partition structure, that is, implement the step S53131 described above. As shown in FIG. 14B, the target level road network partition structure determination method can specifically include the following steps. ​​​Step S531311, determining a target exit node and a target entry node. The target exit node is an exit node searched by the forward search process in the start road network unit, and the target entry node is an entry node searched by the reverse search process in the end road network unit.

[0127] Specifically, the server can determine the exit node searched by the forward search process in the start road network unit as the target exit node, and determine the entry node searched by the reverse search process in the end road network unit as the target entry node.

[0128] Step S531312, determining a first hierarchical road network partition structure and a second hierarchical road network partition structure in the multi-level road network partition structure according to the target exit node and the target entry node. The first hierarchical road network partition structure is a single-layer road network partition structure with the lowest partition granularity and with the target exit node as a boundary node, and the second hierarchical road network partition structure is a single-layer road network partition structure with the lowest partition granularity and with the target entry node as a boundary node.

[0129] Specifically, after determining the target exit node and the target entry node, the server can determine a single-layer road network partition structure with the lowest partition granularity and with the target exit node as a boundary node and a single-layer road network partition structure with the lowest partition granularity and with the target entry node as a boundary node in the multi-level road network partition structure, and determine them as the first hierarchical road network partition structure and the second hierarchical road network partition structure respectively.

[0130] Step S531313, determining a single-layer road network partition structure with the highest partition granularity in the first hierarchical road network partition structure and the second hierarchical road network partition structure as the target hierarchical road network partition structure.

[0131] Specifically, after determining the first hierarchical road network partition structure and the second hierarchical road network partition structure, the server can determine a single-layer road network partition structure with the highest partition granularity in the first hierarchical road network partition structure and the second hierarchical road network partition structure as the target hierarchical road network partition structure.

[0132] For example, as shown in FIG. 5, the target exit node searched by the forward search process in the start road network unit is node 1, and the target entry node searched by the reverse search process in the end road network unit is node 2. Figure 9As shown, assuming that the target exit node is an exit node in the basic road network unit 2 and the target entry node is an entry node in the basic road network unit 10, the server can determine the road network partition structure of level two as the first level road network partition structure, and determine the road network partition structure of level three as the second level road network partition structure. Further, the server can determine the road network partition structure of level two (in an embodiment of the present application, the smaller the level of the road network partition structure, the higher the partition granularity of the road network partition structure. Therefore, the partition granularity of the road network partition structure of level two is higher than that of the road network partition structure of level three) as the target level road network partition structure.

[0133] It is intended to be explained that, in an embodiment of the present application, the target level road network partition structure can be specifically understood as a single layer road network partition structure which has boundary nodes including both the target entry node and the target exit node.

[0134] It should be understood that, in the multi-level road network partition structure, the boundary nodes in the single layer road network partition structure with low partition granularity are also boundary nodes in the single layer road network partition structure with high partition granularity. For example, Figure 9 As shown, for the entry node of the road network unit 4_0 in the road network partition structure of level five, it can be the entry node of the road network unit 3_0 in the road network partition structure of level four, the entry node of the road network unit 2_0 in the road network partition structure of level three, the entry node of the road network unit 1_0 in the road network partition structure of level two, and the entry node of the basic road network unit 1 in the basic level road network partition structure. Therefore, in step S531313, the single layer road network partition structure with the highest partition granularity in the first level road network partition structure and the second level road network partition structure is the single layer road network partition structure which has boundary nodes including both the target entry node and the target exit node, and the server can determine it as the target level road network partition structure.

[0135] In step S53132, the next search node is determined from the plurality of adjacent boundary nodes of the current search node according to the shortcut information corresponding to the target level road network partition structure.

[0136] Specifically, after determining the target level road network partition structure, the server can determine the next search node from the plurality of adjacent boundary nodes of the current search node according to the shortcut information corresponding to the target level road network partition structure.

[0137] Optionally, the position of the next search node and the passing route between the next search node and the current search node can be determined by querying in step S53132.

[0138] Therefore, embodiments of the present invention can utilize the multi-level road network partitioning structure in the road network fusion data structure to support the server in quickly determining a portion of the target route through a query, thereby reducing the amount of computation the server needs to perform during the route calculation service provision process.

[0139] Figure 17 This is a schematic diagram of the target circuit according to an embodiment of the present invention. Figure 17 As shown, for a given route start point O and route end point T, the server can determine the target route 171 by executing the above method. It should be understood that the target route 171 can be a complete route selected and determined by the server from the forward or reverse search results, or it can be a spliced ​​route determined by the server by splicing together parts of the forward or reverse search results; this application does not impose any limitations on this. Regardless of how the target route 171 is determined, the route 1711 from the route start point O to the target exit node P and the route 1712 from the route end point T to the target entrance node R can both be determined by the server through node search based on the road network hierarchical structure of the start point road network unit and the road network hierarchical structure of the end point road network unit, respectively. The route 1713 from the target exit node P to the target entrance node R can be determined by the server through node search based on the shortcut information corresponding to the target hierarchical road network partition structure.

[0140] Optionally, in this embodiment of the invention, if the starting road network unit and the ending road network unit are detected to be the same basic road network unit, the server can directly perform a bidirectional search based on the road network hierarchical structure corresponding to the basic road network unit, and determine the target route based on the positive search results and the reverse search results.

[0141] Specifically, on the one hand, the server can use the starting point of the route as the search starting point and perform a forward search based on the road network hierarchy corresponding to that basic road network unit. On the other hand, the server can use the ending point of the route as the search starting point and perform a reverse search based on the road network hierarchy corresponding to that basic road network unit. During the forward search, the server can search for unit nodes according to the road network hierarchy in descending order of node importance, and during the reverse search, the server can search for unit nodes according to the road network hierarchy in ascending order of node importance. Furthermore, when the forward and reverse search processes encounter the same node, the server can terminate the bidirectional search process and splice the partial routes included in the forward or reverse search results to determine the target route. When the forward search process reaches the ending point of the route and the reverse search process reaches the starting point of the route, the server can terminate the bidirectional search process and select from the complete routes included in the forward and reverse search results to determine the target route.

[0142] Optionally, in the embodiments of the present application, in order to ensure the timeliness of the road network fusion data structure, the server can also update the road network fusion data structure in time when detecting that the urban road network data is updated.

[0143] Figure 18 The flowchart of the road network updating method of the embodiments of the present application. It should be understood that by executing the road network updating method as shown in Figure 18 The server can realize the updating of the road network fusion data structure. As shown in Figure 18 The road network updating method can specifically include the following steps: Step S610, in response to detecting that the urban road network is updated, acquiring road network updating data.

[0144] Specifically, the server can acquire the corresponding road network updating data whenever detecting that the urban road network is updated. Wherein, the urban road network being updated can mean that new road segments are added in the urban road network or that the road related information (for example, the support passing state or the road shape, etc.) of the original road segments in the urban road network is changed.

[0145] Optionally, the detection of whether the urban road network is updated and the acquisition of the road network updating data can be realized by the server querying the relevant road updating data published by the urban road network website, and the present application does not limit this.

[0146] Step S620, updating the road network hierarchical structure of the corresponding basic road network unit according to the road network updating data.

[0147] Specifically, after acquiring the road network updating data, the server can determine the basic road network unit affected by the road network updating in the road network fusion data structure, and update the road network hierarchical structure of the basic road network unit according to the road network updating data. It should be understood that the determination method of the new road network hierarchical structure can refer to the road network hierarchical structure determination flow as shown in Figure 8 The above will not be repeated here.

[0148] The embodiment of the present application can acquire city road network data, and perform road network partitioning on the city road network according to the city road network data to determine a multi-level road network partitioning structure, then perform road network layering on each basic road network unit in a basic level road network partitioning structure in the multi-level road network partitioning structure to determine a road network layering structure corresponding to each basic road network unit, and construct a road network fusion data structure according to the multi-level road network partitioning structure and each road network layering structure, and then plan a target route according to the road network fusion data structure when a route planning request is received. The basic level road network partitioning structure has the highest partitioning granularity in the multi-level road network partitioning structure. Thus, by combining road network partitioning technology and road network layering technology to provide route calculation services, the embodiment of the present application can meet the related needs of route calculation efficiency and quality in instant delivery scenarios.

[0149] Figure 19 The schematic diagram of the information processing device of the embodiment of the present application is shown in FIG. 1. As shown in FIG. 1, the information processing device of the embodiment of the present application includes a data acquisition unit 191, a road network partitioning unit 192, a road network layering unit 193, a data structure fusion unit 194, and a route determination unit 195. Figure 19

[0150] Specifically, the data acquisition unit 191 is configured to acquire city road network data.

[0151] The road network partitioning unit 192 is configured to perform road network partitioning on a city road network according to the city road network data to determine a multi-level road network partitioning structure, wherein the multi-level road network partitioning structure includes a basic level road network partitioning structure, the basic level road network partitioning structure has the highest partitioning granularity in the multi-level road network partitioning structure, and the basic level road network partitioning structure includes a plurality of basic road network units.

[0152] The road network layering unit 193 is configured to perform road network layering on each basic road network unit to determine a road network layering structure corresponding to each basic road network unit.

[0153] The data structure fusion unit 194 is configured to construct a road network fusion data structure according to the multi-level road network partitioning structure and each road network layering structure.

[0154] The route determination unit 195 is configured to plan a target route according to the road network fusion data structure in response to receiving a route planning request.

[0155] ​The embodiment of the present application can acquire city road network data, and perform road network partitioning on the city road network according to the city road network data to determine a multi-level road network partitioning structure, then perform road network layering on each basic road network unit in a basic level road network partitioning structure in the multi-level road network partitioning structure to determine a road network layering structure corresponding to each basic road network unit, and construct a road network fusion data structure according to the multi-level road network partitioning structure and each road network layering structure, and then plan a target route according to the road network fusion data structure when a route planning request is received. The partitioning granularity of the basic level road network partitioning structure in the multi-level road network partitioning structure is the highest. Thus, by combining the road network partitioning technology and the road network layering technology to provide route calculation services, the embodiment of the present application can meet the related requirements of instant delivery scenarios for route calculation efficiency and quality.

[0156] Figure 20 is a schematic diagram of an electronic device of the embodiment of the present application. The electronic device can be a route calculation server in the above embodiment. As shown in Figure 20 , the electronic device includes at least one processor 201, a memory 202 connected in communication with the at least one processor 201, and a communication component 203 connected in communication with a scanning device, the communication component 203 receiving and sending data under the control of the processor 201; wherein the memory 202 stores instructions executable by the at least one processor 201, the instructions being executed by the at least one processor 201 to implement the above information processing method.

[0157] Specifically, the electronic device includes one or more processors 201 and a memory 202, Figure 20 , the processor 201 is taken as an example. The processor 201 and the memory 202 can be connected by a bus or other means, Figure 20 , the bus connection is taken as an example. The memory 202 is a non-volatile computer readable storage medium, which can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The processor 201 performs various functional applications and data processing of the device by running the non-volatile software programs, instructions and modules stored in the memory 202, that is, implements the above information processing method.

[0158] The memory 202 can include a program storage area and a data storage area, where the program storage area can store an operating system, at least one application required by a function, and the data storage area can store an option list, etc. In addition, the memory 202 can include a high-speed random access memory, and can also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state memory device. In some embodiments, the memory 202 can optionally include a memory disposed remotely with respect to the processor 201, which can be connected to an external device through a network. Examples of the above network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0159] One or more modules are stored in the memory 202, and when executed by the one or more processors 201, perform the information processing method in any of the above method embodiments.

[0160] The above product can perform the method provided in the embodiments of the present application, has the corresponding function modules and beneficial effects of performing the method, and the technical details not described in detail in the embodiments can be referred to the method provided in the embodiments of the present application.

[0161] The embodiment of the present application can acquire city road network data, and perform road network partitioning on the city road network according to the city road network data to determine a multi-level road network partition structure, then perform road network layering on each basic road network unit in a basic level road network partition structure in the multi-level road network partition structure to determine a road network layer structure corresponding to each basic road network unit, and construct a road network fusion data structure according to the multi-level road network partition structure and each road network layer structure, and then when a route planning request is received, plan a target route according to the road network fusion data structure. Wherein, the partition granularity of the basic level road network partition structure in the multi-level road network partition structure is the highest. Therefore, by combining the road network partitioning technology and the road network layering technology to provide route calculation services, the embodiment of the present application can meet the related needs of instant delivery scenarios for route calculation efficiency and quality.

[0162] Another embodiment of the present application relates to a non-volatile storage medium for storing a computer readable program for a computer to execute part or all of the above method embodiments.

[0163] That is, a person skilled in the art can understand that all or part of the steps in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a program stored in a storage medium, including a plurality of instructions for causing a device (which can be a single-chip microcomputer, a chip, etc.) or a processor to execute all or part of the steps of the methods described in the embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0164] The above merely describes the preferred embodiments of the present application and is not intended to limit the present application. For those skilled in the art, the present application can have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A location-based information processing method, characterized in that, The method includes: Obtain urban road network data; The urban road network is partitioned based on the urban road network data to determine a multi-level road network partitioning structure. The multi-level road network partitioning structure includes a basic level road network partitioning structure, which has the highest granularity among the multi-level road network partitioning structures. The basic level road network partitioning structure includes multiple basic road network units. Each of the basic road network units is divided into road network layers to determine the road network layer structure corresponding to each of the basic road network units. A road network fusion data structure is constructed based on the multi-level road network partitioning structure and each of the road network hierarchical structures. In response to receiving a route planning request, the target route is planned according to the road network fusion data structure.

2. The method according to claim 1, characterized in that, The planning of the target route based on the road network fusion data structure includes: Determine the starting point and ending point of the route based on the route planning request; Among the multiple basic road network units, the starting road network unit where the starting point of the line is located and the ending road network unit where the ending point of the line is located are determined respectively; In response to the detection that the starting point road network unit and the ending point road network unit are different basic road network units, the target route is planned according to the multi-level road network zoning structure and each of the road network hierarchical structures.

3. The method according to claim 2, characterized in that, The step of planning the target route based on the multi-level road network zoning structure and each of the road network hierarchies includes: A bidirectional search is performed based on the multi-level road network partition structure and each of the road network layer structures to plan the target route.

4. The method according to claim 3, characterized in that, The step of performing a bidirectional search based on the multi-level road network zoning structure and each of the road network hierarchical structures to plan the target route includes: Using the starting point of the route as the search starting point, a forward search is performed based on the multi-level road network partition structure and each of the road network layer structures. Using the end point of the route as the search starting point, a reverse search is performed based on the multi-level road network partition structure and each of the road network layer structures. The target route is determined based on the forward search results and the reverse search results.

5. The method according to claim 4, characterized in that, The forward search, using the starting point of the route as the search starting point and based on the multi-level road network partition structure and each of the road network hierarchical structures, includes: The following steps are performed iteratively until the forward search termination condition is met, wherein the forward search termination condition includes the forward search process and the reverse search process meeting at the same node or the forward search process reaching the end point of the line: In response to detecting that the current search node is in the starting road network unit and is not the exit node of the starting road network unit, the next search node is determined according to the road network layer structure corresponding to the starting road network unit; In response to detecting that the current search node is not in the starting road network unit and the ending road network unit, or that the current search node is the exit node of the starting road network unit, the next search node is determined according to the multi-level road network partitioning structure; In response to detecting that the current search node is in the endpoint road network unit, the next search node is determined according to the road network layer structure corresponding to the endpoint road network unit.

6. The method according to claim 4, characterized in that, The reverse search, starting from the end point of the route and based on the multi-level road network partition structure and the hierarchical structure of each road network layer, includes: The following steps are performed iteratively until the reverse search termination condition is met, wherein the reverse search termination condition includes the reverse search process and the forward search process meeting at the same node or the reverse search process finding the starting point of the line: In response to detecting that the current search node is in the endpoint road network unit and is not the entry node of the endpoint road network unit, the next search node is determined according to the road network layer structure corresponding to the endpoint road network unit; In response to detecting that the destination road network unit is not located in the origin road network unit and the destination road network unit, or that the current search node is the entry node of the destination road network unit, the next search node is determined according to the multi-level road network partitioning structure; In response to detecting that the current search node is located in the starting road network unit, the next search node is determined according to the road network layer structure corresponding to the starting road network unit.

7. The method according to claim 5 or 6, characterized in that, The road network layered structure corresponding to the basic road network unit includes multiple unit nodes of the basic road network unit, and the multiple unit nodes are arranged in the road network layered structure according to the importance of the nodes; The step of determining the next search node based on the road network layer structure corresponding to the starting road network unit, or based on the road network layer structure corresponding to the ending road network unit, includes: According to the road network layering structure, a candidate node set is determined from multiple adjacent unit nodes of the current search node. The candidate node set includes adjacent unit nodes with higher node importance than the current search node during the forward search process, and includes adjacent unit nodes with lower node importance than the current search node during the reverse search process. The next search node is determined from the set of candidate nodes.

8. The method according to claim 5 or 6, characterized in that, Each level of the multi-level road network partitioning structure has corresponding shortcut information. The shortcut information is used to characterize the intra-unit shortcuts and inter-unit shortcuts in the corresponding level of the road network partitioning structure. The intra-unit shortcuts are shortcuts between boundary nodes of the same road network unit, and the inter-unit shortcuts are shortcuts between boundary nodes of different road network units. Determining the next search node based on the multi-level road network partitioning structure includes: Determine the target level road network partition structure within the multi-level road network partition structure; The next search node is determined from among the multiple adjacent boundary nodes of the current search node based on the shortcut information corresponding to the target hierarchical road network partition structure.

9. The method according to claim 8, characterized in that, Determining the target level road network partition structure in the multi-level road network partition structure includes: Determine the target exit node and the target entry node, wherein the target exit node is the exit node found in the starting road network unit by the forward search process, and the target entry node is the entry node found in the ending road network unit by the reverse search process; Based on the target exit node and the target entrance node, a first-level road network partition structure and a second-level road network partition structure are determined in the multi-level road network partition structure, respectively. The first-level road network partition structure is a single-layer road network partition structure with the lowest partition granularity, using the target exit node as the boundary node. The second-level road network partition structure is a single-layer road network partition structure with the lowest partition granularity, using the target entrance node as the boundary node. The single-layer road network partition structure with the highest granularity among the first-level road network partition structure and the second-level road network partition structure is determined as the target-level road network partition structure.

10. The method according to claim 4, characterized in that, Determining the target route based on the forward search results and the reverse search results includes: In response to detecting that the forward search results and the reverse search results include a complete route, the complete route with the shortest distance and / or the shortest time is determined as the target route; In response to detecting that the forward search results and the reverse search results include incomplete lines, the incomplete lines are spliced ​​together to determine the target line.

11. The method according to claim 1, characterized in that, After dividing the urban road network into road network partitions based on the urban road network data to determine a multi-level road network partitioning structure, the method further includes: For each level of road network partition structure, determine the shortcut information corresponding to the current level of road network partition structure.

12. The method according to claim 11, characterized in that, The shortcut information is used to characterize intra-unit shortcuts and inter-unit shortcuts in the corresponding hierarchical road network partition structure. Intra-unit shortcuts are shortcuts between boundary nodes of the same road network unit, and inter-unit shortcuts are shortcuts between boundary nodes of different road network units. The shortcut information corresponding to the current hierarchical road network partition structure includes: In the urban road network, road segments whose starting point and ending point are located in different road network units within the current hierarchical road network partitioning structure are identified as inter-unit shortcuts; The boundary nodes of each road network unit are determined based on the shortcuts between the units; The intra-unit shortcuts of each road network unit are determined based on the boundary nodes.

13. The method according to claim 1, characterized in that, The step of performing road network layering on each of the basic road network units to determine the road network layering structure corresponding to each of the basic road network units includes: For each of the aforementioned basic road network units, determine the importance of each unit node within the basic road network unit; Based on the importance of the nodes, the basic road network units are sorted and shrunk respectively to determine the road network layer structure corresponding to each basic road network unit.

14. The method according to claim 1, characterized in that, The method further includes: In response to the detection that the urban road network has been updated, obtain the road network update data; The road network layering structure of the corresponding basic road network unit is updated based on the road network update data.

15. A location-based information processing device, characterized in that, The device includes: The data acquisition unit is used to acquire urban road network data. A road network partitioning unit is used to partition the urban road network according to the urban road network data to determine a multi-level road network partitioning structure. The multi-level road network partitioning structure includes a basic-level road network partitioning structure, which has the highest granularity of partitioning in the multi-level road network partitioning structure. The basic-level road network partitioning structure includes multiple basic road network units. A road network layering unit is used to perform road network layering on each of the basic road network units to determine the road network layering structure corresponding to each of the basic road network units; A data structure fusion unit is used to construct a road network fusion data structure based on the multi-level road network partition structure and each of the road network hierarchical structures. The route determination unit is used to plan the target route according to the road network fusion data structure in response to receiving a route planning request.

16. A computer-readable storage medium storing computer program instructions thereon, characterized in that, The computer program instructions, when executed by a processor, implement the method as described in any one of claims 1-14.

17. An electronic device, characterized in that, The device includes: Memory is used to store one or more computer program instructions; A processor, wherein the one or more computer program instructions are executed by the processor to implement the method as described in any one of claims 1-14.

18. A computer program product, characterized in that, When the computer program product is run on a computer, it causes the computer to perform the method as described in any one of claims 1-14.

Images