Guide line generation method and device in path planning, electronic equipment and storage medium

Through the high-precision map data and intersection position calculation method, optimal avoidance points are generated to improve the quality of autonomous driving path planning, solving the balance problem of obstacle efficiency and lateral swing in horizontal planning, and achieving efficient and stable path planning.

CN118980387APending Publication Date: 2024-11-19ZHIDAO NETWORK TECH (BEIJING) CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411234348.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-04
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

In autonomous driving path planning, it is difficult to take into account the efficiency of obstacles and avoid lateral swings during the horizontal planning process, resulting in low path quality and the prior art fails to effectively balance these two.

Method used

Determine the travelable area through high-precision map data, calculate the intersection position between the bicycle and the obstacle, obtain candidate avoidance points, and select the optimal avoidance points to generate guide lines, and use the shortest path algorithm and smoothing processing to ensure the safety and stability of the guide lines. sex.

Benefits of technology

It improves the quality of path planning, meets the requirements of efficiency and stability, reduces the risk of collision with obstacles, reduces the lateral shaking of the bicycle, and ensures the safety and effectiveness of the path.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118980387A_ABST
    Figure CN118980387A_ABST
Patent Text Reader

Abstract

The invention discloses a guide line generation method and device in path planning, electronic equipment and a storage medium, and the method comprises the steps: determining a drivable region according to high-precision map data; according to the vehicle and the obstacle to be bypassed by the vehicle in the travelable area, the intersection position of the vehicle and the obstacle to be bypassed by the vehicle in the travelable area is calculated; obtaining candidate avoidance points according to the intersection position; and selecting an optimal avoidance point from the candidate avoidance points, and generating a guide line. According to the invention, on one hand, reference is provided in the transverse planning process, on the other hand, the quality of the path can be improved, and the requirements of high efficiency and stability are met.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of autonomous driving technology, and in particular to a method, device, electronic device, and storage medium for generating a guide line in path planning. Background Art

[0002] The mainstream autonomous driving planning process is divided into two processes: lateral planning and longitudinal planning. Lateral planning plans an efficient and stable path based on dynamic information such as obstacle locations and static information such as map data. Longitudinal planning further plans the speed to form a trajectory on the path generated by lateral planning to meet safety and comfort requirements as much as possible.

[0003] Therefore, lateral path planning needs to take into account both obstacle avoidance efficiency and avoiding lateral swing, which are often conflicting and need to be balanced. Summary of the invention

[0004] The embodiments of the present application provide a guide line generation method, device, electronic device, and storage medium in path planning, which are used to provide a reference in the process of lateral planning to improve the quality of the path and meet the requirements of efficiency and stability.

[0005] The present application embodiment adopts the following technical solutions:

[0006] In a first aspect, an embodiment of the present application provides a method for generating a guide line in path planning, wherein the method comprises:

[0007] Determine the drivable area based on high-precision map data;

[0008] Calculating an intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area;

[0009] According to the intersection position, obtaining a candidate avoidance point;

[0010] An optimal avoidance point is selected from the candidate avoidance points, and a guide line is generated.

[0011] In some embodiments, obtaining a candidate avoidance point according to the intersection position includes:

[0012] Determine at least one obstacle that the vehicle needs to bypass according to the intersection position;

[0013] At the intersection of the ego vehicle and the obstacle to be bypassed by the ego vehicle, the bounding box of the obstacle to be bypassed by the ego vehicle is expanded to obtain four vertices of the expanded bounding box as candidate avoidance points, wherein the expanded width in front of and behind the obstacle is the length of the ego vehicle, and the expanded width on the left and right sides of the obstacle is obtained by calculation.

[0014] In some embodiments, the expanded widths on the left and right sides of the obstacle are obtained by calculation, including:

[0015]

[0016] in, and are the speeds of the vehicle and the obstacle along the center line of the lane, speed_limit is the current road speed limit, and W is the width of the vehicle.

[0017] In some embodiments, selecting the optimal avoidance point from the candidate avoidance points includes:

[0018] Taking the current position of the vehicle as the starting point, all candidate avoidance points in the drivable area are taken as nodes;

[0019] A shortest path algorithm is used to obtain a node sequence, wherein the length of the node sequence is the shortest and there is no intersection with the expansion border of the obstacle at the intersection position;

[0020] All nodes on the shortest path in the node sequence are used as the optimal avoidance points.

