A navigation method, device, electronic device and storage medium

Abstract

The present disclosure provides a navigation method, device, electronic device and storage medium, which relate to the field of intelligent transportation, and in particular to the field of navigation technology. The specific implementation scheme is: receiving a navigation request, obtaining the starting point information and the end point information in the navigation request; determining the initial navigation information according to the starting point information and the end point information; when the initial navigation information is related to the associated road information of the roadless area, determining the shortest path in the roadless area according to the navigation request; using the shortest path in the roadless area and the initial navigation information, determining the final navigation path. The present disclosure can improve the effect of navigation.

Description

Technical Field

[0001] The present disclosure relates to the field of intelligent transportation technology, and in particular to the field of navigation technology. Background Art

[0002] Navigation devices are often used in in-vehicle navigation systems or mobile terminal systems to generate and display navigation instructions using a map database for use by vehicles or pedestrians. The navigation road data in the related art only expresses roads with specific shapes. These roads with specific shapes constitute the entire road network. When users actually use them, they navigate through these expressed roads. However, this method is not applicable to some scenarios, resulting in unsatisfactory results. Summary of the invention

[0003] The present disclosure provides a navigation method, device, electronic device and storage medium.

[0004] According to one aspect of the present disclosure, there is provided a navigation method, comprising:

[0005] Receiving a navigation request, and obtaining starting point information and end point information in the navigation request;

[0006] Determine initial navigation information according to the starting point information and the end point information;

[0007] In a case where the initial navigation information is related to the associated road information of the roadless area, determining the shortest path in the roadless area according to the navigation request;

[0008] The final navigation path is determined by using the shortest path in the roadless area and the initial navigation information.

[0009] According to another aspect of the present disclosure, there is provided a navigation device, comprising:

[0010] An acquisition module, used for receiving a navigation request and acquiring starting point information and end point information in the navigation request;

[0011] An initial determination module, used to determine initial navigation information according to the starting point information and the end point information;

[0012] A shortest path determination module, configured to determine the shortest path in the roadless area according to the navigation request when the initial navigation information is related to the associated road information of the roadless area;

[0013] The final determination module is used to determine the final navigation path by using the shortest path in the roadless area and the initial navigation information.

[0014] According to another aspect of the present disclosure, there is provided an electronic device, comprising:

[0015] at least one processor; and

[0016] a memory communicatively connected to the at least one processor; wherein,

[0017] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform any one of the above navigation methods.

[0018] According to another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute any one of the above navigation methods.

[0019] According to another aspect of the present disclosure, a computer program product is provided, comprising a computer program, wherein the computer program implements any one of the above navigation methods when executed by a processor.

[0020] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present disclosure.

[0022] Figure 1 A schematic diagram of an implementation flow of a navigation method according to an embodiment of the present disclosure;

[0023] Figure 2 is a schematic diagram of an application scenario of the present disclosure;

[0024] Figure 3A is a schematic diagram of a roadless area and its associated road information according to an embodiment of the present disclosure;

[0025] Figure 3B is a schematic diagram of a roadless area and its associated road information according to another embodiment of the present disclosure;

[0026] Figure 4A is a schematic diagram of a navigation implementation scenario of an embodiment of the present disclosure;

[0027] Figure 4B is another schematic diagram of a navigation implementation scenario in an embodiment of the present disclosure;

[0028] Figure 4C is another schematic diagram of a navigation implementation scenario in an embodiment of the present disclosure;

[0029] Figure 5A structural schematic diagram of a navigation device 500 according to an embodiment of the present disclosure;

[0030] Figure 6 A schematic structural diagram of a navigation device 600 according to an embodiment of the present disclosure;

[0031] Figure 7 It is a block diagram of an electronic device used to implement the navigation method of the embodiment of the present disclosure. DETAILED DESCRIPTION

[0032] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present disclosure. Similarly, for the sake of clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0033] The term "and / or" in this article is only a description of the association relationship of associated objects, indicating that there may be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. The term "at least one" in this article means any combination of at least two of any one or more of a plurality of. For example, including at least one of A, B, and C can mean including any one or more elements selected from the set consisting of A, B, and C. The terms "first" and "second" in this article refer to multiple similar technical terms and distinguish them. They do not mean to limit the order or to limit them to only two. For example, the first feature and the second feature refer to two types / two features. The first feature can be one or more, and the second feature can also be one or more.

