Methods for identifying impenetrable roads, path planning methods, and related equipment.

By identifying impenetrable roads during the path planning process, the problem of misjudging impenetrable roads in existing technologies is solved, improving the quality and efficiency of path planning and ensuring that the route complies with the user's access permissions.

CN115808181BActive Publication Date: 2026-11-10PETAL CLOUD TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202111082883.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-09-15
Publication Date
2026-11-10
Estimated Expiration
2041-09-15

AI Technical Summary

Technical Problem

Existing route planning algorithms sometimes misidentify impassable roads, resulting in routes that are impassable to the user, which affects navigation performance and efficiency.

Method used

During the path planning process, by determining whether the roads entering and exiting the road network subgrids are penetrable, and combining this with the penetrability of previous routes and shortcuts, impenetrable roads can be identified and filtered in advance, avoiding the need to make judgments after route combination.

Benefits of technology

It effectively avoids misjudging impenetrable roads, improves the quality and efficiency of path planning, reduces pathfinding time, and ensures that the recalled routes comply with the user's access permissions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115808181B_ABST
    Figure CN115808181B_ABST
Patent Text Reader

Abstract

This application provides a method for identifying impenetrable roads, a path planning method, and related equipment. The identification method includes: determining whether an inbound road of a road network subgrid is a penetrable road; if the inbound road of the road network subgrid is an impenetrable road, determining whether the outbound road of the road network subgrid is a penetrable road; if the outbound road of the road network subgrid is a penetrable road, determining whether a previous route has a penetrable road; if the previous route has a penetrable road, then the route formed by the combination of the previous route and the road network subgrid is an unusable route; wherein, the previous route is the route between the starting point and the inbound road. When performing path planning using a graph segmentation-based path planning algorithm, the above method identifies whether the route contains impenetrable roads during the path finding process, thereby improving the quality of the route obtained by path planning and improving the efficiency of path finding.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of path planning technology, and in particular to a method for identifying impenetrable roads, a path planning method, and related equipment. Background Technology

[0002] Route planning greatly facilitates users' daily travel by providing the best navigation route between the starting point and the destination.

[0003] To accelerate the response time of route planning requests, i.e., shorten the navigation route calculation time, the CRP (Customizable Route Planning) method has been proposed. The CRP algorithm divides the real road network hierarchically, with each layer divided into several road network sub-grids. Each sub-grid includes inbound and outbound roads. It searches for navigation routes from the origin to the destination. Whenever an inbound road is found in a sub-grid, a route calculation strategy is determined according to the route planning rules corresponding to that navigation route request. For example, if the strategy is the shortest distance, the optimal navigation route is selected and output using the shortest distance strategy for that sub-grid.

[0004] The inventors of this application discovered during their research on existing technologies that high-level road network subgrids use routes pre-generated from low-level road network subgrids for planning, while the lowest-level road network subgrids use basic roads to generate routes. However, using this method, local road network subgrid information cannot solve the problem of impenetrable roads in the overall path planning. For example, when the inbound or outbound road of a low-level road network subgrid is impassable, no impenetrable road exists when navigating based on the low-level road network subgrid. Since the inbound or outbound road is the start or end point of the low-level road network subgrid, the navigation system assumes that the user has access to that road network subgrid and therefore determines that the road network subgrid is a permeable road. However, when multiple road network subgrids are combined to form a new route, the new route may contain impenetrable roads, affecting the navigation effect. Impenetrable roads are roads with traffic restrictions. Summary of the Invention

[0005] This application discloses a method for identifying impenetrable roads, a path planning method, and related equipment, which can identify whether a route contains impenetrable roads during the path planning process, thereby improving the quality of the route obtained by path planning and increasing the efficiency of path finding.

[0006] The first aspect of this application discloses an identification method, the method comprising: Determine whether the access road to the subgrid of the road network is a penetrable road; If the road entering the subgrid of the road network is an impenetrable road, determine whether the road exiting the subgrid of the road network is a penetrable road; If the exit road of the road network subgrid is a penetrable road, determine whether there is a penetrable road in the previous route; If the previous route has a penetrable road, then the route formed by the combination of the previous route and the road network subgrid is an unusable route; The previous route is the route between the starting point and the road into which the vehicle enters.

[0007] Thus, when performing path planning using a graph segmentation-based path planning algorithm, the algorithm can effectively determine and identify whether the planned route contains impenetrable roads during the pathfinding process. This avoids situations where the determination is made after path planning is complete, leading to the final determined route containing impenetrable roads. Furthermore, the impenetrable road identification method provided by this invention can also effectively avoid recalling more route results to avoid impenetrable roads, accelerating the pathfinding exit speed and reducing the overall pathfinding time. Using the impenetrable road decision scheme provided by this invention, given a fixed number of recalled routes, the scheme can improve the quality of the final multi-route results and obtain better route planning results because paths containing impenetrable roads have already been filtered during the pathfinding process. By advancing the determination of impenetrable roads from the route selection stage after pathfinding is completed to the pathfinding stage, impenetrable roads can be avoided during the pathfinding process, ensuring the quality of recalled routes and improving pathfinding efficiency.

[0008] In some embodiments, if the exit road of the road network subgrid is an impenetrable road, the method further includes: Determine if a shortcut exists that can be penetrated by a road; If the shortcut has a passable road, determine whether the previous route has a passable road; If the previous route has a penetrable road, the route formed by the combination of the previous route and the road network subgrid is determined to be an unusable route; The shortcut is the route between the inbound road and the outbound road.

[0009] In some embodiments, the method further includes: If the road entering the subgrid of the road network is a penetrable road, determine whether the road exiting the subgrid of the road network is a penetrable road; If the exit road is a penetrable road, determine whether the shortcut is a penetrable road; If the shortcut has an impenetrable road, then the route formed by the combination of the previous route and the road network subgrid is determined to be an unusable route.

[0010] A second aspect of this application provides a path planning method, the method comprising: Obtain the starting and ending points of the path planning; Based on the starting point and the ending point, a planned route is obtained. During the process of obtaining the planned route, when a path is found to one of the sub-grids: Determine whether the access road to the subgrid of the road network is a penetrable road; If the road entering the subgrid of the road network is an impenetrable road, determine whether the road exiting the subgrid of the road network is a penetrable road; If the exit road of the road network subgrid is a penetrable road, determine whether there is a penetrable road in the previous route; If the previous route has a penetrable road, then the route formed by the combination of the previous route and the road network subgrid is an unusable route; The previous route is the route between the starting point and the road into which the vehicle enters.

