CN116562490A - Task processing method, device and system - Google Patents

Task processing method, device and system Download PDF

Info

Publication number
CN116562490A
CN116562490A CN202310848979.7A CN202310848979A CN116562490A CN 116562490 A CN116562490 A CN 116562490A CN 202310848979 A CN202310848979 A CN 202310848979A CN 116562490 A CN116562490 A CN 116562490A
Authority
CN
China
Prior art keywords
target object
processing
task
target
shortest path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310848979.7A
Other languages
Chinese (zh)
Inventor
朱明远
史明
吴奇锋
王燕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Eredi Information Technology Beijing Co ltd
Original Assignee
Eredi Information Technology Beijing Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Eredi Information Technology Beijing Co ltd filed Critical Eredi Information Technology Beijing Co ltd
Priority to CN202310848979.7A priority Critical patent/CN116562490A/en
Publication of CN116562490A publication Critical patent/CN116562490A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/004—Artificial life, i.e. computing arrangements simulating life
    • G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0833—Tracking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y10/00—Economic sectors
    • G16Y10/40—Transportation
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y40/00—IoT characterised by the purpose of the information processing
    • G16Y40/10—Detection; Monitoring
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y40/00—IoT characterised by the purpose of the information processing
    • G16Y40/60—Positioning; Navigation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Computing Systems (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Data Mining & Analysis (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Molecular Biology (AREA)
  • Game Theory and Decision Science (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Primary Health Care (AREA)
  • Artificial Intelligence (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Accounting & Taxation (AREA)
  • Evolutionary Computation (AREA)

Abstract

The invention provides a task processing method, device and system, wherein the method comprises the following steps: acquiring a processing request of at least one target object in a target area, wherein the processing request comprises the position information of the target object; generating a shortest path for scheduling the target object according to the at least one processing request; generating a processing task corresponding to at least one target object according to the shortest path; and sending the processing task to a target object, so that the target object finishes processing at least one target object according to the processing task. The scheme of the invention can monitor the state of the target object in real time and realize timely and reasonable treatment of the target object.

Description

Task processing method, device and system
Technical Field
The invention relates to the technical field of the Internet of things, in particular to a task processing method, device and system.
Background
In the prior art, the treatment of objects represented by garbage cans is often not timely enough and requires the manual treatment of garbage at a garbage collection point. The manual treatment mode has the following defects:
1. the timeliness is poor, the full state of the garbage can at the garbage collection point of each community is unpredictable, the garbage can not be cleared in time after being filled, and the garbage can often overflow to form secondary environmental pollution;
2. the efficiency is low, garbage collection and transportation vehicles need to process garbage points one by one in a sheet area, the working path cannot be optimized, the mileage is long, the occupied man-hour is more, and the energy consumption is high.
Disclosure of Invention
The invention aims to solve the technical problem of providing a task processing method, device and system, which can monitor the state of a target object in real time and realize timely and reasonable processing of the target object.
In order to solve the technical problems, the technical scheme of the invention is as follows:
a method of processing a task, comprising:
acquiring a processing request of at least one target object in a target area, wherein the processing request comprises the position information of the target object;
generating a shortest path for scheduling the target object according to the at least one processing request;
generating a processing task corresponding to at least one target object according to the shortest path;
and sending the processing task to a target object, so that the target object finishes processing at least one target object according to the processing task.
Optionally, generating the shortest path for scheduling the target object according to the at least one processing request includes:
obtaining parameter information of a solving model, wherein the parameter information comprises the following steps: element scale, pheromone factor, heuristic function factor, pheromone volatilization factor, pheromone constant and maximum iteration number;
initializing the parameter information, converting the position information of the target objects in the processing request into at least one distance matrix among the target objects, and constructing a solving space;
and placing m elements in the solving space, solving until a preset condition is reached, outputting a shortest path, wherein m is a positive integer.
Optionally, the processing task includes: the shortest path of at least one target object, the processing time information and the identification information of the target object are connected in series.
Optionally, generating a processing task corresponding to at least one target object according to the shortest path includes:
inquiring the position information of at least one target object;
determining an execution object closest to the at least one target object as a target object; the target object and the target object are positioned in the same target area;
and generating a clearing task according to the identification information of the target object, the time information for processing the target object and the shortest path.
Optionally, the task processing method further includes:
acquiring at least one historical processing task;
determining the utilization rate of at least one target object according to the at least one historical processing task;
and according to the utilization rate, adjusting the position information of the target object with low utilization rate, and re-planning the placement position of the target object in the target area.
Optionally, determining the utilization rate of the at least one target object according to the at least one historical processing task includes:
determining the processed times information of at least one target object in n historical processing tasks, wherein n is a positive integer;
and determining the utilization rate of the target object according to the processed frequency information of the target object.
The invention also provides a task processing device, which comprises:
the acquisition module is used for acquiring a processing request of at least one target object in the target area, wherein the processing request comprises the position information of the target object;
the scheduling module is used for generating a shortest path for scheduling the target object according to the at least one processing request; generating a processing task corresponding to at least one target object according to the shortest path; and sending the processing task to a target object, so that the target object finishes processing at least one target object according to the processing task.
The invention also provides a task processing system, which comprises:
the target comprises a sensor module, a positioning module and a communication module, and is used for sending processing request information to a control center;
the control center is used for receiving a processing request of at least one target object, generating a processing task through a preset algorithm according to the processing request, and sending the processing task to the target object;
the target object comprises a positioning module and a communication module, and is used for receiving a processing task of the control center and completing the processing of at least one target object according to the processing task.
The present invention also provides a computing device comprising: a processor, a memory storing a computer program which, when executed by the processor, performs the method as described above.
The invention also provides a computer readable storage medium storing instructions that, when executed on a computer, cause the computer to perform a method as described above.
The scheme of the invention at least comprises the following beneficial effects:
according to the scheme, the processing request of at least one target object in the target area is obtained, and the processing request comprises the position information of the target object; generating a shortest path for scheduling the target object according to the at least one processing request; generating a processing task corresponding to at least one target object according to the shortest path; and sending the processing task to a target object, so that the target object finishes processing at least one target object according to the processing task. The state of the target object can be monitored in real time, and timely and reasonable treatment of the target object is realized.
Drawings
FIG. 1 is a flow chart of a method of processing tasks according to an embodiment of the invention;
FIG. 2 is an algorithm flow chart of a method of processing tasks of an embodiment of the invention;
FIG. 3 is a schematic diagram of the shortest path of a method of processing tasks according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of site utilization of a method of processing tasks according to an embodiment of the invention;
fig. 5 is a schematic structural diagram of a task processing device according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
As shown in fig. 1, an embodiment of the present invention proposes a task processing method, including:
step 11, obtaining a processing request of at least one target object in a target area, wherein the processing request comprises the position information of the target object;
step 12, generating a shortest path for scheduling the target object according to the at least one processing request;
step 13, generating a processing task corresponding to at least one target object according to the shortest path;
and step 14, the processing task is sent to a target object, so that the target object finishes processing at least one target object according to the processing task.
In this embodiment, a scheduling system for a target object is provided, where the target object may be a dustbin or the like. The target object comprises a sensor, a positioning module, a communication module and the like. When the target object detection reaches a limit state, if the sensor detects that the dustbin is full, a processing request is sent to the control center through the communication module. In the present application, one area includes a plurality of tiles, and one tile includes a plurality of objects. The control center receives the processing requests of a plurality of targets, generates a shortest path for processing the targets through a preset algorithm after receiving the processing requests, generates a processing task by combining time and other information, and sends the task to a target object, such as a garbage truck, wherein the target object processes the targets in the time information in the processing task after receiving the processing task.
In the invention, the target object and the target object are provided with the positioning modules, and are realized mainly by virtue of a GIS (geographic information system), satellite information is acquired through an antenna, and then the modules calculate and analyze the acquired satellite signal parameters, so that the real-time positioning of the target object and the target object is realized.
And the communication function is mainly realized by NB-IOT (narrowband Internet of things) network communication. NB-IOT (narrowband Internet of things) is constructed in a cellular network, is an IOT connection technology contained in LPWA (Low Power consumption Wide area network), and can be used for long-distance data transmission. Moreover, the wireless communication system has the characteristics of wide coverage range, support of a large number of connections, low power consumption and low cost. NB-IOT communication is clearly the best choice for the present invention, which would make the overall task processing system relatively cost-effective.
The sending state and the position information of the target object, the sending position information of the target object and the receiving processing task all need to be communicated, and related information is quickly transferred. The target object, the target object and the control center are mutually interconnected through a communication function to form a large-scale internet of things.
In an alternative embodiment of the present invention, step 12 may include:
step 121, obtaining parameter information of a solution model, wherein the parameter information comprises: element scale, pheromone factor, heuristic function factor, pheromone volatilization factor, pheromone constant and maximum iteration number;
step 122, initializing the parameter information, converting the position information of the target objects in the processing request into at least one distance matrix among the target objects, and constructing a solving space;
and 123, placing m elements in the solving space, and solving until a preset condition is reached, outputting a shortest path, wherein m is a positive integer.
In this embodiment, taking a target object as a dustbin as an example, a task processing method under the following conditions is simulated, that is, an optimal path under a plurality of garbage collection and inventory requests is solved on the same day:
1. the daily garbage collection amount of each garbage collection point is equal; each garbage collection point is only collected and transported once a day; the garbage collection and transportation vehicle receives a dispatching task every morning;
2. the road between any two points is unobstructed;
3. the daily yield and daily cleaning of the garbage at each collecting point are realized, and a signal to be received and transported is sent to the control center only when the garbage overflows;
4. the cost of the garbage collection and transportation vehicle is in direct proportion to the walking Cheng Changduan of the garbage collection and transportation vehicle;
assuming that there are 33 garbage can bodies in a certain area, 31 garbage cans send out a receiving and transporting request signal to a control center, and the coordinates of the request garbage cans are [1304 2312, 3639 1315, 4177 2244, 3712 1399, 3488 1535, 3326 1556, 3238 1229, 4196 1004, 4312 790, 4386 570, 3007 1970, 2562 1756, 2788 1491, 2381 1676, 1332 695, 3715 1678, 3918 2179, 4061 2370, 3780 2212, 3676 2578, 4029 2838, 4263 2931, 3429 1908, 3507 2367, 3394 2643, 3439 3201, 2935 3240, 3140 3550, 2545 2357, 2778 2826 and 2370 2975]. The problem is solved by a preset algorithm as shown in fig. 2.
Firstly, initializing parameter information, wherein the parameter information is set as m=50 of ants (namely the number of the elements) and is a pheromone factorα=1, heuristic factor β=5, pheromone evaporation coefficient ρ=0.1, maximum number of iterations g=200, pheromone increase intensity coefficient q=100. Simultaneously initializing the pheromone concentration of each side on a directed graph formed by 31 sitesWhereinInitializing pheromone concentration on each side, m is the number of ants,Is the path length of the locally optimal solution obtained by a greedy algorithm.
After parameter initialization, a solution space is constructed, m ants are randomly placed on 31 sites, and the probability that each ant goes to other sites is calculated by the following formula:
wherein, the liquid crystal display device comprises a liquid crystal display device,is the probability that ant k goes to site j at current site i,Is a sideThe amount of the pheromone,In order for the heuristic information to be relevant,whereinDistance of side ij, alpha is pheromone factor, beta is heuristic factor,Is made of antAnt k can arrive directly at site i and does not walk on the path vector traversed by ant kA set of paths for stations in (a).
And determining the site with the highest probability obtained by the formula as the next site to which the ant k goes at the current site i until the ant accesses 31 sites, and sequentially obtaining 50 paths constructed by 50 ants at the current round. The pheromone content on cities i through j after this round of circulation is calculated by the following formula:
wherein, the liquid crystal display device comprises a liquid crystal display device,represents the pheromone content from station i to station j after the t+1st cycle,Representing the content of pheromone from station i to station j after the t-th cycle, wherein ρ is the evaporation coefficient of the pheromone,Representing the newly added pheromone content from station i to station j of the current circulation.
Wherein, the liquid crystal display device comprises a liquid crystal display device,whereinRepresenting the pheromone content left by the kth ant on path ij,whereinIs a path vectorIs the total length of (2)。
After the pheromone content is updated, the iteration is completed, the optimal path of the iteration is recorded, and the tabu table is cleared. Judging whether the maximum iteration times are reached, if not, continuing to repeat the steps: constructing a path vector, updating the pheromone content until the maximum iteration number is reached, and outputting an optimal path. The optimal path diagram among n sites is shown in fig. 3.
In an alternative embodiment of the present invention, the processing task includes: the shortest path of at least one target object, the processing time information and the identification information of the target object are connected in series.
In this embodiment, taking garbage can cleaning as an example, after the control center generates the shortest path according to the position information of a plurality of objects to be processed, processing tasks are generated according to the time required to be cleaned by the garbage can and specific objects that can clean the objects, such as garbage cleaning vehicles.
In an alternative embodiment of the present invention, step 13 may include:
step 131, inquiring the position information of at least one target object;
step 132, determining an execution object closest to the at least one target object as a target object; the target object and the target object are positioned in the same target area;
and step 133, generating a clearance task according to the identification information of the target object, the time information for processing the target object and the shortest path.
In this embodiment, when processing a target object, it is necessary to query a target object that belongs to a region identical to the target object, and select an object closest to the target object to process the target object.
In an alternative embodiment of the present invention, the method further includes:
acquiring at least one historical processing task;
determining the utilization rate of at least one target object according to the at least one historical processing task;
and according to the utilization rate, adjusting the position information of the target object with low utilization rate, and re-planning the placement position of the target object in the target area.
In an alternative embodiment of the present invention, determining the utilization of at least one target object according to the at least one historical processing task includes:
determining the processed times information of at least one target object in n historical processing tasks, wherein n is a positive integer;
and determining the utilization rate of the target object according to the processed frequency information of the target object.
In this embodiment, as shown in fig. 4, the number of times of processing a plurality of objects included in the history processing task may be counted according to a plurality of history processing tasks, and the position of the object with a lower utilization rate in the region of the object may be optimized by reflecting the utilization rate of the object by the processing frequency of the object. The method and the system realize optimization of the target object point positions while optimizing the target object scheduling mode, so that the task processing system is more reasonable and efficient.
According to the embodiment of the invention, the garbage can is used as a target object, and the garbage truck is used as a complete treatment process of the target object, wherein the complete treatment process comprises the following steps:
the task processing system includes: the garbage can comprises a garbage can body (comprising a state sensor module, a positioning module and a communication module), a garbage truck (comprising a positioning module and a communication module), a control center, a communication network and the like.
In the system, the garbage truck and the garbage can body are used as nodes of a network and have own position information. The position information of the dustbin body is usually fixed, and the position of the clearing car changes in real time. Each dustbin and each clearing vehicle are provided with a GIS positioning module, and positioning information is generated by receiving GIS satellite signals. The dustbin body is an intelligent unit, the state of the dustbin body is detected in real time, and when the situation that the dustbin is overflowed, the dustbin communication module sends a dustbin overflow clearance request containing position information to the control center through a network.
After receiving the garbage can clearing request, the control center marks the state of the garbage can as to be cleared, then inquires the position information of each empty garbage clearing vehicle, and generates clearing dispatching tasks (time requirements, shortest paths and the like) according to the current position information of the clearing vehicle. Each garbage truck is responsible for the clearance of a plurality of garbage sites, and the optimal working path of the garbage truck is calculated and judged at any time by a control center running optimization algorithm. And after receiving the clearing task, clearing the garbage cans overflowed by the garbage sites in the clearing task according to the optimized path information of the control center. And uploading the garbage can mark to a control center after the clearing task of each garbage can is completed, and converting the garbage can mark into a normal use state. The garbage truck also uploads information to the control center after loading the garbage truck to the full capacity, is set to be full capacity mark, and then directly goes to the garbage disposal center, and no longer receives the garbage disposal task. After the unloading is completed, the state mark of the clearance vehicle is restored to be empty, and the clearance task can be continuously accepted.
According to the embodiment of the invention, the temporary shortest path for executing the collection and transportation task on the plurality of garbage cans to be collected and transported in the target area every day is found through an algorithm. The control center can dynamically calculate the dispatching tasks of the day according to the number and the positions of the bodies of the garbage cans to be received. The flexibility and the rationality of the receiving and transporting route are greatly improved, so that the efficiency of garbage receiving and transporting is improved, the receiving and transporting route is optimized, and the receiving and transporting cost is reduced; meanwhile, through statistics (utilization rate) of the collection and transportation times of the dustbin stations, the distribution point positions of the dustbin are optimized, and the garbage collection and transportation route is planned again.
As shown in fig. 5, an embodiment of the present invention further provides a task processing device 50, including:
an obtaining module 51, configured to obtain a processing request of at least one target object in a target area, where the processing request includes location information of the target object;
a scheduling module 52, configured to generate, according to the at least one processing request, a shortest path for scheduling the target object; generating a processing task corresponding to at least one target object according to the shortest path; and sending the processing task to a target object, so that the target object finishes processing at least one target object according to the processing task.
Optionally, a processing request of at least one target object in the target area is acquired, wherein the processing request contains the position information of the target object;
generating a shortest path for scheduling the target object according to the at least one processing request;
generating a processing task corresponding to at least one target object according to the shortest path;
and sending the processing task to a target object, so that the target object finishes processing at least one target object according to the processing task.
Optionally, generating the shortest path for scheduling the target object according to the at least one processing request includes:
obtaining parameter information of a solving model, wherein the parameter information comprises the following steps: ant colony scale, pheromone factor, heuristic function factor, pheromone volatilization factor, pheromone constant and maximum iteration number;
initializing the parameter information, converting the position information of the target objects in the processing request into at least one distance matrix among the target objects, and constructing a solving space;
and (3) placing m ants in the solving space, solving until the preset condition is reached, and outputting the shortest path.
Optionally, the processing task includes: the shortest path of at least one target object, the processing time information and the identification information of the target object are connected in series.
Optionally, generating a processing task corresponding to at least one target object according to the shortest path includes:
inquiring the position information of at least one target object;
determining an execution object closest to the at least one target object as a target object; the target object and the target object are positioned in the same target area;
and generating a clearing task according to the identification information of the target object, the time information for processing the target object and the shortest path.
Optionally, the obtaining module 51 is further configured to:
acquiring at least one historical processing task;
determining the utilization rate of at least one target object according to the at least one historical processing task;
and according to the utilization rate, adjusting the position information of the target object with low utilization rate, and re-planning the placement position of the target object in the target area.
Optionally, determining the utilization rate of the at least one target object according to the at least one historical processing task includes:
determining the processed times information of at least one target object in n historical processing tasks;
and determining the utilization rate of the target object according to the processed frequency information of the target object.
It should be noted that, the device is a device corresponding to the above method, and all implementation manners in the above method embodiments are applicable to the embodiment of the device, so that the same technical effects can be achieved.
The embodiment of the invention also provides a task processing system, which comprises:
the target comprises a sensor module, a positioning module and a communication module, and is used for sending processing request information to a control center;
the control center is used for receiving a processing request of at least one target object, generating a processing task through a preset algorithm according to the processing request, and sending the processing task to the target object;
the target object comprises a positioning module and a communication module, and is used for receiving a processing task of the control center and completing the processing of at least one target object according to the processing task.
All the implementation manners in the above embodiments are applicable to the embodiment of the system, and the same technical effects can be achieved.
Embodiments of the present invention also provide a computing device comprising: a processor, a memory storing a computer program which, when executed by the processor, performs the method as described above. All the implementation manners in the method embodiment are applicable to the embodiment, and the same technical effect can be achieved.
Embodiments of the present invention also provide a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform a method as described above. All the implementation manners in the method embodiment are applicable to the embodiment, and the same technical effect can be achieved.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk, etc.
Furthermore, it should be noted that in the apparatus and method of the present invention, it is apparent that the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent aspects of the present invention. Also, the steps of performing the series of processes described above may naturally be performed in chronological order in the order of description, but are not necessarily performed in chronological order, and some steps may be performed in parallel or independently of each other. It will be appreciated by those of ordinary skill in the art that all or any of the steps or components of the methods and apparatus of the present invention may be implemented in hardware, firmware, software, or a combination thereof in any computing device (including processors, storage media, etc.) or network of computing devices, as would be apparent to one of ordinary skill in the art after reading this description of the invention.
The object of the invention can thus also be achieved by running a program or a set of programs on any computing device. The computing device may be a well-known general purpose device. The object of the invention can thus also be achieved by merely providing a program product containing program code for implementing said method or apparatus. That is, such a program product also constitutes the present invention, and a storage medium storing such a program product also constitutes the present invention. It is apparent that the storage medium may be any known storage medium or any storage medium developed in the future. It should also be noted that in the apparatus and method of the present invention, it is apparent that the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent aspects of the present invention. The steps of executing the series of processes may naturally be executed in chronological order in the order described, but are not necessarily executed in chronological order. Some steps may be performed in parallel or independently of each other.
While the foregoing is directed to the preferred embodiments of the present invention, it will be appreciated by those skilled in the art that various modifications and adaptations can be made without departing from the principles of the present invention, and such modifications and adaptations are intended to be comprehended within the scope of the present invention.

Claims (10)

1. A method for processing a task, comprising:
acquiring a processing request of at least one target object in a target area, wherein the processing request comprises the position information of the target object;
generating a shortest path for scheduling the target object according to the at least one processing request;
generating a processing task corresponding to at least one target object according to the shortest path;
and sending the processing task to a target object, so that the target object finishes processing at least one target object according to the processing task.
2. The method according to claim 1, wherein generating a shortest path for scheduling the target object according to the at least one processing request, comprises:
obtaining parameter information of a solving model, wherein the parameter information comprises the following steps: element scale, pheromone factor, heuristic function factor, pheromone volatilization factor, pheromone constant and maximum iteration number;
initializing the parameter information, converting the position information of the target objects in the processing request into at least one distance matrix among the target objects, and constructing a solving space;
and placing m elements in the solving space, solving until a preset condition is reached, outputting a shortest path, wherein m is a positive integer.
3. The method for processing a task according to claim 1, wherein the processing the task includes: the shortest path of at least one target object, the processing time information and the identification information of the target object are connected in series.
4. A method of task processing according to claim 3, wherein generating a processing task corresponding to at least one object based on the shortest path comprises:
inquiring the position information of at least one target object;
determining an execution object closest to the at least one target object as a target object; the target object and the target object are positioned in the same target area;
and generating a clearing task according to the identification information of the target object, the time information for processing the target object and the shortest path.
5. The method for processing a task according to claim 1, further comprising:
acquiring at least one historical processing task;
determining the utilization rate of at least one target object according to the at least one historical processing task;
and according to the utilization rate, adjusting the position information of the target object with low utilization rate, and re-planning the placement position of the target object in the target area.
6. The method of task processing according to claim 5, wherein determining the utilization of at least one object based on the at least one historical processing task comprises:
determining the processed times information of at least one target object in n historical processing tasks, wherein n is a positive integer;
and determining the utilization rate of the target object according to the processed frequency information of the target object.
7. A task processing device, comprising:
the acquisition module is used for acquiring a processing request of at least one target object in the target area, wherein the processing request comprises the position information of the target object;
the scheduling module is used for generating a shortest path for scheduling the target object according to the at least one processing request; generating a processing task corresponding to at least one target object according to the shortest path; and sending the processing task to a target object, so that the target object finishes processing at least one target object according to the processing task.
8. A system for processing a task, comprising:
the target comprises a sensor module, a positioning module and a communication module, and is used for sending processing request information to a control center;
the control center is used for receiving a processing request of at least one target object, generating a processing task through a preset algorithm according to the processing request, and sending the processing task to the target object;
the target object comprises a positioning module and a communication module, and is used for receiving a processing task of the control center and completing the processing of at least one target object according to the processing task.
9. A computing device, comprising: a processor, a memory storing a computer program which, when executed by the processor, performs the method of any one of claims 1 to 6.
10. A computer readable storage medium storing instructions which, when run on a computer, cause the computer to perform the method of any one of claims 1 to 6.
CN202310848979.7A 2023-07-12 2023-07-12 Task processing method, device and system Pending CN116562490A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310848979.7A CN116562490A (en) 2023-07-12 2023-07-12 Task processing method, device and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310848979.7A CN116562490A (en) 2023-07-12 2023-07-12 Task processing method, device and system

Publications (1)

Publication Number Publication Date
CN116562490A true CN116562490A (en) 2023-08-08

Family

ID=87498682

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310848979.7A Pending CN116562490A (en) 2023-07-12 2023-07-12 Task processing method, device and system

Country Status (1)

Country Link
CN (1) CN116562490A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109840685A (en) * 2018-12-24 2019-06-04 上海成生科技有限公司 A kind of method and apparatus of refuse collection
CN109974711A (en) * 2019-04-12 2019-07-05 重庆渝博创智能装备研究院有限公司 A kind of AGV multiple target point autonomous navigation method towards wisdom factory
CN114970925A (en) * 2021-02-26 2022-08-30 华晨宝马汽车有限公司 Method and system for optimizing logistics scheduling
WO2023029188A1 (en) * 2021-08-31 2023-03-09 南京天溯自动化控制系统有限公司 Path planning method and apparatus, and device and storage medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109840685A (en) * 2018-12-24 2019-06-04 上海成生科技有限公司 A kind of method and apparatus of refuse collection
CN109974711A (en) * 2019-04-12 2019-07-05 重庆渝博创智能装备研究院有限公司 A kind of AGV multiple target point autonomous navigation method towards wisdom factory
CN114970925A (en) * 2021-02-26 2022-08-30 华晨宝马汽车有限公司 Method and system for optimizing logistics scheduling
WO2023029188A1 (en) * 2021-08-31 2023-03-09 南京天溯自动化控制系统有限公司 Path planning method and apparatus, and device and storage medium

Similar Documents

Publication Publication Date Title
Ali et al. IoT-based smart waste bin monitoring and municipal solid waste management system for smart cities
CN105631546A (en) Waste collection and transportation system based on big data processing and method thereof
CN101557647B (en) Farmland pollution area following system by wireless sensor network and method thereof
CN103678917A (en) Bus real-time arrival time predicting method based on simulated annealing algorithm
CN104113868A (en) Crowdsourcing maintenance-based indoor position fingerprint database establishment method and system
CN109916413A (en) Road matching method, system, device and storage medium based on grid dividing
CN108108926A (en) A kind of shared bicycle scheduling system and dispatching method based on big data
CN101035041A (en) Node invalidation and pre-alarming method of radio sensor network based on Bays method
Zhu et al. Solar photovoltaic generation for charging shared electric scooters
CN114019831A (en) Water resource monitoring Internet of things platform
CN101047591A (en) Remote monitoring system and method for radioactive source
CN108462965A (en) Share planing method in a kind of steel tower demand site
CN112938213A (en) Intelligent environmental sanitation management method and system based on Internet of things and storage medium
CN101998383A (en) Wireless network signal collecting and verifying system
CN105307262A (en) Positioning method and device for pseudo base station
CN116562490A (en) Task processing method, device and system
US20100311173A1 (en) Procedure and System for the Agricultural Evaluation of Livestock Excrement
CN110356736A (en) A kind of intelligent garbage collecting box and its information management system
CN105761037A (en) Logistics scheduling method based on space reverse neighbor search under cloud computing environment
CN112114386B (en) High-time-space resolution microwave rainfall monitoring method
Dios et al. A mixed top-down and bottom-up methodology in spatial segregation of emissions based on GIS tools
CN103024731B (en) Method for determining number attribution, server and mobile terminal
CN115392569A (en) Electric vehicle charging station site selection and volume fixing method and system
CN112529311B (en) Road flow prediction method and device based on graph convolution analysis
CN114118615A (en) Intelligent garbage clearing and dispatching method and related equipment

Legal Events

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