[0021] In some embodiments, generating a guide line includes:

[0022] The rear axle center point of the vehicle, the front center point of the vehicle and the optimal avoidance point are used as control points and smoothed to generate a guide line.

[0023] In some embodiments, determining the drivable area according to the high-precision map data includes:

[0024] Obtain the current lane information, adjacent lane information, and the physical boundary positions on the left and right sides ahead based on high-precision map data;

[0025] A drivable area is determined according to the current lane information, the adjacent lane information, and the front left and right physical boundary positions.

[0026] In some embodiments, calculating the intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area includes:

[0027] The low-speed moving obstacles and stationary obstacles in the drivable area are regarded as obstacles to be bypassed, wherein the speed of the low-speed moving obstacles is lower than 0.5 times the speed of the vehicle or lower than 0.2 times the speed limit of the road;

[0028] Calculating the speed of the vehicle and the obstacle to be circumvented along the center line of the lane;

[0029] Calculating the distance between the vehicle and the obstacle to be circumvented along the center line of the lane;

[0030] Calculating the intersection time according to the speed of the vehicle and the obstacle to be circumvented along the center line of the lane and the distance between the vehicle and the obstacle to be circumvented along the center line of the lane;

[0031] The obstacle to be bypassed is moved forward a preset distance along the center line of the lane where the obstacle is located based on the intersection time, and the position of the obstacle after the obstacle is moved is used as the intersection position.

[0032] In a second aspect, an embodiment of the present application further provides a guide line generating device in path planning, wherein the device comprises:

[0033] A determination module is used to determine the drivable area based on high-precision map data;

[0034] A calculation module, used for calculating the intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area;

[0035] An acquisition module, used for acquiring a candidate avoidance point according to the intersection position;

[0036] A generation module is used to select the optimal avoidance point from the candidate avoidance points and generate a guide line.

[0037] In a third aspect, an embodiment of the present application further provides an electronic device, comprising: a processor; and a memory arranged to store computer executable instructions, wherein the executable instructions, when executed, cause the processor to perform the above method.

[0038] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, which stores one or more programs. When the one or more programs are executed by an electronic device including multiple application programs, the electronic device executes the above method.

[0039] At least one of the above-mentioned technical solutions adopted in the embodiments of the present application can achieve the following beneficial effects: Determine the drivable area based on high-precision map data. When calculating the drivable area, static information such as map elements is taken into account to ensure the validity of the drivable area. According to the vehicle and the obstacles to be bypassed by the vehicle in the drivable area, calculate the intersection position of the vehicle and the obstacles to be bypassed by the vehicle in the drivable area. By using the intersection position and calculating the avoidance point through information such as relative vehicle speed, the safety of the guide line can be fully guaranteed and the risk of collision with obstacles can be reduced. Finally, according to the intersection position, obtain the candidate avoidance point; select the optimal avoidance point from the candidate avoidance points, and generate a guide line. The guide line is generated by the method to provide a reference in the process of lateral planning to improve the quality of the path and meet the requirements of efficiency and stability. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0041] Figure 1 A schematic diagram of a drivable area calculated according to map data in an embodiment of the present application;

[0042] Figure 2 A schematic diagram of the speed (magnitude) along the lane centerline direction in an embodiment of the present application;

[0043] Figure 3 This is a schematic diagram of the longitudinal distance (size) in the embodiment of the present application;

[0044] Figure 4 This is a schematic diagram of the intersection position of obstacles in the embodiment of the present application;

[0045] Figure 5 A schematic diagram of the expansion of the obstacle intersection border and candidate avoidance points in an embodiment of the present application;

[0046] Figure 6 A schematic diagram showing that the candidate avoidance points passed in the embodiment of the present application are optimal avoidance points;

[0047] Figure 7 This is a schematic diagram of a guide line generated after smoothing in an embodiment of the present application;

[0048] Figure 8 This is a flow chart of a method for generating a guide line in path planning in an embodiment of the present application;

[0049] Fig. 9 This is a schematic diagram of the structure of a guide line generating device in path planning in an embodiment of the present application;

[0050] Fig.10 This is a schematic diagram of the structure of an electronic device in an embodiment of the present application. DETAILED DESCRIPTION

[0051] In order to make the purpose, technical solution and advantages of the present application clearer, the technical solution of the present application will be clearly and completely described below in combination with the specific embodiments of the present application and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application.

