CN110989603A - Crane carrying operation path planning method - Google Patents

Crane carrying operation path planning method Download PDF

Info

Publication number
CN110989603A
CN110989603A CN201911279838.8A CN201911279838A CN110989603A CN 110989603 A CN110989603 A CN 110989603A CN 201911279838 A CN201911279838 A CN 201911279838A CN 110989603 A CN110989603 A CN 110989603A
Authority
CN
China
Prior art keywords
crane
point
position point
obstacle
projection
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201911279838.8A
Other languages
Chinese (zh)
Other versions
CN110989603B (en
Inventor
李国杰
职山杰
莫栋成
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou University
Original Assignee
Suzhou University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Suzhou University filed Critical Suzhou University
Priority to CN201911279838.8A priority Critical patent/CN110989603B/en
Publication of CN110989603A publication Critical patent/CN110989603A/en
Application granted granted Critical
Publication of CN110989603B publication Critical patent/CN110989603B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05DSYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
    • G05D1/02Control of position or course in two dimensions
    • G05D1/021Control of position or course in two dimensions specially adapted to land vehicles
    • G05D1/0212Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
    • G05D1/0217Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory in accordance with energy consumption, time reduction or distance reduction criteria

Landscapes

  • Engineering & Computer Science (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Control And Safety Of Cranes (AREA)

Abstract

The invention discloses a method for planning a handling operation path of a crane, which comprises the following steps: importing environment data, wherein the environment data comprises a hoisting object loading position, a hoisting object unloading position, obstacle information and the like; establishing a space plane equation of a vertical plane passing through an initial position point and a destination position point of the carrying operation; calculating and determining an obstacle space area according to the shape data of the lifted object and the obstacle information; and optimizing the carrying path of the crane according to the relation between the obstacle area and the vertical plane. The invention aims at the automatic operation of the crane, realizes the swing control of the crane, avoids obstacles and optimizes the path planning of the lifting object from the original position to the target position.

Description

Crane carrying operation path planning method
Technical Field
The invention relates to the field of hoisting and transporting machinery, in particular to a method for planning a carrying operation path of a crane.
Background
At present, the global port industry is developing from a mechanical age to an artificial intelligence age, the development trend of large-scale ships and the construction of 5G intelligent ports can promote a new round of product innovation and technology upgrade of port container hoisting and handling equipment. On the other hand, at present, ports generally face the problems that skilled operation drivers are insufficient, the loading and unloading operation efficiency of port hoisting and handling equipment cannot meet the requirements of large ships and intelligent port construction, and the like, and the development of automatic operation hoisting equipment which is automatic, intelligent and capable of continuously operating for 24 hours becomes an important research field which is commonly concerned by the whole industry.
The operation efficiency of the crane directly influences the production capacity of the handling system, the intelligent crane has remarkable advantages in the aspects of improving the operation efficiency, reducing labor input and realizing large-scale, continuous, high-strength and high-pollution environment operation, and the intelligentization of the crane operation needs to be realized, so that the crane can independently perform operation path planning and path optimization like a person to become one of key core technologies needing key attack.
In addition, aiming at the crane automation operation, in order to realize the crane efficient transportation operation, the crane swing control and obstacle avoidance are essential key technologies for realizing the path planning of the lifted object from the original position to the target position.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a method for planning a handling operation path of a crane, which adopts the following technical scheme:
the invention provides a method for planning a handling operation path of a crane, which comprises the following steps:
s1, establishing a vertical plane according to the starting position point and the destination position point of the carrying operation, and enabling the vertical plane to pass through the starting position point and the destination position point;
s2, judging whether the vertical plane and the obstacle space area have intersection, if so, executing S3, and if not, setting a straight line path from the starting position point to the destination position point as an optimal path;
s3, judging whether the height of the obstacle space region exceeds a lifting operation height limit value of the crane, if so, executing S6-S8, and if not, executing S4-S5;
s4, determining the intersecting track of the obstacle space area and the vertical plane;
s5, determining an optimal path according to the starting position point, the intersection track and the destination position point;
s6, carrying out horizontal plane projection on the vertical plane to obtain a projection straight line, and carrying out horizontal plane projection on the obstacle space area to obtain a projection area;
s7, comparing the distances between the points in the projection area and the projection straight line, and determining that the carrying operation is carried out on one side of the projection straight line where the point which is not the farthest distance is;
and S8, determining the optimal path according to the starting position point, the outer contour line of the projection area on the conveying operation side and the destination position point.
Further, before step S7, the method further includes:
regularizing the projection region to obtain a regularized polygon, and enabling the projection region to fall into the regularized polygon;
step S7 includes: calculating the distance from each vertex of the regularized polygon to the projection straight line, and taking the other side of the projection straight line side where the vertex with the farthest distance is positioned as a conveying operation side;
the process of determining the optimal path in step S8 includes: the vertex having the largest deviation rate from the projection straight line among the one or more vertices of the regularized polygon on the side of the transport operation is determined, and the optimal path in step S8 is moved horizontally from the start position point to the vertex along a straight line and then from the vertex to the destination position point at a predetermined swing angle.
Furthermore, the vertex corresponding to the maximum included angle between the straight line on the carrying operation side and the initial position point and the projection straight line is taken as the vertex with the maximum deviation rate from the projection straight line.
Further, the intersecting trajectory in step S5 includes a first end point closer to the start position point and a second end point farther from the start position point;
the optimal path in step S5 includes a path from the start point to the first end point, passing through the intersecting trajectory, and then from the second end point to the destination point.
Further, the vertical plane established in step S1 is a spatial plane parallel to the Z axis in the three-dimensional spatial coordinates, and establishing the vertical plane includes the following operations:
establishing a three-dimensional space coordinate system, taking limit position points of a crane loaded with a hoisting object in three motion directions of large and small car running and vertical descending as an original point of the three-dimensional space coordinate system, taking the running directions of a small car, a large car and a hoisting mechanism of the crane as X, Y, Z directions of the three-dimensional space coordinate system respectively, and determining the coordinates of an initial position point and a destination position point;
the plane normal is calculated by the following formula:
the plane normal is calculated by the following formula:
Figure BDA0002316429630000031
wherein the coordinate of the initial position point is Pi(xpi,ypi,zpi) The coordinates of the destination location point are Uj(xuj,yuj,zuj);
The vertical plane is calculated by the following formula:
(yuj-ypi)(x-xpi)-(xuj-xpi)(y-ypi) 0, wherein xpi,ypiRespectively, the coordinates in the direction of the start position X, Y, xuj,yujRespectively, the coordinates of the direction of the destination location X, Y.
Further, the step S3 of determining whether the height of the obstacle space region exceeds the lifting operation height limit value of the crane includes the following operations:
calculated according to the following formula
Figure BDA0002316429630000032
The definition domain of (1):
{(x,y)|(yuj-ypi)(x-xpi)-(xuj-xpi)(y-ypi) 0} where x ispi,ypiRespectively, the coordinates in the direction of the start position X, Y, xuj,yujCoordinates in the direction of destination location X, Y, respectively;
if the lifting operation height limit value of the crane falls into the definition domain range, the height of the obstacle space region is judged to exceed the lifting operation height limit value of the crane, otherwise, the height of the obstacle space region is judged to not exceed the lifting operation height limit value of the crane.
Further, in the transporting operation in step S8, it is necessary to perform the swing control of the hoisted object, the crane swing control parameter is obtained by calculation in advance before the transporting operation in step S8, and the swing control parameter calculating step includes:
determining the motion parameters of the running directions of the large trolley and the small trolley of the crane by the following formula:
x=X10+0.5αx1t2+VX10t (1)
y=Y10+0.5αy1t2+VY10t (2), wherein X and y are respectively the position coordinates of the crane trolley on the X, Y axis10,Y10Initial position coordinates of the trolley on axis X, Y, α respectivelyx1y1Respectively the moving acceleration of the crane in the direction of X, Y axes, αx1y1At the same time, respectively, the swing control parameter V of the crane in the direction X, YX10,VY10Respectively the initial moving speed of the crane in the direction of X, Y axes;
wherein, the swing control parameter α of the crane in the direction of X, Y axisx1y1Respectively calculated by the following formula:
Figure BDA0002316429630000041
Figure BDA0002316429630000042
wherein, VX,VYRespectively the moving speed of the crane in the direction of X, Y axes, n is a natural number,
Figure BDA0002316429630000043
wherein g is the gravity acceleration and L is the length of the steel wire rope of the crane.
Furthermore, the obstacle space area is a protection area which is arranged according to the shape and the size of a lifting object of the crane and a preset safety distance between the lifting object and the obstacle body and is enlarged on the basis of the actual appearance size of the obstacle body.
Furthermore, the hoisted object of the crane is a mass point in the three-dimensional space coordinate.
Further, the regularizing the projection region is to plan a rectangle containing the projection region in a projection plane.
The technical scheme provided by the invention has the following beneficial effects: on the basis of researches such as analysis of a crane conveying system, solution of swing control parameters, a swing control method and the like, a conveying path planning and optimizing method is provided, and the effectiveness of the method is confirmed by verifying the provided method through a crane three-dimensional simulation analysis system.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a flow chart of a planning strategy for a handling operation path of a crane according to an embodiment of the present invention;
fig. 2 is a specific flowchart of a crane handling operation path planning provided by an embodiment of the present invention;
FIG. 3 is a schematic diagram of a path plan for carrying over an obstacle according to an embodiment of the present invention;
FIG. 4 is a schematic diagram illustrating a path bypassing a side of an obstacle according to an embodiment of the present invention;
FIG. 5 is a three-dimensional perspective view of a first simulation test result of a crane handling operation provided by an embodiment of the invention;
FIG. 6 is a view in the X direction of the first simulation test results of FIG. 5;
FIG. 7 is a view in the Z-direction of the first simulation test results of FIG. 5;
FIG. 8 is a three-dimensional perspective view of a second simulation test result of the handling operation of the crane provided by the embodiment of the invention;
FIG. 9 is a view in the X direction of the second simulation test results of FIG. 8;
FIG. 10 is a view in the Z direction of the second simulation test results of FIG. 8;
FIG. 11 is a three-dimensional perspective view of a third simulation test result of the crane handling operation provided by the embodiment of the invention;
FIG. 12 is a view in the X direction of the third simulation test results of FIG. 11;
FIG. 13 is a view in the Y direction of the third simulation test results of FIG. 11;
FIG. 14 is a view in the Z direction of the third simulation test results of FIG. 11;
FIG. 15 is a graph showing a simulation curve of the moving speed of the hoisted object carried by the crane in the third simulation test result of FIG. 11;
fig. 16 is a simulation curve diagram of a swing angle of a wire rope of the crane according to the third simulation test result in fig. 11.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, apparatus, article, or device that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or device.
In one embodiment of the present invention, a crane capable of safely avoiding obstacles and having a minimum vertical lift is provided, as shown in fig. 1, which substantially comprises the following steps:
the method comprises the following steps of firstly, importing environment data, wherein the environment data comprises a hoisting object loading position (namely a starting position point of carrying operation), a hoisting object unloading position (namely a destination position point), obstacle information and the like;
secondly, establishing a space plane equation of a vertical plane passing through the starting position point and the destination position point of the carrying operation, wherein the vertical plane is parallel to a Z axis in a three-dimensional space;
thirdly, calculating and determining an obstacle space area according to the shape data of the lifted object and the obstacle information, specifically, in order to enable the conveyed object to effectively avoid the obstacle, setting a lifting object inaccessible area in a certain distance range around the obstacle by the system, and defining the area as the obstacle space area, wherein the shape and the size of the lifting object and a safe distance which should be kept when the lifting object is close to the obstacle are considered in the obstacle space area, so that the obstacle space area is a protection area which is expanded on the basis of the actual shape size of the obstacle, and the lifting object can be considered as a mass point on the basis;
and fourthly, optimizing the carrying path of the crane according to the relation between the obstacle area and the vertical plane.
Wherein, the step of optimizing the carrying path of the crane in the fourth step is as shown in fig. 2:
and S1, establishing a vertical plane according to the starting position point and the destination position point of the conveying operation, and enabling the vertical plane to pass through the starting position point and the destination position point.
Specifically, the vertical plane is a spatial plane parallel to the Z axis in the three-dimensional spatial coordinate, and establishing a spatial plane equation of the vertical plane W plane includes the following operations:
establishing a three-dimensional space coordinate system, taking an extreme position point of a crane carrying a hoisted object in three motion directions of large and small vehicle running and vertical descending as an origin of the three-dimensional space coordinate system, taking the running directions of a small vehicle, a large vehicle and a hoisting mechanism of the crane as X, Y, Z directions of the three-dimensional space coordinate system respectively, and determining the coordinates of the starting position point and the destination position point, such as: the loading position of the object to be conveyed, i.e., the home position point, is represented by Pi(xpi,ypi,zpi) The unloading position, i.e. the destination location point, is denoted as Uj(xuj,yuj,zuj)。
The plane normal is calculated by the following formula:
Figure BDA0002316429630000071
wherein the coordinate of the initial position point is Pi(xpi,ypi,zpi) The coordinates of the destination location point are Uj(xuj,yuj,zuj);
The vertical plane is calculated by the following formula:
(yuj-ypi)(x-xpi)-(xuj-xpi)(y-ypi) 0, wherein xpi,ypiRespectively, the coordinates in the direction of the start position X, Y, xuj,yujRespectively, the coordinates of the direction of the destination location X, Y.
And S2, judging whether the vertical plane has an intersection with the obstacle space area, if so, executing S3, and if not, setting a straight line path from the starting position point to the destination position point as an optimal path.
Specifically, the obstacle space area is a protection area which is arranged according to the shape and size of a lifting object of the crane and a preset safety distance between the lifting object and the obstacle body and is enlarged on the basis of the actual appearance size of the obstacle body. On the basis, the hoisted object of the crane can be considered as a mass point in the three-dimensional space coordinate. In addition, performance parameters such as the maximum lifting height and the maximum operation speed of the crane are preset in the system.
Crane loading lifting article from starting position point PiHoisting the point to a destination position point UjPoint transport with W plane passing through PiAnd UjTwo points are perpendicular to the spatial plane of the ground. If there is no obstacle in the linear region for loading and unloading the hoisted object, the path of the hoisted object linearly conveyed to the destination position by the crane becomes the optimal conveying path because the distance is shortest.
And S3, judging whether the height of the obstacle space region exceeds the lifting operation height limit value of the crane, if so, executing S6-S8, and if not, executing S4-S5.
The specific judgment operation is as follows:
calculated according to the following formula
Figure BDA0002316429630000072
The definition domain of (1):
{(x,y)|(yuj-ypi)(x-xpi)-(xuj-xpi)(y-ypi) 0} where x ispi,ypiRespectively, the coordinates in the direction of the start position X, Y, xuj,yujCoordinates in the direction of destination location X, Y, respectively;
if the lifting operation height limit value of the crane falls into the definition domain range, the height of the obstacle space region is judged to exceed the lifting operation height limit value of the crane, otherwise, the height of the obstacle space region is judged to not exceed the lifting operation height limit value of the crane.
And S4, determining the intersecting track of the obstacle space area and the vertical plane.
The height of the space area of the obstacle does not exceed the lifting operation height limit value of the crane, namely, the height indicates that the crane can safely pass a lifted object through the highest point of the obstacle within the range of the maximum lifting height, under the condition, the system automatically selects a conveying path which is in the space plane W and passes through the top of the space area of the obstacle, the number of top point searches is only two under the condition that only one obstacle is provided, the number of top point searches can be 4 under the condition that two obstacles are provided, namely, under the condition that the appearance of the obstacle is regular, the number of top point searches is only 2 times of the number of the obstacles, compared with a conventional searching method, the searching calculation amount is exponentially reduced, the system can quickly calculate and provide control instructions for the crane in real time, and the conveying operation of optimizing the conveying path and safe and efficient is completed.
And S5, determining an optimal path according to the starting position point, the intersecting track and the destination position point.
If there is an obstacle in the linear region for loading and unloading the hoisted object, the hoist transports the hoisted object to make the transportation path moving in the plane W of space be the path with least energy consumption, so that the hoisted object moves in the plane W to be one of the effective paths for obtaining the optimal transportation path, as shown in fig. 3, specifically, the intersecting track includes a first end point closer to the starting position point and a second end point farther from the starting position point, the optimal path in step S5 includes that after the hoist vertically lifts the hoisted object from the starting position point to a certain safe distance from the ground, the hoisting mechanism and the horizontal moving mechanism simultaneously operate, the hoisted object bypasses the first end point, passes through the intersecting track, moves from the second end point to a certain safe distance directly above the destination position point, and finally vertically descends to the destination position point, wherein the hoisting mechanism is vertically lifted to a certain safe distance from the ground and the hoisting mechanism is vertically above the destination position point The distance between one ends is set according to the operation characteristics and the safe operation requirements of the crane, and the specific safe distance value is determined according to the type of the crane and the handling operation process. And S6, performing horizontal plane projection on the vertical plane to obtain a projection straight line, and performing horizontal plane projection on the obstacle space area to obtain a projection area.
The height of the space area of the obstacle exceeds the lifting operation height limit value of the crane, namely the height indicates that the crane cannot safely pass the lifted object through the highest point of the obstacle within the maximum lifting height range, in this case, the crane carrying operation path cannot obtain an optimization result from the space plane W, the system selects a carrying operation path which avoids the obstacle from the outer side, in this case, the horizontal control quantity of the large trolley and the small trolley needs to be corrected and adjusted, at the moment, the system can search the shortest carrying distance and correct and adjust the horizontal carrying operation control quantity of the crane in real time according to the search result, and obstacle bypassing carrying path planning and operation are completed.
S7, comparing the distances between the points in the projection area and the projection straight line, and determining that the carrying operation is carried out on one side of the projection straight line where the point which is not the farthest distance is;
further, before step S7, the method further includes:
and regularizing the projection region to obtain a regularized polygon, and enabling the projection region to fall in the regularized polygon.
Step S7 includes: and calculating the distance between each vertex of the regularized polygon and the projection straight line, and setting the other side of the projection straight line side where the vertex with the farthest distance is positioned as the conveying operation side.
Preferably, the projection area is normalized to be rectangular, as shown in fig. 4: the system will automatically calculate and compare the perpendicular distances L of the point of the obstacle area OP3 and the point of OP4 to the spatial plane W01And L02And determining the bypassing direction of the crane obstacle according to the comparison result and finally searching to complete the optimal carrying path planning. L is01≥L02In this case, the system adds an appropriate speed correction amount to the moving direction of the crane X shown in fig. 4, and the crane moves around the obstacle OP4 point side at the corrected horizontal moving speed, and its carrying path is shown in fig. 4. Likewise, L01<L02In this case, the system adds an appropriate speed correction amount to the movement direction of the crane Y shown in fig. 4, and the crane moves around the obstacle OP3 at the corrected horizontal movement speed, thereby completing the hoisted object conveying operation.
And S8, determining the optimal path according to the starting position point, the outer contour line of the projection area on the conveying operation side and the destination position point.
Specifically, the process of determining the optimal path in step S8 includes: the vertex having the largest deviation rate from the projected straight line among the one or more vertices of the regularized polygon on the side of the transport operation is determined, and the optimal path in step S8 is such that the crane transports the hoisted object starting from the start position point, the hoisted object swing control is performed by the swing control parameter calculated in advance by the system, and the crane is horizontally moved to the vertex along the straight line, and the hoisted object is transported to the destination position point by performing the hoisted object swing control from the vertex by the swing control parameter calculated in advance.
Further, the method for determining the vertex with the largest offset rate from the projection straight line in the one or more vertices of the regularized polygon is as follows: and taking the vertex corresponding to the maximum included angle between the straight line on the carrying operation side and the initial position point and the projection straight line as the vertex with the maximum deviation rate from the projection straight line.
Further, the calculation formulas of the motion parameters and the swing control parameters of the large and small trolley running directions of the crane are as follows:
determining the motion parameters of the running directions of the large trolley and the small trolley of the crane by the following formula:
x=X10+0.5αx1t2+VX10t (1)
y=Y10+0.5αy1t2+VY10t (2), wherein X and y are respectively the position coordinates (m) of the crane trolley on the X, Y axis, and X10,Y10Initial position coordinates (in m) of the trolley on axis X, Y, αx1y1Respectively the moving acceleration (in m/s) of the crane in the direction of X, Y axes2),αx1y1At the same time, respectively, the swing control parameter V of the crane in the direction X, YX10,VY10Respectively the initial moving speed (in m/s) of the crane in the direction of X, Y axes;
wherein, the swing control parameter α of the crane in the direction of X, Y axisx1y1Respectively calculated by the following formula:
Figure BDA0002316429630000101
Figure BDA0002316429630000102
wherein, VX,VYRespectively the moving speed (in m/s) of the crane in the direction of X, Y axes, n is a natural number,
Figure BDA0002316429630000103
wherein g is the gravity acceleration and L is the length of the steel wire rope of the crane (unit is m). Substituting the formula (3) into the formula (1), and substituting the formula (4) into the formula (2), the control parameters of the crane for the large and small vehicle movement in the five-large carrying operation area can be calculated.
The optimized carrying operation path obtained by the method and the control quantity and correction quantity output by the optimized result can calculate and obtain swing control and target path tracking control quantity of different carrying intervals, and the crane executes the optimized path and the command to safely and efficiently complete the carrying operation of the hoisted object. The optimized searching method for the crane carrying path greatly reduces the searching quantity and the calculated amount, has good performability, and specifically comprises the following simulation tests and results:
by adopting the method for optimizing and searching the crane carrying path, the actual operation environment conditions are simulated, the simulation test of crane path planning and three-dimensional carrying operation is carried out, the path planning and carrying operation of three different position states of the obstacle relative to the space plane W are mainly verified, the effectiveness of the path planning method is verified through the test, and the specific verification result is as follows.
Carrying operation environment, crane main performance parameter setting and crane path planning simulation test result
In order to fully verify the effectiveness of the method by a digital simulation means, main performance parameters such as the lifting height of the crane, the operation speed and the like are specially amplified compared with the actual main parameters of the crane when a simulation model is established.
1) Simulation environment condition one: the obstacle region is out of the W plane and does not interfere with normal conveying operation
Initial position coordinates (m) of the hoisted object: (6,6,1.5)
Hoisting object target position coordinates (m): (28, 28,1.5)
Hoist outer shape size (m): 2.5X 3
Obstacle center position coordinates (m): (20, 10,3.5)
Obstacle outer size (m): 3.5X 8X 7
Three-directional running speed (m/s) of crane X, Y, Z: 0.7,0.7,0.2
The results of the crane handling operation simulation test are shown in fig. 5-7.
2) Simulation environment condition two: the barrier is in the W plane area, the height of the barrier exceeds the lifting operation range of the crane, and the crane cannot safely pass the lifted lifting object through the highest point of the barrier within the maximum lifting height range
Initial position coordinates (m) of the hoisted object: (4,6,1.5)
Hoisting object target position coordinates (m): (28, 35,1.5)
Hoist outer shape size (m): 2.5X 3
Obstacle center position coordinates (m): (20, 25, 12)
Obstacle outer size (m): 4X 9X 24
Three-directional running speed (m/s) of crane X, Y, Z: 0.7,1.5,0.2
The results of the crane handling operation simulation test are shown in fig. 8-10.
3) Simulation environment condition three: the hoisting object has a primary pendulum, and the number of obstacles on the carrying site is four
Initial swing angle of the steel wire rope: theta0=0.014π;β0=0.01π
Initial position coordinates (m) of the hoisted object: (1.9,8.5, 10.25)
Hoisting object target position coordinates (m): (31, 81,0.75)
Hoist outer shape size (m): 1.6X 3.2X 1.5
Center position coordinates (m) of obstacle 1: (1.5,8,4.75)
External dimension (m) of obstacle 1: 3X 8X 9.5
Obstacle 2 center position coordinates (m): (27, 47, 10)
Outer dimension (m) of obstacle 2: 4X 8X 20
Center position coordinates (m) of obstacle 3: (23.5, 65, 22.5)
Obstacle 3 outer dimension (m): 11X 10X 45
Center position coordinates (m) of obstacle 4: (35.25, 91, 17.5)
Outer dimension (m) of obstacle 4: 3.5X 12X 35
Three-directional running speed (m/s) of crane X, Y, Z: 0.6,1.3,1
The results of the crane path planning and handling operation simulation tests are shown in fig. 11-16.
The invention discloses a method for planning a handling operation path of a crane, which comprises the following steps: importing environment data, wherein the environment data comprises a hoisting object loading position, a hoisting object unloading position, obstacle information and the like; establishing a space plane equation of a vertical plane passing through an initial position point and a destination position point of the carrying operation; calculating and determining an obstacle space area according to the shape data of the lifted object and the obstacle information; and optimizing the carrying path of the crane according to the relation between the obstacle area and the vertical plane. The invention aims at the automatic operation of the crane, realizes the swing control of the crane, avoids obstacles and optimizes the path planning of the lifting object from the original position to the target position.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims (10)