[0034] In addition, in order to better illustrate the present disclosure, numerous specific details are given in the following specific embodiments. It should be understood by those skilled in the art that the present disclosure can also be implemented without certain specific details. In some examples, methods, means, components and circuits well known to those skilled in the art are not described in detail in order to highlight the subject matter of the present disclosure.

[0035] The navigation road data in the related technology only expresses roads with specific shapes. These roads with specific shapes constitute the entire road network. Users can navigate through these expressed roads when they actually use them. This method is not applicable to some scenarios. For example, for areas without specific road shapes, pedestrians can actually travel freely in such areas, but the current linear data cannot express specific roads, resulting in the inability to guide users through areas without specific road shapes (hereinafter referred to as non-road-shaped areas) in actual applications. In addition, if the starting point or end point of the navigation request is in the non-road-shaped area, the usual navigation method cannot accurately initiate or end navigation, and can only initiate or end navigation by binding to the road closest to the starting point or end point of the navigation request. It can be seen that the navigation effect of the existing navigation method is not ideal.

[0036] The present disclosure provides a navigation method. Figure 1 According to a flowchart of a navigation method according to an embodiment of the present disclosure, the method can be applied to a data processing device. For example, the device can be deployed in a terminal or server or other processing device for execution, and can implement navigation processing and other processing. Among them, the terminal can be a user equipment (UE, User Equipment), a mobile device, a personal digital assistant (PDA, Personal Digital Assistant), a handheld device, a computing device, a vehicle-mounted device, a wearable device, etc. In some possible implementations, the method can also be implemented by a processor calling a computer-readable instruction stored in a memory. The method can also be applied to a background server, or a middleware located in the background and connected to the front end and the background, including:

[0037] S110: receiving a navigation request, and obtaining starting point information and end point information in the navigation request;

[0038] S120: determining initial navigation information according to the starting point information and the end point information;

[0039] S130: When the initial navigation information is related to the associated road information of the roadless area, determining the shortest path in the roadless area according to the navigation request;

[0040] S140: Determine a final navigation path by using the shortest path in the roadless area and the initial navigation information.

[0041] In some embodiments, the roadless area may include an area where any passage is allowed (usually refers to an area where pedestrians can pass freely), such as a square. The roadless area can be represented by planar data on a map, such as using line segments, curves, longitude and latitude information, and multiple point information to define the scope of the roadless area. The roadless area may be a fully open area or a semi-open area; wherein a fully open area may refer to an area that can be entered from any position on the edge of the area and can be traversed freely within the area; a semi-open area may refer to an area that can be entered from one or more fixed positions on the edge of the area and can be traversed freely within the area.

[0042] The roadless area involved in the embodiments of the present disclosure generally refers to an area where pedestrians are allowed to pass freely. In some cases, the roadless area may also refer to an area where motor vehicles or non-motor vehicles are allowed to pass freely.

[0043] Figure 2 is a schematic diagram of an application scenario of the present disclosure. Figure 2 As shown, the user sends a user request to the terminal device, and the user request may include destination information, that is, the location information the user expects to reach. The terminal device uses positioning technology (such as the Global Positioning System (GPS)) to determine the current location and uses the current location as the starting point information. Alternatively, the user sends a user request to the terminal device, and the user request may include starting point information and end point information. The terminal device generates a navigation request, which carries the starting point information and the end point information; the terminal device sends the navigation request to the navigation server. The navigation server receives the navigation request, reads map data from a local storage device, or reads map data from a third-party service platform, and uses the map data to navigate according to the navigation request. In this scenario, the terminal device and the navigation server may be connected via wired or wireless communication.

[0044] In some other application scenarios, the terminal device itself can store map information, receive navigation requests from users, and perform navigation based on the navigation requests.

[0045] The embodiment of the present disclosure can pre-store the above-mentioned roadless area and its associated road information. A specific implementation method of pre-saving the roadless area and its associated road information includes:

[0046] Get map data;

[0047] determining at least one roadless area from the map data;

