A method for autonomous movement of a traffic cone robot and a traffic cone robot system
Through group calculation and combination of obstacle avoidance modules, the traffic cone robot system that identifies obstacles is solved, and the problem of traffic cone robots in the prior art is difficult to place curves and flexibly avoid obstacles is improved, and the efficiency and safety of road maintenance operations are improved.
Patent Information
- Application Number
- CN202210241642.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-03-11
- Publication Date
- 2024-11-01
- Estimated Expiration
- 2042-03-11
AI Technical Summary
It is difficult to achieve curve placement during the placement and recycling of existing traffic cone robots, and they cannot flexibly avoid obstacles, and the placement shape and route are fixed, so they cannot adapt to changes in the construction area, resulting in high labor intensity and high safety risks.
By determining the parking profile of the traffic cone robot and the number of moving to the traffic cone robot, it is divided into groups, the expected speed of each traffic cone robot is calculated, and the combined obstacle avoidance module is used to identify obstacle avoidance movement, so as to achieve autonomous formation and follow-up.
It improves the efficiency and safety of traffic cone robots in road maintenance operations, reduces the on-site operation needs of construction personnel, realizes flexible obstacle avoidance and follow-up movement, and reduces labor intensity and safety risks.
Smart Images

Figure CN114625138B_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the technical field of traffic cones, and in particular relates to a method for autonomous movement of a traffic cone robot and a traffic cone robot system. Background Art
[0002] As an important transportation infrastructure, the highway system has been damaged, eroded by natural factors and continuously crushed by passing vehicles, causing different degrees of damage, grinding and degradation of the road. Severe road damage will limit the smooth flow of the highway. Therefore, in order to improve the service life of the highway, the highway needs to be regularly maintained and maintained. Traffic cones are one of the indispensable tools in road maintenance operations, and they play an important role in guiding traffic and ensuring normal road maintenance operations. Due to the heavy weight, high density and long distance of traffic cones in road maintenance work scenes, the placement and recovery of a large number of traffic cones greatly increase the labor intensity of road maintenance operations, and construction personnel face certain safety risks when adjusting and placing them on site. In addition, domestic and foreign universities, enterprises, research institutes and other institutions have also successively carried out research and development of mechanized and automated special vehicles for automatic retracting and releasing traffic cones for highway maintenance with the goal of reducing labor intensity, improving work efficiency and safety. Patent CN109024352A discloses an automatic placement and recovery method of intelligent traffic cones and an intelligent traffic cone robot, which can realize automatic placement of traffic cones. However, during the placement of intelligent traffic cones, the placement shape of the traffic cones is relatively fixed, and it is difficult to achieve curved placement; the movement route of the traffic cones is relatively fixed, and when there are obstacles in the construction area, they cannot flexibly avoid obstacles, and when the construction area changes, the placement of the traffic cones cannot be flexibly changed. Summary of the invention
[0003] In order to solve the deficiencies of the prior art, the present invention provides a method for autonomous movement of a traffic cone robot, which can realize autonomous formation, movement, obstacle avoidance and following of the traffic cone robot, and reduce the occurrence of accidents of the traffic cone robot.
[0004] Another object of the present invention is to provide a traffic cone robot system.
[0005] In order to solve the deficiencies of the prior art, the technical solution provided by the present invention is:
[0006] A method for autonomous movement of a traffic cone robot, comprising:
[0007] Determine the parking contour of the traffic cone robot and the number of traffic cone robots to be moved, divide the traffic cone robots to be moved into s groups, determine the parking contour shape of each group and the expected position of the first traffic cone robot;
[0008] Calculate the expected speed of each traffic cone robot at the current moment according to the expected position of the first traffic cone robot in each group and the current position of each traffic cone robot in each group;
[0009] Determine whether the traffic cone robot encounters an obstacle. If so, the traffic cone robot avoids the obstacle and moves according to the updated expected speed after avoiding the obstacle; otherwise, the traffic cone robot moves according to the expected speed at the current moment; until all traffic cone robots have finished moving.
[0010] Preferably, the calculation formula of the expected speed of each traffic cone robot at the current moment is as follows:
[0011]
[0012] in,
[0013]
[0014]
[0015] in, is the expected speed of the i-th traffic cone robot in the s-th group at time t, ▽ is the gradient; represents the current position of the i-th traffic cone robot in the s-th group; represents the current position of the jth traffic cone robot in the sth group; represents the desired position of the first traffic cone robot in the sth group, represents the following speed of the first traffic cone robot in the sth group; is the potential field function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot of the s-th group; is the potential field function between the current position of the i-th traffic cone robot and the desired position of the first traffic cone robot in the s-th group; for exist The gradient at for exist The gradient at
[0016] The following constraints are met:
[0017] For any i,j∈{1,2,...,n s}, i≠j:
[0018] Existence Mapping Make and satisfy:
[0019]
[0020] if but
[0021] if but
[0022] in, For As the center of the circle, is a sphere with radius is a constant;
[0023] The following constraints are met:
[0024] For any i,j∈{1,2,...,n s}, i≠j:
[0025]
[0026] Existence Mapping Make and satisfy:
[0027] Preferably, the calculation formula of the potential field function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot of the s-th group is as follows:
[0028]
[0029] in,
[0030]
[0031]
[0032] in, is the gravitational function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group; is the repulsive force function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group; is the gravitational constant; is the repulsion constant.
[0033] Preferably, the calculation formula of the potential field function between the current position of the i-th traffic cone robot of the s-th group and the expected position of the first traffic cone robot is as follows:
[0034]
[0035] Among them, k s is a constant.
[0036] Preferably, the traffic cone robot is placed under the following working conditions:
[0037] When the parking profile of the traffic cone robot remains unchanged, is 0;
[0038] As the parking contour of the traffic cone robot moves with the working area, Equal to the moving speed of the working area;
[0039] Traffic cone recycling robot working conditions: is 0.
[0040] Preferably, determining the expected position of the first traffic cone robot in each group includes selecting an endpoint of a parking contour of each group of traffic cone robots as the expected position of the first traffic cone robot in the group.
[0041] A traffic cone robot system comprises a remote host computer and a plurality of traffic cone robots;
[0042] The remote host computer is used to determine the parking contour of the traffic cone robot and the number of traffic cone robots to be moved, divide the traffic cone robots to be moved into s groups, determine the parking contour shape of each group and the expected position of the first traffic cone robot; and, is used to calculate the expected speed of each traffic cone robot at the current moment according to the expected position of the first traffic cone robot in each group and the current position uploaded by each traffic cone robot in each group, and send the expected speed of each traffic cone robot at the current moment to the traffic cone robot;
[0043] The traffic cone robot comprises a cone, a mobile chassis, a main controller module, a communication module, a power module, a combined obstacle avoidance module, a positioning module, a driving module, and a driving wheel; the cone is located above the mobile chassis; the main controller module, the communication module, the power module, the combined obstacle avoidance module, the positioning module, and the driving module are fixed inside the cone or in the mobile chassis; the driving wheel is fixed below the mobile chassis;
[0044] The communication module is connected to the main controller module for communication between the main controller module and the remote host computer;
[0045] The positioning module is used to obtain the real-time position of the traffic cone robot and upload the real-time position of the traffic cone robot to the main controller module;
[0046] The combined obstacle avoidance module is used to identify obstacles and measure the real-time distance between the traffic cone robot and the obstacle, and upload the real-time distance between the traffic cone robot and the obstacle to the main controller module;
[0047] The main controller module is used to receive the real-time distance between the traffic cone robot and the obstacle, and send the obstacle avoidance movement instruction to the driving module according to the real-time distance between the traffic cone robot and the obstacle; and is used to upload the real-time position of the traffic cone robot to the remote host computer through the communication module, receive the expected speed of the traffic cone robot at the current moment sent by the remote host computer, and send the expected speed of the traffic cone robot at the current moment to the driving module;
[0048] The driving module is used to control the driving wheel to avoid obstacles according to the obstacle avoidance motion instruction, and is used to control the driving wheel to move according to the expected speed of the traffic cone robot at the current moment sent by the main controller module;
[0049] The power supply module is used to supply power to the main controller module, the communication module, the combined obstacle avoidance module, the positioning module and the driving module.
[0050] Preferably, the remote host computer is used to calculate the expected speed of each traffic cone robot at the current moment according to the following formula:
[0051]
[0052] in,
[0053]
[0054]
[0055] in, is the expected speed of the i-th traffic cone robot in the s-th group at time t, ▽ is the gradient; represents the current position of the i-th traffic cone robot in the s-th group; represents the current position of the jth traffic cone robot in the sth group; represents the desired position of the first traffic cone robot in the sth group, represents the following speed of the first traffic cone robot in the sth group; is the potential field function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot of the s-th group; is the potential field function between the current position of the i-th traffic cone robot and the desired position of the first traffic cone robot in the s-th group; for exist The gradient at for exist The gradient at
[0056] The following constraints are met:
[0057] For any i,j∈{1,2,...,n s}, i≠j:
[0058] Existence Mapping Make and satisfy:
[0059]
[0060] if but
[0061] if but
[0062] in, For As the center of the circle, is a sphere with radius is a constant;
[0063] The following constraints are met:
[0064] For any i,j∈{1,2,...,n s}, i≠j:
[0065]
[0066] Existence Mapping Make and satisfy:
[0067] Preferably, the remote host computer is used to calculate the potential field function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot of the s-th group according to the following formula:
[0068]
[0069] in,
[0070]
[0071]
[0072] in, is the gravitational function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group; is the repulsive force function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group; is the gravitational constant; is the repulsion constant.
[0073] Preferably, the remote host computer is used to calculate the potential field function between the current position of the i-th traffic cone robot of the s-th group and the desired position of the first traffic cone robot according to the following formula:
[0074]
[0075] Among them, k s is a constant.
[0076] Beneficial effects of the present invention:
[0077] 1) The remote host computer can form teams, design parking contours, set mother cones, and plan speed for traffic cone robots according to different operating conditions. Traffic cone robots can make autonomous decisions to avoid obstacles, move and follow autonomously, without the need for construction personnel to be on-site for deployment, which can effectively improve operating efficiency and placement quality;
[0078] 2) The traffic cone robots can sense and control each other. When the parking outline of the traffic cone robot moves with the working area, the mother cone robot can move synchronously with the working area, and the following robots can move automatically without too much repeated retraction and release. BRIEF DESCRIPTION OF THE DRAWINGS
[0079] Figure 1 A schematic diagram of information interaction between a remote host computer and a traffic cone robot provided by the present invention;
[0080] Figure 2 A schematic diagram of the structure of the traffic cone robot provided by the present invention;
[0081] Figure 3 A schematic diagram of the appearance of a cone provided by the present invention;
[0082] Figure 4 A flow chart of the autonomous movement of the traffic cone robot provided by the present invention;
[0083] Figure 5 A simulation diagram of the autonomous movement of the traffic cone robot provided in Example 1;
[0084] Among them: 1. Warning light; 2. Voice alarm; 3. LiDAR; 4. Cone; 6. Mobile chassis; 7. Driving wheel; 8. Communication module; 9. Positioning module; 10. Power module; 11. Main controller module; 12. Combined obstacle avoidance module; 13. Driving module; 14. Reflective strip; 15. Flexible solar panel. DETAILED DESCRIPTION
[0085] The present invention is further described below in conjunction with the embodiments. The following embodiments are only used to more clearly illustrate the technical solution of the present invention, and cannot be used to limit the protection scope of the present invention.
[0086] The embodiment of the present invention provides a method for autonomous movement of a traffic cone robot, see Figure 4 ,include,
[0087] 1) Determine the parking contour of the traffic cone robot and the number of traffic cone robots to be moved, divide the traffic cone robots to be moved into s groups, determine the parking contour shape of each group and the expected position of the first traffic cone robot:
[0088] 11) When placing traffic cone robot:
[0089] According to the "Highway Maintenance Safety Operation Regulations", the area to be closed can be divided into warning areas, upstream transition areas, longitudinal buffer areas, working areas, downstream transition areas and termination areas. The boundary of the area to be closed is the parking outline of the traffic cone robot.
[0090] Set the parking spacing of the traffic cone robots and obtain the number of traffic cone robots to be moved.
[0091] When grouping, the number of traffic cone robots in each group can be limited according to the parking contours of the traffic cone robots to reduce the subsequent calculation workload of the expected speed and improve the calculation efficiency. Traffic cone robots can also be grouped according to the communication distance between them to ensure that the parking contours of the traffic cone robots in each group do not exceed the communication distance.
[0092] The parking contour shape of each group is determined, and an endpoint of the parking contour of each group of traffic cone robots is selected as the expected position of the first traffic cone robot in the group.
[0093] The traffic cone robot in the group that is closest to the expected position of the first traffic cone robot is selected as the first traffic cone robot, namely the mother cone robot. The other traffic cone robots in the group are used as follower robots.
[0094] 12) Traffic cone recycling robot working condition:
[0095] The number of traffic cone robots that have been placed is the number of traffic cone robots to be moved. To simplify the subsequent calculation process, the grouping of traffic cone robots remains unchanged. Select one endpoint of the parking contour of each group of traffic cone robots after recovery as the expected position of the first traffic cone robot in the group. Select the traffic cone robot in the group that is closest to the expected position of the first traffic cone robot as the first traffic cone robot, that is, the mother cone robot. The other traffic cone robots in the group are used as follower robots.
[0096] 2) Calculate the expected speed of each traffic cone robot at the current moment based on the expected position of the first traffic cone robot in each group and the current position of each traffic cone robot in each group:
[0097] 21) Calculate the potential field function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group:
[0098]
[0099] in, is the potential field function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot of the s-th group; is the gravitational function between the current position of the ith traffic cone robot and the current position of the jth traffic cone robot in the sth group, which enables the traffic cone robots to follow each other during movement; is the repulsive force function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group, which can prevent the traffic cone robots from colliding with each other during movement; represents the current position of the ith traffic cone robot in the sth group, i,j∈{1,2,...,n s}, i≠j, x is the longitude direction, y is the latitude direction, z is the upward direction perpendicular to the horizontal plane, θ is the angle of rotation of the positioning module of the traffic cone robot around the x-axis, δ is the angle of rotation of the positioning module of the traffic cone robot around the y-axis, φ is the angle of rotation of the positioning module of the traffic cone robot around the z-axis; represents the current position of the jth traffic cone robot in the sth group,
[0100] For any i,j∈{1,2,...,n s}, i≠j, The following constraints are met:
[0101] Existence Mapping Make and satisfy: Right now About is a function of , which is only determined by the relative positions of the i-th traffic cone robot and the j-th traffic cone robot.
[0102] The effect of the i-th traffic cone robot on the j-th traffic cone robot is the same as the effect of the j-th traffic cone robot on the i-th traffic cone robot.
[0103] if but
[0104] if but
[0105] in:
[0106]
[0107]
[0108] for exist The gradient at for exist The gradient at For As the center of the circle, is a sphere with radius is a constant. It indicates that if the current distance between the i-th traffic cone robot and the j-th traffic cone robot is relatively close, they will repel each other, and the expected speed calculated in the next step will make the i-th traffic cone robot move away from the j-th traffic cone robot; if the current distance between the i-th traffic cone robot and the j-th traffic cone robot is relatively far, they will attract each other, and the expected speed calculated in the next step will make the i-th traffic cone robot move closer to the j-th traffic cone robot.
[0109]
[0110]
[0111] in, is the gravitational constant; is the repulsion constant.
[0112] 22) Calculate the potential field function between the current position of the i-th traffic cone robot and the desired position of the first traffic cone robot in the s-th group:
[0113]
[0114] in, is the potential field function between the current position of the i-th traffic cone robot and the desired position of the first traffic cone robot in the s-th group; represents the expected position of the first traffic cone robot in the sth group; k s is a constant, k s >0, preferably 0<k s <1.
[0115] The following constraints are met:
[0116] For any i,j∈{1,2,...,n s}, i≠j:
[0117]
[0118] Existence Mapping Make and satisfy: Right now About is a function of , which is only determined by the desired positions of the i-th traffic cone robot and the first traffic cone robot.
[0119] 23) Calculate the expected speed of the i-th traffic cone robot in the s-th group at time t:
[0120]
[0121] in: is the expected speed of the i-th traffic cone robot in the s-th group at time t; n s is the number of traffic cone robots in group s; ▽ is the gradient; Represents the following speed of the first traffic cone robot in the sth group.
[0122] When placing traffic cone robot:
[0123] When the parking profile of the traffic cone robot remains unchanged, is 0, that is, when the working area is fixed, the traffic cone robot stops after moving.
[0124] As the parking contour of the traffic cone robot moves with the working area, Equal to the moving speed of the work area. During construction, the traffic cone robot first forms a parking outline, and then the workers start construction. When the work area moves, the mother cone robot moves in the work area according to It moves synchronously with the working area and can move automatically with the robot without too much repeated retraction and extension.
[0125] Traffic cone recycling robot working conditions: When it is 0, the Traffic Cone Robot stops after moving to the recycling area.
[0126] After calculation, we get:
[0127]
[0128]
[0129] when hour, is 0; at this time, the distance between the traffic cone robots and The distance between traffic cone robots is kept constant. They formed a fixed formation and moved together. When it is 0, the first traffic cone robot reaches the desired position and the traffic cone robot stops moving.
[0130] Therefore, this application can be set and Flexibly set the spacing between traffic cone robots and the parking profile shape of traffic cone robots.
[0131] 3) Traffic cone robot movement:
[0132] The traffic cone robot will determine in real time whether it encounters an obstacle. If it encounters an obstacle, the traffic cone robot will first avoid the obstacle. After avoiding the obstacle, it will recalculate the expected speed according to the current position of each traffic cone robot in the group and move according to the updated expected speed; if it does not encounter an obstacle, the traffic cone robot will move according to the expected speed at the current moment; until all traffic cone robots have finished moving.
[0133] An embodiment of the present invention further provides a traffic cone robot system, comprising a remote host computer and a plurality of traffic cone robots.
[0134] The remote host computer is installed in the construction area, and is used to determine the parking contour of the traffic cone robot and the number of traffic cone robots to be moved, divide the traffic cone robots to be moved into s groups, determine the parking contour shape of each group and the expected position of the first traffic cone robot; and calculate the expected speed of each traffic cone robot at the current moment according to the expected position of the first traffic cone robot in each group and the current position uploaded by each traffic cone robot in each group, and send the expected speed of each traffic cone robot at the current moment to the traffic cone robot (see Figure 1 ). See Figure 2The traffic cone robot includes a cone 4, a mobile chassis 6, a main controller module 11, a communication module 8, a power module 10, a combined obstacle avoidance module 12, a positioning module 9, a drive module 13 and a drive wheel 7. The cone 4 is located above the mobile chassis 6. The main controller module, the communication module, the power module, the combined obstacle avoidance module, the positioning module and the drive module are fixed in the cone or in the mobile chassis. The drive wheel 7 is fixed below the mobile chassis 4.
[0135] The communication module is connected to the main controller module and is used for communication between the main controller module and the remote host computer and other traffic cone robots. The communication module establishes communication with the remote host computer and the communication modules of other traffic cone robots through RPC service and TCP service.
[0136] The positioning module is used to obtain the real-time position of the traffic cone robot and upload the real-time position of the traffic cone robot to the main controller module.
[0137] The combined obstacle avoidance module is used to identify obstacles and measure the real-time distance between the traffic cone robot and the obstacles, and upload the real-time distance between the traffic cone robot and the obstacles to the main controller module. Figure 2 The combined obstacle avoidance module 12 includes ultrasonic sensors evenly distributed around the mobile chassis 6 and a laser radar 3 on the top of the cone 4, which are used to check the surrounding obstacles and the real-time distance between adjacent traffic cone robots.
[0138] When the combined obstacle avoidance module identifies an obstacle, the main controller module receives the real-time distance between the traffic cone robot and the obstacle, and sends an obstacle avoidance motion instruction to the drive module based on the real-time distance between the traffic cone robot and the obstacle. When there is no obstacle, the main controller module uploads the real-time position of the traffic cone robot to the remote host computer through the communication module (see Figure 1 ), receiving the desired speed of the traffic cone robot at the current moment sent by the remote host computer and sending the desired speed of the traffic cone robot at the current moment to the driving module. The main controller module uses ultrasonic sensors and laser radars to identify obstacles and the real-time distance between obstacles. It is a prior art that the main controller module sends obstacle avoidance movement instructions according to the real-time distance between the traffic cone robot and the obstacle, which will not be described in detail here.
[0139] When obstacle avoidance is required, the driving module controls the driving wheels to avoid obstacles according to the obstacle avoidance motion instruction. After the obstacle avoidance is completed, the driving wheels are controlled to move according to the expected speed of the traffic cone robot at the current moment sent by the main controller module.
[0140] The power module is used to supply power to the main controller module, communication module, combined obstacle avoidance module, positioning module, drive module and alarm device.
[0141] The remote host computer is used to calculate the expected speed of each traffic cone robot at the current moment according to the following formula:
[0142]
[0143] in,
[0144]
[0145]
[0146] in, is the expected speed of the i-th traffic cone robot in the s-th group at time t, ▽ is the gradient; represents the current position of the i-th traffic cone robot in the s-th group; represents the current position of the jth traffic cone robot in the sth group; represents the desired position of the first traffic cone robot in the sth group, represents the following speed of the first traffic cone robot in the sth group; is the potential field function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot of the s-th group; is the potential field function between the current position of the i-th traffic cone robot and the desired position of the first traffic cone robot in the s-th group; for exist The gradient at for exist The gradient at
[0147] The following constraints are met:
[0148] For any i,j∈{1,2,...,n s}, i≠j:
[0149] Existence Mapping Make and satisfy:
[0150]
[0151] if but
[0152] if but
[0153] in, For As the center of the circle, is a sphere with radius is a constant;
[0154] The following constraints are met:
[0155] For any i,j∈{1,2,...,n s}, i≠j:
[0156]
[0157] Existence Mapping Make and satisfy:
[0158] The remote host computer is used to calculate the potential field function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group according to the following formula:
[0159]
[0160] in,
[0161]
[0162]
[0163] in, is the gravitational function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group; is the repulsive force function between the current position of the i-th traffic cone robot and the current position of the j-th traffic cone robot in the s-th group; is the gravitational constant; is the repulsion constant.
[0164] The remote host computer is used to calculate the potential field function between the current position of the i-th traffic cone robot of the s-th group and the expected position of the first traffic cone robot according to the following formula:
[0165]
[0166] Among them, k s k is a constant s >0, preferably 0<k s <1.
[0167] In an optional embodiment of the present invention, the power module includes a charging module, a flexible solar panel, a battery and a battery manager; the charging module charges the battery by wired or wireless means; see Figure 3The flexible solar panel 15 is arranged on the outer surface of the cone and is electrically connected to the battery; the battery manager is used to prevent the battery from being overcharged. The solar flexible panel 15 can be folded according to the size of the cone.
[0168] In an optional embodiment of the present invention, the positioning module includes an absolute positioning module RTK GPS, an IMU attitude sensor and a relative positioning module UWB. The absolute positioning module RTK GPS is used to obtain the real-time absolute position of the traffic cone robot, and the IMU attitude sensor is used to obtain the attitude angle of the traffic cone robot. When the real-time absolute position cannot be measured, the relative positioning module UWB is started, and the relative positioning module UWB establishes a corresponding base station according to the construction scene, and gives the current real-time relative position of the traffic cone robot through the base station.
[0169] In an alternative embodiment of the present invention, see Figure 2 The traffic cone robot also includes an alarm module, which includes a warning light 1 and a voice alarm 2, and the warning light 1 and the voice alarm 2 are located at the top of the cone 4. The warning light and the voice alarm can effectively remind the surrounding drivers around the traffic cone robot, thereby protecting the safety of vehicles and drivers.
[0170] In an optional embodiment of the present invention, the communication module uses a 5G communication module, which can meet the high-speed communication requirements between the remote host computer and the traffic cone robot.
[0171] In an optional embodiment of the present invention, four driving wheels 7 are provided, and the steering of the traffic cone robot is achieved through the differential speed of the left and right wheels, which has the characteristics of flexible steering and strong environmental adaptability.
[0172] In an optional embodiment of the present invention, the mobile chassis is counterweighted by 2 to 4 kg, which can prevent the traffic cone robot from being blown down by the wind and meet the anti-collision performance requirements.
[0173] In an optional embodiment of the present invention, the main controller module transmits the real-time position of the traffic cone robot to other traffic cone robots in the group through the communication module to avoid collision between the traffic cone robots.
[0174] In an alternative embodiment of the present invention, see Figure 3 A reflective strip 14 is provided on the outer surface of the cone.
[0175] In an optional embodiment of the present invention, the remote host computer will transmit the operating status, position and other information of the traffic cone robot back to the cloud big data center for storage; since the step of transmitting back to the cloud has low real-time requirements, a mobile cellular communication module can be used for data transmission; the cloud big data center will transmit the relevant information to the vehicle navigation software, which can remind normally moving vehicles of the construction status ahead at a long distance.
[0176] Embodiment 1
[0177] The number of traffic cone robots in the group is 3, and the generalized position q i (t)∈(x(t),y(t),z(t),θ(t),δ(t),φ(t)) T , where the initial position of the first traffic cone robot is (1,0.1,0,0,0,0) T , The initial position of the second traffic cone robot is (0.5,0,0,0,0,0) T , The initial position of the third traffic cone robot is (1,0,0,0,0,0) T , define the expected position of the first traffic cone robot as (20,1,0,0,0,0) T , 3 traffic cone robots move in a two-dimensional plane, and the parking contour shape is a triangle, i, j ∈ {1, 2, 3}, i ≠ j, k = 1; a ij =1; b ij =17; then d ij =2, and perform simulation.
[0178]
[0179] See also Figure 5 , the three traffic cone robots gradually form a triangular shape under the action of the potential field function and move synchronously with the parking contour shape. When the first traffic cone robot reaches the desired position, the three traffic cone robots stop moving.
[0180] 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 in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0181] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes 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 generate 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 1A device that provides the functions specified in a block or multiple blocks.
[0182] 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.
[0183] 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.
[0184] The embodiments of the present invention are described above in conjunction with the accompanying drawings, but the present invention is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the enlightenment of the present invention, ordinary technicians in this field can also make many forms without departing from the scope of protection of the purpose of the present invention and the claims, which all fall within the protection of the present invention.
[0185] The above shows and describes the basic principles and main features of the present invention and the advantages of the present invention. It should be understood by those skilled in the art that the present invention is not limited to the above embodiments. The above embodiments and descriptions are only for explaining the principles of the present invention. Without departing from the spirit and scope of the present invention, the present invention may have various changes and improvements, which fall within the scope of the present invention to be protected. The scope of protection of the present invention is defined by the attached claims and their equivalents.
Claims
1. A method for autonomous movement of a traffic cone robot, characterized in that: include, Determine the parking profile of the traffic cone robot and the number of traffic cone robots to be moved, and divide the traffic cone robots to be moved into s Groups, determine the parking contour shape of each group and the expected position of the first traffic cone robot; Calculate the expected speed of each traffic cone robot at the current moment according to the expected position of the first traffic cone robot in each group and the current position of each traffic cone robot in each group; Determine whether the traffic cone robot encounters an obstacle. If so, the traffic cone robot avoids the obstacle and moves at the updated expected speed after avoiding the obstacle; otherwise, the traffic cone robot moves at the expected speed at the current moment; until all traffic cone robots have finished moving; The calculation formula of the expected speed of each traffic cone robot at the current moment is as follows: ; in, ; in, For the s The first i The expected speed of the traffic cone robot at that moment, is the gradient; Indicates s The first i The current position of the traffic cone robot; Indicates s The first j The current position of the traffic cone robot; Indicates s The desired position of the first traffic cone robot in the group, Indicates s The following speed of the first traffic cone robot in the group; For the s Group i The current position of the traffic cone robot and the j The potential field function between the current positions of the traffic cone robots; For the s Group i The potential field function between the current position of the first traffic cone robot and the desired position of the first traffic cone robot; for exist The gradient at for exist The gradient at The following constraints are met: For any : Existence Mapping , so that and satisfy: ; ; if ,but ; if ,but ; in, For As the center of the circle, is a sphere with radius is a constant; The following constraints are met: For any : ; Existence Mapping , so that and satisfy: .
2. The method for autonomous movement of a traffic cone robot according to claim 1, characterized in that: The said s Group i The current position of the traffic cone robot and the j The calculation formula of the potential field function between the current positions of the traffic cone robots is as follows: ; in, ; in, For the s Group i The current position of the traffic cone robot and the j The gravitational function between the current positions of the traffic cone robots; For the s Group i The current position of the traffic cone robot and the j The repulsion function between the current positions of the traffic cone robots; is the gravitational constant; is the repulsion constant.
3. The method for autonomous movement of a traffic cone robot according to claim 1, characterized in that: The said s Group i The calculation formula of the potential field function between the current position of the first traffic cone robot and the expected position of the first traffic cone robot is as follows: in, is a constant.
4. The method for autonomous movement of a traffic cone robot according to claim 1, characterized in that: Traffic cone placement robot working condition: When the parking profile of the traffic cone robot remains unchanged, is 0; As the parking contour of the traffic cone robot moves with the working area, Equal to the moving speed of the working area; Traffic cone recycling robot working conditions: is 0.
5. The method for autonomous movement of a traffic cone robot according to claim 1, characterized in that: Determining the expected position of the first traffic cone robot in each group includes selecting an endpoint of the parking contour of each group of traffic cone robots as the expected position of the first traffic cone robot in the group.
6. A traffic cone robot system, characterized in that: Includes a remote host computer and multiple traffic cone robots; The remote host computer is used to determine the parking contour of the traffic cone robot and the number of traffic cone robots to be moved, divide the traffic cone robots to be moved into s groups, determine the parking contour shape of each group and the expected position of the first traffic cone robot; and, is used to calculate the expected speed of each traffic cone robot at the current moment according to the expected position of the first traffic cone robot in each group and the current position uploaded by each traffic cone robot in each group, and send the expected speed of each traffic cone robot at the current moment to the traffic cone robot; The remote host computer is used to calculate the expected speed of each traffic cone robot at the current moment according to the following formula: ; in, ; in, For the s The first i The expected speed of the traffic cone robot at that moment, is the gradient; Indicates s The first i The current position of the traffic cone robot; Indicates s The first j The current position of the traffic cone robot; Indicates s The desired position of the first traffic cone robot in the group, Indicates s The following speed of the first traffic cone robot in the group; For the s Group i The current position of the traffic cone robot and the j The potential field function between the current positions of the traffic cone robots; For the s Group i The potential field function between the current position of the first traffic cone robot and the desired position of the first traffic cone robot; for exist The gradient at for exist The gradient at The following constraints are met: For any : Existence Mapping , so that and satisfy: ; ; if ,but ; if ,but ; in, For As the center of the circle, is a sphere with radius is a constant; The following constraints are met: For any : ; Existence Mapping , so that and satisfy: ; The traffic cone robot comprises a cone, a mobile chassis, a main controller module, a communication module, a power module, a combined obstacle avoidance module, a positioning module, a driving module, and a driving wheel; the cone is located above the mobile chassis; the main controller module, the communication module, the power module, the combined obstacle avoidance module, the positioning module, and the driving module are fixed inside the cone or in the mobile chassis; the driving wheel is fixed below the mobile chassis; The communication module is connected to the main controller module for communication between the main controller module and the remote host computer; The positioning module is used to obtain the real-time position of the traffic cone robot and upload the real-time position of the traffic cone robot to the main controller module; The combined obstacle avoidance module is used to identify obstacles and measure the real-time distance between the traffic cone robot and the obstacle, and upload the real-time distance between the traffic cone robot and the obstacle to the main controller module; The main controller module is used to receive the real-time distance between the traffic cone robot and the obstacle, and send the obstacle avoidance movement instruction to the driving module according to the real-time distance between the traffic cone robot and the obstacle; and is used to upload the real-time position of the traffic cone robot to the remote host computer through the communication module, receive the expected speed of the traffic cone robot at the current moment sent by the remote host computer, and send the expected speed of the traffic cone robot at the current moment to the driving module; The driving module is used to control the driving wheel to avoid obstacles according to the obstacle avoidance motion instruction, and is used to control the driving wheel to move according to the expected speed of the traffic cone robot at the current moment sent by the main controller module; The power supply module is used to supply power to the main controller module, the communication module, the combined obstacle avoidance module, the positioning module and the driving module.
7. A traffic cone robot system according to claim 6, characterized in that: The remote host computer is used to calculate the s Group i The current position of the traffic cone robot and the j The potential field function between the current positions of the traffic cone robots: ; in, ; in, For the s Group i The current position of the traffic cone robot and the j The gravitational function between the current positions of the traffic cone robots; For the s Group i The current position of the traffic cone robot and the j The repulsion function between the current positions of the traffic cone robots; is the gravitational constant; is the repulsion constant.
8. The traffic cone robot system according to claim 6, characterized in that: The remote host computer is used to calculate the s Group i The potential field function between the current position of the traffic cone robot and the desired position of the first traffic cone robot: in, is a constant.