1. A method for planning a handling operation path of a crane is characterized by comprising the following steps:
s1, establishing a vertical plane according to the starting position point and the destination position point of the carrying operation, and enabling the vertical plane to pass through the starting position point and the destination position point;
s2, judging whether the vertical plane and the obstacle space area have intersection, if so, executing S3, and if not, setting a straight line path from the starting position point to the destination position point as an optimal path;
s3, judging whether the height of the obstacle space region exceeds a lifting operation height limit value of the crane, if so, executing S6-S8, and if not, executing S4-S5;
s4, determining the intersecting track of the obstacle space area and the vertical plane;
s5, determining an optimal path according to the starting position point, the intersection track and the destination position point;
s6, carrying out horizontal plane projection on the vertical plane to obtain a projection straight line, and carrying out horizontal plane projection on the obstacle space area to obtain a projection area;
s7, comparing the distances between the points in the projection area and the projection straight line, and determining that the carrying operation is carried out on one side of the projection straight line where the point which is not the farthest distance is;
and S8, determining the optimal path according to the starting position point, the outer contour line of the projection area on the conveying operation side and the destination position point.
2. The method for planning a handling operation path of a crane according to claim 1, further comprising, before step S7:
regularizing the projection region to obtain a regularized polygon, and enabling the projection region to fall into the regularized polygon;
step S7 includes: calculating the distance from each vertex of the regularized polygon to the projection straight line, and taking the other side of the projection straight line side where the vertex with the farthest distance is positioned as a conveying operation side;
the process of determining the optimal path in step S8 includes: the vertex having the largest deviation rate from the projection straight line among the one or more vertices of the regularized polygon on the side of the transport operation is determined, and the optimal path in step S8 is moved horizontally from the start position point to the vertex along a straight line and then from the vertex to the destination position point at a predetermined swing angle.
3. The method for planning a crane carrying operation path according to claim 2, wherein a vertex corresponding to a maximum included angle between a straight line on the carrying operation side and the start position point and the projection straight line is taken as the vertex having the maximum deviation rate from the projection straight line.
4. The method for planning a crane transferring operation path according to claim 1, wherein the intersecting trajectory in step S5 includes a first end point closer to the starting position point and a second end point farther from the starting position point;
the optimal path in step S5 includes a path from the start point to the first end point, passing through the intersecting trajectory, and then from the second end point to the destination point.
5. The method for planning a path for a crane transporting operation according to claim 1, wherein the vertical plane established in step S1 is a spatial plane parallel to the Z-axis in the three-dimensional spatial coordinates, and the establishing of the vertical plane includes the following operations:
establishing a three-dimensional space coordinate system, taking limit position points of a crane loaded with a hoisting object in three motion directions of large and small car running and vertical descending as an original point of the three-dimensional space coordinate system, taking the running directions of a small car, a large car and a hoisting mechanism of the crane as X, Y, Z directions of the three-dimensional space coordinate system respectively, and determining the coordinates of an initial position point and a destination position point;
the plane normal is calculated by the following formula:
Figure FDA0002316429620000021
wherein the coordinate of the initial position point is Pi(xpi,ypi,zpi) The coordinates of the destination location point are Uj(xuj,yuj,zuj);
The vertical plane is calculated by the following formula:
(yuj-ypi)(x-xpi)-(xuj-xpi)(y-ypi) 0, wherein xpi,ypiRespectively, the coordinates, x, of the starting point X, Yuj,yujRespectively, the coordinates of the direction of the destination location point X, Y.
6. The method for planning a crane carrying operation path according to claim 5, wherein the step S3 of determining whether the height of the obstacle space region exceeds the lifting operation height limit value of the crane comprises the following operations:
calculated according to the following formula
Figure FDA0002316429620000031
The definition domain of (1):
{(x,y)|(yuj-ypi)(x-xpi)-(xuj-xpi)(y-ypi) 0} where x ispi,ypiRespectively, the coordinates in the direction of the start position X, Y, xuj,yujCoordinates in the direction of destination location X, Y, respectively;
if the lifting operation height limit value of the crane falls into the definition domain range, the height of the obstacle space region is judged to exceed the lifting operation height limit value of the crane, otherwise, the height of the obstacle space region is judged to not exceed the lifting operation height limit value of the crane.
7. The method for planning a route for crane transfer work according to claim 2, wherein the transfer work of step S8 requires swing control of the hoisted object, the crane swing control parameter is obtained by calculation in advance before the transfer work of step S8, and the swing control parameter calculation step includes: determining the motion parameters of the running directions of the large trolley and the small trolley of the crane by the following formula:
x=X10+0.5αx1t2+VX10t (1)
y=Y10+0.5αy1t2+VY10t (2), wherein X and y are respectively the position coordinates of the crane trolley on the X, Y axis10,Y10Initial position coordinates of the trolley on axis X, Y, α respectivelyx1y1Respectively the moving acceleration of the crane in the direction of X, Y axes, αx1y1At the same time, respectively, the swing control parameter V of the crane in the direction X, YX10,VY10Respectively the initial moving speed of the crane in the direction of X, Y axes;
wherein, the swing control parameter α of the crane in the direction of X, Y axisx1y1Respectively calculated by the following formula:
Figure FDA0002316429620000032
Figure FDA0002316429620000033
wherein, VX,VYRespectively the moving speed of the crane in the direction of X, Y axes, n is a natural number,
Figure FDA0002316429620000034
wherein g is the gravity acceleration and L is the length of the steel wire rope of the crane.
8. The method for planning a crane carrying operation path according to any one of claims 1 to 7, wherein the obstacle space region is a protection region which is enlarged based on an actual outer dimension of the obstacle body and is set according to a shape and a size of a lifting object of the crane and a preset safety distance between the lifting object and the obstacle body.
9. The method for planning a transportation work path of a crane according to claim 8, wherein a hoisted object of the crane is a mass point in the three-dimensional space coordinate.
10. The method for planning a transportation operation path of a crane according to claim 2, wherein the regularizing the projection area is to plan a rectangle containing the projection area in a projection plane.
CN201911279838.8A 2019-12-13 2019-12-13 Crane carrying operation path planning method Active CN110989603B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911279838.8A CN110989603B (en) 2019-12-13 2019-12-13 Crane carrying operation path planning method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911279838.8A CN110989603B (en) 2019-12-13 2019-12-13 Crane carrying operation path planning method

Publications (2)

Publication Number Publication Date
CN110989603A true CN110989603A (en) 2020-04-10
CN110989603B CN110989603B (en) 2022-08-16

Family

ID=70093149

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911279838.8A Active CN110989603B (en) 2019-12-13 2019-12-13 Crane carrying operation path planning method

Country Status (1)

Country Link
CN (1) CN110989603B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112884422A (en) * 2021-04-28 2021-06-01 河南科技学院 Automatic crane operation system for storage yard storage
CN112897346A (en) * 2021-03-31 2021-06-04 中国水利水电夹江水工机械有限公司 Crane operation route planning method
CN112919320A (en) * 2021-04-02 2021-06-08 烟台杰瑞石油装备技术有限公司 Sand conveying equipment, control method and equipment thereof, and storage medium
CN113291845A (en) * 2020-09-27 2021-08-24 中冶长天国际工程有限责任公司 Anti-collision method and system for stacker-reclaimer
CN114253261A (en) * 2021-12-08 2022-03-29 广州极飞科技股份有限公司 Path generation method, job control method and related device
US11821296B2 (en) 2021-07-30 2023-11-21 Yantai Jereh Petroleum Equipment & Technologies Co., Ltd. Mixing and discharging device, mixing and discharging system and fracturing system

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102542361A (en) * 2012-01-11 2012-07-04 中联重科股份有限公司 Crane hoisting object path planning method
CN102897674A (en) * 2012-10-11 2013-01-30 中联重科股份有限公司 Method and device for determining hoisting path
CN104528540A (en) * 2014-12-01 2015-04-22 长安大学 Real-time generation method of hoisting scheme of jib crane in vehicle controller and method thereof
CN104627842A (en) * 2014-12-01 2015-05-20 长安大学 Jib crane hoisting operation anti-collision method and system
CN107285206A (en) * 2017-07-14 2017-10-24 武汉市特种设备监督检验所 A kind of collision-proof method based on derrick crane collision prevention early warning system
CN108190771A (en) * 2018-03-30 2018-06-22 上海振华重工(集团)股份有限公司 A kind of platform crane anti-collision system and method
JP2019089612A (en) * 2017-11-13 2019-06-13 株式会社日立産機システム Crane system and control method of crane
CN110362098A (en) * 2018-03-26 2019-10-22 北京京东尚科信息技术有限公司 Unmanned plane vision method of servo-controlling, device and unmanned plane

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102542361A (en) * 2012-01-11 2012-07-04 中联重科股份有限公司 Crane hoisting object path planning method
CN102897674A (en) * 2012-10-11 2013-01-30 中联重科股份有限公司 Method and device for determining hoisting path
CN104528540A (en) * 2014-12-01 2015-04-22 长安大学 Real-time generation method of hoisting scheme of jib crane in vehicle controller and method thereof
CN104627842A (en) * 2014-12-01 2015-05-20 长安大学 Jib crane hoisting operation anti-collision method and system
CN107285206A (en) * 2017-07-14 2017-10-24 武汉市特种设备监督检验所 A kind of collision-proof method based on derrick crane collision prevention early warning system
JP2019089612A (en) * 2017-11-13 2019-06-13 株式会社日立産機システム Crane system and control method of crane
CN110362098A (en) * 2018-03-26 2019-10-22 北京京东尚科信息技术有限公司 Unmanned plane vision method of servo-controlling, device and unmanned plane
CN108190771A (en) * 2018-03-30 2018-06-22 上海振华重工(集团)股份有限公司 A kind of platform crane anti-collision system and method

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113291845A (en) * 2020-09-27 2021-08-24 中冶长天国际工程有限责任公司 Anti-collision method and system for stacker-reclaimer
CN112897346A (en) * 2021-03-31 2021-06-04 中国水利水电夹江水工机械有限公司 Crane operation route planning method
CN112897346B (en) * 2021-03-31 2022-05-13 中国水利水电夹江水工机械有限公司 Crane operation route planning method
CN112919320A (en) * 2021-04-02 2021-06-08 烟台杰瑞石油装备技术有限公司 Sand conveying equipment, control method and equipment thereof, and storage medium
CN112919320B (en) * 2021-04-02 2023-12-26 烟台杰瑞石油装备技术有限公司 Sand conveying equipment, control method and equipment thereof and storage medium
CN112884422A (en) * 2021-04-28 2021-06-01 河南科技学院 Automatic crane operation system for storage yard storage
CN112884422B (en) * 2021-04-28 2021-08-06 河南科技学院 Automatic crane operation system for storage yard storage
US11821296B2 (en) 2021-07-30 2023-11-21 Yantai Jereh Petroleum Equipment & Technologies Co., Ltd. Mixing and discharging device, mixing and discharging system and fracturing system
CN114253261A (en) * 2021-12-08 2022-03-29 广州极飞科技股份有限公司 Path generation method, job control method and related device
CN114253261B (en) * 2021-12-08 2023-04-07 广州极飞科技股份有限公司 Path generation method, job control method and related device