[0052] The guide line generation method in the path planning in the embodiment of the present application can provide necessary references in the lateral planning process, improve the quality of the path, and meet the requirements of efficiency and stability. The method in the embodiment of the present application mainly considers some functions of the path planning in the autonomous driving planning module, and cooperates with the perception module and the control module.

[0053] The technical solutions provided by various embodiments of the present application are described in detail below in conjunction with the accompanying drawings.

[0054] The present application embodiment provides a method for generating a guide line in path planning, such as Figure 8 As shown, a schematic diagram of the guide line generation process in path planning in an embodiment of the present application is provided, and the method at least includes the following steps S810 to S840:

[0055] Step S810, determining the drivable area based on high-precision map data.

[0056] Based on the rich semantic information in the high-precision map data, the current drivable area of ​​the vehicle can be determined.

[0057] High-precision map data is acquired in advance or loaded in advance according to actual needs. High-precision map data includes not only the current lane information of the vehicle, but also the lane information adjacent to the current lane information.

[0058] In order to avoid problems such as crossing the line and hitting the curb, more static information can be obtained from the high-precision map data, such as obtaining the physical boundary information on the left and right sides ahead.

[0059] Step S820, calculating an intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area.

[0060] In the drivable area, the vehicle and obstacles to be circumvented by the vehicle are determined. It can be understood that the vehicle and obstacles to be circumvented by the vehicle mainly include but are not limited to stationary obstacles or obstacles moving at a low speed.

[0061] The intersection position between the vehicle and the obstacle to be bypassed by the vehicle in the drivable area is further calculated. It can be understood that the intersection position refers to the position of the vehicle and the obstacle to be bypassed by the vehicle at a certain future intersection time.

[0062] Step S830: acquiring a candidate avoidance point according to the intersection position.

[0063] There may be multiple intersection locations, which are related to obstacles that the vehicle needs to bypass in the path planning of the vehicle. Based on the intersection locations, candidate avoidance points that meet the requirements can be screened out.

[0064] Step S840, selecting the optimal avoidance point from the candidate avoidance points and generating a guide line.

[0065] The optimal avoidance point is selected from the candidate avoidance points according to the preset path calculation method, and then the guide line is generated after smoothing these optimal avoidance points.

[0066] It should be noted that when selecting the optimal avoidance point, the orientation and position of the vehicle also need to be considered to ensure the stability of the generated guide line.

[0067] Through the above method, while performing lateral path planning, the obstacle avoidance efficiency and the avoidance of lateral swinging are taken into consideration, and a guide line is generated during the path planning process to provide a driving reference for the lateral planning process.

[0068] Through the above method, the drivable area is determined based on the high-precision map data. The specific calculation method of the drivable area also takes into account static information such as map elements, which can avoid problems such as crossing the line and hitting the curb, and ensure the effectiveness of the drivable area.

[0069] By using the above method, the intersection position of the self-vehicle and the obstacle to be circumvented by the self-vehicle in the drivable area is calculated according to the self-vehicle and the obstacle to be circumvented by the self-vehicle in the drivable area. By using the intersection position and calculating the avoidance point by using information such as relative vehicle speed, the safety of the guide line can be fully guaranteed and the risk of collision with obstacles can be reduced.

[0070] Different from the related art, which lacks consideration for obstacle avoidance efficiency or lateral swing, candidate avoidance points are obtained according to the intersection position; the optimal avoidance point is selected from the candidate avoidance points, and a guide line is generated. The guide line generated based on the shortest path method and taking into account the position and orientation information of the vehicle can enable the vehicle to efficiently bypass low-speed or stationary obstacles, and help improve the stability of path planning and thus reduce the lateral swing problem of the vehicle.

[0071] In one embodiment of the present application, obtaining candidate avoidance points based on the intersection position includes: determining at least one obstacle to be bypassed by the vehicle based on the intersection position; at the intersection position between the vehicle and the obstacle to be bypassed by the vehicle, expanding the bounding box of the obstacle to be bypassed by the vehicle to obtain four vertices of the expanded bounding box as candidate avoidance points, wherein the expanded width in front and behind the obstacle is the length of the vehicle, and the expanded width on the left and right sides of the obstacle is obtained by calculation.

[0072] In order to select more reasonable candidate avoidance points, at least one obstacle to be bypassed by the vehicle is determined according to the intersection position. It can be understood that the intersection position refers to the position where the vehicle and the obstacle to be bypassed by the vehicle intersect at a certain future intersection time. Therefore, based on the border of the obstacle to be bypassed by the vehicle, the four vertices of the expanded border can be obtained and these four points are used as candidate avoidance points.

[0073] It should be noted that the expansion width of the front and rear of the obstacle is the length of the vehicle, that is, the length of the expansion frame of the front and rear is the length of the vehicle. The width of the left and right sides of the obstacle needs to be further calculated. Considering that the path planning process is based on the calculation of the interactive position between the center point of the vehicle and the center point of the obstacle to be bypassed by the vehicle, the expansion width of the left and right sides of the obstacle needs to take into account the width of the vehicle.

[0074] In one embodiment of the present application, the expansion widths on the left and right sides of the obstacle are obtained by calculation, including: in, and are the speeds of the vehicle and the obstacle along the center line of the lane, speed_limit is the current road speed limit, and W is the width of the vehicle.

[0075] like Figure 5 As shown, when obtaining the candidate avoidance point, the expansion widths on the left and right sides of the obstacle are obtained by calculation. Figure 5 Middle W ex This is the result of the above calculation formula. L is the length of the vehicle.

[0076] In one embodiment of the present application, the selection of the optimal avoidance point from the candidate avoidance points includes: taking the current position of the vehicle as the starting point and taking all candidate avoidance points in the drivable area as nodes; using the shortest path algorithm to obtain a node sequence, and the length of the node sequence is the shortest and there is no intersection with the expanded border of the obstacle at the intersection position; all nodes on the shortest path in the node sequence are taken as the optimal avoidance points.

[0077] like Figure 6As shown in the figure, the current position of the vehicle is taken as the starting point, and the candidate avoidance points in the obstacles that the vehicle has passed through are taken as nodes. A node sequence can be obtained by using the shortest path algorithm. Please continue to refer to Figure 6 ,In the drivable area, the length of the node sequence is the shortest and there is no intersection with the expansion border of the obstacle at the intersection position.

[0078] It is understandable that those skilled in the art may use the shortest path algorithm including but not limited to the Dijkstra algorithm, the A* algorithm, etc., which is not specifically limited in the embodiments of the present application.

[0079] A node sequence can be obtained through the shortest path algorithm, and all nodes on the shortest path are the optimal avoidance points.

[0080] In one embodiment of the present application, generating the guide line includes: using the rear axle center point of the vehicle, the front center point of the vehicle and the optimal avoidance point as control points and generating the guide line after smoothing.

[0081] Please refer to Figure 7 Based on the shortest path method, the guide line generated by taking into account the position and orientation information of the ego vehicle (through the center point of the rear axle of the ego vehicle and the center point of the front of the ego vehicle) can help improve the stability of path planning and reduce the lateral shaking problem of the ego vehicle while enabling the ego vehicle to efficiently bypass low-speed or stationary obstacles. In the process of generating the guide line, the orientation of the ego vehicle is taken into account, thereby avoiding the generation of incorrect guide lines due to the orientation.

[0082] In the specific implementation, the center point of the rear axle of the vehicle, the center point of the front of the vehicle and the optimal avoidance point are used as control points, and a guide line is obtained by smoothing the B-spline curve, such as Figure 7 shown.

[0083] Alternatively, other smoothing methods may be used, which are not specifically limited in the embodiments of the present application.

[0084] In one embodiment of the present application, determining the drivable area based on high-precision map data includes: obtaining current lane information, adjacent lane information, and the left and right physical boundary positions in front based on the high-precision map data; determining the drivable area based on the current lane information, the adjacent lane information, and the left and right physical boundary positions in front.

[0085] The calculation method of the drivable area also takes into account static information such as map elements to avoid problems such as crossing the line and hitting the curb, ensuring the effectiveness of the drivable area. Figure 1As shown in the figure, the information of the current lane and adjacent lanes is obtained from the high-precision map, such as lane width, left and right boundary line attributes (mainly based on the virtual and real lines to determine whether it is traversable); the position of the left and right physical boundaries in front (such as flower beds, curbs, etc.) is obtained. Based on the information in the above high-precision map data, the drivable area in front of the vehicle can be confirmed.

[0086] Preferably, temporary road changes such as cones, tidal lanes, etc. can be further taken into account when calculating the drivable area.

