Low-speed unmanned vehicle target course angle decision-making method based on graph search

By using the graph search algorithm to find the optimal heading angle in the two-dimensional grid map of unmanned vehicles, and combined with the passage detection, the problem of safe driving and operation coordination between unmanned vehicles in complex environments is solved, and high reliability is achieved. Target heading angle decision.

CN119063755AActive Publication Date: 2024-12-03TONGJI UNIV
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202411387407.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-01
Publication Date
2024-12-03
Estimated Expiration
2044-10-01

AI Technical Summary

Technical Problem

In the urban open road cleaning operation scenario, how unmanned vehicles can drive safely and efficiently in complex environments and work in concert with the operators, there is currently a lack of effective target heading angle decision-making methods.

Method used

A graph-based search algorithm is used to find the optimal or approximately optimal heading angle in a two-dimensional grid map, and guide the travel direction of the unmanned vehicle through discrete search methods, consider static and dynamic obstacles, and conduct pass detection to avoid collisions.

Benefits of technology

It provides a high-reliability target heading angle decision-making method under the condition of no complete upper-level information, ensuring the safe driving of unmanned vehicles, and being able to cope with dynamic environmental changes, providing flexible navigation strategies.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119063755A_ABST
    Figure CN119063755A_ABST
Patent Text Reader

Abstract

The invention discloses a low-speed unmanned vehicle target course angle decision-making method based on graph search, and the method comprises the steps: searching an optimal or approximately optimal course angle in a two-dimensional grid map based on a graph search algorithm, and giving an approximately optimal course angle in a discretization search mode when there is no effective reference information of a road line at an upper layer, and the advancing direction of the unmanned vehicle is guided. The method has the advantages that the reliability is high, and an optimal or approximately optimal course angle can be decided under the condition that no complete upper-layer information exists so as to be used for guiding the advancing direction of the unmanned vehicle.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of decision-making planning in unmanned driving, and in particular to a method for making a target heading angle decision of a low-speed unmanned vehicle based on graph search. Background Art

[0002] With the rapid development of intelligent transportation systems and autonomous driving technology, low-speed unmanned vehicles are increasingly used as part of smart cities, especially in cleaning operations on open roads in cities. However, ensuring that unmanned vehicles can drive safely and efficiently in complex environments and work efficiently with operators remains a challenge.

[0003] This task is to make autonomous decisions on the vehicle orientation when the unmanned vehicle arrives at the planned destination in the grid map during the cleaning operation on the open roads in the city, based on the task requirements, working environment conditions, etc., to ensure that the vehicle automatically follows the cleaning staff. During the following process, the selection of the heading angle of the driving target point needs to ensure the safety of the cleaning staff and the vehicle, the current passability and the subsequent drivability. There is currently no solution to this type of problem. This is where this application focuses on improvement. Summary of the invention

[0004] The technical problem to be solved by the present invention is to provide a low-speed unmanned vehicle target heading angle decision method based on graph search, which has high reliability and can decide an optimal or approximately optimal heading angle for guiding the direction of travel of the unmanned vehicle without complete upper-level information.

[0005] In order to solve the above technical problems, the present invention provides a method for determining the target heading angle of a low-speed unmanned vehicle based on graph search. Based on the graph search algorithm, an optimal or approximately optimal heading angle is found in a two-dimensional grid map. When there is no valid roadside reference information in the upper layer, an approximately optimal heading angle is given by a discretized search method to guide the direction of travel of the unmanned vehicle. The reference system involved is the vehicle coordinate system, which is a plane rectangular coordinate system fixed to the vehicle, with the position of the vehicle itself as the origin, the forward direction of the vehicle as the positive direction of the X-axis, and the left side perpendicular to the vehicle's direction as the positive direction of the Y-axis. The heading angle is the angle between the intersection of the longitudinal axis of the vehicle body and the earth and the earth's inertial coordinate system.

[0006] The specific steps are as follows:

[0007] Step S0: Initialize the valid reception flag of the cleaning staff's location information, grid map information, roadside information and driving target point location information to false;

[0008] Step S1: obtain the location information of the cleaning staff, the grid map information, the roadside information and the navigation point location information, and mark the corresponding flag as true;

[0009] Step S2: Check whether a valid grid map, the location of the cleaning staff and the location information of the navigation point have been received;

[0010] If the cleaning staff's location, grid map or driving target point location information flag is false, return to step S1;