[0011] In some embodiments, if the exit road of the road network subgrid is an impenetrable road, the method further includes: Determine if a shortcut exists that can be penetrated by a road; If the shortcut has a passable road, determine whether the previous route has a passable road; If the previous route has a penetrable road, the route formed by the combination of the previous route and the road network subgrid is determined to be an unusable route; The shortcut is the route between the inbound road and the outbound road.

[0012] In some embodiments, the shortcut includes a plurality of consecutive roads, and at least one of the plurality of consecutive roads of the shortcut is a penetrable road; The previous route includes multiple consecutive roads, and at least one of the multiple consecutive roads of the previous route is a penetrable road.

[0013] A third aspect of this application discloses a computer-readable storage medium storing computer instructions that, when executed on an identification device, cause the identification device to perform the identification method as described in the first aspect or the path planning method as described in the second aspect.

[0014] The fourth aspect of this application discloses an identification device, which includes a processor and a memory. The memory is used to store instructions, and the processor is used to call the instructions in the memory to cause the identification device to perform the identification method as described in the first aspect.

[0015] The fifth aspect of this application discloses a chip system applied to an identification device; the chip system includes an interface circuit and a processor; the interface circuit and the processor are interconnected by a line; the interface circuit is used to receive signals from the memory of the identification device and send signals to the processor, the signals including computer instructions stored in the memory; when the processor executes the computer instructions, the chip system performs the identification method as described in the first aspect.

[0016] The sixth aspect of this application discloses a path planning apparatus, which includes a processor and a memory. The memory is used to store instructions, and the processor is used to call the instructions in the memory to cause the identification device to perform the path planning method as described in the second aspect.

[0017] It should be understood that the computer-readable storage medium described in the third aspect, the identification device described in the fourth aspect, the chip system described in the fifth aspect, and the path planning device described in the sixth aspect all correspond to the methods described in the first or second aspects. Therefore, the beneficial effects they can achieve can be referred to the beneficial effects in the corresponding methods provided above, and will not be repeated here. Attached Figure Description

[0018] Figure 1A This is a schematic diagram of the road network subgrid provided in the embodiments of this application.

[0019] Figure 1B This is a schematic diagram of the road network subgrid provided in the embodiments of this application.

[0020] Figure 1C This is a schematic diagram of the combination of multi-path sub-mesh provided in the embodiments of this application.

[0021] Figure 2 This is a flowchart illustrating the method for identifying impenetrable roads provided in this application embodiment.

[0022] Figure 3A This is a schematic diagram of the route combination of multiple sub-mesh networks provided in the embodiments of this application.

[0023] Figure 3B This is a schematic diagram of the route combination of multi-path sub-mesh provided in the embodiments of this application. Figure 2 .

[0024] Figure 4 This is a schematic diagram illustrating the identification of impenetrable roads in a multi-path sub-mesh provided in an embodiment of this application.

[0025] Figure 5 This is a schematic diagram of the structure of the identification device provided in the embodiments of this application.

[0026] Figure 6This is a schematic diagram of the path planning device provided in the embodiments of this application. Detailed Implementation

[0027] For ease of understanding, exemplary descriptions of some concepts related to the embodiments of this application are provided for reference.

[0028] It should be noted that in this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The terms "first," "second," "third," "fourth," etc. (if present) in the specification, claims, and drawings of this application are used to distinguish similar objects, not to describe a specific order or sequence.

[0029] The following section introduces the relevant terms and concepts that may be involved in the embodiments of this application.

[0030] An impassable road is one or more consecutive roads with route restrictions, preventing drivers from directly traversing such restricted paths. Impassable roads include private roads, residential roads, and military roads. Impassable roads are not completely impassable; they are passable, but access requires permission. Some users may possess this permission. For example, if the impassable road is a user's private road on their estate, that user can drive directly across it. Furthermore, if a user's planned route starts on an impassable road, it indicates that the user has the right to use that road, and thus, by default, the driver is permitted to drive on it. Similarly, if a user's planned route ends on an impassable road, it indicates that the user also has the right to use that road.

[0031] Among them, penetrable roads are the opposite of impenetrable roads. Penetrable roads are roads without traffic restrictions and can also be understood as roads that can be passed normally.

[0032] Path planning: A sequence of points or curves connecting the starting point and the ending point is called a route, and the strategy for constructing a route is called path planning.

[0033] Before introducing the proposed solution, a brief overview of the CRP algorithm is provided. CRP is a graph-partition-based path planning algorithm that divides the real road network into multiple layers. Each layer is further divided into sub-grids, referred to as Cells in the CRP algorithm. During path planning, routes within the lower-level sub-grids are first obtained, and then the overall planned route is formed based on the routes within these sub-grids.

[0034] For example, the map of Henan Province is divided into three layers. The first layer consists of road network subgrids for each urban area; the second layer consists of road network subgrids for each county under the urban area; and the third layer consists of road network subgrids for each township under the county. For each road network subgrid in each layer, the entry and exit roads are fixed. An entry road is a road that enters this road network subgrid from another road network subgrid, and an exit road is a road that exits from this road network subgrid.

[0035] like Figure 1A As shown, Figure 1A A schematic diagram showing the division of Cell1 into four lower-level Cells, namely Cell1-1, Cell1-2, Cell1-3, and Cell1-4. Each Cell has an exit road (CutOut) and an entry road (CutIn). In subsequent examples of this application, CutEdge is used to represent the boundary road of the Cell, which can be either an exit road or an entry road.

[0036] like Figure 1B As shown, Cell1 has two inbound roads, CutIn1 and CutIn2, and two outbound roads, CutOut1 and CutOut2. The path from CutIn to CutOut within a Cell is called a ShortPath; the path from the starting point to CutIn is called a PreRoute, which can also be a path from a CutOut in another subgrid to a CutIn in the current subgrid.

[0037] The preceding route may include multiple consecutive road segments, which may be located in the same road network subgrid and form a complete road network subgrid. Alternatively, the multiple consecutive road segments may be only a part of a road network subgrid. For example, if the starting point is located at the center of the road network subgrid, then the route between the road network subgrid and the adjacent road network subgrid is the preceding route, and the preceding route only includes a part of the area of ​​the road network subgrid.