[0087] In one embodiment of the present application, based on the self-vehicle and the obstacle to be bypassed by the self-vehicle in the drivable area, calculating the intersection position of the self-vehicle and the obstacle to be bypassed by the self-vehicle in the drivable area, includes: taking the low-speed moving obstacles and the stationary obstacles in the drivable area as the obstacles to be bypassed, the speed of the low-speed moving obstacles being lower than 0.5 times the speed of the self-vehicle or lower than 0.2 times the speed limit of the road; calculating the speed of the self-vehicle and the obstacle to be bypassed along the centerline direction of the lane; calculating the distance between the self-vehicle and the obstacle to be bypassed along the centerline direction of the lane; calculating the intersection time according to the speed of the self-vehicle and the obstacle to be bypassed along the centerline direction of the lane and the distance between the self-vehicle and the obstacle to be bypassed along the centerline direction of the lane; based on the intersection time, moving the obstacle to be bypassed forward by a preset distance along the centerline of the lane where it is located, and taking the position after the obstacle is moved as the intersection position.

[0088] Please refer to Figure 2-Figure 4 , calculate the intersection position: calculate the intersection time and intersection position through the speed difference and distance difference between the vehicle and the obstacle. The specific method is:

[0089] First, calculate the speed of the vehicle and the obstacle along the center line of the lane, expressed as V s ,like Figure 2 As shown. The velocity vector of the vehicle or obstacle is decomposed into the direction along the lane line and the direction perpendicular to the lane line, where the length of the component along the lane line is V s .

[0090] Then, the distance between the vehicle and the obstacle along the centerline of the lane is calculated, referred to as the longitudinal distance D. s ,like Figure 3 shown.

[0091] Then, calculate the intersection time, in, and are the speeds of the vehicle and the obstacle along the center line of the vehicle lane respectively;

[0092] Finally, move the obstacle forward along the center line of its lane. As shown in Figure 4, the position after the obstacle is moved is taken as the intersection position.

[0093] Preferably, when calculating the intersection position, the predicted trajectory of the obstacle can also be used to make a more accurate calculation.

[0094] The present application also provides a guide line generating device 900 in path planning, such as Fig. 9 As shown, a schematic diagram of the structure of a guide line generating device in path planning in an embodiment of the present application is provided, wherein the guide line generating device 900 in path planning at least includes: a determination module 910, a calculation module 920, an acquisition module 930 and a generation module 940, wherein:

[0095] In one embodiment of the present application, the determination module 910 is specifically used to determine a drivable area based on high-precision map data.

[0096] Based on the rich semantic information in the high-precision map data, the current drivable area of ​​the vehicle can be determined.

[0097] High-precision map data is acquired in advance or loaded in advance according to actual needs. The high-precision map data includes not only the current lane information of the vehicle, but also the lane information adjacent to the current lane information.

[0098] In order to avoid problems such as crossing the line and hitting the curb, more static information can be obtained from the high-precision map data, such as obtaining the physical boundary information on the left and right sides ahead.

[0099] In one embodiment of the present application, the calculation module 920 is specifically used to calculate the intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area.

[0100] In the drivable area, the vehicle and obstacles to be circumvented by the vehicle are determined. It can be understood that the vehicle and obstacles to be circumvented by the vehicle mainly include but are not limited to stationary obstacles or obstacles moving at a low speed.

[0101] The intersection position between the vehicle and the obstacle to be bypassed by the vehicle in the drivable area is further calculated. It can be understood that the intersection position refers to the position of the vehicle and the obstacle to be bypassed by the vehicle at a certain future intersection time.

[0102] In one embodiment of the present application, the acquisition module 930 is specifically used to: acquire a candidate avoidance point according to the intersection position.

[0103] There may be multiple intersection locations, which are related to obstacles that the vehicle needs to bypass in the path planning of the vehicle. Based on the intersection locations, candidate avoidance points that meet the requirements can be screened out.

[0104] In one embodiment of the present application, the generating module 940 is specifically used to select the optimal avoidance point from the candidate avoidance points and generate a guide line.

[0105] The optimal avoidance point is selected from the candidate avoidance points according to the preset path calculation method, and then the guide line is generated after smoothing these optimal avoidance points.

[0106] It should be noted that when selecting the optimal avoidance point, the orientation and position of the vehicle also need to be considered to ensure the stability of the generated guide line.

[0107] In one embodiment of the present application, the acquisition module 930 is also used to