Also Published As

Publication number Publication date
CN110989603B (en) 2022-08-16

Similar Documents

Publication Publication Date Title
CN110989603B (en) Crane carrying operation path planning method
CN102001090B (en) Robot system
CN105319988B (en) A kind of analogue system and method for Multilayer shuttle car access system
CN106044567B (en) Overhead crane part saturation adaptive controller, control system and control method
CN107479581A (en) Container piles up control device, system, method and storage medium
CN105174061B (en) Double pendulum crane length of a game optimal trajectory planning method based on pseudo- spectrometry
CN108829105A (en) It is a kind of to dispatch avoidance optimization method based on the warehouse logistics of KM algorithm and Artificial Potential Field Method
CN105523476A (en) Anti-swing control method and system for bridge crane
JP2008152380A (en) Conveyance method of overhead crane using laser pointer and overhead crane system
CN108358062A (en) Drive lacking crane global stability control method
CN105911863A (en) Multi-robot cooperative clamping system neural network trajectory tracking control method
CN113955637B (en) Anti-swing control method and control system of three-dimensional double-swing bridge crane
CN206872296U (en) A kind of bridge type vehicle-driving device
CN107145149A (en) A kind of bridge type vehicle-driving device and its avoidance traveling method
CN113156980A (en) Tower crane path planning method and system based on deep reinforcement learning
CN112446642A (en) Multi-crown-block scheduling optimization method and system
Duinkerken et al. Comparison of routing strategies for AGV systems using simulation
JP5258013B2 (en) Transport method with overhead crane and overhead crane system using this transport method
CN109335713A (en) Automatic dock AGV send case method for optimizing route and system
KR20220035177A (en) Method and system for autonomous control of movement of container handling vehicle operating in automated storage and retrieval system
CN106709264B (en) Double-crane system variable phase angle response modeling algorithm and random response domain prediction technique
CN117466145A (en) Bridge portal crane anti-swing control method and device based on deep reinforcement learning
CN114757627A (en) Relay type lifting path planning and scheduling method
CN106959663B (en) The paths planning method and device of angle movement
CN107720556A (en) Automate gantry crane control method and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant