Task scheduling method and device for centralized cooperation of steel grabbing machine cluster and electronic equipment
Through the task scheduling method of centralized cooperation in steel grabbing clusters, the problems of low manual operation efficiency and high safety risks in scrap steel yards are solved, unmanned processing is realized, scheduling efficiency and safety are improved, and it is suitable for multiple vehicles and multiple machines. task allocation and path planning.
Patent Information
- Application Number
- CN202410936269.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-12
- Publication Date
- 2024-11-15
AI Technical Summary
In scrap steel yards, manual operation of steel grab machines leads to inefficient efficiency, high safety risks and high labor costs. When multiple steel grab machines perform tasks in concert, the coupling between task allocation and path planning is complicated, making it difficult to generate feasible driving. Path, affects efficiency.
The task scheduling method of centralized cooperation between steel-grabbing machine clusters is adopted. By calculating the service parameters of each to be service-combined, a service parameter set is constructed, the optimal service parameters are filtered, and the target task scheduling scheme is generated, so that the unmanned processing of steel-grabbing machine cluster operations is realized. Reduce the risks of collaborative operations and improve scheduling efficiency.
The unmanned treatment of scrap steel yards has been realized, the risk of collaborative operations has been reduced, the scheduling efficiency of steel grabbing machines has been improved, and the support has been provided for the realization of less and unmanned, which has improved the efficiency and safety of task execution. .
Smart Images

