A task management method based on time estimation

By introducing a strategy based on time estimate in the task management method, analyzing the conflict degree and task characteristics of nodes, and dynamically adjusting task allocation, the problem of inefficient task processing in the existing technology is solved, and more efficient task management is achieved.

CN118982125BActive Publication Date: 2025-02-21北京科杰科技有限公司
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202410979629.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-07-22
Publication Date
2025-02-21
Estimated Expiration
2044-07-22

AI Technical Summary

Technical Problem

The existing task management methods fail to effectively consider the real-time changes in the busyness of mobile request devices and nodes, resulting in inefficient task processing in the park.

Method used

The task management method based on time estimate is adopted to analyze the conflict degree of the second-class node and the task characteristics of the first-class node, determine the node status and analysis method, and then select the optimal operation route to optimize task allocation and improve processing efficiency.

Benefits of technology

By dynamically adjusting the task allocation strategy, the task processing efficiency in the park is significantly improved according to the real-time node status and the needs of mobile requesting equipment, and task delays and resource waste are avoided.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118982125B_ABST
    Figure CN118982125B_ABST
Patent Text Reader

Abstract

The present invention relates to the field of task management, and in particular to a task management method based on time estimation. The task management method comprises: determining the node state according to the number of second-class nodes of each movable route corresponding to a mobile request device and determining an analysis method according to the node state; determining the conflict degree of the movable route according to the average value of the number of conflicting mobile request devices of each second-class node in each movable route, and determining the running route selection method of the mobile request device according to the conflict degree of each movable route; determining a reference value according to the device characteristics of a fixed request device corresponding to a class of nodes, determining the task reference degree of the class of nodes according to the reference value, and determining the priority coefficient of the class of nodes through the task reference degree; determining the running route of the mobile request device according to the comprehensive priority coefficient corresponding to each movable route to be selected. The present invention effectively improves the task management efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of task management, and in particular to a task management method based on time estimation. Background Art

[0002] Task management plays an important role in improving work efficiency and optimizing resource allocation in actual work scenarios. In large industrial parks, effective task management methods can ensure the timeliness of task processing and the reasonable allocation of work nodes. However, current task management methods often only consider the task volume and the busyness of the nodes to allocate tasks. They fail to plan the operation routes according to the request task status of mobile request devices in the park and the node status of movable routes in the park, which leads to low task processing efficiency in the park. Therefore, how to allocate tasks according to the actual situation of mobile request devices and nodes, and thus improve the task processing efficiency in the park, is an urgent problem to be solved by technical personnel in this field.

[0003] Chinese Patent Publication No. CN117035297B discloses a big data-based park intelligent task allocation method and system, which eliminates processing nodes with potential abnormal problems and then allocates tasks, thereby avoiding the problem of task execution failure due to hardware equipment abnormalities after task allocation, thereby reducing the time delay caused by task reallocation. However, the above scheme has the following problems: the mobile request device in the park is highly sensitive to the processing time of the requested task. When allocating tasks, the scheme does not consider the real-time changes in the busyness of the mobile request device and each node, which easily leads to an increase in the node's response time to the mobile request device's request task, thereby causing low task processing efficiency in the park. Summary of the invention

[0004] To this end, the present invention provides a task management method based on time estimation to overcome the problem in the prior art that the real-time changes of mobile request devices and node busyness are not taken into consideration when allocating tasks, which increases the response time of the node to the task requested by the mobile request device, thereby leading to low task processing efficiency within the park.

[0005] To achieve the above object, the present invention provides a task management method based on time estimation, comprising:

[0006] Determining a node state according to the number of the second-class nodes of each movable route corresponding to the mobile request device, and determining an analysis method according to the node state;

[0007] Under different analysis methods, the conflict degree of the second type of nodes or the task characteristics of the first type of nodes are analyzed;

[0008] In the conflict degree analysis for the second type of nodes, the conflict degree of the movable route is determined according to the average value of the number of conflicting mobile request devices of each second type of node in each movable route, and the operation route selection method of the mobile request device is determined according to the conflict degree of each movable route, and when the conflict degree of the movable route is greater than the preset conflict degree, the estimated reference time is adjusted;

[0009] In analyzing the task characteristics of a class of nodes, a reference value is determined according to the device characteristics of the fixed request device corresponding to the class of nodes, and a task reference degree of the class of nodes is determined according to the reference value, and a priority coefficient of the class of nodes is determined through the task reference degree;

[0010] The running route of the mobile requesting device is determined according to the comprehensive priority coefficients corresponding to each movable route to be selected.

[0011] Furthermore, the node state is determined according to the number of Class II nodes of each movable route corresponding to the mobile request device, and the node state includes that the number of Class II nodes of each movable route is greater than the preset number of nodes, or there is a movable route with a number of Class II nodes greater than the preset number of nodes.

[0012] Further, an analysis method is determined according to the node state of the movable route corresponding to the mobile request device, and the analysis method includes analyzing the conflict degree of the two types of nodes, or analyzing the task characteristics of the one type of nodes;

[0013] Among them, one type of node is a node whose estimated working time is less than the preset working time;

[0014] The second type of nodes are nodes whose estimated working time is greater than or equal to the preset working time.

[0015] Further, all movable routes of the mobile request device are obtained, and the conflict degree of the movable route is determined according to the average value of the total number of conflicting mobile request devices of each type II node in each movable route;

[0016] The average value of the total number of conflicting mobile request devices is positively correlated with the conflict degree of the movable routes.

[0017] Further, determining the operation route selection mode of the mobile request device according to the conflict degree of each movable route corresponding to the mobile request device;

[0018] If there is a movable route with a conflict degree less than or equal to the preset conflict degree, the route with the shortest distance is selected as the operating route of the mobile request device;

[0019] If the conflict degrees of the movable routes are all greater than the preset conflict degrees, an increase adjustment is made for the estimated reference time, and when the increase adjustment is completed, the conflict degrees of each movable route corresponding to the mobile request device are re-determined to determine the route with the shortest distance as the operating route of the mobile request device or to select the operating route according to the node processing range.

[0020] Furthermore, by acquiring the node processing range of each node on the movable route, the overlapping area of ​​the node processing range between each pair of adjacent nodes is detected, and the operating route of the mobile request device is selected according to the proportion of the overlapping area of ​​the node processing range in each movable route.

[0021] Further, by detecting the task reference degree of the fixed request device corresponding to the node of the class, the priority coefficient of the node of the class is determined;

[0022] The task reference degree is negatively correlated with the priority coefficient of a type of node.

[0023] Furthermore, a reference value of the task reference degree is determined by acquiring device characteristics of a fixed request device corresponding to a class of nodes, the reference value being the request interval of the fixed request device, or the waiting time of a class of nodes corresponding to the fixed request device.

[0024] Further, if the reference value is the request interval time, the task reference degree is determined according to the change of the request interval time;

[0025] If the reference value is the time to be worked, the task reference degree is determined according to the time to be worked, and the task reference degree is positively correlated with the time to be worked.

[0026] Further, determining the operation route of the mobile requesting device according to the comprehensive priority coefficient corresponding to each movable route to be selected;

[0027] The movable route to be selected is a movable route in which the number of the second type of nodes is less than or equal to the preset number of nodes.

[0028] Compared with the prior art, the beneficial effect of the present invention is that the present invention determines the node state of the movable route according to the number of the second type of nodes in the movable route, and then determines the analysis method, and determines the analysis target according to different analysis methods, so that the subsequent analysis is more targeted.

[0029] Furthermore, the present invention determines the conflict degree of the movable route according to the average value of the total number of conflicting mobile request devices of each Class II node in each movable route, and is provided with a secondary determination method for adjusting the estimated reference time to redetermine the conflict degree in case that the route selection cannot be effectively performed due to the conflict degree, and then selects the operating route according to the conflict degree of the movable route. The conflict degree reflects the processing capacity of the node when the mobile request device arrives at each Class II node, thereby avoiding the problem that the operating route selection only considers the current node busyness, resulting in a large number of corresponding node mobile request devices when the mobile request device runs to the node processing range, resulting in a large task processing delay, thereby improving the task management efficiency of the present invention.