[0048] Each roadless area and the road information associated with the roadless area are stored.

[0049] For example, map data may be pre-stored in a map database, and the map data may include information such as roads, terrain conditions, topography, and whether passage is allowed at each location. As mentioned above, a roadless area may include an area where any passage is allowed. By pre-saving the roadless area and the associated road information of the roadless area, it is possible to quickly identify whether the shortest path exists during navigation, and determine the shortest path in the roadless area.

[0050] In some possible implementations, the associated road information of the roadless area may include at least one of the following:

[0051] (1) identification information of the road that is interconnected with any location in the roadless area and is closest to the roadless area;

[0052] (2) Sign information of a road that is interconnected with the exit of the roadless area and is closest to the exit of the roadless area.

[0053] By pre-saving different types of roadless areas and the associated road information of different types of roadless areas, different shortest paths can be generated for different types of roadless areas during navigation. For example, if the roadless area is a fully open area, the shortest path can pass through any position in the area and the road closest to the arbitrary position; if the roadless area is a semi-open area with only a few exits, the shortest path can pass through the exit of the area and the road closest to the exit.

[0054] Figure 3A Schematic diagram of a roadless area and its associated road information according to an embodiment of the present disclosure. Figure 3A The roadless area A shown is a fully open square, which has no fence or shielding around it. There are associated roads around the square, which are marked as 1, 2, 3 and 4. Roads 1, 2, 3 and 4 are interconnected with any position of the roadless area A. In the embodiment of the present disclosure, the roadless area A and its associated road information, i.e., roads 1, 2, 3 and 4, can be stored in advance in a map database or a separate database.

[0055] Figure 3B 4 is a schematic diagram of a road-free area and its associated road information according to another embodiment of the present disclosure. Figure 3BThe roadless area B shown is a semi-open square, with multiple exits around the square, and the rest of the square is fenced or blocked. There are associated roads around the square, and the identifications of these associated roads are 5, 6, 7 and 8 respectively. Roads 5, 6, 7 and 8 are interconnected with the exits of the roadless area B. The embodiment of the present disclosure can store the roadless area B and its associated road information, i.e., roads 5, 6, 7 and 8, in a map database or a separate database in advance, and can also store the exit position of the roadless area B.

[0056] by Figure 3A Take the scenario shown as an example. The starting point of the navigation request is position a and the end point is position b. If the existing navigation technology is used, since navigation can only be performed along linear road information, the generated navigation path is position a (position a is on road 2) -> road 1 -> position b (position b is on road 4); and it is impossible to cross the roadless area A (i.e., generate a straight line path between position a and position b). Obviously, the navigation path generated by the existing navigation technology is longer, so the navigation effect is not good.

[0057] The navigation method proposed in the embodiment of the present disclosure can be applied to a variety of scenarios, for example, the starting point and the end point in the navigation request are located on the associated roads of the roadless area; or the starting point and / or the end point in the navigation request are in the same or different roadless areas; etc. The following describes in detail various specific situations.

[0058] Scenario 1:

[0059] In this scenario, the above-mentioned initial navigation information is related to the associated road information of the roadless area in the following situations:

[0060] The associated road information of the roadless area includes information of the road where the starting point is located and / or the road where the end point is located;

[0061] The information of the road where the starting point is located and / or the road where the end point is located belongs to the initial navigation information.

[0062] For example, based on the starting point information and the end point information in the navigation request, the road where the starting point is located and / or the road where the end point is located is determined. The information of the road where the starting point is located and / or the road where the end point is located can be used as all or part of the initial navigation information. This method of determining the initial navigation information is relatively simple and can improve the navigation speed overall. Figure 4A is a schematic diagram of a navigation implementation scenario of an embodiment of the present disclosure, in Figure 4AIn the example, according to the information of the starting point 1 and the end point 1, it can be determined that the road where the starting point 1 is located is road 2, and the road where the end point 1 is located is road 4. The associated road information of the pre-stored multiple roadless areas is searched, and it is found that the associated roads of the roadless area A are roads 1, 2, 3, and 4. It can be seen that the associated road information (roads 1, 2, 3, and 4) of the roadless area A includes the road information (road 2) where the starting point 1 is located and the road information (road 4) where the end point 1 is located.

[0063] In this case, determining the shortest path in the roadless area according to the navigation request may include:

[0064] The shortest path in the roadless area is determined according to the starting point information in the navigation request, the end point information in the navigation request, the associated road information of the roadless area, and at least one of the roadless area.

[0065] For example, in Figure 4A In the scenario shown, based on the starting point information (starting point 1) in the navigation request, the end point information (end point 1) in the navigation request, the associated road information (roads 1, 2, 3, 4) of the roadless area, and the roadless area (area A), the shortest path from the starting point information (starting point 1) to the roadless area (area A) (such as starting point 1->node 1), and the shortest path from the end point information (end point 1) to the roadless area (area A) (such as end point 1->node 2) can be determined, and the shortest path from node 1 to node 2 can be determined, that is, the line segment between node 1 and node 2. Based on the above information, the shortest path in the roadless area can be determined, such as: starting point 1->node 1->node 2->end point 1, and the shortest path can be used as the final navigation path.

[0066] If the navigation method of this embodiment is executed by a navigation server, then after determining the final navigation path, the navigation server may send the final navigation path to the terminal device, and the terminal device may display the final navigation path.

[0067] Scenario 2:

[0068] In this scenario, the above-mentioned initial navigation information is related to the associated road information of the roadless area in the following situations:

[0069] The associated road information of the area without road shape includes at least one navigation road segment information, or there is an intersection between the road segment represented by the associated road information of the area without road shape and the road segment represented by at least one navigation road segment information;

[0070] The at least one navigation section information belongs to initial navigation information.

[0071] For example, according to the starting point information and the end point information in the navigation request, a common navigation algorithm is used to determine the initial navigation information, and the initial navigation information includes one or more navigation route information. Figure 4B FIG. 1 is another schematic diagram of a navigation implementation scenario of an embodiment of the present disclosure. Figure 4B In the example, according to the information of the starting point 2 and the end point 2, the initial navigation information can be determined, and a navigation section information contained in the initial navigation information is road 5; the associated roads of the roadless area B are roads 6, 7, 8, and 9, among which roads 6 and 9 have intersections with road 5. It can also be determined that the starting point 2 is within the roadless area B. In this way, whether the initial navigation information is related to the associated road information of the roadless area is determined, not only whether the associated roads of the roadless area contain the navigation section, but also whether the associated roads of the roadless area intersect with the navigation section, which can realize correlation judgment in a wider range, thereby expanding the scope of application of the navigation method proposed in the present disclosure.

[0072] In this case, determining the shortest path in the roadless area according to the navigation request may include:

[0073] The shortest path in the roadless area is determined according to the starting point information in the navigation request, the end point information in the navigation request, the associated road information of the roadless area, and at least one of the roadless area.