[0011] Step S3: Check whether valid roadside information has been received. If valid roadside information has been received, determine whether the cleaning staff and the vehicle are on the same side of the roadside. If valid roadside information has not been received, use the previous determination result of the same side or different side.

[0012] Step S4: Calculate the reference heading angle;

[0013] If the cleaning staff and the vehicle are on the same side of the curb, the reference heading angle is set as the angle between the line connecting the navigation point and the cleaning staff's position and the X-axis of the vehicle coordinate system;

[0014] If the cleaning staff and the vehicle are on different sides of the curb, the reference heading angle is set as the angle between the curb line and the X-axis of the vehicle coordinate system;

[0015] Step S5: Perform traffic detection;

[0016] Check in the grid map whether the navigation point is passable along the direction of the reference heading angle. If passable, publish the heading angle information through the communication architecture of the vehicle computing platform, and then return to step S0 to make a new decision; if not passable, jump to step S6;

[0017] Step S6: Adjust the heading angle and return to step S5 until the pass test is passed; if no heading angle that can pass the pass test is found during the traversal search, a decision failure message is published through the communication architecture of the on-board computing platform, and then return to step S0 to make a new decision.

[0018] The present invention uses a graph search algorithm to find the optimal or approximately optimal heading angle in a discretized state space, thereby guiding the target heading angle decision of the unmanned vehicle. This method not only handles static obstacles, but also copes with changes in dynamic environments, providing a more reliable and flexible navigation strategy for unmanned vehicles.

[0019] Beneficial effects of the present invention:

[0020] 1) The present invention provides a method for determining a target heading angle in a low-speed scenario. The method has high reliability and can determine an optimal or approximately optimal heading angle to guide the direction of travel of an unmanned vehicle without complete upper-layer information.

[0021] 2) The heading angle decision method of the present invention takes into account the impact of dynamic and static obstacles on the unmanned vehicle. By adding a passage detection function, it avoids the unmanned vehicle from colliding with obstacles when running to the navigation point, thereby ensuring the driving safety of the unmanned vehicle. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The drawings in the specification, which constitute a part of this application, are used to provide a further understanding of the present invention. The illustrative embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute improper limitations on the present invention.

[0023] In the attached picture:

[0024] Figure 1 It is a working flow chart of a specific embodiment of the present invention;

[0025] Figure 2 A schematic diagram of a traffic detection method according to a specific embodiment of the present invention;

[0026] Figure 3 and Figure 4 This is a diagram of the heading angle decision results of a real vehicle experiment according to a specific embodiment of the present invention. DETAILED DESCRIPTION

[0027] The embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0028] The present invention provides a method for determining a target heading angle of a low-speed unmanned vehicle based on graph search, comprising the following specific steps:

[0029] Step S0: Initialize the valid reception flag of the cleaning staff's location information, grid map information, roadside information and driving target point (ie, navigation point) location information to false.

[0030] Step S1: Acquire the location information of the cleaning staff, grid map information, roadside information and driving target point location information. The specific steps are as follows:

[0031] Step S11: Obtain the coordinate position (x p ,y p ), when receiving valid cleaning staff location information, the corresponding flag is recorded as true;

[0032] Step S12: obtaining the two-dimensional grid map information in the vehicle coordinate system through the ROS topic communication mechanism of the vehicle computing platform, and when receiving the grid map information storing the complete data content, recording the corresponding flag as true;

[0033] The grid map is a mapping of the vehicle environment. It decomposes the space into interconnected but non-overlapping grids. Each grid is divided into occupied, free or unknown states according to the data value stored in it. When the storage value is 0, it represents "free", that is, a drivable area without obstacles; when the storage value is 100, it represents "occupied", that is, a non-drivable area with obstacles; when the storage value is -1, it represents "unknown", that is, a non-drivable area with unknown risks;

[0034] Step S13: Obtain the roadside information in the vehicle coordinate system through the ROS topic communication mechanism of the vehicle computing platform. When valid roadside information is received, the corresponding flag is recorded as true;

[0035] The roadside line is generated by fitting the laser radar point cloud data in the form of a parametric equation. The straight line equation is y=kx+b. The equation parameters, including the slope k and the intercept b, are obtained through ROS topic communication.

[0036] Step S14: Obtain the navigation point position information (x0, y0) in the vehicle coordinate system through the ROS topic communication mechanism of the vehicle computing platform. When receiving valid driving target point position information, the corresponding flag bit is recorded as true;

[0037] The navigation point is the local planned destination where the vehicle is expected to arrive.

