CN114116182A - Disinfection task allocation method and device, storage medium and equipment - Google Patents
Disinfection task allocation method and device, storage medium and equipment Download PDFInfo
- Publication number
- CN114116182A CN114116182A CN202210103553.4A CN202210103553A CN114116182A CN 114116182 A CN114116182 A CN 114116182A CN 202210103553 A CN202210103553 A CN 202210103553A CN 114116182 A CN114116182 A CN 114116182A
- Authority
- CN
- China
- Prior art keywords
- killing
- area
- killed
- preset
- task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/55—Detecting local intrusion or implementing counter-measures
- G06F21/56—Computer malware detection or handling, e.g. anti-virus arrangements
- G06F21/568—Computer malware detection or handling, e.g. anti-virus arrangements eliminating virus, restoring damaged files
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Virology (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a killing task allocation method, a killing task allocation device, a storage medium and equipment, wherein the method comprises the following steps: acquiring a boundary box generated by framing a preset killing map by a user; determining the to-be-killed area framed by the boundary frame according to the boundary frame, and calculating the area of the to-be-killed area and the average killing difficulty coefficient of the killing target object in the to-be-killed area; determining the number of killing personnel corresponding to the area to be killed according to the area of the area to be killed and the average killing difficulty coefficient; and allocating killing tasks according to the number of the killing personnel and the identification information corresponding to the area to be killed. According to the invention, the area of the killing area and the corresponding killing difficulty are combined, the killing difficulty is confirmed by the killing difficulty coefficient of each target object in the area, and the corresponding number of killing people is dynamically adjusted to adaptively adjust the number of killing people, so that the killing area is more matched with the number of killing people, and the technical problem of unreasonable distribution of killing tasks can be effectively solved.
Description
Technical Field
The invention relates to the technical field of killing tasks, in particular to a killing task allocation method, a killing task allocation device, a storage medium and equipment.
Background
In the process of infectious diseases or epidemic situations or in the process of ordinary disease prevention, related departments generally need to arrange disinfection personnel to go to a specific place for disinfection and sterilization, so that disinfection and sterilization tasks need to be distributed regularly or temporarily.
In the prior art, at present, a person in charge is mainly used for dispatching a killing task, or a fixed number of killing people is arranged in each area, or the person in charge distributes the number of killing people in each area by subjective consciousness, however, the environment of each area is different, and the manual task distribution mode obviously has the defect of unreasonable task distribution. Meanwhile, the killing task is manually distributed at present, so that the efficiency and the intelligent degree are low, and the experience feeling is poor.
Disclosure of Invention
Based on this, the invention aims to provide a killing task allocation method, a killing task allocation device, a storage medium and equipment, so as to solve the technical problem that the existing killing task allocation is unreasonable.
According to the embodiment of the invention, the killing task allocation method comprises the following steps:
acquiring a boundary frame generated by framing on a preset killing map by a user, and judging whether the boundary frame is intersected with a preset killing target object on the preset killing map;
if so, adjusting the boundary frame to ensure that the boundary frame does not intersect with the killing target object;
determining the to-be-killed area framed by the boundary frame according to the boundary frame, and calculating the area of the to-be-killed area and the average killing difficulty coefficient of the killing target object in the to-be-killed area;
determining the number of killing personnel corresponding to the area to be killed according to the area of the area to be killed and the average killing difficulty coefficient;
and allocating killing tasks according to the number of the killing personnel and the identification information corresponding to the area to be killed.
In addition, the killing task allocation method according to the above embodiment of the present invention may further have the following additional technical features:
further, the step of calculating the killing difficulty coefficient of the killing target object in the area to be killed specifically comprises:
acquiring all the killing target objects in the area to be killed, and determining a preset killing difficulty value corresponding to each killing target object;
and calculating the average killing difficulty coefficient of the killing target objects in the area to be killed according to the preset killing difficulty value corresponding to each killing target object.
Further, the step of determining the number of the killing staff corresponding to the area to be killed according to the area of the area to be killed and the average killing difficulty coefficient comprises the following steps:
determining the corresponding preset number of people according to the area of the area to be killed;
and determining the number of the killing personnel corresponding to the area to be killed according to the average killing difficulty coefficient and the preset personnel number and by adopting a rounding counting rule.
Further, the step of adjusting the bounding box not to intersect with the killing target object comprises:
and shifting the intersecting part of the bounding box and the killing target object outwards or inwards so as to be not intersected with the killing target object.
Further, the step of allocating the killing task according to the number of the killing personnel and the identification information corresponding to the area to be killed comprises the following steps:
according to a selection mode closer to a to-be-killed area, selecting target killing personnel with the number corresponding to the number of the killing personnel from the currently idle killing personnel, and dispatching a killing task containing identification information of the to-be-killed area to a terminal of the target killing personnel.
Further, after the step of obtaining a bounding box generated by the user in the frame selection on the preset killing map, the method further comprises the following steps:
acquiring parameters of the bounding box, wherein the parameters comprise one or more of shape, color and frame line width;
and determining a corresponding preset killing task type according to the parameters of the boundary frame, and determining a corresponding preset killing target object according to the killing task type.
Further, the step of allocating the killing task according to the number of the killing personnel and the identification information corresponding to the area to be killed comprises the following steps:
and distributing the killing tasks according to the killing task types, the number of the killing personnel and the identification information corresponding to the area to be killed.
According to an embodiment of the invention, the killing task distribution device comprises:
the boundary frame judging module is used for acquiring a boundary frame generated by framing on a preset killing map by a user and judging whether the boundary frame is intersected with a preset killing target object on the preset killing map;
the boundary frame adjusting module is used for adjusting the boundary frame to enable the boundary frame to be not intersected with a preset killing target object on the preset killing map when the boundary frame is judged to be intersected with the preset killing target object;
the coefficient calculation module is used for determining the to-be-killed area framed and selected by the boundary frame according to the boundary frame, and calculating the area of the to-be-killed area and the killing difficulty coefficient of the killing target object in the to-be-killed area;
the number determining module is used for determining the number of the killing personnel corresponding to the area to be killed according to the area of the area to be killed and the killing difficulty coefficient;
and the task allocation module is used for allocating killing tasks according to the number of the killing personnel and the identification information corresponding to the area to be killed.
The present invention also provides a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the above-described killing task allocation method.
The invention also provides a killing task allocation device which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor executes the program to realize the killing task allocation method.
Compared with the prior art: by combining the area of the killing area and the corresponding killing difficulty, the killing difficulty is confirmed by the killing difficulty coefficient of each target object in the area, the corresponding number of killing people is dynamically adjusted, the number of killing people is adaptively adjusted, the killing area is matched with the number of killing people, the technical problem that the task distribution of killing is unreasonable can be effectively solved, meanwhile, the intelligent distribution of the killing task is realized, a user only needs to perform one-step frame selection operation, the adaptive killing task distribution is automatically completed by the system, the efficiency and the intelligent degree of the task distribution of killing are improved, and the experience is improved.
Drawings
Fig. 1 is a schematic structural diagram of a killing task allocation system according to an embodiment of the present invention;
FIG. 2 is a flowchart of a killing task allocation method according to a first embodiment of the present invention;
FIG. 3 is a flowchart of a killing task allocation method according to a second embodiment of the present invention;
FIG. 4 is a schematic structural diagram of a task assigning apparatus for killing according to a third embodiment of the present invention;
fig. 5 is a schematic structural diagram of a killing task assigning apparatus according to a fourth embodiment of the present invention.
The following detailed description will further illustrate the invention in conjunction with the above-described figures.
Detailed Description
To facilitate an understanding of the invention, the invention will now be described more fully with reference to the accompanying drawings. Several embodiments of the invention are presented in the drawings. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete.
It will be understood that when an element is referred to as being "secured to" another element, it can be directly on the other element or intervening elements may also be present. When an element is referred to as being "connected" to another element, it can be directly connected to the other element or intervening elements may also be present. The terms "vertical," "horizontal," "left," "right," and the like as used herein are for illustrative purposes only.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
The following embodiments can be applied to the killing task distribution system shown in fig. 1, where the killing task distribution system shown in fig. 1 includes a server and a killing person terminal.
In specific implementation, the killing personnel terminal can be in communication connection with the server based on a 4G or 5G network so as to receive a killing task issued by the server. In specific implementation, each disinfection and killing person can be equipped with a terminal (not limited to a mobile phone, a smart watch and the like), and the disinfection and killing person can check the disinfection and killing task issued by the server on the terminal and know the disinfection and killing task in time, for example, check the range of a region to be disinfected and killed in the disinfection and killing task.
In addition, the supervisor of the assignment task can operate on the server to assign the killing task, for example, perform box selection on the killing map of the server. Or, in another embodiment, a terminal may be assigned to the supervisor, and the supervisor may operate on the terminal to assign the killing task, where the assigned killing task may be sent to the killing person terminal directly or indirectly through the server. The principle and process of allocating the killing task will be described in detail in the killing task allocation method in the following embodiments.
It should be noted that the configuration shown in FIG. 1 is not intended to be limiting, and in other embodiments, the task assigning system may include fewer or more components than shown, or some components may be combined, or a different arrangement of components.
Example one
Referring to fig. 2, a killing task allocation method according to a first embodiment of the present invention is shown, and is applied to a killing task allocation device, where the killing task allocation device may be the server or the supervisor terminal, and the method specifically includes steps S01-S05.
Step S01, acquiring a boundary frame generated by framing on a preset killing map by a user, and judging whether the boundary frame is intersected with a preset killing target object on the preset killing map.
When the boundary frame is judged to be intersected with a preset killing target object on the preset killing map, executing the steps S02-S05; and executing the steps S03-S05 when the boundary frame is judged not to be intersected with the preset killing target object on the preset killing map.
Specifically, the preset killing map may be a general navigation map, such as a high-grade map, a Baidu map, or the like. Or may be a separately built internal map. In specific implementation, a supervisor can select an area to be killed on the killing map by using a finger, a touch pen, a mouse and the like, and at this time, a corresponding boundary frame is formed on the killing map. After the boundary frame is obtained, the system can automatically judge whether the boundary frame is intersected with a preset killing target object on a preset killing map, if so, the boundary frame is adjusted first and then the area to be killed is determined, and if not, the area to be killed is directly determined.
The killing target object is a preset object (or called target) needing killing, the killing target object can be but not limited to a railway station, a subway station, a park, an office building and the like, and dynamic adjustment can be performed according to different killing task requirements.
And step S02, adjusting the bounding box to ensure that the bounding box does not intersect with the killing target object.
Specifically, the manner of adjusting the bounding box may be any one of the following two manners:
1) shifting the whole boundary frame outwards or inwards, and determining a shifting distance according to the intersection position of the boundary frame and the killing target object, or shifting in multiple steps and shifting each step by a fixed distance until the boundary frame and the killing target object do not intersect;
2) and the part of the boundary frame intersected with the killing target object is outwards or inwards shifted, namely, only the intersected part is adjusted, so that the boundary frame can be quickly adjusted to be not intersected with the killing target object.
And step S03, determining the to-be-killed area framed by the boundary box according to the boundary box, and calculating the area of the to-be-killed area and the average killing difficulty coefficient of the killing target object in the to-be-killed area.
It should be understood that different killing targets have different killing difficulties, for example, the floors of an office building are numerous, and it is obviously unreasonable if only the floor area is considered, so that the number of killing people in the office building can be determined according to the floor number of the office building and the preset killing difficulty, for example, the preset difficulty coefficient is 2.4, and then the number of killing people can be determined according to the floor area and then multiplied by the difficulty coefficient 2.4, thereby finally determining the number of killing people in the office building; in a similar way, although the park occupies a larger area, the park only needs to kill the ground surface, the air fluidity is better, the dead angle is less, the overall killing is easier, and therefore, the difficulty coefficient can be preset to be 0.8. The above two different exemplary scenarios are only examples, and there are actually more scenarios, and in practice, the corresponding difficulty coefficients may be set according to the specific situation of each disinfection target object, so as to obtain the preset disinfection difficulty coefficients corresponding to various disinfection target objects, and a mapping table in which the disinfection target objects and the disinfection difficulty coefficients are in one-to-one correspondence may be established, and then the disinfection difficulty coefficients of each disinfection target object in the area to be disinfected may be determined from the mapping table, and then the average value of the disinfection difficulty coefficients of each disinfection target object is obtained, so as to obtain the average disinfection difficulty coefficient.
In specific implementation, the killing difficulty coefficient of the target object which is not to be killed can be calibrated through experiments, and the experiment mode can be, for example: the method comprises the steps of arranging the same group of people to kill different killing objects with close floor areas according to the same killing method, recording the killing time required by the different killing objects, and then confirming the killing difficulty coefficient corresponding to the killing objects according to the proportional relation between the killing time required by the different killing objects, wherein the killing time required by the same group of people is 1 hour, and the killing time required by an office building is 3 hours (the killing time corresponding to floors of different office buildings is different and can be respectively calibrated or deduced), for example, the killing difficulty coefficient of the office building is set to be 2.4 if the killing difficulty coefficient of the park is set to be 0.8. After the initial calibration, in the actual killing process, the preset killing difficulty coefficient can be dynamically adjusted, and in addition, the subsequent killing number corresponding to different killing areas and the killing difficulty coefficient corresponding to different killing task types can also be experimentally calibrated according to the time proportional method.
And step S04, determining the number of the killing personnel corresponding to the area to be killed according to the area of the area to be killed and the killing difficulty coefficient.
Specifically, the number of corresponding persons can be preset respectively for different killing areas, a mapping table of one-to-one correspondence between the killing areas and the number of persons is established, the number of preset persons corresponding to the area of the area to be killed can be determined from the mapping table subsequently, and then the number of preset persons is multiplied by the killing difficulty coefficient, so that the number of killing persons corresponding to the area to be killed is recorded.
And step S05, allocating killing tasks according to the number of the killing personnel and the identification information of the corresponding to-be-killed areas.
The identification information of the area to be killed is mainly convenient for a killer to determine the area to be killed, and specifically, the identification information of the area to be killed can be positioning information, such as boundary coordinates of the area to be killed or coordinates of each killing target object in the area to be killed; or, the identification information of the area to be killed may be the boundary frame, and since the killing personnel terminals generally share a preset killing map (both server maps), the boundary frame is consistent in the area to be killed framed on the killing task distribution device and the map of the killing personnel terminals, so that the killing personnel can determine the area to be killed conveniently.
Specifically, the step of allocating the killing task according to the number of the killing staff and the identification information corresponding to the area to be killed may specifically include:
according to a selection mode closer to a to-be-killed area, selecting target killing personnel with the number corresponding to the number of the killing personnel from the currently idle killing personnel, and dispatching a killing task containing identification information of the to-be-killed area to a terminal of the target killing personnel.
After the number of people and the area are determined, the system can acquire the position information of each currently idle killing person, then pick out the target killing person with the corresponding number of people from the position information of the currently idle killing person to participate in the killing of the area, and distribute the killing task containing the identification information of the area to the terminal of the target killing person.
It should be noted that, during normal work, the sterilizer terminal reports the current positioning information and the task state of the sterilizer to the server in real time, and the server can determine whether the corresponding sterilizer is idle according to the task state.
In summary, in the killing task allocation method in the above embodiments of the present invention, the area of the killing area and the corresponding killing difficulty are combined, the killing difficulty is determined by the killing difficulty coefficient of each target object in the area, and the corresponding number of killing people is dynamically adjusted to adaptively adjust the number of killing people, so that the killing area and the number of killing people are more matched, and the technical problem of unreasonable allocation of the killing tasks can be effectively solved.
Example two
Referring to fig. 3, a killing task allocation method according to a second embodiment of the present invention is shown, and is applied to a killing task allocation device, where the killing task allocation device may be the server or the supervisor terminal, and the method specifically includes steps S11-S18.
Step S11, acquiring a boundary frame generated by framing on a preset killing map by a user, and judging whether the boundary frame is intersected with a preset killing target object on the preset killing map.
When the boundary frame is judged to be intersected with a preset killing target object on the preset killing map, executing the steps S12-S18; and executing the steps S13-S18 when the boundary frame is judged not to be intersected with the preset killing target object on the preset killing map.
And step S12, shifting the intersecting part of the bounding box and the killing target outwards or inwards to make the intersecting part not intersect with the killing target.
And step S13, determining the to-be-killed area framed by the boundary box according to the boundary box, and calculating the area of the to-be-killed area.
Specifically, for the boundary box with a regular shape, the area of the area to be killed can be directly calculated according to the length, the width, the radius and the like of the boundary box. For the irregular-shaped bounding box, the connected domain area algorithm can be adopted to calculate the connected domain area of the bounding box to obtain the area of the area to be killed, and for the purpose of ensuring the accuracy of the calculation of the connected domain area, the bounding box can be transferred into a blank image (white background) one by one, and then the connected domain area calculation is carried out on the bounding box in the blank image, so that the interference of noise points of other elements on the map is avoided, and the accuracy of the area calculation is ensured.
Step S14, all the killing target objects in the area to be killed are obtained, and a preset killing difficulty value corresponding to each killing target object is determined.
Step S15, calculating the average killing difficulty coefficient of the killing target objects in the area to be killed according to the preset killing difficulty value corresponding to each killing target object in the area to be killed.
And step S16, determining the corresponding preset number of people according to the area of the area to be killed.
And step S17, determining the number of the killing personnel corresponding to the area to be killed according to the average killing difficulty coefficient and the preset personnel number and by adopting a rounding counting rule.
For example, a park has a floor area of 983m2And the number of the corresponding preset personnel is 9, the killing difficulty coefficient of the park is 0.8, 9 x 0.8=7.2, and then the number of the actual killing personnel in the park is 7.
And step S18, selecting target killing personnel with the number corresponding to the number of the killing personnel from the currently idle killing personnel according to a selection mode closer to the area to be killed, and dispatching a killing task containing the identification information of the area to be killed to the terminal of the target killing personnel.
In addition, in some optional embodiments of the present invention, after the step of obtaining the bounding box generated by the user by framing on the preset killing map, the method further includes:
acquiring parameters of the bounding box, wherein the parameters comprise one or more of shape, color and frame line width;
and determining a corresponding preset killing task type according to the parameters of the boundary frame, and determining a corresponding preset killing target object according to the killing task type.
It should be noted that, in the actual killing process, different killing task types may exist, for example, the killing task type may be a killing task grade, for example, a normalized killing task, an emphasized killing task, and the like, or the killing task type may also be divided according to disease prevention types, for example, a new crown killing task, a hand-foot-and-mouth killing task, an influenza killing task, and the like. And different killing task types may correspond to different killing targets, for example, normalized killing only can kill public occasions with a lot of people flow such as railway stations, streets and the like, and does not kill office buildings, restaurants and the like in the areas, so that in specific implementation, the corresponding killing targets can be preset for different killing task types, and the parameters of the corresponding bounding boxes are preset for different killing task types, so that a user can define the areas to be killed by the bounding boxes with different parameters, and the system can know the current killing task type of the areas to be killed according to the parameters of the bounding boxes, and then confirms which are the killing targets, thereby calculating the average killing difficulty coefficient of the areas to be killed, and completing the final killing task allocation.
In addition, in other embodiments, each killing task type may also be assigned a corresponding killing difficulty coefficient, and then the number of killing persons corresponding to the area to be killed may be determined according to the area of the area to be killed, the killing difficulty coefficient determined by the killing task type, and the killing difficulty coefficient determined by the killing target object, and using a rounding-off counting rule, for example, the floor area of a park is 983m2The number of the corresponding preset persons is 9, the killing difficulty coefficient of the park is 0.8, the type of the killing task is the key killing, the difficulty coefficient of the key killing is 1.5, 9 is 0.8 is 1.5=10.8, and then the actual killing persons in the park are killed in the parkThe number of members is 11, so that the final killing task distribution can be more reasonable.
On this basis, the step of allocating the killing task according to the number of the killing persons and the identification information corresponding to the area to be killed may specifically include:
and distributing the killing tasks according to the killing task types, the number of the killing personnel and the identification information corresponding to the area to be killed. The more concrete implementation steps are as follows:
according to a selection mode closer to an area to be killed, selecting target killing personnel with the number corresponding to the number of the killing personnel from the currently idle killing personnel, sending a killing task comprising identification information of the area to be killed and the type of the killing task to a terminal of the target killing personnel, namely sending the identification of the area to be killed and the type of the killing task to the terminal of the killing personnel together, and knowing how to kill and prepare what kind of killing tool according to the type of the killing.
EXAMPLE III
Another aspect of the present invention further provides a killing task allocation apparatus, referring to fig. 4, which is a killing task allocation apparatus in a third embodiment of the present invention, and is applied to a killing task allocation device, where the killing task allocation device may be the server or the supervisor terminal, and the killing task allocation apparatus includes:
the boundary frame judging module 11 is configured to acquire a boundary frame generated by framing on a preset killing map by a user, and judge whether the boundary frame intersects with a preset killing target object on the preset killing map;
the boundary frame adjusting module 12 is configured to adjust the boundary frame to make the boundary frame not intersect with the disinfection target object when it is determined that the boundary frame intersects with the preset disinfection target object on the preset disinfection map;
the coefficient calculation module 13 is configured to determine the to-be-killed area framed and selected by the boundary box according to the boundary box, and calculate the area of the to-be-killed area and a killing difficulty coefficient of a killing target object in the to-be-killed area;
the number-of-people determining module 14 is used for determining the number of the killing personnel corresponding to the area to be killed according to the area of the area to be killed and the killing difficulty coefficient;
and the task allocation module 15 is used for allocating killing tasks according to the number of the killing personnel and the identification information of the corresponding to-be-killed area.
Further, in some optional embodiments of the present invention, the coefficient calculating module 13 is further configured to obtain all the killing targets in the to-be-killed area, and determine a preset killing difficulty value corresponding to each of the killing targets; and calculating the average killing difficulty coefficient of the killing target objects in the area to be killed according to the preset killing difficulty value corresponding to each killing target object.
Further, in some optional embodiments of the present invention, the number-of-people determining module 14 is further configured to determine a corresponding preset number of people according to an area of the area to be killed; and determining the number of the killing personnel corresponding to the area to be killed according to the average killing difficulty coefficient and the preset personnel number and by adopting a rounding counting rule.
Further, in some optional embodiments of the present invention, the bounding box adjusting module 12 is further configured to shift a portion of the bounding box intersecting the killing target outward or inward so as not to intersect the killing target.
Further, in some optional embodiments of the present invention, the task allocation module 15 is further configured to select, according to a selection manner closer to the area to be killed, target killing persons whose number corresponds to the number of the killing persons from among currently idle killing persons, and dispatch, to the terminal of the target killing person, a killing task including the identification information of the area to be killed.
Further, in some optional embodiments of the present invention, the killing task assigning device further includes:
the parameter acquisition module is used for acquiring parameters of the bounding box, wherein the parameters comprise one or more of shape, color and border line width;
and the target object determining module is used for determining a corresponding preset killing task type according to the parameters of the boundary frame and determining a corresponding preset killing target object according to the killing task type.
Further, in some optional embodiments of the present invention, the task allocation module 15 is further configured to allocate killing tasks according to the types of killing tasks, the number of killing personnel, and identification information of corresponding to the areas to be killed.
The functions or operation steps of the modules and units when executed are substantially the same as those of the method embodiments, and are not described herein again.
Example four
Referring to fig. 5, the apparatus for distributing a killing task according to a fourth embodiment of the present invention includes a memory 20, a processor 10, and a computer program 30 stored in the memory and executable on the processor, where the processor 10 executes the computer program 30 to implement the method for distributing a killing task as described above.
The killing task allocation device may be a server or a supervisor terminal, and the processor 10 may be a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor or other data Processing chip in some embodiments, and is configured to run a program code stored in the memory 20 or process data, for example, execute an access restriction program.
The memory 20 includes at least one type of readable storage medium, which includes a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a magnetic memory, a magnetic disk, an optical disk, and the like. The memory 20 may in some embodiments be an internal storage unit of the disinfection task allocation device, for example a hard disk of the disinfection task allocation device. The memory 20 may also be an external storage device of the task assigning apparatus in other embodiments, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, provided on the task assigning apparatus. Further, the memory 20 may also include both an internal storage unit and an external storage device of the killing task allocation apparatus. The memory 20 may be used not only to store application software installed in the disinfecting task assigning apparatus and various kinds of data, but also to temporarily store data that has been output or will be output.
It should be noted that the configuration shown in FIG. 5 does not constitute a limitation of the disinfection task dispensing apparatus, which in other embodiments may include fewer or more components than shown, or some components may be combined, or a different arrangement of components.
An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the above-mentioned killing task allocation method.
Those of skill in the art will understand that the logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be viewed as implementing logical functions, can be embodied in any computer-readable storage medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable storage medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable storage medium may even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present invention should be subject to the appended claims.
Claims (10)
1. A method for assigning a killing task, the method comprising:
acquiring a boundary frame generated by framing on a preset killing map by a user, and judging whether the boundary frame is intersected with a preset killing target object on the preset killing map;
if so, adjusting the boundary frame to ensure that the boundary frame does not intersect with the killing target object;
determining the to-be-killed area framed by the boundary frame according to the boundary frame, and calculating the area of the to-be-killed area and the average killing difficulty coefficient of the killing target object in the to-be-killed area;
determining the number of killing personnel corresponding to the area to be killed according to the area of the area to be killed and the average killing difficulty coefficient;
and allocating killing tasks according to the number of the killing personnel and the identification information corresponding to the area to be killed.
2. The task assigning method for killing according to claim 1, wherein the step of calculating the difficulty coefficient of killing of the target objects in the area to be killed specifically comprises:
acquiring all the killing target objects in the area to be killed, and determining a preset killing difficulty value corresponding to each killing target object;
and calculating the average killing difficulty coefficient of the killing target objects in the area to be killed according to the preset killing difficulty value corresponding to each killing target object.
3. The killing task allocation method according to claim 2, wherein the step of determining the number of killing persons corresponding to the area to be killed according to the area of the area to be killed and the average killing difficulty coefficient comprises:
determining the corresponding preset number of people according to the area of the area to be killed;
and determining the number of the killing personnel corresponding to the area to be killed according to the average killing difficulty coefficient and the preset personnel number and by adopting a rounding counting rule.
4. The task allocation method for killing according to claim 1, wherein the step of adjusting the bounding box so as not to intersect with the killing target object comprises:
and shifting the intersecting part of the bounding box and the killing target object outwards or inwards so as to be not intersected with the killing target object.
5. The killing task allocation method according to claim 1, wherein the step of allocating the killing tasks according to the number of the killing personnel and the identification information corresponding to the area to be killed comprises the steps of:
according to a selection mode closer to a to-be-killed area, selecting target killing personnel with the number corresponding to the number of the killing personnel from the currently idle killing personnel, and dispatching a killing task containing identification information of the to-be-killed area to a terminal of the target killing personnel.
6. The task assigning method for killing according to claim 1, wherein after the step of obtaining the bounding box generated by the user in the frame selection on the preset killing map, the method further comprises:
acquiring parameters of the bounding box, wherein the parameters comprise one or more of shape, color and frame line width;
and determining a corresponding preset killing task type according to the parameters of the boundary frame, and determining a corresponding preset killing target object according to the killing task type.
7. The killing task allocation method according to claim 6, wherein the step of allocating the killing tasks according to the number of the killing personnel and the identification information corresponding to the area to be killed comprises the steps of:
and distributing the killing tasks according to the killing task types, the number of the killing personnel and the identification information corresponding to the area to be killed.
8. A task assigning apparatus for killing, the apparatus comprising:
the boundary frame judging module is used for acquiring a boundary frame generated by framing on a preset killing map by a user and judging whether the boundary frame is intersected with a preset killing target object on the preset killing map;
the boundary frame adjusting module is used for adjusting the boundary frame to enable the boundary frame to be not intersected with a preset killing target object on the preset killing map when the boundary frame is judged to be intersected with the preset killing target object;
the coefficient calculation module is used for determining the to-be-killed area framed and selected by the boundary frame according to the boundary frame, and calculating the area of the to-be-killed area and the killing difficulty coefficient of the killing target object in the to-be-killed area;
the number determining module is used for determining the number of the killing personnel corresponding to the area to be killed according to the area of the area to be killed and the killing difficulty coefficient;
and the task allocation module is used for allocating killing tasks according to the number of the killing personnel and the identification information corresponding to the area to be killed.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out a killing task allocation method according to any one of claims 1 to 7.
10. A task assigning apparatus for killing, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the task assigning method according to any one of claims 1 to 7 when executing the program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210103553.4A CN114116182B (en) | 2022-01-28 | 2022-01-28 | Disinfection task allocation method and device, storage medium and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210103553.4A CN114116182B (en) | 2022-01-28 | 2022-01-28 | Disinfection task allocation method and device, storage medium and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114116182A true CN114116182A (en) | 2022-03-01 |
| CN114116182B CN114116182B (en) | 2022-07-08 |
Family
ID=80361779
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210103553.4A Active CN114116182B (en) | 2022-01-28 | 2022-01-28 | Disinfection task allocation method and device, storage medium and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114116182B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115796563A (en) * | 2023-02-10 | 2023-03-14 | 中建安装集团有限公司 | Steel structure list checking and verifying management system based on big data |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101009754B1 (en) * | 2010-04-07 | 2011-01-19 | 김기문 | Counting apparatus for laver |
| CN109242275A (en) * | 2018-08-21 | 2019-01-18 | 平安科技（深圳）有限公司 | Method for allocating tasks, device and storage medium |
| JP2020071609A (en) * | 2018-10-30 | 2020-05-07 | 株式会社ケアコム | Hand hygiene management system |
| CN111191532A (en) * | 2019-12-18 | 2020-05-22 | 深圳供电局有限公司 | Face recognition method and device based on construction area and computer equipment |
| CN111738596A (en) * | 2020-06-22 | 2020-10-02 | 中国银行股份有限公司 | Work order distribution method and device |
| CN111973792A (en) * | 2020-09-21 | 2020-11-24 | 北京海风智能科技有限责任公司 | Epidemic prevention and elimination platform and epidemic prevention and elimination method |
| US20210015959A1 (en) * | 2018-03-29 | 2021-01-21 | Sun Energy Corporation | Ultraviolet irradiation device, ultraviolet irradiation method, illumination device, and ultraviolet irradiation system |
| CN112766723A (en) * | 2021-01-19 | 2021-05-07 | 广州赛特智能科技有限公司 | Disinfection robot scheduling method |
| CN113191250A (en) * | 2021-04-28 | 2021-07-30 | 无锡洛希极限科技有限公司 | Medical structure intelligent safety supervision based on machine vision |
| WO2021169668A1 (en) * | 2020-02-26 | 2021-09-02 | Oppo广东移动通信有限公司 | Image processing method and related device |
| CN113566808A (en) * | 2021-06-17 | 2021-10-29 | 浙江图讯科技股份有限公司 | Navigation path planning method, device, equipment and readable storage medium |
| CN113592173A (en) * | 2021-07-28 | 2021-11-02 | 安徽大学 | System and method for scheduling multiple disinfection robots applied to large public places |
| US20210338864A1 (en) * | 2020-04-30 | 2021-11-04 | Aristocrat Technologies, Inc. | Ultraviolet disinfection and sanitizing systems and methods for electronic gaming devices and other gaming equipment |
| CN113868220A (en) * | 2021-06-28 | 2021-12-31 | 航天科工智能运筹与信息安全研究院(武汉)有限公司 | Construction method and device of epidemic situation research platform |
-
2022
- 2022-01-28 CN CN202210103553.4A patent/CN114116182B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101009754B1 (en) * | 2010-04-07 | 2011-01-19 | 김기문 | Counting apparatus for laver |
| US20210015959A1 (en) * | 2018-03-29 | 2021-01-21 | Sun Energy Corporation | Ultraviolet irradiation device, ultraviolet irradiation method, illumination device, and ultraviolet irradiation system |
| CN109242275A (en) * | 2018-08-21 | 2019-01-18 | 平安科技（深圳）有限公司 | Method for allocating tasks, device and storage medium |
| JP2020071609A (en) * | 2018-10-30 | 2020-05-07 | 株式会社ケアコム | Hand hygiene management system |
| CN111191532A (en) * | 2019-12-18 | 2020-05-22 | 深圳供电局有限公司 | Face recognition method and device based on construction area and computer equipment |
| WO2021169668A1 (en) * | 2020-02-26 | 2021-09-02 | Oppo广东移动通信有限公司 | Image processing method and related device |
| US20210338864A1 (en) * | 2020-04-30 | 2021-11-04 | Aristocrat Technologies, Inc. | Ultraviolet disinfection and sanitizing systems and methods for electronic gaming devices and other gaming equipment |
| CN111738596A (en) * | 2020-06-22 | 2020-10-02 | 中国银行股份有限公司 | Work order distribution method and device |
| CN111973792A (en) * | 2020-09-21 | 2020-11-24 | 北京海风智能科技有限责任公司 | Epidemic prevention and elimination platform and epidemic prevention and elimination method |
| CN112766723A (en) * | 2021-01-19 | 2021-05-07 | 广州赛特智能科技有限公司 | Disinfection robot scheduling method |
| CN113191250A (en) * | 2021-04-28 | 2021-07-30 | 无锡洛希极限科技有限公司 | Medical structure intelligent safety supervision based on machine vision |
| CN113566808A (en) * | 2021-06-17 | 2021-10-29 | 浙江图讯科技股份有限公司 | Navigation path planning method, device, equipment and readable storage medium |
| CN113868220A (en) * | 2021-06-28 | 2021-12-31 | 航天科工智能运筹与信息安全研究院(武汉)有限公司 | Construction method and device of epidemic situation research platform |
| CN113592173A (en) * | 2021-07-28 | 2021-11-02 | 安徽大学 | System and method for scheduling multiple disinfection robots applied to large public places |
Non-Patent Citations (5)
| Title |
|---|
| SOUMENDRA NANDA ET AL: "Cross-layer TCP adaptation in DISCO for tactical edge networks", 《MILCOM 2016 - 2016 IEEE MILITARY COMMUNICATIONS CONFERENCE》 * |
| YANG SHEN ET AL: "Robots Under COVID-19 Pandemic: A Comprehensive Survey", 《IEEE ACCESS》 * |
| 尹厚淳等: "面向协同感知的任务分配方法", 《软件导刊》 * |
| 徐振杰等: "一种基于目标检测的偏斜图像校准方法", 《小型微型计算机系统》 * |
| 李阳: "军医大学地震灾害救援应急卫生疫队组织训练及实用软件研究", 《中国优秀硕士学位论文全文数据库 医药卫生科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115796563A (en) * | 2023-02-10 | 2023-03-14 | 中建安装集团有限公司 | Steel structure list checking and verifying management system based on big data |
| CN115796563B (en) * | 2023-02-10 | 2023-04-11 | 中建安装集团有限公司 | Steel structure list checking and verifying management system based on big data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114116182B (en) | 2022-07-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109737974B (en) | 3D navigation semantic map updating method, device and equipment | |
| CN109685276B (en) | Order processing method and device, electronic equipment and computer readable storage medium | |
| CN114116182B (en) | Disinfection task allocation method and device, storage medium and equipment | |
| Duchaineau et al. | ROAMing terrain: Real-time optimally adapting meshes | |
| US5905500A (en) | Method and apparatus for adaptive nonlinear projective rendering | |
| CN107451673A (en) | Dispense region partitioning method and device | |
| CN108416519A (en) | A kind of guest room method for allocating tasks, server and computer readable storage medium | |
| CN111596661A (en) | Sterilization control method and device, electronic equipment and system | |
| DE102018008275A1 (en) | Refine local parameterizations for the transmission of two-dimensional images to three-dimensional models | |
| CN108765583B (en) | A kind of method and device of the size marking of spacial flex in virtual three-dimensional space | |
| CN110235077A (en) | Medicine distribution method and dispensing vehicle | |
| CN109960887A (en) | Model production method and device, storage medium and electronic equipment based on LOD | |
| CN114779787A (en) | Grid map construction method, robot and machine-readable storage medium | |
| CN113744403B (en) | Method and system for generating three-dimensional model of building | |
| CN109600414A (en) | A kind of resource allocation methods, device, equipment and storage medium | |
| CN116030952B (en) | Method, apparatus, device and medium for deploying and managing currently available AEDs | |
| US6437795B1 (en) | Method and apparatus for clipping a function | |
| CN113129098B (en) | Order allocation method and device | |
| US8049749B2 (en) | Image generator for medical treatment and its method | |
| CN113889254A (en) | Cloud computing-based medical internet of things management system | |
| CN112613769A (en) | Intelligent scheduling method based on laboratory forensics task allocation, terminal equipment and medium | |
| CN113099163A (en) | Monitoring adjusting method, monitoring system, electronic device and readable storage medium | |
| CN117611615A (en) | Compression and decompression method, device and system for three-dimensional map and storage medium | |
| CN116542659B (en) | Resource allocation method, device, electronic equipment and storage medium | |
| CN109254857A (en) | A kind of method of adjustment of shared drive, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |