CN113988490A - Method, apparatus, and medium for planning a patrol path - Google Patents
Method, apparatus, and medium for planning a patrol path Download PDFInfo
- Publication number
- CN113988490A CN113988490A CN202111616581.8A CN202111616581A CN113988490A CN 113988490 A CN113988490 A CN 113988490A CN 202111616581 A CN202111616581 A CN 202111616581A CN 113988490 A CN113988490 A CN 113988490A
- Authority
- CN
- China
- Prior art keywords
- patrolled
- objects
- patrolling
- patrol
- determining
- 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
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Embodiments of the present disclosure relate to a method, apparatus, and medium for planning a patrol path. According to the method, associated business data of a plurality of objects to be patrolled in a first past time period are obtained, so that business evaluation data of the plurality of objects to be patrolled associated with each patrolling execution subject is determined based on the associated business data; determining a candidate object set to be patrolled for the patrolling execution main body based on the service evaluation data and the patrolling historical data of the patrolling execution main body in a second past time period; selecting a preset number of objects to be patrolled from a candidate object set to be patrolled; and determining the shortest patrol route which takes a preset position as a starting point, passes through the selected object to be patrolled according to the preset advancing direction and finally returns to the preset position for the patrol execution main body based on the Astar algorithm. Therefore, the patrol efficiency of the patrol execution main body can be improved, the time spent by the patrol execution main body on the road is reduced, and the actual patrol effect is improved.
Description
Technical Field
Embodiments of the present disclosure relate generally to the field of path planning, and more particularly, to a method, apparatus, and medium for planning a patrol path.
Background
The shop patrol refers to the purpose that related business personnel of a company make actual shop patrol visits to subordinate shops to know the operating conditions of the shops, so that the standards of the company are maintained, the latest policies of the company are followed, and opportunity points are found. Currently, a service person generally determines which stores need to be subjected to store patrol visit and what store patrol route is to be adopted to complete the store patrol visit of the stores according to the judgment of the service person. However, each service person often performs the work of visiting the shops according to personal preferences only due to personal reasons or limitations of capability level, which often causes that good-performing shops are frequently visited by the shops, but the shops which are urgently waiting for the shops are not visited by people. However, actually, the influence of visiting stores with good performance on the promotion of the business is limited, but visiting stores with urgent business development can help to obviously promote the performance effect of relevant stores, otherwise, the loss of the cooperative stores is easily caused, and thus the business of the company is greatly influenced. In addition, the shop patrol route determined by the business personnel on the journey often causes waste of time and cost. Therefore, the mode of arranging the shop patrol task by the service personnel cannot ensure the effect and efficiency of the shop patrol and cannot ensure the work supervision and execution efficiency.
Thus, there is a need for a technique that can be used to automatically plan a tour route to improve tour efficiency and effectiveness.
Disclosure of Invention
In view of the above problems, the present disclosure provides a method, an apparatus, and a medium for planning an inspection path, which can improve inspection efficiency of an inspection execution subject, reduce time spent by the inspection execution subject on a road, and contribute to improving an actual effect of inspection, thereby providing an optimal guarantee for business development.
According to a first aspect of the present disclosure, there is provided a method for planning a patrol path, comprising: acquiring associated service data of all objects to be patrolled in a first past time period so as to determine service evaluation data of a plurality of objects to be patrolled associated with each patrolling execution subject based on the associated service data; determining a candidate object set to be patrolled for the patrolling execution main body based on the business evaluation data and patrolling historical data of the patrolling execution main body in a second time period in the past, wherein the second time period is less than or equal to the first time period; selecting a preset number of objects to be patrolled from the candidate object to be patrolled set, wherein the selected objects to be patrolled are in a fan-shaped area range which takes a preset position of the patrolling execution main body as a center and takes a preset distance length as a radius; and determining the shortest patrol route which takes the predetermined position as a starting point, passes through the selected object to be patrolled in a predetermined advancing direction and finally returns to the predetermined position for the patrol execution main body based on an Astar algorithm. In this way, it is made possible to improve the patrol efficiency of the patrol execution subject, reduce the time taken by the patrol execution subject on the road, and contribute to improving the actual effect of the patrol.
According to a second aspect of the present disclosure, there is provided a computing device comprising: at least one processor; and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first aspect of the disclosure.
In a third aspect of the present disclosure, a non-transitory computer readable storage medium is provided having stored thereon computer instructions for causing the computer to perform the method of the first aspect of the present disclosure.
In some embodiments, determining, for the patrol execution subject, a shortest patrol path that passes through the selected object to be patrolled in a predetermined travel direction, starting from the predetermined position, and finally returns to the predetermined position, based on an Astar algorithm, includes: calculating a path length from the starting position to each of the selected objects to be patrolled in the predetermined traveling direction with the predetermined position as a starting position; for each object to be patrolled in the selected objects to be patrolled, calculating the total time length from the starting position to the object to be patrolled and then from the object to be patrolled to the starting position based on an Astar algorithm and the corresponding path length; taking the position of the object to be patrolled associated with the minimum time length as a second position of the patrolling path; and continuing to determine the subsequent position of the patrol route in the selected object to be patrolled until the whole patrol route is determined.
In some embodiments, determining business evaluation data for a plurality of objects to be patrolled associated with each patrolling execution principal based on the associated business data comprises: determining a first invoice amount of each object to be patrolled in the first time period and a second invoice amount of each object to be patrolled in one or more third time periods respectively immediately before the first time period based on the associated business data, wherein the length of the first time period is the same as that of the third time period; determining an object to be patrolled, of the plurality of objects to be patrolled associated with the patrolling execution subject, of which a first output is greater than or equal to a first threshold value as having first business evaluation data; determining an object to be patrolled, of the plurality of objects to be patrolled associated with the patrolling execution subject, for which a first order quantity is smaller than the first threshold value but a second order quantity is greater than or equal to the first threshold value, as having second traffic assessment data; determining an object to be patrolled, of the plurality of objects to be patrolled associated with the patrolling execution subject, for which both a first order quantity and a second order quantity are smaller than the first threshold value but larger than zero, as having third business evaluation data; and determining the object to be patrolled with zero first order quantity and second order quantity in the plurality of objects to be patrolled associated with the patrolling execution subject as having fourth business evaluation data.
In some embodiments, determining a set of candidate objects to be patrolled for the patrol execution subject based on the business evaluation data and the patrol history data of the patrol execution subject over a second period of time in the past comprises: determining an object to be patrolled having the second business evaluation data or the fourth business evaluation data among the plurality of objects to be patrolled associated with the patrolling execution subject; and selecting objects to be patrolled, which are not patrolled by the patrolling execution subject in the second time period, from the determined objects to be patrolled based on the patrolling historical data to obtain the candidate object to be patrolled set.
In some embodiments, selecting a predetermined number of objects to be patrolled from the set of candidate objects to be patrolled comprises: determining a first sector area which takes the preset position as a circle center and the preset distance length as a radius, wherein the size of a central angle of the first sector area is a first degree; determining a first number of potential objects to be patrolled that fall within the first sector area in the set of candidate objects to be patrolled; in response to determining that the first number is greater than or equal to the predetermined number, randomly selecting the predetermined number of objects to be patrolled within the first sector area; in response to determining that the first number is less than the predetermined number, determining a second sector area centered at the predetermined position and having a radius of the predetermined distance length, the second sector area having a central angle of a second degree, the second degree being greater than the first degree; determining a second number of potential objects to be patrolled that fall within the second sector area in the set of candidate objects to be patrolled; in response to determining that the second number is greater than or equal to the predetermined number, randomly selecting the predetermined number of objects to be patrolled within the second sector area.
In some embodiments, the predetermined direction of travel is clockwise or counterclockwise.
In some embodiments, the first period of time in the past comprises at least one of the last 1 day, 3 days, 7 days, 15 days, or 30 days.
In some embodiments, the predetermined distance length is 10 kilometers.
It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. In the drawings, like or similar reference characters designate like or similar elements.
Fig. 1 shows a schematic diagram of a system 100 for implementing a method for planning a patrol path according to an embodiment of the invention.
Fig. 2 shows a flow diagram of a method 200 for planning a patrol path according to an embodiment of the present disclosure.
Fig. 3 illustrates a flow chart of a method 300 for determining business evaluation data for a plurality of objects to be patrolled associated with each patrolling execution principal based on associated business data according to an embodiment of the present disclosure.
Fig. 4 shows a flow diagram of a method 400 for selecting a predetermined number of objects to be patrolled from a set of candidate objects to be patrolled according to an embodiment of the present disclosure.
Fig. 5 shows a block diagram of an electronic device 500 according to an embodiment of the disclosure.
Detailed Description
Exemplary embodiments of the present disclosure are described below with reference to the accompanying drawings, in which various details of the embodiments of the disclosure are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
The term "include" and variations thereof as used herein is meant to be inclusive in an open-ended manner, i.e., "including but not limited to". Unless specifically stated otherwise, the term "or" means "and/or". The term "based on" means "based at least in part on". The terms "one example embodiment" and "one embodiment" mean "at least one example embodiment". The term "another embodiment" means "at least one additional embodiment". The terms "first," "second," and the like may refer to different or the same object. Other explicit and implicit definitions are also possible below.
As described above, currently, a service person generally determines which stores need to be visited each day according to his/her own arrangement, and the selection and routing of the stores each day can only be performed depending on the judgment of the service person, so that the effect and efficiency of store patrol cannot be ensured, and the work supervision and execution efficiency cannot be guaranteed.
To address at least in part one or more of the above issues and other potential issues, an example embodiment of the present disclosure proposes a method for planning a patrol path, comprising: acquiring associated service data of a plurality of objects to be patrolled in a first past time period so as to determine service evaluation data of the plurality of objects to be patrolled associated with each patrolling execution subject based on the associated service data; determining a candidate object set to be patrolled for the patrolling execution main body based on the business evaluation data and patrolling historical data of the patrolling execution main body in a second time period in the past, wherein the second time period is less than or equal to the first time period; selecting a preset number of objects to be patrolled from the candidate object to be patrolled set, wherein the selected objects to be patrolled are in a fan-shaped area range which takes a preset position of the patrolling execution main body as a center and takes a preset distance length as a radius; and determining the shortest patrol route which takes the predetermined position as a starting point, passes through the selected object to be patrolled in a predetermined advancing direction and finally returns to the predetermined position for the patrol execution main body based on an Astar algorithm. In this way, scientific distribution of the patrol tasks can be realized, the patrol execution main body can efficiently complete the patrol tasks, the time spent by the patrol execution main body on the road can be reduced, the actual patrol effect can be improved, and the best guarantee can be provided for business development.
Fig. 1 shows a schematic diagram of a system 100 for implementing a method for planning a patrol path according to an embodiment of the invention. As shown in fig. 1, system 100 includes a computing device 110, a network 120, and a server 130. Computing device 110 and server 130 may interact with data via network 120 (e.g., the internet). In the present disclosure, the server 130 may be used to provide associated business data for an associated plurality of objects to be patrolled (e.g., stores). All objects to be patrolled that are associated may refer to all objects to be patrolled that are recorded on the inside surface of the objects to be patrolled of the system 100. The computing device 110 may communicate with the server 130 via the network 120 to enable acquisition of the associated business data. The computing device 110 may include at least one processor 112 and at least one memory 114 coupled to the at least one processor 112, the memory 114 having stored therein instructions 116 executable by the at least one processor 112, the instructions 116 when executed by the at least one processor 112 performing the method 200 as described below. Note that herein, computing device 110 may be part of server 130 or may be separate from server 130. The specific structure of computing device 110 or server 130 may be described, for example, in connection with FIG. 5, below.
Fig. 2 shows a flow diagram of a method 200 for planning a patrol path according to an embodiment of the present disclosure. The method 200 may be performed, for example, by each patrol execution subject via its respective computing device (e.g., the computing device 110 as shown in fig. 1 or the electronic device 500 as shown in fig. 5). It should be understood that method 200 may also include additional blocks not shown and/or may omit blocks shown, as the scope of the present disclosure is not limited in this respect. By executing the method 200 for planning a patrol route, the patrol executive body can be helped to determine the patrol route of each day and the objects to be patrolled which need to be patrolled currently. For example, in the case where the object to be patrolled is a store, the patrol may refer to a patrol visit. In the present disclosure, the patrol execution topic may be, for example, a business person or any other subject that may be used to perform a patrol or patrol task.
At step 202, the computing device 110 obtains the associated business data of all of the objects to be inspected during the first period of time in the past to determine business assessment data (e.g., performance scores, etc.) for a plurality of objects to be inspected associated with each inspection execution subject based on the associated business data.
In the present disclosure, information of all objects to be patrolled may be recorded by, for example, an associated object to be patrolled table which may record which objects to be patrolled are specifically included and an address, a phone, and associated credentials (e.g., a business license) and the like of each object to be patrolled.
The associated business data may include a billing condition for each object to be patrolled, such as a billing amount within a certain time period, etc. The first time period in the past is usually referred to as the last one of the traffic periods. For example, the first period of time in the past may include, but is not limited to, at least one of the last 1 day, 3 days, 7 days, 15 days, or 30 days. In the present disclosure, the business cycle may be dynamic, which may be related to the invoicing index of different businesses of the object to be patrolled. In some embodiments, the service period R may be determined, for example, based on a matrix P of odd numbers (for example, for a store related to a union of medicine, such odd numbers may include a general odd number, a trade-new odd number, a value-added odd number, a medicine treasure odd number, and the like) of the related services (i.e., one or more services related to an object to be patrolled by a patrolling executing subject) in the life cycle (for example, for a store related to a union of medicine, a matrix W of weighted values of the odd numbers about the related services set according to a strategic direction of the company, a total odd number s of all related services in the life cycle, and the life cycle t of the related services, for example, the service period R may be determined based on the following formula: r = ((P × W)/s) × t.
The plurality of objects to be patrolled associated with each patrol execution principal may be recorded, for example, by an associated object to be patrolled allocation table which may record a list of all objects to be patrolled which are available for allocation to the respective patrol execution principal. The allocation table of the objects to be patrolled can also record the number of patrols needed by the patrolling execution subject in the day.
The service evaluation data of each object to be patrolled can reflect the order-out condition of the object to be patrolled in the current service period, the better order-out condition in the current service period can be generally called as an actively expecting patrolled object, and the objects to be patrolled do not need to be patrolled frequently because the order-out condition is good. Objects to be patrolled that are good when orders are made during a current business cycle, but good when orders are made during a previous business cycle or a few previous business cycles, may be referred to as attrition expectation patrolled objects, which may be considered to have potential willingness to make an order, but which may require some training or motivation. The objects to be patrolled, which are general in the current service period and the previous service period or a plurality of previous service periods, can be called silence expectation patrolling objects, and the significance of patrolling the objects to be patrolled is not great. Still other objects to be patrolled have not been operated, that is, the order of all past service periods is zero, and these objects to be patrolled may be called objects to be activated, and training, internet of things arrangement and the like are required, so that patrolling these objects to be patrolled is also generally significant.
In the disclosure, after the business evaluation data of a plurality of objects to be patrolled associated with each patrolling execution subject is determined, the business scores can be recorded in a corresponding score recording table of the objects to be patrolled for subsequent calling.
Step 202 is described in further detail below in conjunction with fig. 3.
In step 204, a candidate inspection object set is determined for the inspection execution subject based on the service evaluation data and the inspection history data of the inspection execution subject in the second past time period. The second time period may be less than or equal to the first time period.
For example, the second period of time in the past may be, for example, 1 or 3 days in the past.
In the present disclosure, the patrol history data of the patrol execution subject for the second period of time in the past may be recorded, for example, by an associated object to be patrolled patrol record table in which it is recordable which objects to be patrolled are patrolled by the patrol execution subject for the second period of time in the past and the specific time at which these patrols are completed. In the present disclosure, all the objects to be patrolled which have been patrolled by the patrolling execution subject will be recorded in the object to be patrolled patrolling record table.
The set of candidate objects to be patrolled may refer to a set of objects to be patrolled which have not been patrolled recently by the patrolling executing body and have a potential effect.
In some embodiments, step 204 may specifically include the following steps.
First, an object to be patrolled having second business evaluation data or fourth business evaluation data among a plurality of objects to be patrolled associated with the patrolling execution subject is determined. The meaning of the second traffic rating data and the fourth traffic rating data may be determined by referring to steps 306 and 310 in method 300 described below in connection with fig. 3.
Then, based on the patrol history data, objects to be patrolled, which have not been patrolled by the patrol execution subject in the second time period, are selected from the objects to be patrolled determined in the previous step to obtain a candidate set of objects to be patrolled.
In step 206, a predetermined number of objects to be patrolled are selected from the set of candidate objects to be patrolled, the selected objects to be patrolled being within a sector area centered on a predetermined position of the patrolling execution body and having a predetermined distance length as a radius.
In the present disclosure, the predetermined number mentioned in step 206 may refer to, for example, the number of objects to be patrolled for which patrol accesses that the patrol execution subject needs to complete on the same day are recorded in the object to be patrolled allocation table.
In addition, the predetermined position of the patrol execution subject may refer to an initial position coordinate (i.e., a departure position) of the set patrol execution subject, typically a position where an office or a home of the patrol execution subject is located. The predetermined distance length may be, for example, 10 km, although more or less distances are also possible. The coordinates of the initial position and the predetermined distance length may also be recorded in the object-to-be-patrolled allocation table of the patrol execution subject.
In the present disclosure, an object to be patrolled in the candidate object to be patrolled set, which satisfies the following condition, may be determined to fall within the fan-shaped area: that is, the distance from the predetermined position of the patrol performing body to the object to be patrolled is smaller than the radius of the fan-shaped area range, and the angle with the first side of the fan-shaped area range is smaller than the central angle of the fan-shaped area range.
The selected object to be patrolled is in the range of the sector area which takes the preset position of the patrolling execution main body as the center of a circle and takes the preset distance length as the radius, so that the time spent by the patrolling execution main body on the road during patrolling access can be reduced, the patrolling execution main body can be ensured to complete the distributed patrolling access amount in the range close to the patrolling execution main body, and the corresponding patrolling task cannot be completed due to the distance.
In step 208, based on the Astar algorithm, the shortest patrol route that starts at a predetermined position, passes through the selected object to be patrolled in a predetermined travel direction, and finally returns to the predetermined position is determined for the patrol execution subject.
In the present disclosure, the predetermined traveling direction may be a clockwise direction or a counterclockwise direction.
In some embodiments, step 208 may specifically include the following operations.
First, with a predetermined position as a start position, a path length from the start position to each of the selected objects to be patrolled in a predetermined traveling direction (for example, clockwise or counterclockwise) is calculated.
Assuming that the number of the selected objects to be patrolled is n, the coordinates of the predetermined position of the patrolling execution body are (lonU, latU), and the coordinates of the selected objects to be patrolled are (lonS1, latS1), (lonS2, latS2), (lonS3, latS3), (lonSn, latSn), respectively, the path lengths L1 to Ln from the start position to each of the selected objects to be patrolled can be determined, for example, according to the following formula:
radLatU = deg2rad(latU) （1）
radLatS1 = deg2rad(latS1) （2）
radLonU = deg2rad(lonU) （3）
radLonS1 = deg2rad(lonS1) （4）
diffLat = radLatU - radLatS1 （5）
diffLon = radLonU - radLonS1 （6）
L1=2*asin(sqrt(pow(sin(diffLat/2),2)+cos(radLatU)*cos(radLatS1)*pow(sin(diffLon/2),2)))*6378.137*1000 （7）
l2, L3.. Ln is calculated in turn according to the similar steps above.
In the above formula, deg2rad is a function for converting a corresponding angle into a radian, for example, deg2rad (latU) is used for converting a latitude value of the patrol performing body into a corresponding radian value, and deg2rad (lonU) is used for converting a longitude value of the patrol performing body into a corresponding radian value.
Then, for each of the selected objects to be inspected, the total time length required for going from the starting position to the object to be inspected and then going back to the starting position from the object to be inspected is calculated based on the Astar algorithm and the corresponding path length.
Since the Astar core algorithm is f (n) = g (n) + h (n), the above length of time can be calculated according to the following equation:
T(n) = (g(n) + h(n))*Ln （8）
wherein g (n) is used to calculate the length of time taken from the start position to the current position, and h (n) is used to calculate the length of time taken from the current position to the final position.
Then, the position of the object to be patrolled associated with the minimum length of time is taken as the second position of the patrol route.
The minimum time length is the minimum of T1, T2 … … Tn.
Then, a third position of the patrol route can be determined in the selected object to be patrolled based on a similar method as described before, for example with the determined second position as a starting position and the aforementioned predetermined position as a final position, and so on until all subsequent positions of the entire patrol route are determined.
Fig. 3 illustrates a flow chart of a method 300 for determining business evaluation data for a plurality of objects to be patrolled associated with each patrolling execution principal based on associated business data according to an embodiment of the present disclosure. The method 300 may be performed by the computing device 110 as shown in FIG. 1, or may be performed at the electronic device 500 shown in FIG. 5. It should be understood that method 300 may also include additional blocks not shown and/or may omit blocks shown, as the scope of the disclosure is not limited in this respect.
In step 302, a first invoice amount of each object to be patrolled in a first time period and a second invoice amount of each object to be patrolled in one or more third time periods respectively immediately before the first time period are determined based on the associated service data, and the length of the first time period may be the same as that of the third time period. In this disclosure, the one or more third time periods may be one or more traffic periods prior to the first time period.
In step 304, an object to be patrolled, of the plurality of objects to be patrolled associated with the patrolling execution subject, for which a first output amount is greater than or equal to a first threshold value is determined as having first business evaluation data. The object to be patrolled with the first business evaluation data is the aforementioned active expectation patrolling object. It is actively expected that the patrol object is not meaningful because it is good to take a single item.
In step 306, the object to be patrolled, which has a first order quantity smaller than a first threshold value but a second order quantity larger than or equal to the first threshold value among the objects to be patrolled associated with the patrolling execution subject, is determined to have second service evaluation data. The object to be patrolled with the second business evaluation data is the aforementioned attrition expectation patrolled object. The loss expected inspection object has potential on-purpose, so the performance improvement effect of inspecting the loss expected inspection object can be far greater than that of the loss expected inspection object, and the inspection effect is generally better.
In step 308, the object to be patrolled, of the plurality of objects to be patrolled associated with the patrolling execution subject, for which both the first and second orders are smaller than the first threshold value but larger than zero, is determined to have the third business evaluation data. The object to be patrolled with the third business evaluation data is the silent expectation patrol object mentioned earlier. Silence expects that objects to be patrolled may be considered less capable of business and thus, patrolling these objects to be patrolled is of little interest.
In step 310, the object to be patrolled, of which the first order amount and the second order amount are zero, among the plurality of objects to be patrolled associated with the patrolling execution subject is determined to have the fourth business evaluation data. The object to be patrolled having the fourth service evaluation data is the aforementioned object to be patrolled to be activated. The object to be patrolled to be activated requires business training or material arrangement, so patrolling the object can help the object to grow, and the patrolling effect is usually good.
Different objects to be patrolled can be distinguished by determining the service evaluation data, so that scientific allocation of patrolling tasks is facilitated, the actual patrolling effect is improved, and the best guarantee is provided for service development.
Fig. 4 shows a flow diagram of a method 400 for selecting a predetermined number of objects to be patrolled from a set of candidate objects to be patrolled according to an embodiment of the present disclosure. The method 400 may be performed by the computing device 110 as shown in FIG. 1, or may be performed at the electronic device 500 shown in FIG. 5. It should be understood that method 400 may also include additional blocks not shown and/or may omit blocks shown, as the scope of the disclosure is not limited in this respect.
At step 402, a first sector area centered at a predetermined position and having a radius of the predetermined distance length is determined, the first sector area having a central angle of a first degree (e.g., 45 degrees) in magnitudeoC）。
At step 404, a first number of potential objects to be patrolled that fall within the first sector in the set of candidate objects to be patrolled is determined.
At step 406, a predetermined number of objects to be patrolled are randomly selected within the first sector area in response to determining that the first number is greater than or equal to the predetermined number.
At step 408, in response to determining that the first number is less than the predetermined number, a second sector area centered at the predetermined position and having a radius of a predetermined distance length is determined, the second sector area having a central angle of a second degree (e.g., 60 degrees) in magnitudeoC) Wherein the second degree is greater than the first degree.
At step 410, a second number of potential objects to be patrolled that fall within the second sector in the set of candidate objects to be patrolled is determined.
In step 412, in response to determining that the second number is greater than or equal to the predetermined number, the predetermined number of objects to be patrolled is randomly selected within the second sector area.
Through the above process, it can be ensured that the object to be patrolled, which needs to be patrolled and accessed by the patrolling executing body on the same day, can be quickly determined.
FIG. 5 illustrates a schematic block diagram of an example electronic device 500 that can be used to implement embodiments of the present disclosure. For example, the computing device 110 as shown in fig. 1 may be implemented by the electronic device 500. As shown, electronic device 500 includes a Central Processing Unit (CPU) 501 that may perform various appropriate actions and processes according to computer program instructions stored in a Read Only Memory (ROM) 502 or loaded from a storage unit 508 into a Random Access Memory (RAM) 503. In the random access memory 503, various programs and data necessary for the operation of the electronic apparatus 500 can also be stored. The central processing unit 501, the read only memory 502 and the random access memory 503 are connected to each other by a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
A plurality of components in the electronic device 500 are connected to the input/output interface 505, including: an input unit 506 such as a keyboard, a mouse, a microphone, and the like; an output unit 507 such as various types of displays, speakers, and the like; a storage unit 508, such as a magnetic disk, optical disk, or the like; and a communication unit 509 such as a network card, modem, wireless communication transceiver, etc. The communication unit 509 allows the device 500 to exchange information/data with other devices through a computer network such as the internet and/or various telecommunication networks.
The various processes and processes described above, such as methods 200, 300, and 400, may be performed by the central processing unit 501. For example, in some embodiments, methods 200, 300, and 400 may be implemented as a computer software program tangibly embodied in a machine-readable medium, such as storage unit 508. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 500 via the read only memory 502 and/or the communication unit 509. When the computer program is loaded into the random access memory 503 and executed by the central processing unit 501, one or more of the actions of the methods 200, 300 and 400 described above may be performed.
The present disclosure relates to methods, apparatuses, systems, electronic devices, computer-readable storage media and/or computer program products. The computer program product may include computer-readable program instructions for performing various aspects of the present disclosure.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge computing devices. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
The computer program instructions for carrying out operations of the present disclosure may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, the electronic circuitry that can execute the computer-readable program instructions implements aspects of the present disclosure by utilizing the state information of the computer-readable program instructions to personalize the electronic circuitry, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA).
Various aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.
These computer-readable program instructions may be provided to a processing unit of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processing unit of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Having described embodiments of the present disclosure, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (10)
1. A method for planning a patrol path, comprising:
acquiring associated service data of a plurality of objects to be patrolled in a first past time period so as to determine service evaluation data of the plurality of objects to be patrolled associated with each patrolling execution subject based on the associated service data;
determining a candidate object set to be patrolled for the patrolling execution main body based on the business evaluation data and patrolling historical data of the patrolling execution main body in a second time period in the past, wherein the second time period is less than or equal to the first time period;
selecting a preset number of objects to be patrolled from the candidate object to be patrolled set, wherein the selected objects to be patrolled are in a fan-shaped area range which takes a preset position of the patrolling execution main body as a center and takes a preset distance length as a radius; and
and determining the shortest patrol route which takes the predetermined position as a starting point, passes through the selected object to be patrolled according to the predetermined advancing direction and finally returns to the predetermined position for the patrol execution main body based on an Astar algorithm.
2. The method according to claim 1, wherein determining, based on an Astar algorithm, a shortest patrol route for the patrol execution subject to pass through the selected object to be patrolled in a predetermined travel direction, starting from the predetermined position, and finally return to the predetermined position comprises:
calculating a path length from the starting position to each of the selected objects to be patrolled in the predetermined traveling direction with the predetermined position as a starting position;
for each object to be patrolled in the selected objects to be patrolled, calculating the total time length from the starting position to the object to be patrolled and then from the object to be patrolled to the starting position based on an Astar algorithm and the corresponding path length;
taking the position of the object to be patrolled associated with the minimum time length as a second position of the patrolling path;
and continuing to determine the subsequent position of the patrol route in the selected object to be patrolled until the whole patrol route is determined.
3. The method of claim 1, wherein determining business assessment data for a plurality of objects to be patrolled associated with each patrolling execution principal based on the associated business data comprises:
determining a first invoice amount of each object to be patrolled in the first time period and a second invoice amount of each object to be patrolled in one or more third time periods respectively immediately before the first time period based on the associated business data, wherein the length of the first time period is the same as that of the third time period;
determining an object to be patrolled, of the plurality of objects to be patrolled associated with the patrolling execution subject, of which a first output is greater than or equal to a first threshold value as having first business evaluation data;
determining an object to be patrolled, of the plurality of objects to be patrolled associated with the patrolling execution subject, for which a first order quantity is smaller than the first threshold value but a second order quantity is greater than or equal to the first threshold value, as having second traffic assessment data;
determining an object to be patrolled, of the plurality of objects to be patrolled associated with the patrolling execution subject, for which both a first order quantity and a second order quantity are smaller than the first threshold value but larger than zero, as having third business evaluation data; and
and determining the object to be patrolled with zero first order quantity and second order quantity in the plurality of objects to be patrolled associated with the patrolling execution subject as having fourth business evaluation data.
4. The method of claim 3, wherein determining a set of candidate objects to be patrolled for the patrol performing subject based on the business evaluation data and patrol history data of the patrol performing subject over a second period of time in the past comprises:
determining an object to be patrolled having the second business evaluation data or the fourth business evaluation data among the plurality of objects to be patrolled associated with the patrolling execution subject;
and selecting objects to be patrolled, which are not patrolled by the patrolling execution subject in the second time period, from the determined objects to be patrolled based on the patrolling historical data to obtain the candidate object to be patrolled set.
5. The method of claim 1, wherein selecting a predetermined number of objects to be patrolled from the set of candidate objects to be patrolled comprises:
determining a first sector area which takes the preset position as a circle center and the preset distance length as a radius, wherein the size of a central angle of the first sector area is a first degree;
determining a first number of potential objects to be patrolled that fall within the first sector area in the set of candidate objects to be patrolled;
in response to determining that the first number is greater than or equal to the predetermined number, randomly selecting the predetermined number of objects to be patrolled within the first sector area;
in response to determining that the first number is less than the predetermined number, determining a second sector area centered at the predetermined position and having a radius of the predetermined distance length, the second sector area having a central angle of a second degree, the second degree being greater than the first degree;
determining a second number of potential objects to be patrolled that fall within the second sector area in the set of candidate objects to be patrolled; and
in response to determining that the second number is greater than or equal to the predetermined number, randomly selecting the predetermined number of objects to be patrolled within the second sector area.
6. The method of claim 2, the predetermined direction of travel being a clockwise direction or a counterclockwise direction.
7. The method of claim 1, wherein the past first time period comprises at least one of the last 1, 3, 7, 15, or 30 days.
8. The method of claim 1, wherein the predetermined distance length is 10 kilometers.
9. A computing device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor;
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-8.
10. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111616581.8A CN113988490B (en) | 2021-12-28 | 2021-12-28 | Method, apparatus, and medium for planning a patrol path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111616581.8A CN113988490B (en) | 2021-12-28 | 2021-12-28 | Method, apparatus, and medium for planning a patrol path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113988490A true CN113988490A (en) | 2022-01-28 |
| CN113988490B CN113988490B (en) | 2022-03-18 |
Family
ID=79734651
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111616581.8A Active CN113988490B (en) | 2021-12-28 | 2021-12-28 | Method, apparatus, and medium for planning a patrol path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113988490B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109657908A (en) * | 2018-11-13 | 2019-04-19 | 北京国电龙源环保工程有限公司 | A kind of visiting method, system and computer readable storage medium |
| CN110866987A (en) * | 2019-11-19 | 2020-03-06 | 泰康保险集团股份有限公司 | Patrol method, device, server, storage medium and electronic equipment |
| CN110880238A (en) * | 2019-10-21 | 2020-03-13 | 广州丰石科技有限公司 | Road congestion monitoring method based on mobile phone communication big data |
| CN112327925A (en) * | 2020-11-24 | 2021-02-05 | 天津市公路工程总公司 | Road maintenance patrol cooperative auxiliary system |
| CN113505945A (en) * | 2021-08-05 | 2021-10-15 | 上海中通吉网络技术有限公司 | BD card punching and shop visiting method for maintaining customer relationship and supervising BD personnel |
-
2021
- 2021-12-28 CN CN202111616581.8A patent/CN113988490B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109657908A (en) * | 2018-11-13 | 2019-04-19 | 北京国电龙源环保工程有限公司 | A kind of visiting method, system and computer readable storage medium |
| CN110880238A (en) * | 2019-10-21 | 2020-03-13 | 广州丰石科技有限公司 | Road congestion monitoring method based on mobile phone communication big data |
| CN110866987A (en) * | 2019-11-19 | 2020-03-06 | 泰康保险集团股份有限公司 | Patrol method, device, server, storage medium and electronic equipment |
| CN112327925A (en) * | 2020-11-24 | 2021-02-05 | 天津市公路工程总公司 | Road maintenance patrol cooperative auxiliary system |
| CN113505945A (en) * | 2021-08-05 | 2021-10-15 | 上海中通吉网络技术有限公司 | BD card punching and shop visiting method for maintaining customer relationship and supervising BD personnel |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113988490B (en) | 2022-03-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9534914B1 (en) | Cognitive needs-based trip planning | |
| US10623894B2 (en) | Cognitive geofence updates | |
| US11158010B2 (en) | Incremental search based multi-modal journey planning | |
| US9554402B2 (en) | Freeing up mobile network for important phone calls in case of disaster | |
| US20180293687A1 (en) | Ridesharing management for autonomous vehicles | |
| US20200356237A1 (en) | Graphical chatbot interface facilitating user-chatbot interaction | |
| US20190147468A1 (en) | Location evaluation | |
| US11537872B2 (en) | Imitation learning by action shaping with antagonist reinforcement learning | |
| US10956674B2 (en) | Creating cost models using standard templates and key-value pair differential analysis | |
| CN111860929B (en) | Method and system for estimating spelling rate of carpooling order | |
| CN108573315A (en) | A kind of prompt message determines method, system and computer readable storage medium | |
| US11023939B2 (en) | Method, device, and computer-readable medium for smart refueling event management | |
| US20180373997A1 (en) | Automatically state adjustment in reinforcement learning | |
| US20220026222A1 (en) | Method, Machine Readable Medium, Device, and Vehicle For Determining a Route Connecting a Plurality of Destinations in a Road Network, Method, Machine Readable Medium, and Device For Training a Machine Learning Module | |
| CN111859172A (en) | Information pushing method and device, electronic equipment and computer readable storage medium | |
| US11928641B2 (en) | Self adaptive delivery based on simulated disruption | |
| CN113988490B (en) | Method, apparatus, and medium for planning a patrol path | |
| US20180180431A1 (en) | Determining Commute Tolerance Areas | |
| CN111896020A (en) | Method for information processing, electronic device, and storage medium | |
| EP3965026A1 (en) | Method and device for use in information processing, and computer storage medium | |
| US10739155B2 (en) | Cognitive route quality-learning service | |
| US11995154B2 (en) | Method of determining state of target object, electronic device, and storage medium | |
| US20230177612A1 (en) | Dynamic micro-insurance premium value optimization using digital twin based simulation | |
| US11647377B2 (en) | Mobile device roaming optimization and operation | |
| US20170350714A1 (en) | Route planning based on connectivity of nodes |
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 |