[0038] Step S2: Check whether a valid grid map, the location of the cleaning staff and the location information of the driving target point have been received;

[0039] If any information flag bit in the cleaning staff's position, the grid map, or the driving target point position is false, then return to step S1.

[0040] Step S3: Check whether valid roadside information has been received. If valid roadside information has been received, determine whether the cleaning staff and the vehicle (i.e., the origin of the vehicle coordinate system) are on the same side of the roadside. The determination method is as follows:

[0041]

[0042] Where: x p ,y p is the position of the cleaning staff in the vehicle coordinate system. If k and b do not receive valid roadside information, the previous judgment result of the same side or the opposite side is used.

[0043] Step S4: Calculate the reference heading angle;

[0044] If the cleaner and the vehicle are on the same side of the curb, the reference heading angle is set as the angle between the line connecting the navigation point and the cleaner's position and the X-axis of the vehicle coordinate system. The calculation formula is as follows:

[0045]

[0046] If the cleaning staff and the vehicle are on different sides of the curb, the reference heading angle is set to the angle between the curb line and the X-axis of the vehicle coordinate system. The calculation formula is as follows:

[0047] θ = arctan(k).

[0048] Step S5: traffic detection;

[0049] In a two-dimensional grid map, the size is set with the navigation point as the center.

[0050] m*m(0<m<m max ,m∈N) search space, where m max is the maximum size of the grid map, and traverses all grids (x i ,y i ), where (i>0, i∈N), and the distance d between each occupied grid and the grid where the navigation point is located is calculated at the same time 1i and the distance d from each occupied grid to the navigation point along the straight line of the above heading angle 2i , the calculation formula is as follows:

[0051]

[0052] Check whether the navigation point is passable along the above heading angle direction. If there is a satisfying d 1i ≤d 1threshold &&d 2i ≤d 2threshold If the grid is occupied by , it is impassable, otherwise it is passable;

[0053] in:

[0054]

[0055] d 1threshold , d 2threshold is an empirical value related to the vehicle body size. The vehicle is simplified here to have a length and width of D L and D W The rectangle, d safe It is the artificial experience value, generally:

[0056]

[0057] If it is passable, the heading angle information is released through the communication architecture of the vehicle computing platform; if it is not passable, jump to step S6;

[0058] Step S6: adjusting the heading angle that fails the passage detection;

[0059] Iteratively adjust the heading angle based on the incremental step size, fine-tune the heading angle within a predetermined range [-180°, 180°], and adjust a fixed step size (±1°) each time, and then return to step S5 until the passage detection is passed;

[0060] If no heading angle that can pass the traffic detection is found during the traversal search, a decision failure message is published through the ROS communication mechanism of the on-board computing platform, and then the process returns to step S0 to make a new decision.

[0061] The traffic detection method described in the specific embodiment of the present invention is as follows Figure 2 As shown in the figure, the shadow area on the right is the area on the curb, and the shadow area on the left is the detection area for passage detection. At this time, the cleaning staff and the unmanned vehicle are on different sides of the curb. The reference heading angle is set to the angle θ between the curb line and the X-axis of the vehicle coordinate system. However, there are grids occupied by obstacles in the detection area, so the reference heading angle cannot pass the passage detection and needs to be adjusted. Figure 3 and Figure 4 This is a schematic diagram of the actual vehicle experiment results of a specific embodiment of the present invention, wherein the blue area is the non-drivable area, the black area is the drivable area, the "Target person" is the cleaning staff to be followed, the "Road boundary" is the fitted roadside line, and the red arrow in the middle is the heading angle decision result. Figure 3 The cleaning staff and the unmanned vehicle are on opposite sides of the curb. The reference heading angle is set as the angle between the curb line and the X-axis of the vehicle coordinate system, and the reference heading angle passes the pass detection. Figure 4 The cleaning staff and the unmanned vehicle are on the same side of the curb. The reference heading angle is set as the angle between the curb line and the X-axis of the vehicle coordinate system, and the reference heading angle passes the passage detection.