[0038] Optionally, the multiple road segments of the previous route may also be located within multiple road network subgrids. For example, the previous route includes road A, road B, and road C, where road A is located in Cell 1, road B in Cell 2, and road C in Cell 3. The shortcut may include multiple consecutive road segments, which may be located within the same road network subgrid, and these consecutive road segments may form a complete road network subgrid.

[0039] Optionally, a shortcut is a path from CutIn to CutOut within a Cell. Multiple segments of a shortcut can also be located in multiple lower-level road network subgrids. For example, a shortcut is a path from CutIn to CutOut within Cell0. The shortcut includes road A, road B, and road C, where road A is located in Cell1, road B is located in Cell2, and road C is located in Cell3. Cell1, Cell2, and Cell3 are at a lower level than Cell0.

[0040] like Figure 1C As shown, there are two adjacent road network subgrids, Cell0 and Cell1. Cell0 has two boundary roads: CutEdgeA and CutEdgeB, and Cell1 has two boundary roads: CutEdgeB and CutEdgeC. If the current road network subgrid is Cell1 based on the CRP algorithm, then the route from CutEdgeA to CutEdgeB is called PreRoute. Of course, in other embodiments, PreRoute can also be the route from the user-input starting point to CutEdgeB, and the route from CutEdgeB to CutEdgeC is called ShortPath.

[0041] In the current route planning process, if there are impenetrable roads among the planned routes, the routes with impenetrable roads will be deleted to avoid the existence of impenetrable roads that users cannot pass through in the route planning.

[0042] Specifically, a route from the starting point to the destination is planned based on a path planning algorithm (such as the CRP algorithm), and multiple routes that meet preset conditions are stored, such as the route with the shortest travel time. Then, these routes are iterated sequentially to determine if any impassable roads exist. If so, the route is removed from the list of routes to avoid having impassable roads in the planned route. However, the above solution has the following problems: During the path planning process, considering the possibility of impassable roads among the planned routes, the number of planned routes is greater than the preset number. For example, to provide users with 3 optional routes, at least 4 or 5 routes must be planned to prevent the existence of impassable roads in the routes planned by the path planning algorithm. Planning multiple routes leads to a longer path planning time, increasing the delay and overall path planning time. Furthermore, if the number of routes obtained based on the path planning algorithm is a fixed value, if there are impassable roads among the fixed number of routes, routes containing impassable roads are removed, reducing the number of routes available to the user and affecting the quality of the planned routes.

[0043] Because the CRP algorithm is used for path planning, all roads are divided into cells of different levels. Routes to higher-level cells are planned based on pre-generated sub-routes from lower-level cells, and sub-routes to the lowest-level cells are generated based on the basic roads. In this path planning method, the locally planned cell routes cannot solve the problem of impassable roads in the overall path planning. This is because the actual planned route may cross multiple cells, and the route planning for each cell is independent. Especially in scenarios where the CutEdge is an impassable road, the pre-planned route in the cell is planned with the CutEdge as the start or end point. Therefore, when planning the path based on this cell, impassable roads in the path planning are identified as reasonable routes, resulting in situations where impassable roads are traversed in the overall route combining multiple cells.

[0044] Please see again Figure 1CIf CutEdgeB in Cell0 and Cell1 is an impenetrable road, when Cell0 generates a path with CutEdgeB as the endpoint, the CRP algorithm assumes that the user has permission to travel on the impenetrable road because the endpoint of the path planning for that Cell is on the impenetrable road. Therefore, for Cell0 only, Cell0 is the road that the user can actually travel on. Similarly, for Cell1, since the starting point of that Cell is on the impenetrable road, the CRP algorithm assumes that the user has permission to travel on the impenetrable road because the starting point of the path planning for that Cell is on the impenetrable road. Therefore, Cell1 is the impenetrable road. The overall planned route has the path: CutEdgeA-CutEdgeB-CutEdgeC, that is, from CutEdgeA to CutEdgeB, and then from CutEdgeB to CutEdgeC. CutEdgeA is a penetrable road, CutEdgeB is an impenetrable road, and CutEdgeC is a penetrable road. In the overall planned route, the impenetrable road CutEdgeB is neither the starting point nor the end point of the path planning. Therefore, the overall planned route does not have passage permission for the user. Thus, the route of Cell0 and Cell1 has an impenetrable road that cannot be passed, that is, the route is unusable. However, the CPR algorithm cannot identify the existence of an impenetrable road in the route during pathfinding.

[0045] Therefore, when performing path planning based on the CRP algorithm, the following situation exists when combining planned routes within a local cell to form the overall route: all locally planned routes are penetrable roads, but the overall route formed by combining locally planned routes (e.g., a route formed by combining multiple cells) contains impenetrable roads for which the user does not have permission to pass.

[0046] This application provides a method for identifying impenetrable roads during path planning, so that impenetrable roads can be identified during the path finding process of path planning at the cell level. This ensures that there are no impenetrable roads in the overall route planned by the path planning algorithm based on graph segmentation, thereby ensuring the rationality of the path finding results and ensuring that there are no impenetrable roads in the route obtained based on the path planning algorithm that are actually inaccessible to the user.

[0047] During the path planning process, route search is performed based on the starting point and the ending point of the path planning. Since the path planning algorithm based on graph segmentation divides the road between the starting point and the ending point into multiple levels of road network subgrids, and the path planning between each road network subgrid is independent of each other, the identification of impenetrable roads is performed when searching for each road network subgrid to ensure that the overall route formed by the combination of routes planned based on multiple levels of road network subgrids does not contain any impenetrable roads.

[0048] Please see Figure 2 The following is an illustrative example of a method for identifying impenetrable roads provided in the embodiments of this application.

[0049] The method for identifying impenetrable roads provided in this application is applied to the pathfinding process during path planning using a graph segmentation-based path planning algorithm, to ensure that there are no impenetrable roads in the completed path where the user does not have permission to pass.

[0050] S201: Determine whether the road entering the road network subgrid is a penetrable road. If the road entering is a penetrable road, proceed to S202; otherwise, proceed to S203.

[0051] Specifically, when path planning reaches the current road network subgrid, the identification of impenetrable roads is triggered. This application does not limit the location of the road network subgrid; the road network subgrid can be located at the starting point of navigation, the ending point, or any location between the starting and ending points.

[0052] Among them, penetrable roads and non-penetrable roads are the basic attributes of roads (including entering roads and exiting roads, and of course, roads between entering roads and exiting roads) in the road network sub-grid. These basic attributes can be stored in the path planning server.

[0053] In the path planning process, routes may contain roads with the "impenetrable road" attribute. However, these routes are actually traversable by the user. For example, if the impenetrable road is located in the road network subgrid where the path planning start or end point is located, even if the entry or exit roads of this subgrid have the basic attribute of impenetrable roads, the route still contains impenetrable roads. Since the user has permission to traverse these impenetrable roads, the route is actually traversable and usable for the user. Conversely, if the user does not have permission to traverse the entry or exit roads with the "impenetrable road" attribute on the route (i.e., the path planning start or end point is not on an impenetrable road), then the route contains impenetrable roads that the user cannot traverse, and the route is actually unusable for the user.

[0054] S202: The subgrid of this road network is determined to be identifiable.

[0055] Specifically, since the entry road of this road network subgrid is a penetrable road, the usability of a route containing this subgrid can be determined within the cell. If the road network subgrid includes multiple roads, it can be determined during the pathfinding process whether it includes impenetrable roads. For example, if the initial entry road of a road network subgrid is passable, and all other roads in the subgrid are passable, then the subgrid as a whole is passable; if at least one of the roads in the subgrid is impenetrable, then the subgrid as a whole is impenetrable, meaning the route containing this subgrid is unavailable.

[0056] S203: Determine whether the exit road of the road network subgrid is a penetrable road. If the exit road of the road network subgrid is a penetrable road, proceed to S204; if the exit road of the road network subgrid is not a penetrable road, proceed to S207.

[0057] Specifically, if the road entered is impenetrable, but all previous routes in this road network subgrid are also impenetrable, it means the starting point of the path planning is on an impenetrable road, and the user has permission to travel on that impenetrable road. Therefore, for this user, the route formed by combining the previous route with the current road network subgrid is traversable. Conversely, if the previous route includes a penetrable road, it means the previous route is not impenetrable, and the starting point of the path planning is not on an impenetrable road. Therefore, it means the user does not have permission to travel on that impenetrable road, and for this user, the route formed by combining the previous route with the current road network subgrid is impassable.

[0058] S204: Determine if there is a penetrable road on the previous route. If there is a penetrable road on the previous route, proceed to S205; if there is no penetrable road on the previous route, proceed to S206.

[0059] In one embodiment, if the previous route includes a plurality of consecutive roads, and at least one of the consecutive roads is a penetrable road, then the previous route has a penetrable road.

[0060] In one embodiment, the previous route includes at least one road network subgrid, and if one of the road network subgrids has at least one penetrable road, it indicates that the previous route has a penetrable road.

[0061] Furthermore, if there are no penetrable roads in the previous route, it means that at least one road network subgrid of the previous route is an impenetrable road.

[0062] Specifically, if the road leading to the current road network subgrid is an impenetrable road and the road leading out is a permeable road, then the following scenarios exist: Scene 1: If the previous route includes at least one road network subgrid, and the roads in at least one road network subgrid in the previous route are all impenetrable roads, then the previous route is an impenetrable road, and the user enters the current road network subgrid from the previous route. Since the previous route that the user has already traversed is an impenetrable road, and that route is passable for the user, and the exit road of the current route is a passable road, the route formed by the combination of the current road network subgrid and the previous route is passable for the user and is a usable route.

[0063] The previous route is the route that has been completed and has passed through the identification of impenetrable roads, indicating that the previous route is a route that the user can actually travel. If the roads in the road network subgrids of the previous route have the basic attribute of impenetrable roads, it means that the user has the right to travel through the impenetrable roads. For example, if the starting point of the navigation is located on an impenetrable road, and the route formed by the previous route and the current road network subgrid is still located on the same impenetrable road, then the route formed by the combination of the current road network subgrid and the previous route is traversable for the user.

[0064] Scene 2: At least one road in the previous route is a penetrable road. The user enters the current road network subgrid from the previous route on a penetrable road. Since the user was previously on a penetrable road and the road leading to the current route is impassable, there is an impassable road between the two penetrable roads. It is determined that the starting point of the user's route planning is not on an impassable road, and the user does not have the permission to pass through penetrable roads. Therefore, the current road network subgrid is an impassable impassable road.

[0065] S205: Determine that the route formed by the previous route and this subgrid is an unusable route.

[0066] S206: The subgrid of this road network is determined to be identifiable.

[0067] Specifically, if the previous route was an impenetrable road, it means that the starting point of the route planning is located on an impenetrable road, indicating that the user has permission to pass through that impenetrable road. Therefore, the route formed by the combination of the current road network subgrid and the previous route is passable for the user. The "identifiable" in S206 can be understood as: It can be determined whether the user has permission to pass through the road network subgrid. If all roads within the subgrid are either impenetrable or impenetrable, then the user has permission to pass through the subgrid; otherwise, the user does not have permission to pass through the subgrid.

[0068] S207: Determine if the shortcut has a penetrable road; if the shortcut does not have a penetrable road, proceed to S208; if the shortcut has a penetrable road, proceed to S209.

[0069] In one embodiment, the shortcut includes a plurality of consecutive roads, and if at least one of the consecutive roads is a penetrable road, then the shortcut has a penetrable road.

[0070] In one embodiment, a shortcut includes at least one road network subgrid, and if one of the road network subgrids has at least one penetrable road, it indicates that the shortcut has a penetrable road.

[0071] Furthermore, if a shortcut does not have any penetrable roads, it means that at least one subgrid of the shortcut is an impenetrable road.

[0072] S208: The subgrid of this road network is determined to be identifiable.

[0073] Since shortcuts do not have penetrable roads, the shortcut as a whole is an impenetrable road. Therefore, the current road network subgrid includes: entering road → shortcut → exit road: impenetrable road → impenetrable road → impenetrable road. Thus, the current road network subgrid is an impenetrable road. Within this subgrid, the route subgrid can be identified. Since the user's starting and ending points are both on impenetrable roads, this subgrid is traversable for the user. Therefore, by identifying whether a road network subgrid is traversable for the user, it can be determined that the subgrid is identifiable.

[0074] If the shortcut has a passable road, execute S209: Determine if the previous route has a passable road.

[0075] If there is a penetrable road on the previous route, execute S210: determine that the route formed by the previous route and the road network subgrid is an unusable route.

[0076] If no penetrable road exists on the previous route, execute S211: Determine that the road network subgrid is identifiable.