[0108] Determine at least one obstacle that the vehicle needs to bypass according to the intersection position;

[0109] At the intersection of the ego vehicle and the obstacle to be bypassed by the ego vehicle, the bounding box of the obstacle to be bypassed by the ego vehicle is expanded to obtain four vertices of the expanded bounding box as candidate avoidance points, wherein the expanded width in front of and behind the obstacle is the length of the ego vehicle, and the expanded width on the left and right sides of the obstacle is obtained by calculation.

[0110] In one embodiment of the present application, the acquisition module 930 is also used to

[0111] The expanded widths on the left and right sides of the obstacle are calculated, including:

[0112]

[0113] in, and are the speeds of the vehicle and the obstacle along the center line of the lane, speed_limit is the current road speed limit, and W is the width of the vehicle.

[0114] In one embodiment of the present application, the generating module 940 is also used to

[0115] Taking the current position of the vehicle as the starting point, all candidate avoidance points in the drivable area are taken as nodes;

[0116] A shortest path algorithm is used to obtain a node sequence, wherein the length of the node sequence is the shortest and there is no intersection with the expansion border of the obstacle at the intersection position;

[0117] All nodes on the shortest path in the node sequence are used as the optimal avoidance points.

[0118] In one embodiment of the present application, the generating module 940 is also used to

[0119] The rear axle center point of the vehicle, the front center point of the vehicle and the optimal avoidance point are used as control points and smoothed to generate a guide line.

[0120] In one embodiment of the present application, the determining module 910 is further configured to:

[0121] Obtain the current lane information, adjacent lane information, and the physical boundary positions on the left and right sides ahead based on high-precision map data;

[0122] A drivable area is determined according to the current lane information, the adjacent lane information, and the front left and right physical boundary positions.

[0123] In one embodiment of the present application, the calculation module 920 is also used to

[0124] The low-speed moving obstacles and stationary obstacles in the drivable area are regarded as obstacles to be bypassed, wherein the speed of the low-speed moving obstacles is lower than 0.5 times the speed of the vehicle or lower than 0.2 times the speed limit of the road;

[0125] Calculating the speed of the vehicle and the obstacle to be circumvented along the center line of the lane;

[0126] Calculating the distance between the vehicle and the obstacle to be circumvented along the center line of the lane;

[0127] Calculating the intersection time according to the speed of the vehicle and the obstacle to be circumvented along the center line of the lane and the distance between the vehicle and the obstacle to be circumvented along the center line of the lane;

[0128] The obstacle to be bypassed is moved forward a preset distance along the center line of the lane where the obstacle is located based on the intersection time, and the position of the obstacle after the obstacle is moved is used as the intersection position.

[0129] It can be understood that the guide line generating device in the above-mentioned path planning can implement the various steps of the guide line generating method in path planning provided in the aforementioned embodiments, and the relevant explanations on the guide line generating method in path planning are applicable to the guide line generating device in path planning, which will not be repeated here.

[0130] Fig.10 This is a schematic diagram of the structure of an electronic device according to an embodiment of the present application. Fig.10At the hardware level, the electronic device includes a processor, and optionally also includes an internal bus, a network interface, and a memory. The memory may include a memory, such as a high-speed random access memory (RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk storage. Of course, the electronic device may also include hardware required for other services.

[0131] The processor, network interface and memory can be interconnected through an internal bus, which can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.10 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0132] The memory is used to store the program. Specifically, the program may include a program code, and the program code includes a computer operation instruction. The memory may include a memory and a non-volatile memory, and provides instructions and data to the processor.

[0133] The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it, forming a guide line generation device in the path planning at the logical level. The processor executes the program stored in the memory and is specifically used to perform the following operations:

[0134] Determine the drivable area based on high-precision map data;

[0135] Calculating an intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area;

[0136] According to the intersection position, obtaining a candidate avoidance point;

[0137] An optimal avoidance point is selected from the candidate avoidance points, and a guide line is generated.

[0138] The above application Figure 8The method performed by the guide line generation device in the path planning disclosed in the illustrated embodiment can be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware decoding processor for execution, or a combination of hardware and software modules in the decoding processor for execution. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0139] The electronic device may also perform Figure 8 A method for executing a guide line generation device in path planning, and realizing a guide line generation device in path planning Figure 8 The functions of the illustrated embodiment will not be described in detail in the embodiments of the present application.