[0030] Furthermore, in the present invention, the overlapping area of ​​the node processing range of each pair of adjacent nodes is detected to determine the proportion of the overlapping area. When the running route cannot be determined according to the conflict degree, the movable route with the largest proportion of the overlapping area of ​​the node processing range is selected as the running route of the mobile request device. When the mobile request device is in the overlapping area of ​​the node processing range of different nodes, the mobile request device can select the request node according to the busyness of different nodes. The larger the proportion of the overlapping area of ​​the movable route, the more situations in which the mobile request device can select nodes, thereby avoiding the problem of large delay in request task processing of the mobile request device, thereby improving the task management efficiency of the present invention.

[0031] Furthermore, the present invention determines a reference value based on the application of a fixed request device corresponding to a class of nodes in an actual scenario, so that the selection of the reference value is more accurate, and thus the determination of the priority coefficient of the subsequent class of nodes is more accurate, thereby improving the task management efficiency of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 A schematic diagram of a task management method based on time estimation according to the present invention;

[0033] Figure 2 It is a flow chart of the present invention for determining an analysis method according to the node status of a mobile request device corresponding to a movable route;

[0034] Figure 3 A flow chart of the present invention for determining a running route selection method of a mobile request device according to the conflict degree of each movable route corresponding to the mobile request device;

[0035] Figure 4 The present invention is a flow chart of determining a reference value of a task reference degree by acquiring device characteristics of a fixed request device corresponding to a type of node. DETAILED DESCRIPTION

[0036] In order to make the objects and advantages of the present invention more clearly understood, the present invention is further described below in conjunction with embodiments; it should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0037] The preferred embodiments of the present invention are described below with reference to the accompanying drawings. It should be understood by those skilled in the art that these embodiments are only used to explain the technical principles of the present invention and are not intended to limit the protection scope of the present invention.

[0038] It should be noted that, in the description of the present invention, terms such as "up", "down", "left", "right", "inside" and "outside" indicating directions or positional relationships are based on the directions or positional relationships shown in the drawings. This is merely for the convenience of description and does not indicate or imply that the device or element must have a specific orientation, be constructed and operated in a specific orientation. Therefore, it cannot be understood as a limitation on the present invention.

[0039] In addition, it should be noted that in the description of the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For those skilled in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0040] See also Figures 1 to 4 As shown, the present invention provides a high-density low-speed vehicle dispatching and management system, comprising:

[0041] Determining a node state according to the number of the second-class nodes of each movable route corresponding to the mobile request device, and determining an analysis method according to the node state;

[0042] Under different analysis methods, the conflict degree of the second type of nodes or the task characteristics of the first type of nodes are analyzed;

[0043] In the conflict degree analysis for the second type of nodes, the conflict degree of the movable route is determined according to the average value of the number of conflicting mobile request devices of each second type of node in each movable route, and the operation route selection method of the mobile request device is determined according to the conflict degree of each movable route, and when the conflict degree of the movable route is greater than the preset conflict degree, the estimated reference time is adjusted;

[0044] In analyzing the task characteristics of a class of nodes, a reference value is determined according to the device characteristics of the fixed request device corresponding to the class of nodes, and a task reference degree of the class of nodes is determined according to the reference value, and a priority coefficient of the class of nodes is determined through the task reference degree;

[0045] The running route of the mobile requesting device is determined according to the comprehensive priority coefficients corresponding to each movable route to be selected.

[0046] The application scenario of the present invention is the task management of the Internet of Things in a smart park. The device for sending a request task in the present invention includes a mobile request device and a fixed request device. The mobile request device is in the node processing range of different nodes as the position changes. When it is in the overlapping area of ​​the node processing ranges of different nodes, the node with the closest distance or the shortest waiting time is selected. The node processing range in the present invention is determined by each node according to the ability of the node to receive a request signal. The node processing range is a circular area with the node setting position as the center and the farthest distance at which the node can receive the request signal of the request task as the radius. The mobile request device operates within a movable route. The movable route is a route that the mobile request device can pass through and reach the actual target location. The mobile request device has different movable routes corresponding to different actual target locations. There may be one or more movable routes corresponding to the mobile request device. The fixed request device always sends a request task to a fixed node, but the request interval time for sending the request task and the task amount of a single request task are different. The present invention does not make specific restrictions on the working performance and position of each node, and the user sets them according to actual work requirements.

[0047] Specifically, the node state is determined according to the number of the second type of nodes of each movable route corresponding to the mobile request device, and the node state includes a first preset node state or a second preset node state;

[0048] The first preset node state is that the number of the second-type nodes of each movable route is greater than the preset number of nodes;

[0049] The second preset node state is that the number of the second type of nodes with movable routes is greater than the preset number of nodes;

[0050] Among them, the numerical setting of the preset number of nodes can be set by the user according to actual needs and historical experience records, and a method for taking the value of the preset number of nodes is provided. The preset number of nodes is the average of the maximum number of second-class nodes in the movable route that meets the user's time requirements for processing tasks in the historical records. A value of the preset number of nodes is provided, and the value of the preset number of nodes is 50% of the number of nodes in the movable route.

[0051] Specifically, an analysis method is determined according to the node state of the movable route corresponding to the mobile request device, and the analysis method includes analyzing the conflict degree of the two types of nodes, or analyzing the task characteristics of the one type of nodes;

[0052] Among them, one type of node is a node whose estimated working time is less than the preset working time;

[0053] The second type of nodes are nodes whose estimated working time is greater than or equal to the preset working time.

[0054] Among them, the estimated working time is the time required for each node to process the remaining tasks of the corresponding node. The remaining tasks of the node are the tasks that the node is currently processing and the tasks that have been received but not processed. The numerical setting of the preset working time can be set by the user according to actual needs and historical records. The higher the user's requirement for the delay time of the node processing tasks, the smaller the value of the preset working time. A method for determining the value of the preset working time is provided. The preset working time is the average of the estimated working times of each node in the movable route that meets the user's time requirements for processing tasks in the historical records, in seconds.

[0055] Specifically, all movable routes of the mobile request device are obtained, and the conflict degree of the movable route is determined according to the average value of the total number of conflicting mobile request devices of each type II node in each movable route;

[0056] The average value of the total number of conflicting mobile request devices is positively correlated with the conflict degree of the movable routes.

[0057] Specifically, the operation route selection mode of the mobile request device is determined according to the conflict degree of each movable route corresponding to the mobile request device;

[0058] If there is a movable route with a conflict degree less than or equal to the preset conflict degree, the route with the shortest distance is selected as the operating route of the mobile request device;

[0059] If the conflict degrees of the movable routes are all greater than the preset conflict degrees, an increase adjustment is made for the estimated reference time, and when the increase adjustment is completed, the conflict degrees of each movable route corresponding to the mobile request device are re-determined to determine the route with the shortest distance as the operating route of the mobile request device or to select the operating route according to the node processing range.

[0060] The running route is the route finally determined by each mobile request device, the estimated reference time is the estimated time required for each mobile request device to pass through the node processing range of each node, the estimated reference time = the length of the movable route within the corresponding node processing range / the running speed of the mobile request device, the total number of conflicting mobile request devices is the number of mobile request devices expected to enter the corresponding node within the estimated reference time, the conflict degree c of the movable route, m is the number of nodes in the corresponding movable route, p jis the total number of conflicting mobile request devices of the jth node. The numerical setting of the preset conflict degree can be set by the user according to the actual processing capacity and historical records of the node. The better the processing capacity of the node, the faster the processing speed, and the greater the preset conflict degree. A method for determining the value of the preset conflict degree is provided. The average of the maximum number of processing devices of each node in the historical records is recorded as the preset conflict degree value. The maximum number of processing devices is the maximum number of mobile request devices that the node can process under the premise of meeting the user's requirements for the delay time. A value of the preset conflict degree is provided.