[0077] Thus, when performing path planning using a graph segmentation-based path planning algorithm, it is possible to effectively determine and identify whether the planned route contains impenetrable roads that the user has permission to traverse, avoiding situations where the determination is made after path planning is complete, resulting in the final determined route containing impenetrable roads that the user cannot traverse. Furthermore, the impenetrable road identification method provided in this application can also effectively avoid recalling more route results to avoid impenetrable roads, speeding up the path finding exit and reducing the overall path finding time. Using the impenetrable road identification method provided in this application, given a fixed number of recalled routes, since routes containing impenetrable roads that the user cannot traverse have already been filtered out during the path finding process, the solution can improve the quality of the final multi-route results and obtain better route planning results.

[0078] By moving the decision-making time for impenetrable roads from the route selection stage after the pathfinding process ends to the pathfinding stage, it is possible to avoid impenetrable roads that users cannot pass through during the pathfinding process, ensuring the quality of recalled roads and improving the efficiency of pathfinding.

[0079] Optionally, after identifying impenetrable roads in the road network subgrid, if the route formed by the previous route and the road network subgrid is an unusable route, then the route is deleted. If the route formed by the previous route and the road network subgrid is an unusable route, then the next road network subgrid is used for route finding based on the navigation endpoint.

[0080] The method for identifying impenetrable roads in the above embodiments can identify two types of routes that contain impenetrable roads that are impassable to the user. That is, the route is impassable to the user and needs to be discarded during the route planning process.

[0081] like Figure 3A As shown, the first type of route is: the CutIn of the subgrid is an impenetrable road, the CutOut of the subgrid is a permeable road, and the previous route of the subgrid is a permeable road.

[0082] like Figure 3B As shown, the second type of route: the CutIn of this subgrid is an impenetrable road, the CutOut of this subgrid is an impenetrable road, and the ShortPath between CutIn and CutOut is a permeable road, and the previous route is a permeable road.

[0083] for Figure 3AThe pathfinding process proceeds to the current road network subgrid. Before pathfinding, the subgrid has pre-generated the optimal path from CutIn to CutOut. During path generation, although CutIn is an impenetrable road, it is the starting point within the subgrid, so the subgrid determines that it has permission to traverse that impenetrable road. Path planning within the current subgrid cannot consider previous routes before CutIn. Since previous routes pass through penetrable roads, the overall route combination results in a sequence of penetrable road (PreRoute) → impenetrable road (CutIn) → penetrable road (CutOut). Therefore, the overall path planning includes impenetrable roads for which the user does not have permission, and these routes can be discarded during the path planning process to avoid traversing impenetrable roads.

[0084] for Figure 3B The overall planned route may have a sequence of paths: PreRoute → CutIn → ShortPath. If a path is not accessible to the user, it may be discarded during the route planning process to avoid passing through such a path.

[0085] To improve the efficiency of methods for identifying impenetrable roads, reduce the complexity of implementing such methods, and accelerate the identification of impenetrable roads during the pathfinding process, this application provides an implementation method for such identification.

[0086] In some embodiments, specifically, 1 bit is used to indicate whether CutIn and CutOut are penetrable roads, that is, CutIn = 1 indicates that the road entering is a penetrable road, and CutIn = 0 indicates that the road entering is a non-penetrable road; CutOut = 1 indicates that the road exiting is a penetrable road, and CutOut = 0 indicates that the road exiting is a non-penetrable road.

[0087] One bit is used to indicate whether there is a passable road in the ShortPath between CutIn and CutOut. That is, ShortPath = 1 means that the path between the inbound road and the outbound road is a passable road, and ShortPath = 0 means that there is no passable road between the inbound road and the outbound road. In other words, all roads in ShortPath are impassable roads.

[0088] One bit is used to indicate whether the path from the starting road to CutIn (denoted by PreRoute) has a penetrable road. PreRoute = 1 indicates that the path from the starting road to CutIn has a penetrable road, and PreRoute = 0 indicates that the path from the starting road to CutIn does not have a penetrable road. The data structure for the identification method is as follows: Struct RoadInfo : uint8 { CutIn: 1 CutOut: 1 ShortPath: 1 PreRoute: 1 Rsvd: 4 }

[0089] To determine whether a route containing the current road network subgrid is available, that is, to determine whether a route formed by combining the previous route with the current road network subgrid is available, the following formula can be used: (~CutIn&CutOut&PreRouteM) | (~CutIn&~CutOut&ShortPathN&PreRouteM); Where ShortPathN indicates whether there is a penetrable road in the shortcut between CutIn and CutOut, and N represents the level of the road network subgrid corresponding to CutIn and CutOut. ShortPathN is obtained from multiple ShortPathN-1 at the lower level: ShortPathN = ShortPath0N-1 | CutOut0N-1 | ShortPath1N-1 | CutOut1N-1 |… | ShortPathkN-1 | CutOutkN-1 | ShortPath(k+1)N-1 (N>0); ShortPath0 is an identifier indicating whether there is a penetrable road in the ShortPath composed of basic roads in the lowest level road network subgrid; Where PreRouteM is an indicator of whether the path from the starting road to CutIn passes through a penetrable road, and M represents the number of road network subgrids traversed from the starting road to CutIn: PreRouteM = PreRouteM-1 | CutIn |ShortPathN (M>0); where PreRoute0 is an indicator of whether there is a penetrable road in the basic road from the starting road to the first road network subgrid.

[0090] like Figure 4As shown, the current pathfinding leads to Cell2, which is a cell at level 2. Cell2 is divided into four cells at level 1: Cell2-1, Cell2-2, Cell2-3, and Cell2-4. CutIn2 and CutIn2-1 are the same road, serving as both the entry road to Cell2 and the entry road to Cell2-1, making it an entry road with two level attributes. CutOut2 and CutOut2-2 are the same road, serving as both the exit road to Cell2 and the exit road to Cell2-2, also an exit road with two level attributes. CutOut2-1 and CutIn2-2 are the same road, serving as both the exit road to Cell2-1 and the entry road to Cell2-2, both corresponding to a level of 1.