[0062] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for determining the target heading angle of a low-speed unmanned vehicle based on graph search, comprising the following steps: Step S0: Initialize the valid reception flag of the cleaning staff's location information, grid map information, roadside information and driving target point location information to false; Step S1: obtain the location information of the cleaning staff, the grid map information, the roadside information and the navigation point location information, and mark the corresponding flag as true; Step S2: Check whether a valid grid map, the location of the cleaning staff and the location information of the navigation point have been received; If the cleaning staff's location, grid map or driving target point location information flag is false, return to step S1; Step S3: Check whether valid roadside information has been received. If valid roadside information has been received, determine whether the cleaning staff and the vehicle are on the same side of the roadside. If valid roadside information has not been received, use the previous determination result of the same side or different side. Step S4: Calculate the reference heading angle; If the cleaning staff and the vehicle are on the same side of the curb, the reference heading angle is set as the angle between the line connecting the navigation point and the cleaning staff's position and the X-axis of the vehicle coordinate system; If the cleaning staff and the vehicle are on different sides of the curb, the reference heading angle is set as the angle between the curb line and the X-axis of the vehicle coordinate system; Step S5: Perform traffic detection; Check in the grid map whether the navigation point is passable along the direction of the reference heading angle. If passable, publish the heading angle information through the communication architecture of the vehicle computing platform, and then return to step S0 to make a new decision; if not passable, jump to step S6; Step S6: After adjusting the heading angle, return to step S5 until the pass test is passed; if no heading angle that can pass the pass test is found during the traversal search, a decision failure message is published through the communication architecture of the on-board computing platform, and then return to step S0 to make a new decision.

2. The method for determining the target heading angle of a low-speed unmanned vehicle based on graph search according to claim 1, characterized in that: In step S3, it is determined whether the cleaning staff and the vehicle are on the same side of the roadside, and the determination method is as follows: Where: x p ,y p is the position of the cleaning staff in the vehicle coordinate system. If k and b do not receive valid roadside information, the previous judgment result of the same side or the opposite side is used.

3. The method for determining the target heading angle of a low-speed unmanned vehicle based on graph search according to claim 1, characterized in that: In step S4, if the cleaning staff and the vehicle are on the same side of the curb, the reference heading angle is set as the angle between the line connecting the navigation point and the cleaning staff's position and the X-axis of the vehicle coordinate system, and the calculation formula is as follows:

4. The method for determining the target heading angle of a low-speed unmanned vehicle based on graph search according to claim 1, characterized in that: In step S4, if the cleaning staff and the vehicle are on different sides of the curb, the reference heading angle is set to the angle between the curb line and the X-axis of the vehicle coordinate system, and the calculation formula is as follows: θ = arctan(k).

5. The method for determining the target heading angle of a low-speed unmanned vehicle based on graph search according to claim 1, characterized in that: In step S5, a size of m*m (0<m<m) is set with the navigation point position as the center in the two-dimensional grid map. max , m∈N) search space, where m max is the maximum size of the grid map, and traverses all grids (x i ,y i ), where (i>0, i∈N), and the distance d between each occupied grid and the grid where the navigation point is located is calculated at the same time 1i and the distance d from each occupied grid to the navigation point along the straight line of the above heading angle 2i , the calculation formula is as follows: Check whether the navigation point is passable along the above heading angle direction. If there is a satisfying d 1i ≤d 1threshold &&d 2i ≤d 2threshold If the grid is occupied by , it is inaccessible, otherwise it is accessible; in: d 1threshold , d 2threshold is an empirical value related to the vehicle body size. The vehicle is simplified here to have a length and width of D L and D W The rectangle, d safe is the artificial experience value, which is:

6. The method for determining the target heading angle of a low-speed unmanned vehicle based on graph search according to claim 1, characterized in that: The passage detection in step S6 is to iteratively adjust the heading angle based on the incremental step size, and fine-tune the heading angle within the predetermined range [-180°, 180°], each time adjusting a fixed step size (±1°), and then return to step S5 until the passage detection is passed.

7. A computer system comprising a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the steps of the target heading angle decision method according to any one of claims 1 to 6.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the target heading angle decision method described in any one of claims 1 to 6 are implemented.

9. A computer program product, comprising a computer program, characterized in that: When the computer program is executed by a processor, the steps of the target heading angle decision method described in any one of claims 1 to 6 are implemented.

Citation Information

Patent Citations

  • Unmanned vehicle track real-time planning method based on road structure weight fusion

    CN110081894A

  • Multi-sensor fusion road extraction and indexing method based on global and local grid maps

    CN111273305A

  • Method and device for calculating course angle of target vehicle based on visual information

    CN114549645A

  • Vehicle driving reference line generation method and system and moving tool

    CN117087694A

  • Path planning method for dynamic target identification and tracking of miniature unmanned vehicle

    CN117928570A