[0140] The present application also provides a computer-readable storage medium, which stores one or more programs, wherein the one or more programs include instructions, which, when executed by an electronic device including multiple application programs, enable the electronic device to execute Figure 8 The method performed by the guide line generation device in the path planning in the illustrated embodiment is specifically used to perform:

[0141] Determine the drivable area based on high-precision map data;

[0142] Calculating an intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area;

[0143] According to the intersection position, obtaining a candidate avoidance point;

[0144] An optimal avoidance point is selected from the candidate avoidance points, and a guide line is generated.

[0145] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0146] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0147] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0148] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0149] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0150] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0151] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0152] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0153] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0154] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. A method for generating a guide line in path planning, wherein: The method comprises: Determine the drivable area based on high-precision map data; Calculating an intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area; According to the intersection position, obtaining a candidate avoidance point; An optimal avoidance point is selected from the candidate avoidance points, and a guide line is generated.

2. The method of claim 1, wherein: The step of obtaining a candidate avoidance point according to the intersection position includes: Determine at least one obstacle that the vehicle needs to bypass according to the intersection position; At the intersection of the ego vehicle and the obstacle to be bypassed by the ego vehicle, the bounding box of the obstacle to be bypassed by the ego vehicle is expanded to obtain four vertices of the expanded bounding box as candidate avoidance points, wherein the expanded width in front of and behind the obstacle is the length of the ego vehicle, and the expanded width on the left and right sides of the obstacle is obtained by calculation.

3. The method of claim 2, wherein: The expanded widths on the left and right sides of the obstacle are obtained by calculation, including: in, and are the speeds of the vehicle and the obstacle along the center line of the lane, speed_limit is the current road speed limit, and W is the width of the vehicle.

4. The method of claim 3, wherein: The selecting the optimal avoidance point from the candidate avoidance points comprises: Taking the current position of the vehicle as the starting point, all candidate avoidance points in the drivable area are taken as nodes; A shortest path algorithm is used to obtain a node sequence, wherein the length of the node sequence is the shortest and there is no intersection with the expansion border of the obstacle at the intersection position; All nodes on the shortest path in the node sequence are used as the optimal avoidance points.

5. The method of claim 4, wherein: The generating of guide lines comprises: The rear axle center point of the vehicle, the front center point of the vehicle and the optimal avoidance point are used as control points and smoothed to generate a guide line.

6. The method of claim 1, wherein: Determining the drivable area based on high-precision map data includes: Obtain the current lane information, adjacent lane information, and the physical boundary positions on the left and right sides ahead based on high-precision map data; A drivable area is determined according to the current lane information, the adjacent lane information, and the front left and right physical boundary positions.

7. The method of claim 1, wherein: Calculating the intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area includes: The low-speed moving obstacles and stationary obstacles in the drivable area are regarded as obstacles to be bypassed, wherein the speed of the low-speed moving obstacles is lower than 0.5 times the speed of the vehicle or lower than 0.2 times the speed limit of the road; Calculating the speed of the vehicle and the obstacle to be circumvented along the center line of the lane; Calculating the distance between the vehicle and the obstacle to be circumvented along the center line of the lane; Calculating the intersection time according to the speed of the vehicle and the obstacle to be circumvented along the center line of the lane and the distance between the vehicle and the obstacle to be circumvented along the center line of the lane; The obstacle to be bypassed is moved forward a preset distance along the center line of the lane where the obstacle is located based on the intersection time, and the position of the obstacle after the obstacle is moved is used as the intersection position.

8. A guide line generation device in path planning, wherein: The device comprises: A determination module is used to determine the drivable area based on high-precision map data; A calculation module, used for calculating the intersection position of the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area according to the ego vehicle and the obstacle to be circumvented by the ego vehicle in the drivable area; An acquisition module, used for acquiring a candidate avoidance point according to the intersection position; A generation module is used to select the optimal avoidance point from the candidate avoidance points and generate a guide line.

9. An electronic device, comprising: processor; as well as A memory arranged to store computer executable instructions, which when executed cause the processor to perform the method of any one of claims 1 to 7.

10. A computer-readable storage medium storing one or more programs, which, when executed by an electronic device including a plurality of application programs, causes the electronic device to execute any one of the methods of claims 1 to 7.

Citation Information

Cited By

  • Improved a-star-based intelligent vehicle obstacle avoidance path search method and apparatus, vehicle, and storage medium

    WO2026124457A1