[0091] During the pathfinding process, upon reaching Cell2, the path will directly lead from CutIn2 to CutOut2. During this process, it is necessary to identify impenetrable roads. Based on the identification method provided in the above embodiments, ShortPath2 indicates whether there is a penetrable road on the path from CutIn2 to CutOut2 (ShortPath2 = 1 for yes, ShortPath2 = 0 for no, the representation is the same below), ShortPath2-1 indicates whether there is a penetrable road on the path from CutIn2-1 to CutOut2-1, ShortPath2-2 indicates whether there is a penetrable road on the path from CutIn2-2 to CutOut2-2, and CutOut2-1 indicates whether there is a penetrable road on CutOut2-1. According to the diagram, ShortPath2 = ShortPath2-1 | CutOut2-1 | ShortPath2-2; ShortPath2-1 = an identifier indicating whether there is a penetrable road on ShortPath2-1, which consists of basic roads; ShortPath2-2 = ... The system identifies whether there are penetrable roads on ShortPath2-2, which consists of basic roads. PreRoute1 indicates whether there are penetrable roads before CutIn2, PreRoute0 indicates whether there are penetrable roads before CutIn1, and CutIn1 indicates whether CutIn1 is a penetrable road: PreRoute1 = PreRoute0 | CutIn1 | ShortPath1; PreRoute0 = The system identifies whether there are penetrable roads on the basic roads from the starting road to CutIn1; CutIn2 indicates whether CutIn2 is a penetrable road, and CutOut2 indicates whether CutOut2 is a penetrable road. The final formula for determining whether the current Cell2 needs to be supplemented with an impassable decision and discarded as an invalid route is: (~CutIn2&CutOut2&PreRoute1)| (~CutIn2&~CutOut2&ShortPath2&PreRoute1).

[0092] This invention provides a data structure that supports the decision-making process for impenetrable roads and a method for generating the data. The data structure has a small memory footprint, is simple to generate, and can effectively support the operation of the decision-making algorithm.

[0093] This application provides a path planning method, the method comprising: Obtain the starting and ending points of the path planning; Based on the starting point and the ending point, a planned route is obtained. During the process of obtaining the planned route, when a path is found to one of the sub-grids: Determine whether the access road to the subgrid of the road network is a penetrable road; If the road entering the subgrid of the road network is an impenetrable road, determine whether the road exiting the subgrid of the road network is a penetrable road; If the exit road of the road network subgrid is a penetrable road, determine whether there is a penetrable road in the previous route; If the previous route has a penetrable road, then the route formed by the combination of the previous route and the road network subgrid is an unusable route; The previous route is the route between the starting point and the road into which the vehicle enters.

[0094] Optionally, if the exit road of the road network subgrid is an impenetrable road, the method further includes: Determine if a shortcut exists that can be penetrated by a road; If the shortcut has a passable road, determine whether the previous route has a passable road; If the previous route has a penetrable road, the route formed by the combination of the previous route and the road network subgrid is determined to be an unusable route; The shortcut is the route between the inbound road and the outbound road.

[0095] Optionally, the shortcut includes multiple consecutive roads, and at least one of the multiple consecutive roads of the shortcut is a penetrable road; The previous route includes multiple consecutive roads, and at least one of the multiple consecutive roads of the previous route is a penetrable road.

[0096] Figure 5 This is a schematic diagram of the structure of an identification device 50 provided in an embodiment of this application. For example... Figure 5 As shown, the identification device 50 may include: an RF circuit 501, a memory 502, an input unit 503, a display unit 504, a sensor 505, an audio circuit 506, a Wi-Fi module 507, a processor 508, a power supply 509, and a PIR 510. Those skilled in the art will understand that... Figure 5 The structure shown does not constitute a limitation on the convergence and forwarding path of the service flow and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0097] RF circuit 501 can be used to send and receive warning information and warning indication information. It receives and transmits signals, specifically receiving downlink information from the base station and then transferring it to processor 508 for processing. Additionally, it sends uplink data to the base station. Typically, RF circuit 501 includes, but is not limited to: an antenna, at least one amplifier, a transceiver, a coupler, a low-noise amplifier (LNA), a duplexer, etc.

[0098] The memory 502 can be used to store software programs and modules. The processor 508 executes various functional applications and data processing of the identification device by running the software programs and modules stored in the memory 502. The memory 502 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, application programs required for at least one function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the identification device (such as audio data, telephone book, etc.). In addition, the memory 502 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0099] The input unit 503 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the recognition device. Specifically, the input unit 503 may include a touch panel 5031 and other input devices 5032. The touch panel 5031, also known as a touch screen, can collect touch operations performed by the user on or near it (such as operations performed by the user using a finger, stylus, or other suitable object or accessory on or near the touch panel 5031 to define a set area), and drive the corresponding connection device according to a pre-set program. Optionally, the touch panel 5031 may include two parts: a touch detection device and a touch recognition device. The touch detection device detects the user's touch position and the signal generated by the touch operation, and transmits the signal to the touch recognition device; the touch recognition device receives touch information from the touch detection device, converts it into touch point coordinates, sends it to the processor 508, and receives and executes commands from the processor 508. In addition, the touch panel 5031 can be implemented using various types such as resistive, capacitive, infrared, and surface acoustic wave. In addition to the touch panel 5031, the input unit 503 may also include other input devices 5032. Specifically, other input devices 5032 may include, but are not limited to, one or more of the following: physical keyboard, function keys (such as volume control buttons, power buttons, etc.), trackball, mouse, joystick, etc. Display unit 504 can be used to display information input by the user or information provided to the user, as well as the area of ​​interest or environmental image of the recognition device. Display unit 504 may include display panel 5041, which may optionally be configured as a liquid crystal display (LCD), organic light-emitting diode (OLED), or the like. Further, touch panel 5031 may cover display panel 5041. When touch panel 5031 detects a touch operation on or near it, it transmits the information to processor 508 to determine the type of touch event. Subsequently, processor 508 provides corresponding visual output on display panel 5041 according to the type of touch event. Touch panel 5031 and display panel 5041 can be integrated to realize the input and output functions of the recognition device.

[0100] The identification device may also include at least one sensor 505, such as a light sensor and other sensors. Specifically, the light sensor may include an ambient light sensor and a proximity sensor, wherein the ambient light sensor can adjust the brightness of the display panel 5041 according to the ambient light level, and the proximity sensor can turn off the display panel 5041 and / or the backlight when the identification device is moved to the ear. In addition, the identification device may also be equipped with other sensors such as a barometer, hygrometer, thermometer, and infrared sensor, which will not be described in detail here.

