Patent Application
20200117922
The disclosure relates to the technical fields of high-definition map navigation and data processing, and more particularly, to a method, system and memory for constructing a topological network of lanes in a high-definition map.
A high-definition map, as an important support to development of self-driving cars, plays an important role in the aspects of transverse/longitudinal accurate positioning, path planning, intelligent speed regulation, steering and the like. However, present high-definition map-based path planning is implemented based on roads and has the advantage of capability in long-distance road calculation and the shortcoming that a specific lane may not be determined under local route planning, and thus a route guide is not so accurate.
Therefore, there is an urgent need in related researches on self-driving for a lane-level-based path planning algorithm capable of implementing fast topological calculation to improve detailed local route planning and provide an accurate route guide.
Explanations about related terms:
1: High-definition lane group
It is used to completely describe a set of lanes in the same region on a road and with the same running direction, as illustrated in
2: Lane number
It is used to completely describe a number sequence of lanes in a lane group. The lanes are sequentially numbered from 0 from the roadside to the middle of a road according to a traffic direction of the road.
3: High-definition lane centerline shape coordinate point
A lane centerline is an imaginary line located in middle of a lane and configured to describe a shape of the lane. Each point in a shape coordinate point set of the lane centerline is required to have X and Y coordinates. The X and Y coordinates may be latitude and longitude coordinates under a spherical coordinate system and may also be X and Y coordinates of a rectangular coordinate system under a projected coordinate system, as illustrated in
4: High-definition lane centerline node coordinate
It is used to describe a connection relationship of lanes between two lane groups sharing a lane group boundary. A node of a lane centerline is required to have X and Y coordinates. The X and Y coordinates may be latitude and longitude coordinates under a spherical coordinate system and may also be X and Y coordinates of a rectangular coordinate system under a projected coordinate system, as illustrated in
5: High-definition lane boundary line shape coordinate point
It is used to completely describe a set of points required by a lane boundary line. Each point is required to have X and Y coordinates. The X and Y coordinates may be latitude and longitude coordinates under a spherical coordinate system and may also be X and Y coordinates of a rectangular coordinate system under a projected coordinate system, as illustrated in
6: High-definition lane boundary line group
It is used to completely describe a set of boundary lines of different types on the same sides of a lane. Each boundary line set consists of one or more parallel boundary line elements configured to describe lane boundary line attributes, and each parallel boundary line element consists of one or more boundary line units which are sequentially arranged and have different attributes. As illustrated in
7: Lane boundary line number
It is used to completely describe number sequences of lane boundary line groups and parallel boundary line elements therein. The lane boundary lines are sequentially numbered from 0 from the roadside to the middle of a road according to a traffic direction of the road. The parallel boundary line elements in each lane boundary line group are sequentially numbered from 0 from the roadside to the inner side of the road.
8: Shared boundary line group
It is used to describe a set of boundary lines separating two adjacent lanes.
9: Boundary line unit
It is used to completely describe attributes of boundary lines with different attributes on a high-definition lane boundary line. A lane boundary line may be divided into multiple segments according to different attributes (for example, colors and materials), and each segment of the boundary line is called a boundary line unit.
10: Solid and dotted lane boundary line change
It is used to describe a changing condition of a lane changing strategy for vehicles on a lane boundary line. For example, if a certain segment on the lane boundary line is a single solid line, it is indicated that a vehicle is not allowed to run across the segment of the boundary line for lane changing in a region of the segment. If a certain segment of the boundary line is a single dotted line, a vehicle may run across the segment of the boundary line to change the lane to an adjacent lane.
For the technical problem in a conventional art, the disclosure provides a method and system for constructing a transverse topological relationship of lanes in a high-definition map and a memory. A transverse topological relationship between two adjacent lanes in a lane group is constructed within an acceptable accuracy requirement range, and is applied to lane-level path guiding to implement fast topological calculation and greatly improve path planning efficiency.
The technical problem is solved in the disclosure through the following technical solutions.
According to an aspect, the disclosure provides a method for constructing a transverse topological relationship of lanes in a high-definition map, which may include the following steps.
Data of lane groups is acquired from the high-definition map.
For each lane group, a shared boundary line group of two adjacent lanes is sequentially extracted, and the number of parallel boundary line elements in the shared boundary line group is determined.
If the number of the parallel boundary line elements is 1, a transverse topological relationship between the two adjacent lanes is not generated.
Otherwise the number and types of boundary line units on the parallel boundary line elements are determined.
If the number of the boundary line units is 1, the transverse topological relationship between the two adjacent lanes is generated according to a type of a shared boundary line.
Otherwise segmentation processing is performed on the lane group along a lane direction according to a point, where switching between a solid line and a dotted line occurs, of the shared boundary line, and the transverse topological relationship between two adjacent lanes in each of segments, which are obtained by the segmentation processing on the lane group, is sequentially generated according to a position of the point where switching between the solid line and dotted line occurs and the types of the boundary line units.
The data of lane groups in the high-definition map includes lane centerline data configured to describe lane information and lane boundary line data configured to describe a geometric shape and attribute of a boundary line.
The lane centerline data includes coordinate point data configured to describe a lane connecting line shape and numbers of a starting node and termination node of a lane centerline, and the lane boundary line data includes coordinate point data configured to describe a boundary line shape and a start-end range of each boundary line unit on each boundary line.
The coordinate point data includes a spherical coordinate or a projected coordinate.
Furthermore, after the operation that the data of lane groups is acquired from the high-definition map, the method further includes that a lane group set is filtered to acquire lane group data, including lane boundary line information, of more than one lane.
Furthermore, the operation that segmentation processing is performed on the lane group along the lane direction according to the point where switching between the solid line and dotted line occurs of the shared boundary line may include the following operations.
If a previous boundary line unit of the point where switching between the solid line and dotted line occurs of the shared boundary line is B1, a distance dis between an ending point A of the boundary line unit B1 and a starting point S of a shared boundary line L is acquired from the lane group data, the distance dis being an accumulated sum of shape point line segments between the point S and the point A.
Shape coordinate points of the shared boundary line L are acquired, and assuming a set of the vectorized coordinate points of the shared boundary line is {P1, P2, P3 . . . Pn}, every two adjacent coordinate points form a line segment to obtain line segments L1{P1, P2}, L2{P2, P3}, L3{P3, P4} . . . line segment Ln−1{Pn−1, Pn}, and lengths len1, len2, len3, . . . lenn−1 of the line segments are calculated.
The specific line segment, where the ending point A is located, in a line segment set L1, L2, L3, . . . Ln−1 is calculated according to the distance dis and the lengths len1, len2, len3, . . . lenn−1 of the line segments, A being denoted as located on a line segment La and a starting point of La being denoted as B.
A distance between the ending point A and B is calculated, and a position of the point A on the line segment La is calculated according to the distance to acquire a coordinate of the point A.
The point A and the point B form a line segment LAB, a perpendicular line VA, that passes through the point A, of the line segment LAB is drawn, and cutting processing is performed on the lane group by use of the perpendicular line VA.
The steps are repeated to cut the lane group into multiple segments along the lane direction according to shared boundary line units.
Furthermore, after the operation that cutting processing is performed on the lane group along the lane direction, the method may further include that intersection points of the perpendicular line VA and each of a lane centerline CL on the left of the shared boundary line L and a lane centerline CR on the right of L are calculated.
Furthermore, the operation that the intersection points of the perpendicular line VA and each of the lane centerline CL on the left of the shared boundary line L and the lane centerline CR on the right of L are calculated may include the following operations.
Shape coordinate points of the lane centerline CR on the right of the shared boundary line L are acquired, and assuming a set of the vectorized coordinate points of the lane centerline CR is {P1′, P2′, P3′ . . . Pn′}, every two adjacent coordinate points form a line segment to obtain line segments L1′{P1′, P2′}, L2′{P2′, P3′}, L3′{P3′, P4′} . . . line segment Ln−1′{Pn−1′, Pn′}.
Whether the perpendicular line VA is intersected with a line segment set {L1′, L2′, L3′ . . . Ln−1′} or not is determined, and an intersection point is calculated, if there is more than one intersection point, the intersection point closest to the point A is extracted and is denoted as a point C.
It is assumed that the lane centerline on the left of the shared boundary line L is CL, the steps are repeated to calculate an intersection point D between the perpendicular line VA and CL.
Furthermore, the operation that the transverse topological relationship between two adjacent lanes in each of segments, which are obtained by the segmentation processing on the lane group, is sequentially generated according to the position of the point where switching between the solid line and dotted line occurs and the types of the boundary line unit may include the following operations.
For a point A where switching between a solid line and a dotted line occurs, a position of the point where the switching occurs is determined at first.
If the point A is the first point of points where switching between a solid line and a dotted line occurs on the shared boundary line, a starting point of the lane centerline CR on the right is denoted as SR and a starting point of the lane centerline CL on the left is denoted as SL, topological relationships between the point SR and the point D and between the point SL and the point C are generated according to the type of the boundary line unit B1.
If the point A is not the first point of points where switching between a solid line and a dotted line occurs on the shared boundary line, a topological relationship between an intersection point C−1 of a perpendicular line VA−1 and the lane centerline CR on the right and the intersection point D of the perpendicular line VA and the lane centerline CL on the left and a topological relationship between an intersection point D−1 of the perpendicular line VA−1 and the lane centerline CL on the left and the intersection point C of the perpendicular line VA and the lane centerline CR on the right are generated according to the type of the boundary line unit B1, VA−1 being a perpendicular line passing through a point, where switching between a solid line and a dotted line occurs and which is previous to the point A, and VA being a perpendicular line passing through the point A.
If the point A is the last point where switching between a solid line and a dotted line occurs on the shared boundary line, a boundary line unit next to the point A is recorded as B2, a terminal point of the lane centerline CR on the right is ER and the starting point of the lane centerline CL on the left is EL, a topological relationship between the intersection point C of the perpendicular line VA and the lane centerline CR on the right and the point EL and a topological relationship between the intersection point D of the perpendicular line VA and the lane centerline CL on the left and the point ER are generated according to a type of the boundary line unit B2.
Furthermore, the operation that the transverse topological relationship between the two adjacent lanes in each segment of the lane group is generated may include the following operations.
(1) If the boundary line unit B1 is blank, namely there is no lane line or B1 is a dotted line, a transverse topological relationship that lane changing is allowed in the two lanes in a cutting region is generated.
(2) If the boundary line unit B1 is dotted on the left and solid on the right, a transverse topological relationship of changing from the left lane to the right lane in the cutting region is generated.
(3) If the boundary line unit B1 is solid on the left and dotted on the right, a transverse topological relationship of changing from the right lane to the left lane in the cutting region is generated.
(4) Under circumstance except for the three circumstances, the transverse topological relationship between the two lanes in the cutting region is not generated.
According to another aspect, the disclosure provides a system for constructing a transverse topological relationship of lanes in a high-definition map, which may include a data acquisition module, a boundary line unit determination module and a topological relationship generation module.
The data acquisition module may be configured to acquire lane group data in the high-definition map.
The boundary line unit determination module may be configured to, for each lane group, sequentially extract a shared boundary line group of two adjacent lanes and determine the number of shared parallel boundary line elements and the number and types of boundary line units.
The topological relationship generation module may be configured to generate a transverse topological relationship between the two adjacent lanes, when the number of the parallel boundary line elements of a shared boundary line group is more than 1, not generate the transverse topological relationship between the two adjacent lanes, when the number of the parallel boundary line elements of the shared boundary line group is 1 and if the number of the units of the parallel boundary line element is 1, directly generate the transverse topological relationship between the two adjacent lanes according to a type of a shared boundary line, otherwise perform segmentation processing on the lane group along a lane direction according to a point, where switching between a solid line and a dotted line occurs, of the shared boundary line and sequentially generate the transverse topological relationship between two adjacent lanes in each of segments, which are obtained by the segmentation processing on the lane group, according to the types of the boundary line units.
Furthermore, the topological relationship generation module may include a segmentation processing module, configured to:
if a previous boundary line unit of the point where switching between the solid line and dotted line occurs of the shared boundary line is B1, acquire a distance dis between an ending point A of the boundary line unit B1 and a starting point S of the shared boundary line L from the lane group data, the distance dis being an accumulated sum of shape point line segments between the point S and the point A;
acquire shape coordinate points of the shared boundary line L, and assuming a set of the vectorized coordinate points of the shared boundary line is {P1, P2, P3 . . . Pn}, form, by every two adjacent coordinate points, a line segment to obtain line segments L1{P1, P2}, L2{P2, P3}, L3{P3, P4} . . . line segment Ln−1{Pn−1, Pn} and calculate lengths len1, len2, len3, . . . lenn−1 of the line segments;
calculate a specific line segment, where the ending point A is located, in a line segment set L1, L2, L3, . . . Ln−1 according to the distance dis and the lengths len1, len2, len3, . . . lenn−1 of the line segments, A being denoted as located on a line segment La and a starting point of La being denoted as B;
calculate a distance between the ending point A and B and calculate a position of the point A on the line segment La according to the distance to acquire a coordinate of the point A;
form, by the point A and the point B, a line segment LAB, draw a perpendicular line VA, that passes through the point A, of the line segment LAB and perform cutting processing on the lane group by use of the perpendicular line VA; and
repeat the steps to cut the lane group into multiple segments along the lane direction according to shared boundary line units.
Furthermore, the topological relationship generation module may further include an intersection point calculation module, configured to calculate intersection points of the perpendicular line VA and each of a lane centerline CL on the left of a shared boundary line L and a lane centerline CR on the right of L.
According to a third aspect, the disclosure also provides a memory, which may store a computer program configured to implement the method for constructing the transverse topological relationship of the lines in the high-definition map.
The principle and characteristics of the disclosure will be described below in combination with the drawings. The listed examples are only adopted to explain the disclosure and not intended to limit the scope of the disclosure.
In 1, lane group data in a high-definition map is read, and after the data is read, it is necessary to ensure correctness of numbers of lanes in each lane group and ensure consistency between an arrangement sequence of the lanes and the real world.
In 2, a read high-definition lane group set is filtered to acquire lane group data, including lane boundary line shape point information, of more than one lane. In a few lane groups illustrated in
In 3, a transverse topological relationship between adjacent lanes in the same lane group is generated.
In (3.1), a shared boundary line group of the two adjacent lanes is acquired.
In (3.2), if the number of parallel boundary line elements in the shared boundary line group is not 1, the transverse topological relationship between the two lanes is not generated, otherwise Step (3.3) is executed.
In (3.3), if the number of units of the parallel boundary line element is 1, cutting is not required and the lane changing topological relationship between the two lanes is generated according to a type of a boundary line; and if the number of the units is more than 1, Step (3.4) is executed.
In (3.4), two adjacent boundary line units on a lane boundary line are extracted, whether they form switching between a solid line and a dotted line is determined, and if YES, cutting is performed by use of a cutting algorithm to obtain a perpendicular line, recorded as VA, at a position where switching between a solid line and a dotted line occurs.
As illustrated in
The cutting algorithm includes the following steps.
In {circle around (1)}, if a previous boundary line unit of the position where switching between a solid line and a dotted line occurs of the lane boundary line is B1 and a next boundary line unit is B2, a distance dis between an ending point A of the boundary line unit B1 and a starting point S of a shared boundary line L is acquired from the lane group data (dis is an accumulated distance sum of shape point line segments between the point S and the point A), as illustrated in
In {circle around (2)}, shape coordinate points of the shared boundary line L are acquired, and assuming a set of the vectorized coordinate points of the shared boundary line is {P1, P2, P3 . . . Pn}, every two adjacent coordinate points form a line segment to obtain line segments L1{P1, P2}, L2{P2, P3}, L3{P3, P4} . . . line segment Ln−1{Pn−1, Pn} and lengths len1, len2, len3, . . . lenn−1 of the line segments are calculated, as illustrated in
In {circle around (3)}, the specific line segment, where the ending point A is located, in a line segment set L1, L2, L3, . . . Ln−1 is calculated according to the distance dis and len1, len2, len3, . . . lenn−1, A being denoted as located on a line segment La and a starting point of La being denoted as B.
In {circle around (4)}, a distance between the ending point A and B is calculated, and a position of the point A on the line segment La is calculated according to the distance to acquire a coordinate of the point A.
In {circle around (5)}, the point A and the point B form a line segment LAB, and a perpendicular line VA, that passes through the point A, of the line segment LAB is drawn.
In (3.5), shape coordinate points of a lane centerline CR on the right of the shared boundary line L are acquired, and assuming a set of the vectorized coordinate points of the lane centerline CR is {P1′, P2′, P3′ . . . Pn′}, every two adjacent coordinate points form a line segment to obtain line segments L1′{P1′, P2′}, L2′{P2′, P3′}, L3′{P3′, P4′} . . . line segment Ln−1′{Pn−1′, Pn′}, as illustrated in
In (3.6), whether the perpendicular line VA is intersected with a line segment set {L1′, L2′, L3′ . . . Ln−1′} or not is calculated, and an intersection point is calculated, if there is more than one intersection point, the intersection point closest to the point A is extracted and is denoted as a point C, as illustrated in
In (3.7), it is assumed that the lane centerline on the left of the shared boundary line L is CL, a right-side lane centerline of CR is BR and a left-side lane boundary line of CL is BL, Steps (3.4) and (3.5) are repeated to calculate intersection points D, E and F between the perpendicular line VA and CL, BR and BL, as illustrated in
In (3.8), the transverse topological relationship is generated.
In {circle around (1)}, if B1 and B2 are adjacent boundary line units on two sides of the first position where switching between a solid line and a dotted line occurs on the shared lane boundary line, a starting point of the lane centerline CR on the right is recorded as SR and a starting point of the lane centerline CL on the left is recorded as SL, topological relationships between the point SR and the point D and between the point SL and the point C are generated according to a type of the boundary line unit B1, as illustrated in
In {circle around (2)}, if B1 and B2 are adjacent boundary line units on the two sides of the first position where switching between a solid line and a dotted line occurs on the shared lane boundary line, an intersection point of the perpendicular line and the lane centerline CR at a previous position where switching between a solid line and a dotted line occurs is recorded as GR and an intersection point with the lane centerline CL is recorded as GL, topological relationships between a point GR and the point D and between a point GL and the point C are generated according to the type of the boundary line unit B1, as illustrated in
In {circle around (3)}, if B1 and B2 are where the last switching between a solid line and a dotted line occurs on the shared lane boundary line, an ending point of the lane centerline CR is recorded as ER and an ending point of the lane centerline CL is recorded as EL, it is necessary to generate topological relationships between the point C and the point EL and between the point D and the point ER according to a type of the boundary line unit B2 as illustrated in
In (3.9), Step (3.2)-Step (3.8) are repeated to generate transverse topological relationships at all positions where switching between a solid line and a dotted line occurs on the shared lane boundary line.
In ((3.10), Step (3.2)-(3.9) are repeated to generate transverse topological relationships between every two adjacent lanes in the same lane group.
According to the disclosure, a transverse topological relationship between two adjacent lanes at a position where switching between a solid line and a dotted line occurs of a lane boundary line is calculated simply by use of an accumulated sum of lengths of line segments, a relationships between the line segments and a relationship between a line segment and a straight line, thereby simplifying complex lane-level path planning into simple plane-level data calculation problem.
Referring to
The processing unit 1301 is configured to execute executable programs stored in the storage unit 1302 to perform steps of:
acquiring data of lane groups from the high-definition map;
for each lane group, sequentially extracting a shared boundary line group of two adjacent lanes and determining the number of parallel boundary line elements in the shared boundary line group;
if the number of the parallel boundary line elements is 1, not generating a transverse topological relationship between the two adjacent lanes;
if the number of the parallel boundary line elements is not 1, determining the number and types of boundary line units on the parallel boundary line elements;
if the number of the boundary line units is 1, generating the transverse topological relationship between the two adjacent lanes according to a type of a shared boundary line; and
if the number of the boundary line units is not 1, performing segmentation processing on the lane group along a lane direction according to a point, where switching between a solid line and a dotted line occurs, of the shared boundary line, and sequentially generating the transverse topological relationship between two adjacent lanes in each of segments, which are obtained by the segmentation processing on the lane group, according to a position of the point where switching between the solid line and dotted line occurs and the types of the boundary line units.
The step of performing segmentation processing on the lane group along the lane direction according to the point where switching between the solid line and dotted line occurs of the shared boundary line comprises:
if a previous boundary line unit of the point where switching between the solid line and dotted line occurs of the shared boundary line is B1, acquiring a distance dis between an ending point A of the boundary line unit B1 and a starting point S of a shared boundary line L from the lane group data, the distance dis being an accumulated sum of shape point line segments between the point S and the point A;
acquiring shape coordinate points of the shared boundary line L, and assuming a set of the vectorized coordinate points of the shared boundary line is {P1, P2, P3 . . . Pn}, forming, by every two adjacent coordinate points, a line segment to obtain line segments L1{P1, P2}, L2 {P2, P3}, L3 {P3, P4} . . . line segment Ln−1{Pn−1, Pn} and calculating lengths len1, len2, len3, . . . lenn−1 of the line segments;
calculating a specific line segment, where the ending point A is located, in a line segment set L1, L2, L3, . . . Ln−1 according to the distance dis and the lengths len1, len2, len3, . . . lenn−1 of the line segments, A being denoted as located on a line segment La and a starting point of La being denoted as B;
calculating a distance between the ending point A and B and calculating a position of the point A on the line segment La according to the distance to acquire a coordinate of the point A;
forming, by the point A and the point B, a line segment LAB, drawing a perpendicular line VA, that passes through the point A, of the line segment LAB and performing cutting processing on the lane group by use of the perpendicular line VA; and
repeating the steps to cut the lane group into multiple segments along the lane direction according to shared boundary line units.
After the step of performing cutting processing on the lane group along the lane direction, further comprising: calculating an intersection point of the perpendicular line VA and a lane centerline CL on the left of the shared boundary line L, and an intersection point of the perpendicular line VA and a lane centerline CR on the right of the shared boundary line L.
The step of calculating the intersection point of the perpendicular line VA and the lane centerline CL on the left of the shared boundary line L and the intersection point of the perpendicular line VA and the lane centerline CR on the right of L comprises:
acquiring shape coordinate points of the lane centerline CR on the right of the shared boundary line L, and assuming a set of the vectorized coordinate points of the lane centerline CR is {P1′, P2′, P3′ . . . Pn′}, forming, by every two adjacent coordinate points, a line segment to obtain line segments L1′{P1′, P2′}, L3′{P3′, P4′} . . . line segment Ln−1′{Pn−1′, Pn′};
determining whether the perpendicular line VA is intersected with a line segment set {L1′, L2′, L3′ . . . Ln−1′} or not, and calculating an intersection point, if there is more than one intersection point, extracting the intersection point closest to the point A, the intersection point being denoted as as a point C; and assuming the lane centerline on the left of the shared boundary line L is CL, repeating the steps to calculate an intersection point D between the perpendicular line VA and CL.
The step of sequentially generating the transverse topological relationship between two adjacent lanes in each of segments, which are obtained by the segmentation processing on the lane group, according to the position of the point where switching between the solid line and dotted line occurs and the types of the boundary line unit comprises:
for a point A where switching between a solid line and a dotted line occurs, determining a position of the point where the switching occurs at first;
if the point A is the first point of points where switching between a solid line and a dotted line occurs on the shared boundary line, a starting point of the lane centerline CR on the right being denoted as SR and a starting point of the lane centerline CL on the left being denoted as SL, generating topological relationships between the point SR and the point D and between the point SL and the point C according to the type of the boundary line unit B1;
if the point A is not the first point of points where switching between a solid line and a dotted line occurs on the shared boundary line, generating a topological relationship between an intersection point C−1 of a perpendicular line VA−1 and the lane centerline CR on the right and the intersection point D of the perpendicular line VA and the lane centerline CL on the left and a topological relationship between an intersection point D−1 of the perpendicular line VA−1 and the lane centerline CL on the left and the intersection point C of the perpendicular line VA and the lane centerline CR on the right according to the type of the boundary line unit B1, VA−1 being a perpendicular line passing through a point, where switching between a solid line and a dotted line occurs and which is previous to the point A, and VA being a perpendicular line passing through the point A; and
if the point A is the last point where switching between a solid line and a dotted line occurs on the shared boundary line, a boundary line unit next to the point A being denoted as B2, a terminal point of the lane centerline CR on the right being denoted as ER and the starting point of the lane centerline CL on the left being denoted as EL, generating a topological relationship between the intersection point C of the perpendicular line VA and the lane centerline CR on the right and the point EL and a topological relationship between the intersection point D of the perpendicular line VA and the lane centerline CL on the left and the point ER according to a type of the boundary line unit B2.
The step of generating the transverse topological relationship between the two adjacent lanes in each segment of the lane group comprises:
(1) if the boundary line unit B1 is blank, namely there is no lane line or B1 is a dotted line, generating a transverse topological relationship that lane changing is allowed in the two lanes in a cutting region;
(2) if the boundary line unit B1 is dotted on the left and solid on the right, generating a transverse topological relationship of changing from the left lane to the right lane in the cutting region;
(3) if the boundary line unit B1 is solid on the left and dotted on the right, generating a transverse topological relationship of changing from the right lane to the left lane in the cutting region; and
(4) under circumstance except for the three circumstances, not generating the transverse topological relationship between the two lanes in the cutting region.
The disclosure has the following beneficial effects. According to the disclosure, a transverse topological relationship between two adjacent lanes at a position where switching between a solid line and a dotted line occurs of a lane boundary line is calculated simply by use of an accumulated sum of lengths of line segments, a relationships between the line segments and a relationship between a line segment and a straight line, thereby simplifying complex lane-level path planning into simple plane-level data calculation problem.
In an exemplary embodiment, the processing unit 1301 may be a processor or a controller (which may be, for example, a Central Processing Unit (CPU), a universal processor, a Digital Signal Processor (DSP), an Application-Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or another programmable logical device, transistor logical device, hardware component or any combination thereof. It may implement or execute various exemplary logical blocks, modules and circuits described in combination with the contents disclosed in the disclosure. The processor may also be a combination realizing a calculation function (for example, including a combination of one or more microprocessors and a combination of a DSP and a microprocessor. The storage unit 1302 may be a memory.
An embodiment of the disclosure also provides a computer-readable storage medium, which stores a computer program configured for electronic data exchange, the computer program enabling a computer to execute part or all of the operations executed in the abovementioned methods.
An embodiment of the disclosure also provides a computer program product. The computer program product includes a non-transitory computer-readable storage medium storing a computer program. The computer program may be operated to enable a computer to execute part or all of the operations executed in the abovementioned methods. The computer program product may be a software installation package.
The operations of the method or algorithm described in the embodiments of the disclosure may be implemented in a hardware manner, or may be implemented in a manner of executing, by a processor, software. A software instruction may consist of a corresponding software module, and the software module may be stored in a RAM, a flash memory, a Read Only Memory (ROM), an Erasable Programmable ROM (EPROM), an Electrically EPROM (EEPROM), a register, a hard disk, a mobile hard disk, a Compact Disc-ROM (CD-ROM) or a storage medium in any other form well known in the field. An exemplary storage medium is coupled to the processor, thereby enabling the processor to read information from the storage medium and write information into the storage medium. Of course, the storage medium may also be a component of the processor. The processor and the storage medium may be located in an ASIC. In addition, the ASIC may be located in an access network device, a target network device or a core network device. Of course, the processor and the storage medium may also exist in the access network device, the target network device or the core network device as discrete components.
Those skilled in the art may realize that, in one or more abovementioned examples, all or part of the functions described in the embodiments of the disclosure may be realized through software, hardware or any combination thereof. During implementation with the software, the embodiments may be implemented completely or partially in form of computer program product. The computer program product includes one or more computer instructions. When the computer program instruction is loaded and executed on a computer, the flows or functions according to the embodiments of the disclosure are completely or partially generated. The computer may be a universal computer, a dedicated computer, a computer network or another programmable device. The computer instruction may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instruction may be transmitted from a website, computer, server or data center to another website, computer, server or data center in a wired (for example, coaxial cable, optical fiber and Digital Subscriber Line (DSL)) or wireless (for example, infrared, wireless and microwave) manner. The computer-readable storage medium may be any available medium accessible for the computer or a data storage device, such as a server and a data center, including one or more integrated available media. The available medium may be a magnetic medium (for example, a floppy disk, a hard disk and a magnetic tape), an optical medium (for example, a Digital Video Disc (DVD)), a semiconductor medium (for example, a Solid State Disk (SSD)) or the like.
The above is only the preferred embodiment of the disclosure and not intended to limit the disclosure. Any modifications, equivalent replacements, improvements and the like made within the spirit and principle of the disclosure shall fall within the scope of protection of the disclosure.
| Number | Date | Country | Kind |
|---|---|---|---|
| 201810887601.7 | Aug 2018 | CN | national |
This is a continuation application of International Patent Application No. PCT/CN2019/082325, filed on Apr. 1, 2019, the contents of which are hereby incorporated by reference in its entirety.
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/CN2019/082325 | Apr 2019 | US |
| Child | 16702700 | US |