[0061] Specifically, by obtaining the node processing range of each node on the movable route, the overlapping area of ​​the node processing range between each pair of adjacent nodes is detected, and the operating route of the mobile request device is selected according to the proportion of the overlapping area of ​​the node processing range in each movable route.

[0062] Among them, the overlapping area is the same area covered by the node processing range of two adjacent nodes, and the overlapping area ratio = the area of ​​all overlapping areas corresponding to the movable route / the area of ​​all node processing ranges in the movable route. The movable route with the largest overlapping area ratio is selected as the operating route of the mobile request device, so that the mobile request device can select the most suitable node to make a task request during operation, so as to ensure that the response time of the node in the operating route to the requested task meets the user's requirements. The response time is the difference between the time when the node receives the task request and the time when it starts processing the task.

[0063] Specifically, the priority coefficient of a class of nodes is determined by detecting the task reference degree of the fixed request device corresponding to the class of nodes;

[0064] The task reference degree is negatively correlated with the priority coefficient of a type of node.

[0065] Specifically, the reference value of the task reference degree is determined by acquiring the device characteristics of the fixed request device corresponding to a type of node, and the reference value is the request interval time of the fixed request device, or the waiting time of a type of node corresponding to the fixed request device.

[0066] Among them, if the fixed request equipment includes processing equipment and non-processing equipment, the processing equipment is the equipment that performs fixed production tasks in the park, for example, the intelligent injection molding machine in the injection molding production workshop, and the non-processing equipment is the equipment that does not perform production tasks in the park, for example, the intelligent Internet of Things visual monitoring device. If the fixed request equipment is processing equipment, the waiting time is selected as the reference value, and the waiting time is determined according to the work tasks corresponding to the processing equipment in the actual application scenario. That is, the processing equipment is the intelligent injection molding machine in the injection molding production workshop, and the waiting time is the time required for the processing equipment to complete the currently unfinished planned tasks. If the fixed request equipment is non-processing equipment, the request interval time is selected as the reference value. The request interval time is the time interval between two requests sent by the fixed request equipment. The waiting time is the time required for the fixed request equipment corresponding to a type of node to process the unprocessed target objects.

[0067] Specifically, if the reference value is the request interval, the task reference degree is determined according to the change of the request interval;

[0068] If the reference value is the time to be worked, the task reference degree is determined according to the time to be worked, and the task reference degree is positively correlated with the time to be worked.

[0069] Among them, when the task reference degree is determined according to the change of the request interval time, the task reference degree n is the number of times the fixed request device sends request tasks within the preset detection time, t i is the i-th request interval, t0 is the average of all request intervals, the preset detection duration is the duration corresponding to the end time at that time, and the numerical setting of the preset detection duration can be set by the user according to actual needs and historical records. The higher the user's requirement for the duration of the stable state of a type of node, the longer the preset detection duration is. A value of the preset detection duration is provided, and the preset detection duration is 10 minutes.

[0070] Specifically, the operation route of the mobile request device is determined according to the comprehensive priority coefficient corresponding to each movable route to be selected;

[0071] The movable route to be selected is a movable route in which the number of the second type of nodes is less than or equal to the preset number of nodes.

[0072] The comprehensive priority coefficient is the average of the priority coefficients of all nodes in the movable route to be selected, and the movable route to be selected with the largest comprehensive priority coefficient is selected as the operating route of the mobile request device.

[0073] So far, the technical solutions of the present invention have been described in conjunction with the preferred embodiments shown in the accompanying drawings. However, it is easy for those skilled in the art to understand that the protection scope of the present invention is obviously not limited to these specific embodiments. Without departing from the principle of the present invention, those skilled in the art can make equivalent changes or substitutions to the relevant technical features, and the technical solutions after these changes or substitutions will fall within the protection scope of the present invention.

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

Claims