[0074] For example, in Figure 4B In the scenario shown, based on the starting point information (starting point 2) in the navigation request, the end point information (end point 2) in the navigation request, the associated road information (roads 6, 7, 8, 9) of the roadless area, and the roadless area (area B), it is possible to determine the intersection of road 6 and road 9 with road 5 from the starting point information (starting point 2) (e.g. Figure 4B The shortest path of the node 3 in the pathless area, that is, the line segment between the starting point 2 and the node 3, can determine the shortest path in the pathless area, that is: starting point 2->node 3. The above-proposed method for determining the shortest path is simple and easy to implement, and can improve the navigation speed as a whole.

[0075] Afterwards, the shortest path in the roadless area can be used to determine the final navigation path, that is, starting point 2 -> node 3 -> end point 2 , where node 3 reaches end point 2 via path 5 .

[0076] If the navigation method of this embodiment is executed by a navigation server, then after determining the final navigation path, the navigation server may send the final navigation path to the terminal device, and the terminal device may display the final navigation path.

[0077] Scenario 3:

[0078] Similar to scenario 2, this scenario contains at least one navigation segment information in the road-free area's associated road information, or there is an intersection between the segment represented by the road-free area's associated road information and the segment represented by at least one navigation segment information; wherein the at least one navigation segment information belongs to the initial navigation information. Different from scenario 2, in this scenario, the initial navigation information determined based on the start point information and the end point information of the navigation request spans multiple road-free areas.

[0079] Figure 4C FIG. 1 is another schematic diagram of a navigation implementation scenario of an embodiment of the present disclosure. Figure 4C In the example, according to the information of the starting point 3 and the end point 3, the initial navigation information can be determined. The multiple navigation road segment information contained in the initial navigation information includes roads 18, 15, 14, and 11. That is, according to the general navigation algorithm, the road from the starting point 3 to the end point 3 will pass through roads 18, 15, 14, and 11 in sequence. According to the pre-saved roadless area and its associated road information, it can be determined that road 18 is an associated road of the roadless area C, roads 15 and 14 are associated roads of the roadless area D, and road 11 is an associated road of the roadless area E, wherein the intersection of road 18 with roads 15 and 16 is node 4, and the intersection of road 11 with roads 14 and 17 is node 5.

[0080] In this case, determining the shortest path in the roadless area according to the navigation request may include:

[0081] The shortest path in the roadless area is determined according to the starting point information in the navigation request, the end point information in the navigation request, the associated road information of the roadless area, and at least one of the roadless area.

[0082] For example, in Figure 4C In the scenario shown, the initial navigation information can be determined based on the starting point information (starting point 3) and the end point information (end point 3) in the navigation request, and then based on the navigation segment information, roadless areas C, D, E and their associated road information contained in the initial navigation information, it can be determined that the shortest path in the roadless area C is the line segment between starting point 3 and node 4, the shortest path in the roadless area D is the line segment between node 4 and node 5, and the shortest path in the roadless area E is the line segment between node 5 and end point 3. The aforementioned line segments are combined to obtain the shortest path in the roadless area: starting point 3->node 4->node 5->end point 3.

[0083] Further, in some embodiments, first navigation segment information associated with an endpoint of the shortest path in the road-free area is determined from the navigation segment information of the initial navigation information;

[0084] The shortest path in the roadless area is used to replace and / or modify the first navigation section information in the initial navigation information to obtain the final navigation path.

[0085] by Figure 4C Taking the example shown as an example, the endpoints of the shortest path in the roadless area may include: starting point 3, node 4, node 5 and end point 3. In the navigation segment information of the initial navigation information, the navigation segment information associated with the endpoints of the shortest path in the roadless area includes roads 18, 15, 14, and 11.

[0086] In order to determine the final navigation path. In some embodiments, it is determined that the starting point 3 is located in the roadless area C and the road 18 is an associated road of the roadless area C, so the starting point 3 is associated with the road 18; the node 4 is a position in the road 18, so the node 4 is associated with the road 18; according to the aforementioned association, the "starting point 3->node 4" in the shortest path can be used to replace the road 18 in the initial navigation information (road 18 belongs to the above-mentioned first navigation section information). In addition, it is determined that node 4 is a position in the road 15, so node 4 is associated with the road 15; node 5 is a position in the road 14, so node 4 is associated with the road 14; according to the aforementioned association, the "node 4->node 5" in the shortest path can be used to replace the roads 15 and 14 in the initial navigation information (roads 15 and 14 belong to the above-mentioned first navigation section information). Furthermore, it is determined that the end point 3 is located in the roadless area E and the road 11 is an associated road of the roadless area E, so the end point 3 is associated with the road 11; the node 5 is a position in the road 11, so the node 5 is associated with the road 11; according to the aforementioned association, the road 11 in the initial navigation information can be replaced by "node 5->end point 3" in the shortest path (road 11 belongs to the above-mentioned first navigation section information). Based on the above replacement results, the final navigation path is determined to be: starting point 3->node 4->node 5->end point 3.

[0087] The above scenarios are only examples, and in actual applications, there are more abundant scenarios for implementing navigation. In short, the disclosed embodiment pre-saves the roadless area and its associated road information, and when the initial navigation information determined by the navigation algorithm in the relevant technology passes through the roadless area, or the starting point and / or end point of the navigation request is located in the roadless area, or there are other situations involving the roadless area, the shortest path in the roadless area is determined, and the shortest path is used to replace and / or modify the initial navigation information, and the final navigation path obtained can pass through the roadless area, solving the detour problem caused by the inability to plan the roadless area, thereby planning the shortest route and improving the navigation effect.

[0088] The present disclosure also provides a navigation device. Figure 5According to a structural diagram of a navigation device 500 according to an embodiment of the present disclosure, the navigation device includes:

[0089] The acquisition module 510 is used to receive a navigation request and acquire the starting point information and the end point information in the navigation request;

[0090] An initial determination module 520, configured to determine initial navigation information according to the starting point information and the end point information;

[0091] The shortest path determination module 530 is used to determine the shortest path in the roadless area according to the navigation request when the initial navigation information is related to the associated road information of the roadless area;

[0092] The final determination module 540 is used to determine the final navigation path by using the shortest path in the roadless area and the initial navigation information.

[0093] The present disclosure also provides a navigation device. Figure 6 A structural diagram of a navigation device 600 according to an embodiment of the present disclosure, the navigation device comprises: an acquisition module 510, an initial determination module 520, a shortest path determination module 530, a final determination module 540 and a storage module 650;

[0094] Among them, the acquisition module 510, the initial determination module 520, the shortest path determination module 530, and the final determination module 540 are the same as the corresponding modules in the above navigation device 500, and are not described in detail here.

[0095] The storage module 650 is used to obtain map data, determine at least one roadless area from the map data, and store each of the roadless areas and the associated road information of the roadless areas.

[0096] In some possible implementations, the roadless area includes an area that allows any passage;

[0097] In some possible implementations, the associated road information of the roadless area includes at least one of the following:

[0098] identification information of a road that is interconnected with any position in the roadless area and is closest to the roadless area;

[0099] The identification information of a road which is interconnected with the exit of the roadless area and is closest to the exit of the roadless area.

[0100] In some possible implementations, the initial navigation information is related to the associated road information of the roadless area, including:

[0101] The associated road information of the roadless area includes information of the road where the starting point is located and / or the road where the end point is located;

[0102] The information of the road where the starting point is located and / or the road where the end point is located belongs to the initial navigation information.

[0103] In some other possible implementations, the initial navigation information is related to the associated road information of the roadless area, including:

[0104] The associated road information of the road-free area contains at least one navigation road segment information, or there is an intersection between the road segment represented by the associated road information of the road-free area and the road segment represented by the at least one navigation road segment information;

[0105] Wherein, the at least one navigation section information belongs to the initial navigation information.

[0106] In some possible implementations, the above-mentioned initial determination module 520 is used to determine the shortest path in the roadless area based on the starting point information in the navigation request, the end point information in the navigation request, the associated road information of the roadless area and at least one item in the roadless area.

[0107] In some possible implementations, the final determination module 540 is configured to:

[0108] Determining first navigation segment information associated with an endpoint of the shortest path in the roadless area from the navigation segment information of the initial navigation information;

[0109] The first navigation section information in the initial navigation information is replaced and / or modified by using the shortest path in the road-free area to obtain the final navigation path.

[0110] In the technical solution disclosed herein, the acquisition, storage and application of user personal information involved are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0111] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