[0101] Audio circuit 506, speaker 5061, and microphone 5062 provide an audio interface between the user and the identification device. Audio circuit 506 converts received audio data into electrical signals and transmits them to speaker 5061, where speaker 5061 converts them into sound signals for output. On the other hand, microphone 5062 converts collected sound signals into electrical signals, which are received by audio circuit 506, converted into audio data, and then processed by processor 508 before being sent to another identification device via RF circuit 501, or the audio data can be output to memory 502 for further processing.

[0102] Wi-Fi is a short-range wireless transmission technology. Through the Wi-Fi module 507, it can help users send and receive emails, browse the web, and access streaming media, providing wireless broadband internet access. Although Figure 5 Wi-Fi module 507 is shown, but it is understood that it is not a necessary component of the identification device and can be omitted as needed without changing the nature of the invention.

[0103] The processor 508 is the control center of the identification device. It connects various parts of the identification device via various interfaces and lines. By running or executing software programs and / or modules stored in the memory 502, and by calling data stored in the memory 502, it performs various functions of the identification device and processes data, thereby providing overall monitoring of the identification device. Optionally, the processor 508 may include one or more processing units; preferably, the processor 508 may integrate an application processor and a modem, wherein the application processor mainly handles the operating system, user interface, and applications, and the modem mainly handles wireless communication. It is understood that the aforementioned modem processor may not be integrated into the processor 508.

[0104] The identification device also includes a power supply 509 (such as a battery) that supplies power to the various components. Optionally, the power supply can be logically connected to the processor 508 through a power management system, thereby enabling functions such as charging, discharging, and power consumption management through the power management system.

[0105] The identification device also includes a PIR510, which is a passive infrared detector used to acquire detection information of the detection area.

[0106] The identification device may also include a camera, Bluetooth module, etc., which will not be elaborated here.

[0107] Figure 5 The identification device described herein can be used to implement some or all of the processes in the method embodiment shown in FIG3 of this application. Please refer to the relevant descriptions in the embodiments described in FIG3 above, which will not be repeated here.

[0108] Figure 6 This is a schematic diagram of the structure of a path planning device 60 provided in an embodiment of this application. Figure 5 As shown, the identification device 50 may include: an RF circuit 601, a memory 602, an input unit 603, a display unit 604, a sensor 605, an audio circuit 606, a Wi-Fi module 607, a processor 608, a power supply 609, and a PIR 610. Those skilled in the art will understand that... Figure 6 The structure shown does not constitute a limitation on the convergence and forwarding path of the service flow and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0109] RF circuit 601 can be used to send and receive warning information and warning indication information. It receives and transmits signals, specifically receiving downlink information from the base station and then transferring it to processor 608 for processing. Additionally, it sends uplink data to the base station. Typically, RF circuit 601 includes, but is not limited to: an antenna, at least one amplifier, a transceiver, a coupler, a low-noise amplifier (LNA), a duplexer, etc.

[0110] The memory 602 can be used to store software programs and modules. The processor 608 executes various functional applications and data processing of the identification device by running the software programs and modules stored in the memory 602. The memory 602 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, application programs required for at least one function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the identification device (such as audio data, telephone book, etc.). In addition, the memory 602 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0111] The input unit 603 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the recognition device. Specifically, the input unit 603 may include a touch panel 6031 and other input devices 6032. The touch panel 6031, also known as a touch screen, can collect touch operations performed by the user on or near it (such as operations performed by the user using a finger, stylus, or other suitable object or accessory on or near the touch panel 6031 to define a set area), and drive the corresponding connection device according to a pre-set program. Optionally, the touch panel 6031 may include two parts: a touch detection device and a touch recognition device. The touch detection device detects the user's touch position and the signal generated by the touch operation, and transmits the signal to the touch recognition device; the touch recognition device receives touch information from the touch detection device, converts it into touch point coordinates, sends it to the processor 608, and receives and executes commands from the processor 608. In addition, the touch panel 6031 can be implemented using various types such as resistive, capacitive, infrared, and surface acoustic wave. In addition to the touch panel 6031, the input unit 603 may also include other input devices 6032. Specifically, other input devices 6032 may include, but are not limited to, one or more of the following: physical keyboard, function keys (such as volume control buttons, power buttons, etc.), trackball, mouse, joystick, etc. Display unit 604 can be used to display information input by the user or information provided to the user, as well as the area of ​​interest or environmental image of the recognition device. Display unit 604 may include display panel 6041, which may optionally be configured as a liquid crystal display (LCD), organic light-emitting diode (OLED), or the like. Further, touch panel 6031 may cover display panel 6041. When touch panel 6031 detects a touch operation on or near it, it transmits the information to processor 608 to determine the type of touch event. Subsequently, processor 608 provides corresponding visual output on display panel 6041 according to the type of touch event. Touch panel 6031 and display panel 6041 can be integrated to realize the input and output functions of the recognition device.

[0112] The identification device may also include at least one sensor 605, such as a light sensor and other sensors. Specifically, the light sensor may include an ambient light sensor and a proximity sensor, wherein the ambient light sensor can adjust the brightness of the display panel 6041 according to the ambient light level, and the proximity sensor can turn off the display panel 6041 and / or the backlight when the identification device is moved to the ear. In addition, the identification device may also be equipped with other sensors such as a barometer, hygrometer, thermometer, and infrared sensor, which will not be described in detail here.

[0113] Audio circuit 606, speaker 6061, and microphone 6062 provide an audio interface between the user and the identification device. Audio circuit 606 converts received audio data into electrical signals and transmits them to speaker 6061, where speaker 6061 converts them into sound signals for output. On the other hand, microphone 6062 converts collected sound signals into electrical signals, which are then received by audio circuit 606, converted into audio data, and output to processor 608 for processing. The audio data is then sent to another identification device via RF circuit 601, or output to memory 602 for further processing.

[0114] Wi-Fi is a short-range wireless transmission technology. The identification device, through the Wi-Fi module 607, can help users send and receive emails, browse web pages, and access streaming media, providing users with wireless broadband internet access. Although Figure 6 Wi-Fi module 607 is shown, but it is understood that it is not a necessary component of the identification device and can be omitted as needed without changing the nature of the invention.

[0115] The processor 608 is the control center of the identification device. It connects various parts of the identification device via various interfaces and lines. By running or executing software programs and / or modules stored in the memory 602, and by calling data stored in the memory 602, it performs various functions and processes data, thereby providing overall monitoring of the identification device. Optionally, the processor 608 may include one or more processing units; preferably, the processor 608 may integrate an application processor and a modem, wherein the application processor mainly handles the operating system, user interface, and applications, and the modem mainly handles wireless communication. It is understood that the aforementioned modem processor may not be integrated into the processor 608.

[0116] The identification device also includes a power supply 609 (such as a battery) that supplies power to the various components. Optionally, the power supply can be logically connected to the processor 608 through a power management system, thereby enabling functions such as charging, discharging, and power consumption management through the power management system.

[0117] The identification device also includes a PIR610, which is a passive infrared detector used to acquire detection information of the detection area.

[0118] Figure 6 The path planning device described herein can be used in some or all of the processes in the path planning method embodiments described above. Please refer to the relevant descriptions in the previous embodiments, which will not be repeated here.

[0119] This embodiment also provides a computer storage medium storing computer instructions. When the computer instructions are run on the identification device, the identification device executes the above-mentioned related method steps to implement the identification method or path planning method in the above embodiment.

[0120] This embodiment also provides a computer program product that, when run on an identification device, causes the identification device to perform the aforementioned related steps to implement the identification or path planning method in the above embodiment.

[0121] In addition, embodiments of this application also provide an apparatus, which may specifically be a chip, component or module. The apparatus may include a connected processor and a memory; wherein the memory is used to store computer execution instructions, and when the apparatus is running, the processor may execute the computer execution instructions stored in the memory to cause the chip to execute the identification methods in the above-described method embodiments.

[0122] In this embodiment, the identification device, computer storage medium, computer program product or chip are all used to execute the corresponding methods provided above. Therefore, the beneficial effects they can achieve can be referred to the beneficial effects in the corresponding methods provided above, and will not be repeated here.

[0123] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0124] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another apparatus, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0125] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0126] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0127] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solutions of the embodiments of this application, essentially or in other words, the parts that contribute to the prior art, or all or part of the technical solutions, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0128] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any changes or substitutions within the technical scope disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for identifying impenetrable roads, characterized in that, The method includes: Determine whether the access road to the subgrid of the road network is a penetrable road; If the road entering the subgrid of the road network is an impenetrable road, determine whether the road exiting the subgrid of the road network is a penetrable road; If the exit road of the road network subgrid is a penetrable road, determine whether there is a penetrable road in the previous route; If the previous route has a penetrable road, then the route formed by the combination of the previous route and the road network subgrid is an unusable route; The previous route is the route between the starting point and the road to be entered. The previous route includes at least one road network subgrid. If there is at least one penetrable road in one of the road network subgrids, it means that there is a penetrable road in the previous route.

2. The method as described in claim 1, characterized in that, If the exit road of the road network subgrid is an impenetrable road, the method further includes: Determine whether a shortcut exists that can be penetrated by a road, wherein the shortcut is the route between the inbound road and the outbound road; If the shortcut has a penetrable road, determine whether the previous route has a penetrable road. The shortcut includes at least one road network subgrid. If at least one road network subgrid has a penetrable road, it means that the shortcut has a penetrable road. If the previous route has a penetrable road, the route formed by the combination of the previous route and the road network subgrid is determined to be an unusable route.

3. The method as described in claim 2, characterized in that, The shortcut includes multiple consecutive roads, and at least one of the multiple consecutive roads of the shortcut is a penetrable road; The previous route includes multiple consecutive roads, and at least one of the multiple consecutive roads of the previous route is a penetrable road.

4. The method as described in claim 2, characterized in that, The method further includes: If the road entering the subgrid of the road network is a penetrable road, determine whether the road exiting the subgrid of the road network is a penetrable road; If the exit road is a penetrable road, determine whether the shortcut is a penetrable road; If the shortcut has an impenetrable road, then the route formed by the combination of the previous route and the road network subgrid is determined to be an unusable route.

5. A path planning method, characterized in that, The method includes: Obtain the starting and ending points of the path planning; Based on the starting point and the ending point, a planned route is obtained. During the process of obtaining the planned route, when a path is found to one of the sub-grids: Determine whether the access road to the subgrid of the road network is a penetrable road; If the road entering the subgrid of the road network is an impenetrable road, determine whether the road exiting the subgrid of the road network is a penetrable road; If the exit road of the road network subgrid is a penetrable road, determine whether there is a penetrable road in the previous route; If the previous route has a penetrable road, then the route formed by the combination of the previous route and the road network subgrid is an unusable route; The previous route is the route between the starting point and the road to be entered. The previous route includes at least one road network subgrid. If there is at least one penetrable road in one of the road network subgrids, it means that there is a penetrable road in the previous route.

6. The method as described in claim 5, characterized in that, If the exit road of the road network subgrid is an impenetrable road, the method further includes: Determine if a shortcut exists that can be penetrated by the road; If the shortcut has a penetrable road, determine whether the previous route has a penetrable road. The shortcut includes at least one road network subgrid. If at least one road network subgrid has a penetrable road, it means that the shortcut has a penetrable road. If the previous route has a penetrable road, the route formed by the combination of the previous route and the road network subgrid is determined to be an unusable route; The shortcut is the route between the inbound road and the outbound road.

7. The method as described in claim 6, characterized in that, The shortcut includes multiple consecutive roads, and at least one of the multiple consecutive roads of the shortcut is a penetrable road; The previous route includes multiple consecutive roads, and at least one of the multiple consecutive roads of the previous route is a penetrable road.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on the identification device, cause the identification device to perform the method as described in any one of claims 1 to 7.

9. An identification device, characterized in that, The identification device includes a processor and a memory, the memory being used to store instructions, and the processor being used to invoke the instructions in the memory to cause the identification device to perform the method as described in any one of claims 1 to 4.

10. A chip system, characterized in that, The chip system is applied to an identification device; the chip system includes an interface circuit and a processor; the interface circuit and the processor are interconnected via a line; the interface circuit is used to receive signals from the memory of the identification device and send signals to the processor, the signals including computer instructions stored in the memory; when the processor executes the computer instructions, the chip system performs the method as described in any one of claims 1 to 7.

11. A path planning device, characterized in that, The path planning apparatus includes a processor and a memory, the memory being used to store instructions, and the processor being used to invoke the instructions in the memory to cause the path planning apparatus to perform the method as described in any one of claims 5 to 7.

Citation Information

Patent Citations

  • Navigation method and device

    CN107525514A

  • Systems and methods for avoiding location-dependent driving restrictions

    CN110770543A