Figure CN118966612A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of steel transportation, and in particular to a task scheduling method, device and electronic equipment for centralized collaboration of a steel grabber cluster. Background Art
[0002] In recent years, with the increasing pace of industrialization and urbanization, the demand for steel has also continued to expand. As an important downstream base for steel processing, the internal operating burden of the scrap steel yard has continued to increase. As a special excavator, the steel grabber is mainly used for steel loading and unloading, shearing, steel packaging and other operations. It is a core operating tool in the scrap steel yard. At present, the operation of the steel grabber is mainly performed by the operator, and the on-site commander conducts real-time scheduling. When processing large-volume orders, the following problems may arise:
[0003] (1) Efficiency issues: Manual operation of steel grabbers and other equipment may lead to inefficiency;
[0004] (2) Safety risks: Operating a steel grabber to handle scrap steel may result in safety risks such as scrap steel falling, which may affect the stability and safety of the operation due to operator fatigue or inconsistent skills;
[0005] (3) Cost issues: Long manual operation may lead to expensive labor costs;
[0006] In the process of multiple grabbers cooperating to perform tasks in the scrap steel yard, the number of tasks performed by the grabbers and their time sequence relationship will affect the planning results of the grabber's driving path, and sometimes even a feasible driving path cannot be generated; conversely, the different driving paths selected by the grabber will have an important impact on the efficiency of its task execution. Therefore, the task allocation and path planning of multiple vehicles and multiple machines in the scrap steel yard are mutually coupled, and simply separating them often reduces the final execution efficiency of the tasks. Summary of the invention
[0007] The present application provides a task scheduling method, device and electronic equipment for centralized collaboration of a cluster of steel grabbers to solve the above-mentioned technical problems.
[0008] An embodiment of the present application provides a task scheduling method for centralized collaboration of a steel grabber cluster, the method comprising: obtaining a to-be-serviced combination based on a to-be-serviced set, the to-be-serviced combination comprising an idle service platform and a to-be-serviced vehicle, the to-be-serviced set comprising an idle service platform set and a to-be-serviced vehicle set; calculating service parameters corresponding to each to-be-serviced combination, and constructing a service parameter set, the service parameters comprising a driving path and a driving time, the driving path comprising the shortest driving path from an idle service platform to a to-be-serviced vehicle; screening the service parameters in the service parameter set to obtain optimal service parameters, and constructing an optimal solution set through the optimal service parameters, and deleting the to-be-serviced combination in the optimal solution set from the to-be-serviced set; judging whether the to-be-serviced set is an empty set, and generating a target task scheduling scheme based on the judgment result, and performing steel grabber cluster operations based on the target task scheduling scheme.
[0009] In one embodiment of the present application, a combination to be served is obtained based on the set to be served, including: extracting a single idle service platform from the set of idle service platforms, combining the single idle service platform with all vehicles to be served, until all idle service platforms in the set of idle service platforms are combined with all vehicles to be served, to obtain multiple path sequences, and integrating all path sequences into the combination to be served; or, extracting a single vehicle to be served from the set of vehicles to be served, combining the single vehicle to be served with all idle service platforms, until all vehicles to be served in the set of vehicles to be served are combined with all idle service platforms, to obtain multiple path sequences, and integrating all path sequences into the combination to be served.
[0010] In one embodiment of the present application, the service parameters corresponding to each combination to be served are calculated, and a service parameter set is constructed, including: constructing a network diagram and processing the layout points in the network diagram; searching the network diagram for a starting point feasible layout point corresponding to the starting point in the combination to be served, and a terminal point feasible layout point corresponding to the terminal point; performing path planning on the starting point feasible layout point and the terminal point feasible layout point through a path planning algorithm to obtain the driving path; calculating the driving time based on the driving path, and constructing a service parameter set based on the driving path and driving time of each combination to be served.
[0011] In one embodiment of the present application, the service parameters in the service parameter set are screened to obtain the optimal service parameters, and the optimal solution set is constructed through the optimal service parameters, including: extracting the travel time of each combination to be served in the service parameter set; calculating the weighted travel time through the travel time and the corresponding weight of the vehicle to be served; sorting the combinations to be served in the path sequence according to the arrangement rule of the weighted travel time from small to large, and screening out the minimum service parameter in each path sequence; determining the minimum service parameter as the optimal service parameter, and generating the optimal solution set based on the combinations to be served corresponding to all the optimal service parameters.
[0012] In one embodiment of the present application, a network graph is constructed, including: discretizing the material yard area according to discretization intervals to obtain layout points, initializing all layout point sets, and obtaining an initial network graph; setting the material pile layout points in the material yard area to infeasible points, and setting the obstacle layout points in the material yard area to infeasible points; calculating the connectivity relationship and the shortest arrival time between feasible layout points, and configuring the edges between directly connected layout points in the network graph to obtain a network graph.
[0013] In one embodiment of the present application, it is determined whether the set to be served is an empty set, and a target task scheduling plan is generated based on the determination result, including: if the set to be served is not an empty set, a combination to be served is obtained through the set to be served, and the optimal service parameters of the combination to be served are calculated until the set to be served is an empty set; if the set of idle service platforms is an empty set, or the set of vehicles to be served is an empty set, an initial task scheduling plan is generated through the optimal solution set, the path time and space overlap in the initial task scheduling plan is eliminated, the target task scheduling plan is obtained, and the steel grabbing machine group operation is performed based on the target task scheduling plan.
[0014] In one embodiment of the present application, the spatiotemporal overlap of paths in the initial task scheduling scheme is eliminated to obtain a target task scheduling scheme, including: classifying the scheduled tasks in the initial task scheduling scheme according to a preset priority order to obtain a classification result; traversing each type of task in turn according to the task priority, replanning the task path using the shortest path algorithm, and updating the task start time using the intersection function to eliminate the spatiotemporal overlap between paths to obtain a target task scheduling scheme.
[0015] In one embodiment of the present application, obtaining a to-be-served combination based on a to-be-served set also includes: extracting a first idle service platform from the idle service platform set, combining the first idle service platform with all the vehicles to be served to obtain a first path sequence; determining an optimal to-be-served combination in the first path sequence, and deleting the to-be-served combination corresponding to the optimal to-be-served combination from the to-be-served set, wherein the optimal to-be-served combination is the to-be-served combination corresponding to the optimal parameters; if it is determined that the to-be-served set is not an empty set, extracting a second idle service platform from the idle service platform set, combining the second idle service platform with all the vehicles to be served to obtain a second path sequence; determining an optimal to-be-served combination in the second path sequence, and deleting the to-be-served combination corresponding to the optimal to-be-served combination from the to-be-served set, until the idle service platform set is an empty set, or the vehicle to be served set is an empty set.
[0016] The embodiment of the present application provides a task scheduling device for centralized collaboration of a steel grabber cluster, the device comprising: an acquisition module, used to obtain a to-be-serviced combination based on a to-be-serviced set, the to-be-serviced combination comprising an idle service platform and a to-be-serviced vehicle, the to-be-serviced set comprising an idle service platform set and a to-be-serviced vehicle set; a calculation module, used to calculate the service parameters corresponding to each to-be-serviced combination, and to construct a service parameter set, the service parameters comprising a driving path and a driving time, the driving path comprising the shortest driving path from an idle service platform to a to-be-serviced vehicle; a screening module, used to screen the service parameters in the service parameter set to obtain the optimal service parameters, and to construct an optimal solution set through the optimal service parameters, and to delete the to-be-serviced combination in the optimal solution set from the to-be-serviced set; a generation module, used to determine whether the to-be-serviced set is an empty set, and to generate a target task scheduling scheme based on the determination result, and to perform steel grabber cluster operations based on the target task scheduling scheme.
[0017] An embodiment of the present application provides an electronic device, including a processor, a memory and a communication bus; the communication bus is used to connect the processor and the memory; the processor is used to execute a computer program stored in the memory to implement the collaborative task scheduling method in the above-mentioned steel grabber cluster.
[0018] The beneficial effects of the present application are as follows: after extracting the combination to be served, the present invention calculates the service parameters corresponding to each combination to be served and constructs a service parameter set, wherein the combination to be served includes an idle service platform and a vehicle to be served, and the service parameters include a driving path and a driving time, wherein the driving path includes the shortest driving path from the idle service platform to the vehicle to be served; the service parameters in the service parameter set are screened to obtain the optimal service parameters, and an optimal solution set is constructed through the optimal service parameters, and the combination to be served in the optimal solution set is deleted from the set to be served; it is determined whether the set to be served is an empty set, and a target task scheduling scheme is generated according to the determination result, and the steel grabber group operation is performed based on the target task scheduling scheme. All scheduling operations of the present invention are performed by the central system, realizing unmanned processing of the scrap steel yard, which not only reduces the risk of collaborative operations but also improves the scheduling efficiency of the steel grabbers in the scrap steel yard, providing strong support for realizing the less-manned and unmanned operation of the scrap steel yard.
[0019] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0020] The drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present application, and together with the specification, are used to explain the principles of the present application. Obviously, the drawings described below are only some embodiments of the present application, and for those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative work. In the drawings:
[0021] Figure 1 is a flow chart of a collaborative task scheduling method in a steel grabber cluster shown in an exemplary embodiment of the present application;
[0022] Figure 2 is a flow chart of path planning for cluster collaboration of steel grabbers shown in an exemplary embodiment of the present application;
[0023] Figure 3 An exemplary embodiment of the present application shows a path visualization result diagram of an approximately optimal scheduling solution for a scene file;
[0024] Figure 4 is a block diagram of a task scheduling device for collaboration in a steel grabber cluster shown in an exemplary embodiment of the present application;
[0025] Figure 5 It is a structural schematic diagram of an electronic device shown in an exemplary embodiment of the present application. DETAILED DESCRIPTION
[0026] The following will describe the implementation methods of the present application with reference to the accompanying drawings and preferred embodiments. Those skilled in the art can easily understand other advantages and effects of the present application from the contents disclosed in this specification. The present application can also be implemented or applied through other different specific implementation methods, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present application. It should be understood that the preferred embodiments are only for illustrating the present application, not for limiting the scope of protection of the present application.
[0027] It should be noted that the illustrations provided in the following embodiments are only schematic illustrations of the basic concept of the present application, and thus the drawings only show components related to the present application rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the type, quantity and proportion of each component may be changed at will, and the component layout may also be more complicated.
[0028] In the following description, a large number of details are discussed to provide a more thorough explanation of the embodiments of the present application. However, it is obvious to those skilled in the art that the embodiments of the present application can be implemented without these specific details. In other embodiments, well-known structures and devices are shown in the form of block diagrams rather than in detail to avoid making the embodiments of the present application difficult to understand.
[0029] The embodiments of the present application respectively propose a task scheduling method for collaboration in a steel grabber cluster, a task scheduling device for collaboration in a steel grabber cluster, and an electronic device, and these embodiments will be described in detail below.
[0030] First of all, it should be noted that in the process of multiple grabbers in the scrap steel yard cooperating to perform tasks, the number of tasks performed by the grabbers and their time sequence relationship will affect the planning results of the grabber's driving path, and sometimes even a feasible driving path cannot be generated; conversely, the different driving paths selected by the grabber will have an important impact on the efficiency of its task execution. Therefore, the task allocation and path planning of multiple vehicles and multiple machines in the scrap steel yard are mutually coupled, and simply separating them often reduces the final execution efficiency of the task. In order to improve the execution efficiency in the actual operation scenario of the scrap steel yard, the task scheduling problem of the cluster of grabbers in the scrap steel yard is converted into a joint optimization problem of multi-machine task allocation and path planning. By constructing a heuristic algorithm and considering multiple factors such as task attributes, grabber constraints, and external environment, a multi-machine task allocation and path joint optimization model is constructed.
[0031] The construction heuristic algorithm is a method that approaches the optimal solution by gradually building a solution. The construction heuristic algorithm usually starts with an empty solution, and then gradually adds elements (such as tasks, path segments, etc.) according to certain rules until a complete solution is formed. An innovative solution to the problem of collaborative task scheduling of steel grabber clusters in scrap steel yards is proposed. By building a multi-machine task allocation and path joint optimization model, and designing a construction heuristic algorithm and adding path collision detection and repair modules, efficient, coordinated and safe operation goals can be achieved.
[0032] See also Figure 1 , Figure 1 FIG. 1 is a flowchart of a collaborative task scheduling method in a steel grabber cluster according to an embodiment of the present application. Figure 1 As shown, the method at least includes steps S110 to S130, which are described in detail as follows:
[0033] Step S110, obtaining a to-be-served combination based on the to-be-served set, the to-be-served combination including idle service platforms and to-be-served vehicles, and the to-be-served set including an idle service platform set and a to-be-served vehicle set.
[0034] In one embodiment of the present application, the set to be served may also include a set of idle service platforms and a set of vehicles to be served. Based on the set to be served, the idle service platforms and the vehicles to be served may be arranged and combined to obtain multiple combinations to be served. By comprehensively considering all possible combinations of idle service platforms and vehicles to be served, it is possible to more accurately match service demand and supply, thereby maximizing the use of existing resources and flexibly responding to different task scheduling requirements.
[0035] As a specific example, the vehicle to be serviced is a steel grabber, which is mainly used for grabbing and loading various materials such as scrap metal, scrap steel, finished steel bars, industrial waste, gravel, construction waste, and domestic waste.
[0036] Step S120, calculating the service parameters corresponding to each combination to be served, and constructing a service parameter set, the service parameters include a driving path and a driving time, the driving path includes the shortest driving path from an idle service platform to the vehicle to be served.
[0037] Step S130, screening the service parameters in the service parameter set to obtain the optimal service parameters, constructing the optimal solution set through the optimal service parameters, and deleting the to-be-served combination in the optimal solution set from the to-be-served set.
[0038] Step S140, determine whether the set to be served is an empty set, generate a target task scheduling plan according to the determination result, and perform steel grabbing machine group operations based on the target task scheduling plan.
[0039] exist Figure 1 In the technical scheme shown, after extracting the combination to be served, the service parameters corresponding to each combination to be served are calculated, and a service parameter set is constructed. The combination to be served includes an idle service platform and a vehicle to be served. The service parameters include a driving path and a driving time. The driving path includes the shortest driving path from the idle service platform to the vehicle to be served; the service parameters in the service parameter set are screened to obtain the optimal service parameters, and an optimal solution set is constructed through the optimal service parameters, and the combination to be served in the optimal solution set is deleted from the set to be served; it is determined whether the set to be served is an empty set, and a target task scheduling scheme is generated according to the determination result, and the steel grabber group operation is performed based on the target task scheduling scheme. All scheduling operations of the present invention are performed by the central system, which realizes the unmanned processing of the scrap steel yard, which not only reduces the risk of collaborative operations but also improves the scheduling efficiency of the steel grabbers in the scrap steel yard, and provides strong support for realizing the less-manned and unmanned operation of the scrap steel yard.
[0040] In one embodiment of the present application, obtaining a to-be-served combination based on a to-be-served set also includes: extracting a first idle service platform from an idle service platform set, combining the first idle service platform with all vehicles to be served to obtain a first path sequence; determining an optimal to-be-served combination in the first path sequence, and deleting the to-be-served combination corresponding to the optimal to-be-served combination from the to-be-served set, where the optimal to-be-served combination is the to-be-served combination corresponding to the optimal parameters; if it is determined that the to-be-served set is not an empty set, extracting a second idle service platform from the idle service platform set, combining the second idle service platform with all vehicles to be served to obtain a second path sequence; determining an optimal to-be-served combination in the second path sequence, and deleting the to-be-served combination corresponding to the optimal to-be-served combination from the to-be-served set, until the idle service platform set is an empty set, or the to-be-served vehicle set is an empty set. A combination to be served is determined in the set to be served, the optimal service parameters are determined in the path sequence corresponding to the combination to be served, and the combination to be served corresponding to the optimal service parameters is deleted from the corresponding set. This avoids duplication in the combination to be served in the optimal solution combination finally determined, ensures that the idle service platforms and vehicles to be served corresponding to the optimal service parameters are one-to-one corresponding, avoids repeated determination, and thus improves the efficiency of actual operations.
[0041] As an example, the set of vehicles to be served includes 3 trucks to be served, specifically {K1, K2, K3}, and the set of idle service platforms includes 4 idle service platforms, specifically {T1, T2, T3, T4}. Truck K1 to be served is extracted from the set of trucks to be served, and truck K1 to be served is combined with all idle service platforms in the set of idle service platforms to obtain a first path sequence {K1T1, K1T2, K1T3, K1T4}; the service parameters of the above combination to be served are calculated, and the combination to be served corresponding to the optimal service parameters is determined. For example, the combination to be served corresponding to the optimal service parameters is calculated to be K1T2, and the combination to be served K1T2 is stored in the optimal solution set. The combination to be served in the optimal solution set is deleted from the set to be served; the deleted set of vehicles to be served {K2, K3} and the deleted trucks to be served are obtained as {T1, T3, T4}. Since the to-be-served set is not an empty set, a to-be-served truck K2 is extracted from the to-be-served truck set, and the to-be-served truck K2 is combined with all the idle service platforms in the idle service platform set to obtain a second path sequence {K2T1, K2T3, K2T4}; the service parameters of the to-be-served combination of the above path sequence are calculated, and the to-be-served combination corresponding to the optimal service parameters is determined. For example, the to-be-served combination corresponding to the optimal service parameters is calculated to be K2T3, and the to-be-served combination K2T3 is stored in the optimal solution set, and the to-be-served combination K2T3 is deleted from the to-be-served set to obtain the deleted to-be-served vehicle set {K3} and the deleted to-be-served trucks {T1, T4}. Since the to-be-served set is not an empty set, the to-be-served truck K2 is extracted from the to-be-served truck set, and the to-be-served truck K2 is combined with all the idle service platforms in the idle service platform set to obtain a second path sequence {K2T1, K2T3, K2T4}; the service parameters of the to-be-served combination of the above path sequence are calculated, and the to-be-served combination corresponding to the optimal service parameters is determined. For example, the to-be-served combination K2T3 is stored in the optimal solution set, and the to-be-served combination K2T3 is deleted from the to-be-served set to obtain the deleted to-be-served vehicle set {K3} and the deleted to-be-served trucks {T1, T4}. The truck to be served K2 is extracted from the vehicle set, and the truck to be served K2 is combined with all the idle service platforms in the idle service platform set to obtain the third path sequence {K3T1, K3T4}, the service parameters of the to-be-served combination in the above path sequence are calculated, and the to-be-served combination corresponding to the optimal service parameters is determined. For example, the to-be-served combination corresponding to the optimal service parameters is calculated to be K3T1, then the to-be-served combination K3T1 is stored in the optimal solution set, and the to-be-served combination K3T1 is deleted from the to-be-served set. At this time, it is judged that the to-be-served vehicle set is an empty set, and the optimal solution set is {K1T2, K2T3, K3T1}. The target task scheduling plan is generated based on the optimal solution set, and the steel grabbing machine group operation is performed based on the target task scheduling plan. A combination to be served is determined in the set to be served, the optimal service parameters are determined in the path sequence corresponding to the combination to be served, and the combination to be served corresponding to the optimal service parameters is deleted from the corresponding set. This avoids duplication in the combination to be served in the optimal solution combination finally determined, ensures that the idle service platforms and vehicles to be served corresponding to the optimal service parameters are one-to-one corresponding, avoids repeated determination, and thus improves the efficiency of actual operations.
[0042] In one embodiment of the present application, a combination to be served is obtained based on a set to be served, including: extracting a single idle service platform from a set of idle service platforms, combining the single idle service platform with all vehicles to be served, until all idle service platforms in the set of idle service platforms are combined with all vehicles to be served, obtaining multiple path sequences, and integrating all path sequences into a combination to be served; or, extracting a single vehicle to be served from a set of vehicles to be served, combining the single vehicle to be served with all idle service platforms, until all vehicles to be served in the set of vehicles to be served are combined with all idle service platforms, obtaining multiple path sequences, and integrating all path sequences into a combination to be served. By comprehensively considering all possible combinations of idle service platforms and vehicles to be served, it is possible to more accurately match service demand and supply, thereby maximizing the use of existing resources and flexibly responding to different task scheduling requirements. And when facing multiple service requests, a more diverse task scheduling scheme can be generated based on the path sequence information in the combination to be served, taking into account a variety of factors (such as service priority, vehicle location, platform load, etc.).
[0043] As an example, the set of vehicles to be served includes 3 trucks to be served, specifically {K1, K2, K3}, and the set of idle service platforms includes 4 idle service platforms, specifically {T1, T2, T3, T4}. A single idle service platform is combined with all the vehicles to be served, until all the idle service platforms in the set of idle service platforms are combined with all the vehicles to be served, to obtain multiple path sequences, that is, the obtained path sequences include: a first path sequence {K1T1, K1T2, K1T3, K1T4}, a second path sequence {K2T1, K2T2, K2T3, K2T4}, and a third path sequence {K3T1, K3T2, K3T3, K3T4}. The service parameters corresponding to each combination to be served are calculated, and a service parameter set is constructed. For example, the service parameter set corresponding to the first path sequence is {Q1, Q2, Q3, Q4}, and the service parameter set corresponding to the second path sequence is {W1, W 2, W3, W4}, the service parameter set corresponding to the third path sequence is {P1, P2, P3, P4}, the service parameters in the above service parameter sets are screened to obtain the optimal service parameters, for example: the optimal service parameter screened out from the service parameter set corresponding to the first path sequence is Q1, the optimal service parameter screened out from the service parameter set corresponding to the second path sequence is W2, and the optimal service parameter screened out from the service parameter set corresponding to the third path sequence is P3, the optimal solution set {Q1, W2, P3} is constructed, and the to-be-served combinations corresponding to Q1, W2, P3, namely K1T1, K2T2, K3T3 are deleted from the to-be-served set, and the to-be-served vehicle set after deletion is empty, and the idle service platform set is {T4}; since the to-be-served vehicle set is an empty set, the target task scheduling plan is generated through the optimal solution set {Q1, W2, P3}, and the steel grabbing machine group operation is performed based on the target task scheduling plan. By comprehensively considering all possible combinations of idle service platforms and vehicles to be served, it is possible to more accurately match service demand and supply, thereby maximizing the use of existing resources and flexibly responding to different task scheduling requirements.
[0044] In one embodiment of the present application, service parameters corresponding to each combination to be served are calculated, and a service parameter set is constructed, including: constructing a network diagram; searching the network diagram for a starting point feasible layout point corresponding to the starting point in the combination to be served, and a terminal point feasible layout point corresponding to the terminal point; performing path planning on the starting point feasible layout point and the terminal point feasible layout point through a path planning algorithm to obtain a driving path; calculating the driving time based on the driving path, and constructing a service parameter set based on the driving path and driving time of each combination to be served.
[0045] As an example, the driving path is the shortest path, such as Figure 2 As shown, Figure 2 An exemplary path planning flowchart shown in this application specifically includes the following steps:
[0046] Step S210, arranging points at the starting point corresponding to the determined service combination on the network map, and then executing step S220.
[0047] Step S220, determine whether the starting point layout point is an infeasible layout point. If it is an infeasible layout point, execute step S210. If it is a feasible layout point, map the corresponding terminal layout point in the network diagram according to the determined combination to be served, and determine whether the terminal layout point is an infeasible layout point. If it is an infeasible layout point, execute step S210. If it is a feasible layout point, execute step S230.
[0048] Step S230, based on the starting point layout point and the end point layout point, the driving path is calculated by using the Dijkstra shortest path algorithm, and the driving time of the driving path is calculated, and then step S240 is executed.
[0049] Step S240, constructing a service parameter set based on the driving path and driving time of each combination to be served, and then ending.
[0050] exist Figure 2 In the technical solution shown, the feasible layout points of the starting point and the end point of the service combination to be served are found in the network diagram, and the driving path is planned by the path planning algorithm. By finding the feasible layout points of the starting point and the end point in the network diagram, it can be ensured that the planned driving path is actually feasible and meets the road network constraints. This reduces service delays or failures caused by infeasible paths and improves the efficiency of actual operations.
[0051] In one embodiment of the present application, the service parameters in the service parameter set are screened to obtain the optimal service parameters, and the optimal solution set is constructed through the optimal service parameters, including: extracting the travel time of each combination to be served in the service parameter set; calculating the weighted travel time through the travel time and the corresponding weight of the vehicle to be served; sorting the combinations to be served in the path sequence according to the arrangement rule of weighted travel time from small to large, and screening out the minimum service parameter in each path sequence; determining the minimum service parameter as the optimal service parameter, and generating the optimal solution set based on the combinations to be served corresponding to all the optimal service parameters. The calculation of weighted travel time can more accurately reflect the actual cost or efficiency of each service combination, and flexibly adapt to different service scenarios and needs by adjusting parameters such as vehicle weight and travel time, so as to facilitate the selection of routes that can reduce the overall travel time or cost while ensuring the service quality in different scenarios, and flexibly adapt to different service scenarios and needs, thereby improving the overall service efficiency.
[0052] As an example, the service parameters of each group of to-be-served combinations are calculated, and the service parameter set corresponding to the first path sequence is obtained as {Q1, Q2, Q3, Q4}, the service parameter set corresponding to the second path sequence is obtained as {W1, W2, W3, W4}, and the service parameter set corresponding to the third path sequence is obtained as {P1, P2, P3, P4}. The weight of the to-be-served truck corresponding to each to-be-served parameter is multiplied by the travel time in each to-be-served parameter to obtain the weighted travel time. The parameters in each service parameter set are sorted and updated in descending order of the weighted travel time. At this time, the service parameters include the travel time. The weighted travel time corresponding to the path and the driving path is used to select the minimum service parameter in each set of parameters to be served; the minimum service parameter is determined as the optimal service parameter, for example: the minimum service parameter in the service parameter set corresponding to the sorted first path sequence is selected as Q1, the minimum service parameter in the service parameter set corresponding to the sorted second path sequence is selected as W2, and the minimum service parameter in the service parameter set corresponding to the sorted third path sequence is selected as P3. The optimal solution set is generated based on the combination to be served corresponding to all the optimal service parameters, and the obtained optimal solution set is {Q1, W2, P3}. The calculation of weighted travel time can more accurately reflect the actual cost or efficiency of each service combination. By adjusting parameters such as vehicle weight and travel time, it can flexibly adapt to different service scenarios and needs, so as to reduce the overall travel time or cost of the route while ensuring the service quality in different scenarios, and flexibly adapt to different service scenarios and needs, thereby improving the overall service efficiency.
[0053] In one embodiment of the present application, constructing a network graph includes: discretizing the material yard area according to the discretization interval to obtain layout points, initializing all layout point sets, and obtaining an initial network graph; setting the material pile layout points in the material yard area as infeasible points, and setting the obstacle layout points in the material yard area as infeasible points; calculating the connectivity relationship and the shortest arrival time between feasible layout points, and configuring the edges between directly connected layout points in the network graph to obtain a network graph. By constructing the network graph in advance and searching for feasible layout points of the starting point and the end point in the network graph, it can be ensured that the planned driving path is actually feasible and meets the road network constraints, thereby reducing service delays or failures caused by infeasible paths and improving the efficiency of actual operations.
[0054] As an example, the application scenario is a scrap steel yard. According to the actual size of the scrap steel yard and the operation requirements, a suitable discretization interval is determined (for example, every 5 meters or 10 meters is a unit interval). The scrap steel yard is divided into several discretized areas using the grid division method. The center point or representative point of each area is regarded as a layout point to obtain an initial network diagram, which includes a set of layout points. According to the actual layout of the piles, obstacles, etc. in the scrap steel yard, the corresponding layout points are marked as infeasible. By traversing the set of layout points, it is checked whether each layout point is located within or near the boundary of the pile or obstacle, and the layout points located within or near the boundary of the pile or obstacle are set as infeasible layout points. For the layout points that are determined to be infeasible, their status is updated (such as setting the feasible flag to false) and marked accordingly in the initial network diagram. Based on the actual accessibility (such as barrier-free path) and distance between two points. Calculate the shortest distance between two points, for example, through Euclidean distance (on a two-dimensional plane), Manhattan distance (considering the case where movement can only be along grid lines), or more complex path finding algorithms (such as Dijkstra's algorithm). And add the edges between directly connected feasible layout points to the initial network graph to obtain a network graph. By constructing a network graph in advance and finding feasible layout points for the starting point and the end point in the network graph, it can be ensured that the planned driving path is actually feasible and meets the road network constraints, thereby reducing service delays or failures caused by infeasible paths and improving the efficiency of actual operations.
[0055] In one embodiment of the present application, it is determined whether the set to be served is an empty set, and a target task scheduling plan is generated based on the determination result, including: if the set to be served is not an empty set, a combination to be served is obtained through the set to be served, and the optimal service parameters of the combination to be served are calculated until the set to be served is an empty set; if the set of idle service platforms is an empty set, or the set of vehicles to be served is an empty set, an initial task scheduling plan is generated through the optimal solution set, the path time and space overlap in the initial task scheduling plan is eliminated, the target task scheduling plan is obtained, and the steel grabbing machine group operation is performed based on the target task scheduling plan.
[0056] In one embodiment of the present application, the time-space overlap of the paths in the initial task scheduling scheme is eliminated to obtain the target task scheduling scheme, including: classifying the scheduled tasks in the initial task scheduling scheme according to the preset priority order to obtain the classification result; traversing each type of task in turn according to the task priority, replanning the task path using the shortest path algorithm, and updating the task start time using the intersection function to eliminate the time-space overlap between the paths to obtain the target task scheduling scheme. By updating the task start time according to the priority order by the preset priority order, the time and space conflicts and overlaps of different tasks on the execution path can be effectively avoided, ensuring smooth and efficient task execution.
[0057] In one embodiment of the present application, the present invention is applied to a scrap steel stockyard, firstly, the stockyard area is gridded according to the discretization interval; then, a weighted undirected graph is constructed with the intersections between the grids as nodes, and the infeasible edges of the weighted undirected graph are deleted according to the stockpile area and the obstacle area; then, the Dijkstra algorithm is used to calculate the shortest path and the corresponding weighted driving time from each idle service platform to the corresponding vehicle to be served; then, for each vehicle to be served, the driving path with the smallest weighted driving time to reach the vehicle to be served is found, and determined as the optimal driving path, and the optimal driving path and the corresponding weighted time constitute an optimal solution set, and then the optimal driving path and the corresponding weighted time are screened out; the corresponding combination to be served is determined according to the optimal driving path and the corresponding weighted time, and the combination to be served is deleted from the corresponding set; then, it is determined whether the set of trucks to be served or the set of idle service platforms is empty, and if not, the optimal solution set of all vehicles to be served is continued to be obtained; if it is empty, the current scheduling plan is subjected to a time-space overlap elimination operation to obtain a final scheduling plan. All scheduling operations of the present invention are carried out by the central system, realizing unmanned processing of the scrap steel yard, which not only reduces the risk of collaborative operations but also improves the scheduling efficiency of the steel grabbers in the scrap steel yard, providing strong support for realizing the less-manned or unmanned operation of the scrap steel yard.
[0058] As an example, Table 1 is a comparison table between manual scheduling and construction heuristic scheduling. As shown in Table 1, Table 1 includes scenario files, construction heuristic solution time, construction heuristic solution evaluation value, and simulated manual scheduling solution evaluation value. The test file is named as "number of tasks-number of steel grabbers-number of scenario files in this group". For example, in the 10-15-1 test data, the number of tasks is 10, and the number of service platforms (steel grabbers) is 15, which is the first scenario file in the second group of test data. The manual scheduling method based on simulation is compared with the scheduling results generated based on construction heuristic of the present invention. From the comparison results, it can be seen that the solution effect of the construction heuristic algorithm is significantly improved compared with the simulated manual scheduling, which can well overcome the blindness of manual scheduling.
[0059] Table 1 - Comparison of manual scheduling and constructed heuristic scheduling
[0060]
[0061] In the above embodiment, Figure 3 An exemplary embodiment of the present application shows a path visualization result diagram of the approximate optimal scheduling solution of the scenario file 10-15-5, such as Figure 3As shown in the figure, the scrap steel yard is 300 meters (m) long and 100 meters (m) wide. The black area represents the stockpile, the yellow square represents the obstacle, t represents the truck to be served, and s represents the service platform. It can be seen from the figure that all paths avoid the stockpile and obstacles, and all trucks are served by the service platform.
[0062] Figure 4 FIG. 1 is a block diagram of a task scheduling device for collaboration in a steel grabbing machine cluster according to an exemplary embodiment of the present application. Figure 4 As shown, according to an embodiment of the present application, a task scheduling device 400 for coordinated clustering of steel grabbers includes: an acquisition module 410, a calculation module 420, a screening module 430, and a generation module 440. The acquisition module is used to obtain a combination to be served based on a set to be served, the combination to be served includes an idle service platform and a vehicle to be served, and the set to be served includes an idle service platform set and a vehicle to be served set; the calculation module is used to calculate the service parameters corresponding to each combination to be served, and to construct a service parameter set, the service parameters include a driving path and a driving time, and the driving path includes the shortest driving path from an idle service platform to a vehicle to be served; the screening module is used to screen the service parameters in the service parameter set to obtain the optimal service parameters, and to construct an optimal solution set through the optimal service parameters, and to delete the combination to be served in the optimal solution set from the set to be served; the generation module is used to determine whether the set to be served is an empty set, and to generate a target task scheduling plan according to the determination result, and to perform the steel grabber cluster operation based on the target task scheduling plan.
[0063] In one embodiment of the present application, the acquisition module is used to extract a single idle service platform from the idle service platform set, and combine the single idle service platform with all vehicles to be served, until all idle service platforms in the idle service platform set are combined with all vehicles to be served, to obtain multiple path sequences, and integrate all path sequences into a to-be-served combination; or, extract a single to-be-served vehicle from the to-be-served vehicle set, and combine the single to-be-served vehicle with all idle service platforms, until all to-be-served vehicles in the to-be-served vehicle set are combined with all idle service platforms, to obtain multiple path sequences, and integrate all path sequences into a to-be-served combination.
[0064] In one embodiment of the present application, the calculation module is used to construct a network diagram and process the layout points in the network diagram; search for the starting point feasible layout point corresponding to the starting point in the combination to be served, and the terminal feasible layout point corresponding to the terminal in the network diagram; plan the path for the starting point feasible layout point and the terminal feasible layout point through the path planning algorithm to obtain the driving path; calculate the driving time based on the driving path, and construct a service parameter set based on the driving path and driving time of each combination to be served.
[0065] In one embodiment of the present application, the screening module is used to extract the travel time of each combination to be served in the service parameter set; calculate the weighted travel time by the travel time and the corresponding weight of the vehicle to be served; sort the combinations to be served in the path sequence according to the arrangement rule of weighted travel time from small to large, and screen out the minimum service parameter in each path sequence; determine the minimum service parameter as the optimal service parameter, and generate an optimal solution set based on the combinations to be served corresponding to all the optimal service parameters.
[0066] In one embodiment of the present application, the calculation module is used to discretize the material yard area according to the discretization interval to obtain layout points, initialize all layout point sets, and obtain an initial network diagram; set the material pile layout points in the material yard area as infeasible points, and set the obstacle layout points in the material yard area as infeasible points; calculate the connectivity relationship and the shortest arrival time between feasible layout points, and configure the edges between directly connected layout points in the network diagram to obtain a network diagram.
[0067] In one embodiment of the present application, the generation module is used to obtain a combination to be served through the set to be served if the set to be served is not an empty set, and calculate the optimal service parameters of the combination to be served until the set to be served is an empty set; if the set of idle service platforms is an empty set, or the set of vehicles to be served is an empty set, an initial task scheduling plan is generated through the optimal solution set, the time and space overlap of the paths in the initial task scheduling plan is eliminated, a target task scheduling plan is obtained, and the steel grabbing machine group operation is performed based on the target task scheduling plan.
[0068] In one embodiment of the present application, the task scheduling device for the centralized collaboration of a cluster of steel grabbers also includes an elimination module 450, which is used to classify the scheduled tasks in the initial task scheduling plan according to a preset priority order to obtain a classification result; traverse each type of task in turn according to the task priority, re-plan the task path using the shortest path algorithm, and update the task start time using the intersection function to eliminate the time and space overlap between the paths to obtain a target task scheduling plan.
[0069] In one embodiment of the present application, the acquisition module is also used to extract the first idle service platform from the idle service platform set, combine the first idle service platform with all the vehicles to be served, and obtain a first path sequence; determine the optimal to-be-served combination in the first path sequence, and delete the to-be-served combination corresponding to the optimal to-be-served combination from the to-be-served set, where the optimal to-be-served combination is the to-be-served combination corresponding to the optimal parameters; if it is determined that the to-be-served set is not an empty set, extract the second idle service platform from the idle service platform set, combine the second idle service platform with all the vehicles to be served, and obtain a second path sequence; determine the optimal to-be-served combination in the second path sequence, and delete the to-be-served combination corresponding to the optimal to-be-served combination from the to-be-served set, until the idle service platform set is an empty set, or the to-be-served vehicle set is an empty set.
[0070] It should be noted that the device provided in the above embodiment and the method provided in the above embodiment belong to the same concept, wherein the specific manner in which each module and unit performs the operation has been described in detail in the method embodiment, and will not be repeated here. In practical applications, the device provided in the above embodiment can distribute the above functions to different functional modules as needed, that is, divide the internal structure of the device into different functional modules to complete all or part of the functions described above, and this is not limited here.
[0071] See also Figure 5 , Figure 5 is a schematic diagram of a structure of an electronic device shown in an exemplary embodiment of the present application. It should be noted that: Figure 5 The electronic device 500 shown is only an example and should not bring any limitation to the functions and usage area of the embodiments of the present application.
[0072] like Figure 5 As shown, the electronic device 500 includes a processor 501, a memory 502 and a communication bus 503; the communication bus 503 is used to connect the processor 501 and the memory 502; the processor 501 is used to execute the computer program stored in the memory 502 to implement one or more methods in the above embodiments.
[0073] The electronic device provided in the present application includes a processor, a memory, a transceiver and a communication interface. The memory and the communication interface are connected to the processor and the transceiver and complete communication with each other. The memory is used to store computer programs, the communication interface is used to communicate, and the processor and the transceiver are used to run the computer program so that the electronic device executes each step of the above method.
[0074] In this embodiment, the memory may include a random access memory (RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory.
[0075] The above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
[0076] The above embodiments are merely illustrative of the principles and effects of the present application, and are not intended to limit the present application. Anyone familiar with the technology may modify or change the above embodiments without violating the spirit and scope of the present application. Therefore, all equivalent modifications or changes made by a person of ordinary skill in the art without departing from the spirit and technical ideas disclosed in the present application shall still be covered by the claims of the present application.
Claims
1. A task scheduling method for cluster collaboration of steel grabbers, characterized in that: The method comprises: Obtaining a to-be-serviced combination based on the to-be-serviced set, wherein the to-be-serviced combination includes idle service platforms and vehicles to be serviced, and the to-be-serviced set includes an idle service platform set and a vehicle set to be serviced; Calculate the service parameters corresponding to each combination to be served, and construct a service parameter set, wherein the service parameters include a driving path and a driving time, and the driving path includes the shortest driving path from an idle service platform to a vehicle to be served; Screening the service parameters in the service parameter set to obtain optimal service parameters, constructing an optimal solution set through the optimal service parameters, and deleting the to-be-served combination in the optimal solution set from the to-be-served set; Determine whether the set to be served is an empty set, generate a target task scheduling plan according to the determination result, and perform steel grabbing machine group operations based on the target task scheduling plan.
2. The task scheduling method for centralized collaboration of a steel grabber cluster according to claim 1 is characterized in that: Based on the waiting service set, a waiting service combination is obtained, including: Extract a single idle service platform from the idle service platform set, combine the single idle service platform with all the vehicles to be served, until all the idle service platforms in the idle service platform set are combined with all the vehicles to be served, to obtain multiple path sequences, and integrate all the path sequences into the to-be-served combination; or, A single vehicle to be served is extracted from the set of vehicles to be served, and the single vehicle to be served is combined with all idle service platforms, until all vehicles to be served in the set of vehicles to be served are combined with all idle service platforms to obtain multiple path sequences, and all path sequences are integrated into the combination to be served.
3. The task scheduling method for centralized collaboration of a steel grabber cluster according to claim 2 is characterized in that: Calculate the service parameters corresponding to each service combination and build a service parameter set, including: Constructing a network diagram and processing the layout points in the network diagram; Searching the network diagram for a feasible layout point of the starting point corresponding to the starting point in the combination to be served, and a feasible layout point of the end point corresponding to the end point; Performing path planning on the starting feasible layout point and the end feasible layout point by using a path planning algorithm to obtain the driving path; The driving time is calculated based on the driving path, and a service parameter set is constructed based on the driving path and driving time of each combination to be served.
4. The task scheduling method for centralized collaboration of a steel grabber cluster according to claim 2 is characterized in that: Screening the service parameters in the service parameter set to obtain optimal service parameters, and constructing an optimal solution set through the optimal service parameters, including: Extracting the travel time of each to-be-serviced combination in the service parameter set; Calculating weighted driving time by using the driving time and the corresponding weight of the vehicle to be served; The to-be-serviced combinations in the path sequence are sorted according to the weighted travel time arrangement rule from small to large, and the minimum service parameter in each path sequence is screened out; The minimum service parameter is determined as the optimal service parameter, and an optimal solution set is generated based on the to-be-serviced combinations corresponding to all the optimal service parameters.
5. The task scheduling method for centralized collaboration of a steel grabber cluster according to claim 3 is characterized in that: Construct a network diagram, including: Discretize the material yard area according to the discretization interval to obtain the layout points, initialize all the layout point sets, and obtain the initial network diagram; Setting the stockpile arrangement points in the stockyard area as infeasible points, and setting the obstacle arrangement points in the stockyard area as infeasible points; The connectivity relationship and the shortest arrival time between feasible layout points are calculated, and the edges between directly connected layout points are configured in the network graph to obtain a network graph.
6. The task scheduling method for centralized collaboration of a steel grabber cluster according to claim 1, characterized in that: Determining whether the to-be-served set is an empty set, and generating a target task scheduling scheme according to the determination result, including: If the set to be served is not an empty set, obtaining a combination to be served through the set to be served, and calculating the optimal service parameters of the combination to be served until the set to be served is an empty set; If the set of idle service platforms is an empty set, or the set of vehicles to be served is an empty set, an initial task scheduling plan is generated through the optimal solution set, the time-space overlap of paths in the initial task scheduling plan is eliminated, and a target task scheduling plan is obtained, and the steel grabbing machine group operation is performed based on the target task scheduling plan.
7. The task scheduling method for centralized collaboration of a steel grabber cluster according to claim 6 is characterized in that: Eliminating the spatiotemporal overlap of paths in the initial task scheduling scheme to obtain a target task scheduling scheme includes: Classifying the scheduled tasks in the initial task scheduling scheme according to a preset priority order to obtain a classification result; Each type of task is traversed in turn according to the task priority, the task path is replanned using the shortest path algorithm, and the task start time is updated using the intersection function to eliminate the time and space overlap between paths and obtain the target task scheduling plan.
8. The task scheduling method for centralized collaboration of a steel grabber cluster according to any one of claims 1 to 7, characterized in that: The combination of services to be served is obtained based on the set of services to be served, and further includes: Extracting a first idle service platform from the idle service platform set, combining the first idle service platform with all vehicles to be served, and obtaining a first path sequence; Determine an optimal combination to be served in the first path sequence, and delete the combination to be served corresponding to the optimal combination to be served from the set to be served, wherein the optimal combination to be served is the combination to be served corresponding to the optimal parameters; If it is determined that the set to be served is not an empty set, extracting a second idle service platform from the set of idle service platforms, combining the second idle service platform with all the vehicles to be served to obtain a second path sequence; An optimal to-be-served combination is determined in the second path sequence, and the to-be-served combination corresponding to the optimal to-be-served combination is deleted from the to-be-served set until the idle service platform set is an empty set, or the to-be-served vehicle set is an empty set.
9. A task scheduling device for cluster collaboration of steel grabbers, characterized in that: The device comprises: An acquisition module, configured to obtain a to-be-serviced combination based on a to-be-serviced set, wherein the to-be-serviced combination includes idle service platforms and to-be-serviced vehicles, and the to-be-serviced set includes an idle service platform set and a to-be-serviced vehicle set; A calculation module, used to calculate the service parameters corresponding to each combination to be served and construct a service parameter set, wherein the service parameters include a driving path and a driving time, and the driving path includes the shortest driving path from an idle service platform to a vehicle to be served; A screening module, used to screen the service parameters in the service parameter set to obtain the optimal service parameters, construct an optimal solution set through the optimal service parameters, and delete the to-be-served combination in the optimal solution set from the to-be-served set; A generation module is used to determine whether the set to be served is an empty set, generate a target task scheduling plan according to the determination result, and perform steel grabbing machine group operations based on the target task scheduling plan.
10. An electronic device, characterized in that: It comprises a processor, a memory and a communication bus; the communication bus is used to connect the processor and the memory; the processor is used to execute a computer program stored in the memory to implement the collaborative task scheduling method in a steel grabber cluster as described in any one of claims 1 to 8.