[0112] Figure 7A schematic block diagram of an example electronic device 700 that can be used to implement an embodiment of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0113] like Figure 7 As shown, the device 700 includes a computing unit 701, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 702 or a computer program loaded from a storage unit 708 into a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the device 700 can also be stored. The computing unit 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0114] A number of components in the device 700 are connected to the I / O interface 705, including: an input unit 706, such as a keyboard, a mouse, etc.; an output unit 707, such as various types of displays, speakers, etc.; a storage unit 708, such as a disk, an optical disk, etc.; and a communication unit 709, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 709 allows the device 700 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0115] The computing unit 701 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 701 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 701 performs the various methods and processes described above, such as navigation methods. For example, in some embodiments, the navigation method may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 708. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 700 via the ROM 702 and / or the communication unit 709. When the computer program is loaded into the RAM 703 and executed by the computing unit 701, one or more steps of the navigation method described above may be performed. Alternatively, in other embodiments, the computing unit 701 may be configured to perform the navigation method in any other appropriate manner (e.g., by means of firmware).

[0116] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0117] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0118] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0119] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0120] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0121] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.

[0122] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.

[0123] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A navigation method, comprising: Receiving a navigation request, and obtaining starting point information and end point information in the navigation request; Determine initial navigation information according to the starting point information and the end point information; In a case where the initial navigation information is related to the associated road information of the roadless area, determining the shortest path in the roadless area according to the starting point information in the navigation request, the end point information in the navigation request, the associated road information of the roadless area and the roadless area; Determine a final navigation path by using the shortest path in the roadless area and the initial navigation information; The initial navigation information is related to the associated road information of the roadless area, including: The associated road information of the road-free area contains at least one navigation road segment information, or there is an intersection between the road segment represented by the associated road information of the road-free area and the road segment represented by the at least one navigation road segment information; the at least one navigation road segment information belongs to the initial navigation information; The roadless area includes an area where at least one of pedestrians, non-motorized vehicles and motorized vehicles can pass freely and a specific road cannot be expressed by linear data.

2. The method according to claim 1, further comprising: Get map data; determining at least one roadless area from the map data; The roadless areas and the road information associated with the roadless areas are stored.

3. The method according to claim 2, wherein: The roadless area includes an area where any passage is allowed; The associated road information of the roadless area includes at least one of the following: identification information of a road that is interconnected with any position in the roadless area and is closest to the roadless area; The identification information of a road which is interconnected with the exit of the roadless area and is closest to the exit of the roadless area.

4. The method according to any one of claims 1 to 3, wherein: The initial navigation information is related to the associated road information of the roadless area, and also includes: The associated road information of the roadless area includes information of the road where the starting point is located and / or the road where the end point is located; The information of the road where the starting point is located and / or the road where the end point is located belongs to the initial navigation information.

5. The method according to claim 1, wherein: The determining of the final navigation path by using the shortest path in the roadless area and the initial navigation information comprises: Determining first navigation segment information associated with an endpoint of the shortest path in the roadless area from the navigation segment information of the initial navigation information; The first navigation section information in the initial navigation information is replaced and / or modified by using the shortest path in the road-free area to obtain the final navigation path.

6. A navigation device, comprising: An acquisition module, used for receiving a navigation request and acquiring starting point information and end point information in the navigation request; An initial determination module, used to determine initial navigation information according to the starting point information and the end point information; a shortest path determination module, configured to determine the shortest path in the roadless area according to the starting point information in the navigation request, the end point information in the navigation request, the road information associated with the roadless area, and the roadless area, when the initial navigation information is related to the associated road information of the roadless area; A final determination module, used to determine a final navigation path by using the shortest path in the roadless area and the initial navigation information; The initial navigation information is related to the associated road information of the roadless area, including: The associated road information of the road-free area contains at least one navigation road segment information, or there is an intersection between the road segment represented by the associated road information of the road-free area and the road segment represented by the at least one navigation road segment information; the at least one navigation road segment information belongs to the initial navigation information; The roadless area includes an area where at least one of pedestrians, non-motorized vehicles and motorized vehicles can pass freely and a specific road cannot be expressed by linear data.

7. The apparatus according to claim 6, further comprising: The storage module is used to obtain map data, determine at least one roadless area from the map data, and store each of the roadless areas and the associated road information of the roadless areas.

8. The device according to claim 7, wherein: The roadless area includes an area where any passage is allowed; The associated road information of the roadless area includes at least one of the following: identification information of a road that is interconnected with any position in the roadless area and is closest to the roadless area; The identification information of a road which is interconnected with the exit of the roadless area and is closest to the exit of the roadless area.

9. The device according to any one of claims 6 to 8, wherein: The initial navigation information is related to the associated road information of the roadless area, including: The associated road information of the roadless area includes information of the road where the starting point is located and / or the road where the end point is located; The information of the road where the starting point is located and / or the road where the end point is located belongs to the initial navigation information.

10. The device according to claim 6, wherein: The final determination module is used to: Determining first navigation segment information associated with an endpoint of the shortest path in the roadless area from the navigation segment information of the initial navigation information; The first navigation section information in the initial navigation information is replaced and / or modified by using the shortest path in the road-free area to obtain the final navigation path.

11. An electronic device, comprising: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 5.

12. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1 to 5.

13. A computer program product comprising a computer program, which, when executed by a processor, implements the method according to any one of claims 1 to 5.

Images