1. A task management method based on time estimation, characterized in that: include: Determining a node state according to the number of the second-class nodes of each movable route corresponding to the mobile request device, and determining an analysis method according to the node state; Under different analysis methods, the conflict degree of the second type of nodes or the task characteristics of the first type of nodes are analyzed; In the conflict degree analysis for the second type of nodes, the conflict degree of the movable route is determined according to the average value of the number of conflicting mobile request devices of each second type of node in each movable route, and the operation route selection method of the mobile request device is determined according to the conflict degree of each movable route, and when the conflict degree of the movable route is greater than the preset conflict degree, the estimated reference time is adjusted; In analyzing the task characteristics of a class of nodes, a reference value is determined according to the device characteristics of the fixed request device corresponding to the class of nodes, and a task reference degree of the class of nodes is determined according to the reference value, and a priority coefficient of the class of nodes is determined through the task reference degree; Determine the operation route of the mobile request device according to the comprehensive priority coefficient corresponding to each movable route to be selected; Determine a node state according to the number of the second-class nodes of each movable route corresponding to the mobile request device, the node state including that the number of the second-class nodes of each movable route is greater than the preset number of nodes, or that the number of the second-class nodes of the movable route is greater than the preset number of nodes; The first type of node is a node whose estimated working time is less than the preset working time; The second type of node is a node whose estimated working time is greater than or equal to the preset working time; Determine a reference value of the task reference degree by acquiring a device characteristic of a fixed request device corresponding to a class of nodes, the reference value being a request interval of the fixed request device, or a waiting time of a class of nodes corresponding to the fixed request device; If the reference value is the request interval, the task reference degree is determined according to the change of the request interval; If the reference value is the time to be worked, the task reference degree is determined according to the time to be worked, and the task reference degree is positively correlated with the time to be worked; The comprehensive priority coefficient is the average of the priority coefficients of all nodes in the movable route to be selected; The node processing range is a circular area with the node setting position as the center and the farthest distance at which the node can receive the request signal of the request task as the radius; Obtain all movable routes of the mobile request device, and determine the conflict degree of the movable route according to the average value of the total number of conflicting mobile request devices of each type II node in each movable route; The average value of the total number of conflicting mobile request devices is positively correlated with the conflict degree of the movable routes.

2. The task management method based on time estimation according to claim 1 is characterized in that: The analysis method is determined according to the node status of the movable route corresponding to the mobile request device. The analysis method includes analyzing the conflict degree of the second type of nodes, or analyzing the task characteristics of the first type of nodes.

3. The task management method based on time estimation according to claim 2 is characterized in that: Determine the operation route selection mode of the mobile request device according to the conflict degree of each movable route corresponding to the mobile request device; If there is a movable route with a conflict degree less than or equal to the preset conflict degree, the route with the shortest distance is selected as the operating route of the mobile request device; If the conflict degrees of the movable routes are all greater than the preset conflict degrees, an increase adjustment is made for the estimated reference time, and when the increase adjustment is completed, the conflict degrees of each movable route corresponding to the mobile request device are re-determined to determine the route with the shortest distance as the operating route of the mobile request device or to select the operating route according to the node processing range.

4. The task management method based on time estimation according to claim 1 is characterized in that: By obtaining the node processing range of each node on the movable route, the overlapping area of ​​the node processing range between each pair of adjacent nodes is detected, and the operation route of the mobile request device is selected according to the proportion of the overlapping area of ​​the node processing range in each movable route.

5. The task management method based on time estimation according to claim 2 is characterized in that: Determine the priority coefficient of a class of nodes by detecting the task reference degree of the fixed request device corresponding to the class of nodes; The task reference degree is negatively correlated with the priority coefficient of a type of node.

6. The task management method based on time estimation according to claim 5 is characterized in that: Determine the operation route of the mobile request device according to the comprehensive priority coefficient corresponding to each movable route to be selected; The movable route to be selected is a movable route in which the number of the second type of nodes is less than or equal to the preset number of nodes.

Citation Information

Patent Citations

  • A park intelligent task allocation method and system based on big data

    CN117035297B

  • Distributed task allocation optimization method and device, storage medium and electronic device

    CN111176840A

  • Mobile sewage treatment vehicle management system and method

    CN117875534A