CN112733309A - Method and device for determining layout position, electronic device and storage medium - Google Patents
Method and device for determining layout position, electronic device and storage medium Download PDFInfo
- Publication number
- CN112733309A CN112733309A CN202110099303.3A CN202110099303A CN112733309A CN 112733309 A CN112733309 A CN 112733309A CN 202110099303 A CN202110099303 A CN 202110099303A CN 112733309 A CN112733309 A CN 112733309A
- Authority
- CN
- China
- Prior art keywords
- target
- garbage
- cans
- determining
- trash
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- 239000010813 municipal solid waste Substances 0.000 claims abstract description 333
- 238000011156 evaluation Methods 0.000 claims description 22
- 238000004891 communication Methods 0.000 claims description 18
- 238000004590 computer program Methods 0.000 claims description 11
- 230000006870 function Effects 0.000 description 14
- 238000003064 k means clustering Methods 0.000 description 9
- 238000004422 calculation algorithm Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000005070 sampling Methods 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000001568 sexual effect Effects 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
- G06F18/232—Non-hierarchical techniques
- G06F18/2321—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
- G06F18/23213—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
- G06F30/27—Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
-
- 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/043—Optimisation of two dimensional placement, e.g. cutting of clothes or wood
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Evolutionary Computation (AREA)
- Human Resources & Organizations (AREA)
- Geometry (AREA)
- Strategic Management (AREA)
- General Engineering & Computer Science (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- Tourism & Hospitality (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Artificial Intelligence (AREA)
- Development Economics (AREA)
- Computer Hardware Design (AREA)
- General Health & Medical Sciences (AREA)
- Computer Networks & Wireless Communication (AREA)
- Educational Administration (AREA)
- Evolutionary Biology (AREA)
- Primary Health Care (AREA)
- Bioinformatics & Computational Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Health & Medical Sciences (AREA)
- Computational Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Medical Informatics (AREA)
- Software Systems (AREA)
- Refuse Collection And Transfer (AREA)
Abstract
The application provides a method and a device for determining a layout position, electronic equipment and a storage medium, wherein the method comprises the following steps: determining a first placement position of the plurality of first trash cans, wherein the first placement position comprises a first sub-position of each of the plurality of first trash cans within the target area; acquiring a first using time of a plurality of first garbage cans, wherein the first using time comprises a first sub-time of each first garbage can used in a first time period; and determining target arrangement positions of the plurality of target garbage cans according to the first placement positions and the first using times, wherein the target arrangement positions comprise target sub-arrangement positions of each target garbage can in the plurality of target garbage cans in the target area. Through the garbage can, the problems that in the related art, labor cost is high and positions are unreasonably laid in a garbage can laying mode in a specific area are solved.
Description
Technical Field
The present application relates to the field of data processing, and in particular, to a method and an apparatus for determining a layout position, an electronic device, and a storage medium.
Background
At present, subways increasingly become transportation means used by people for going out. In order to ensure cleanness and sanitation in the subway region, a plurality of garbage boxes are distributed in the subway region. The layout design of the dustbin in the subway region is only carried out by the manual work according to the feeling, the workers spend longer time to plan the region, and due to the fact that a scientific reasonable plan is not carried out, unreasonable arrangement of the dustbin position is probably caused, people are unsatisfied with subway service, or waste of space resources is caused by excessively arranging the dustbin.
Therefore, the related art method for arranging the trash can in a specific area (e.g., a subway area) has the problems of high labor cost and unreasonable position arrangement.
Disclosure of Invention
The application provides a method and a device for determining a layout position, electronic equipment and a storage medium, which are used for solving the problems of high labor cost and unreasonable position layout in a mode of arranging a garbage can in a specific area in the related art.
According to an aspect of an embodiment of the present application, there is provided a method for determining a layout position, including: determining a first placement location for a plurality of first trashcans, wherein the first placement location comprises a first sub-location of each of the plurality of first trashcans within a target area; obtaining a first usage number of the plurality of first trash cans, wherein the first usage number comprises a first sub-number of times that each first trash can is used in a first time period; determining target layout positions of a plurality of target garbage cans according to the first placement position and the first using times, wherein the target layout positions comprise target sub-layout positions of each target garbage can in the target area.
Optionally, determining the target deployment position of the plurality of target trash cans according to the first placement position and the first number of uses comprises: according to the first using times, selecting the garbage cans of which the using times are larger than or equal to a target time threshold value from the first garbage cans to obtain a plurality of second garbage cans; and determining the target arrangement positions of the target garbage cans according to a second placement position and/or a second use number, wherein the second placement position is the position corresponding to the second garbage cans in the first placement position, and the second use number is the number corresponding to the second garbage cans in the first use number.
Optionally, before selecting the trash can with the usage number greater than or equal to the target number threshold from the plurality of first trash cans according to the first usage number, the method further includes: calculating a first average value corresponding to the plurality of first garbage cans according to the first using times, wherein the first average value is an average value of the first sub times of each first garbage can; and determining the product of the first average value and a target proportion as the target time threshold, wherein the target proportion is less than 1.
Optionally, determining the target deployment position of the plurality of target trash cans according to the second placement position and/or the second number of uses comprises: clustering the plurality of second garbage cans according to the second placing positions and/or the second using times to obtain a plurality of target cluster types; and determining the target layout positions of the target garbage cans according to the central point positions of the target clusters.
Optionally, clustering the plurality of second trash cans according to the second placement position and/or the second number of times of use, and obtaining a plurality of target clusters includes: selecting a plurality of initial centroids, wherein the number of the centroids is the number of the plurality of target garbage cans which are configured in advance; circularly performing the following clustering steps until the plurality of centroids after updating are the same as the plurality of centroids before updating: determining a distance between each of the plurality of second trashcans and each of the plurality of centroids according to the second placement location; clustering the plurality of second garbage cans according to the distance between each second garbage can and each centroid to obtain a plurality of reference clusters; updating the plurality of centroids by using the central point positions of the plurality of reference clusters to obtain the updated plurality of centroids; wherein the target clusters are the reference clusters obtained after the clustering step is executed circularly.
Optionally, after determining the target deployment position of the plurality of target trash cans according to the first placement position and/or the first number of uses, the method further comprises: obtaining target use times of the target garbage cans, wherein the target use times comprise target sub-times of use of each target garbage can in a second time period; determining target variances corresponding to the plurality of target trash cans, wherein the target variances are variances of the target sub-times of each target trash can; and determining a target evaluation result corresponding to the target layout position according to the target variance, wherein the target evaluation result comprises the target variance.
According to another aspect of the embodiments of the present application, there is provided a layout position determination apparatus including: a first determination unit, configured to determine a first placement position of a plurality of first trashcans, wherein the first placement position includes a first sub-position of each of the plurality of first trashcans within a target area; a first obtaining unit, configured to obtain a first number of times of use of the plurality of first trash cans, where the first number of times of use includes a first sub-number of times of use of each first trash can in a first time period; a second determining unit, configured to determine target deployment positions of a plurality of target trash cans according to the first placement position and the first number of times of use, where the target deployment positions include target sub-deployment positions of each of the plurality of target trash cans within the target area.
Optionally, the second determining unit includes: the selecting module is used for selecting the garbage cans of which the using times are larger than or equal to a target time threshold value from the plurality of first garbage cans according to the first using times to obtain a plurality of second garbage cans; the determining module is configured to determine the target layout positions of the target trash cans according to a second placement position and/or a second number of times of use, where the second placement position is a position in the first placement position corresponding to the second trash cans, and the second number of times of use is a number of times in the first number of times of use corresponding to the second trash cans.
Optionally, the apparatus further comprises: a calculating unit, configured to calculate a first average value corresponding to the plurality of first trash cans according to the first number of usage times before selecting trash cans, of which the number of usage times is greater than or equal to the target number threshold, from the plurality of first trash cans according to the first number of usage times, where the first average value is an average value of the first sub-number of times of each first trash can; a third determining unit, configured to determine a product of the first average and a target ratio as the target number threshold, where the target ratio is smaller than 1.
Optionally, the first determining module includes: the clustering submodule is used for clustering the plurality of second garbage cans according to the second placing position and/or the second using times to obtain a plurality of target clusters; and the determining submodule is used for determining the target layout positions of the target garbage cans according to the central point positions of the target clusters.
Optionally, the clustering submodule includes: the selecting subunit is used for selecting a plurality of initial centroids, wherein the number of the centroids is the number of the plurality of target garbage cans configured in advance; a clustering subunit configured to perform the following clustering steps in a loop until the updated centroids are the same as the plurality of centroids before updating: determining a distance between each of the plurality of second trashcans and each of the plurality of centroids according to the second placement location; clustering the plurality of second garbage cans according to the distance between each second garbage can and each centroid to obtain a plurality of reference clusters; updating the plurality of centroids by using the central point positions of the plurality of reference clusters to obtain the updated plurality of centroids; wherein the target clusters are the reference clusters obtained after the clustering step is executed circularly.
Optionally, the apparatus further comprises: a second obtaining unit, configured to obtain target usage times of the plurality of target trash cans after determining the target arrangement positions of the plurality of target trash cans according to the first placement position and the first usage times, where the target usage times include a target sub-number of times that each target trash can is used in a second time period; a fourth determining unit, configured to determine target variances corresponding to the plurality of target trash cans, where the target variances are variances of the target sub-times of each target trash can; and the fifth determining unit is used for determining a target evaluation result corresponding to the target layout position according to the target variance, wherein the target evaluation result comprises the target variance.
According to another aspect of the embodiments of the present application, there is also provided an electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory communicate with each other through the communication bus; wherein the memory is used for storing the computer program; a processor for performing the method steps in any of the above embodiments by running the computer program stored on the memory.
According to a further aspect of the embodiments of the present application, there is also provided a computer-readable storage medium, in which a computer program is stored, wherein the computer program is configured to perform the method steps of any of the above embodiments when the computer program is executed.
In the embodiment of the application, the arrangement positions of the garbage cans are determined according to the counted use times of the garbage cans in different positions, and the first placement positions of the plurality of first garbage cans are determined, wherein the first placement positions comprise first sub positions of each of the plurality of first garbage cans in a target area; acquiring a first using time of a plurality of first garbage cans, wherein the first using time comprises a first sub-time of each first garbage can used in a first time period; the target arrangement positions of the target garbage cans are determined according to the first placement positions and the first use times, wherein the target arrangement positions comprise the target sub-arrangement positions of each target garbage can in the target areas, the garbage can arrangement positions are determined according to the use times of the garbage cans in different counted positions, and compared with a manual garbage can arrangement mode, the garbage can arrangement mode depends on the actual use conditions of the garbage cans, so that the purpose of automatically determining the garbage can arrangement positions is achieved, the technical effects of reducing labor cost and improving the reasonability of the garbage can arrangement positions are achieved, and the problems that in the related technology, the labor cost is high and the position arrangement is unreasonable in a garbage can arrangement mode in a specific area are solved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
FIG. 1 is a schematic flow chart diagram of an alternative deployment location determination method according to an embodiment of the present application;
FIG. 2 is a schematic flow chart diagram of an alternative deployment location determination method according to an embodiment of the present application;
FIG. 3 is a block diagram of an alternative deployment location determining apparatus according to an embodiment of the present application;
fig. 4 is a block diagram of an alternative electronic device according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
According to one aspect of the embodiments of the present application, a method for determining a layout position is provided. Alternatively, in this embodiment, the method for determining the layout position may be applied to a hardware environment formed by a trash can and a terminal. The garbage can be a garbage can which is arranged in a specific area and has a function of counting the number of times of use, and the garbage can is used for counting the number of times of use. The quantity of the garbage cans can be multiple, each garbage can be connected with the terminal through the network, the counted use times are sent to the terminal, and the terminal determines the arrangement positions of the garbage cans required to be arranged based on the positions and the use times of the garbage cans.
The network may include, but is not limited to, at least one of: wired networks, wireless networks. The wired network may include, but is not limited to, at least one of: wide area networks, metropolitan area networks, local area networks, which may include, but are not limited to, at least one of the following: WIFI (Wireless Fidelity), bluetooth. The terminal may not be limited to a PC, a mobile phone, a tablet computer, and the like.
The method for determining the layout position in the embodiment of the application can be executed by a garbage can, a terminal, or both the garbage can and the terminal. The method for determining the layout position of the terminal according to the embodiment of the present application may be executed by a client installed on the terminal.
Taking the method for determining the layout position in this embodiment executed by the terminal device as an example, fig. 1 is a schematic flow chart of an optional method for determining the layout position according to this embodiment, and as shown in fig. 1, the flow of the method may include the following steps:
step S102, a first placement position of the plurality of first trash cans is determined, wherein the first placement position includes a first sub-position of each of the plurality of first trash cans in the target area.
The method and the device for planning the arrangement positions of the garbage cans in the specific area can be applied to the scene of planning the arrangement positions of the garbage cans in the specific area, the specific area can be an area in public places such as subways and parks, or other areas with the requirement of arranging a plurality of garbage cans, and the specific area is not limited in the embodiment.
The target area is one of the above-described specific areas, for example, a subway area. Enough trash cans (i.e., a plurality of first trash cans) can be disposed in the target area to sample the usage of the trash cans in the target area. The placement location of different first trashcans may be different for a plurality of first trashcans.
The terminal device may determine a first placement location for a plurality of first trashcans, the first placement location including a first sub-location of each first trashcan within the target area. For a first trash can, a placement position (a first sub-position) of the first trash can in the target area may be reported by the first trash can in real time, may be configured in advance through a configuration file, and may also be input by a target object (a user of the terminal device) through an input component (e.g., a keyboard, a touch screen, etc.), which is not limited in this embodiment.
Step S104, acquiring a first using frequency of a plurality of first garbage cans, wherein the first using frequency comprises a first sub-frequency of each first garbage can used in a first time period.
The first trash can be a trash can with a function of counting the number of times of use, so that the number of times of use of the trash can in a certain time can be counted conveniently, the number of times of use can be represented by the number of times of being opened, that is, the first trash can be a trash can with a function of counting the number of times of being opened.
The terminal device may obtain the number of times each of the plurality of first trash cans is used in the first time period, i.e., the first sub-number of times, thereby obtaining the first number of times of use. The manner of acquiring the first number of times of use by the terminal device may be various, and may include but is not limited to at least one of the following: the first trash can is used for periodically and actively reporting, and the first trash can is obtained from the first trash can through manual input of a user (reading when the first trash can is close to the first trash can, and reporting of the first trash can is triggered by issuing a reporting instruction).
As an optional embodiment, the number of times each first trash can is used in the first time period may be actively reported by the first trash can, that is, obtaining the first number of times of use of the plurality of first trash cans includes: and receiving a first sub-frequency reported by each first garbage can and used by each garbage can in a first time period to obtain a first using frequency of the plurality of first garbage cans.
As another alternative, the obtaining the first number of uses of the first trash cans includes: issuing a reporting instruction to each first garbage can, wherein the reporting instruction is used for indicating the number of times that each first garbage can is used for reporting; and receiving a first sub-frequency reported by each first garbage can and used by each garbage can in a first time period to obtain a first using frequency of the plurality of first garbage cans.
For example, a sufficient number of temporary portable trashcans (first trashcans) having a function of counting the number of times of being opened may be arranged at different positions of one floor of the subway station, and the position information identifying n trashcans is (x1, y1), (x2, y2) … … (xn, yn). The use times of the garbage cans at different positions of the subway are sampled and counted by the arranged temporary portable garbage cans. Through statistical analysis, the use times of the n garbage cans are recorded as Z1 and Z2 … … Zn respectively.
And S106, determining target layout positions of the target garbage cans according to the first placement position and the first using times, wherein the target layout positions comprise target sub-layout positions of each target garbage can in the target area.
The goal of trash can deployment is to place multiple target trash cans in the proper location within the target area. The number of the plurality of target trash cans may be preset, or may be determined according to the first placement position and the first number of uses, which is not limited in this embodiment.
The terminal equipment can analyze the first placement position and the first use times, and determine the layout position (target sub-layout position) of each target garbage can from the target area, namely, determine which positions are suitable for placing the garbage cans, thereby determining the target layout positions of the target garbage cans.
The first placing position and the first using times can be analyzed in various ways, for example, a plurality of placing positions selected from the first placing positions of the first trash cans as target placing positions according to the first using times can be selected, or: and selecting a plurality of positions from the target area as target layout positions according to the first placing position and the first using times. The selection condition of the layout position can comprise: the position of the first garbage can with more use times is closer, and the position of the first garbage can with less use times is farther. This is not limited in this embodiment.
Determining a first placement position of the plurality of first trash cans through the steps S102 to S106, wherein the first placement position includes a first sub-position of each of the plurality of first trash cans in the target area; acquiring a first using time of a plurality of first garbage cans, wherein the first using time comprises a first sub-time of each first garbage can used in a first time period; according to the first placement position and the first use times, the target arrangement positions of the target garbage cans are determined, wherein the target arrangement positions comprise the target sub-arrangement positions of each target garbage can in the target area, the problems that in the related art, the labor cost is high and the position arrangement is unreasonable in the garbage can arrangement mode in the specific area are solved, the labor cost is reduced, and the reasonability of the garbage can arrangement positions is improved.
As an alternative embodiment, determining the target deployment positions of the plurality of target trash cans according to the first placement position and the first number of uses comprises:
s11, selecting the garbage cans of which the using times are larger than or equal to the target time threshold value from the first garbage cans according to the first using times to obtain a plurality of second garbage cans;
and S12, determining target arrangement positions of the target garbage cans according to a second arrangement position and/or a second use frequency, wherein the second arrangement position is a position corresponding to the second garbage cans in the first arrangement position, and the second use frequency is a frequency corresponding to the second garbage cans in the first use frequency.
When the target arrangement positions are determined, the placement positions and the use times of all the first garbage cans can be analyzed, so that the target arrangement positions of a plurality of target garbage cans are determined.
Optionally, in order to improve the efficiency of determining the arrangement positions of the trash cans, the plurality of first trash cans may be screened, a part of the trash cans (i.e., the plurality of second trash cans) may be selected from the plurality of first trash cans, and the placement positions and the number of times of use of the selected part of the trash cans are analyzed, so as to determine the target arrangement positions of the plurality of target trash cans.
The terminal device can select the trash cans with the usage times larger than or equal to the target time threshold value from the plurality of first trash cans according to the first usage times (namely, the usage times of each first trash can), and obtain a plurality of second trash cans. The target number threshold may be a fixed number configured in advance, or may be a number determined according to the first usage number, which is not limited in this embodiment.
After selecting the plurality of second trash cans, the terminal device may obtain the placement position, i.e., the second sub-position, of each second trash can from the first placement position to obtain a second placement position, where the second placement position includes the second sub-position of each second trash can. The terminal device may obtain the number of times of use of each second trash can from the first number of times of use, that is, the second sub-number of times of use, to obtain a second number of times of use, where the second number of times of use includes the number of times of use of each second trash can.
After determining the second placement position and the second number of times of use, the terminal device may determine the target arrangement positions of the plurality of target trash cans according to at least one of the second placement position and the second number of times of use (e.g., according to the second placement position, and the second number of times of use). The determination method of the target layout position is similar to that described above, and is not described herein again.
Through this embodiment, through screening a plurality of first garbage bins according to the number of times of use, can improve the garbage bin and lay the efficiency that the position was confirmed.
As an alternative embodiment, before the garbage can with the usage number greater than or equal to the target number threshold is selected from the plurality of first garbage cans according to the first usage number, the method further includes:
s21, calculating a first average value corresponding to the plurality of first garbage cans according to the first using times, wherein the first average value is an average value of the first sub times of each first garbage can;
and S22, determining the product of the first average value and the target proportion as a target frequency threshold value, wherein the target proportion is less than 1.
The target number threshold may be determined based on the first number of uses. The terminal device may calculate a first average value corresponding to the plurality of first trash cans according to the first number of times of use. For example, the terminal device may first sum the first sub-times of each first trash can to obtain a sum of the first usage times; and then carrying out quotient calculation on the sum of the first using times and the number of the first garbage cans so as to obtain a first average value.
The first average value may be directly used as the target number threshold, that is, the target number threshold is the calculated first average value. In order to ensure the reasonability of the layout of the garbage cans, avoid the garbage cans from being concentrated in transition and avoid the garbage cans not being arranged in a part of areas with use requirements, a proportion (namely, a target proportion) can be multiplied on the basis of the first average value, and the obtained value is determined as a target frequency threshold.
For example, the average value of the number of usage times of n trash cans is calculated by the formula (1)
Wherein Zi is the number of times of use of each garbage can.
Garbage bin with statistics frequency lower than 30% of mean value (
) And identifying the garbage cans as invalid arrangements, and rejecting the using times and the position information of the garbage cans with the invalid arrangements. After the data is screened, the information such as the number, the using times and the positions of the last remaining garbage cans (a plurality of second garbage cans) can be obtained.
As an alternative embodiment, the determining the target arrangement positions of the plurality of target trash cans according to the second placement position and/or the second usage number comprises:
s31, clustering the second garbage cans according to the second placement positions and/or the second using times to obtain a plurality of target cluster;
and S32, determining the target layout positions of the target garbage cans according to the central point positions of the target clusters.
In order to improve the rationality of the target arrangement position determination, a plurality of second target garbage cans can be clustered according to the second placement position and/or the second using times to obtain a plurality of target clusters. The clustering may be based on the second placement position, may be based on the second placement position and the second number of times of use, and may be based on the second number of times of use. The clustering manner used for clustering the plurality of second target garbage cans may be various, for example, K-means (K average), mean shift clustering, density-based clustering, and the like, which is not limited in this embodiment.
After obtaining a plurality of target class clusters, the terminal device may determine the center point position of each target class cluster. The center point location of a cluster may be: the average of the positions of the individual data points contained in the cluster. According to the central point positions of the target clusters, the terminal equipment can determine the target layout positions of the target garbage cans, and the central point position of one target cluster can be used for determining the layout position of one target garbage can.
The target arrangement positions may be determined in various manners, for example, the central point positions of a plurality of target clusters may be determined as the target arrangement positions of a plurality of target trash cans, and for example, the second placement position of a second trash can in one target cluster, which is closest to the central point position of the target cluster, may be determined as the arrangement position of the corresponding target trash can.
Optionally, in this embodiment, determining the target layout positions of the plurality of target trash cans according to the center point positions of the plurality of target clusters may include: under the condition that the central point position of a first cluster in the target clusters is located in an area allowing the garbage can to be placed in the target area, determining the central point position of the first cluster as a target sub-layout position of a target garbage can; and under the condition that the central point position of a second cluster in the target clusters is positioned outside the region, in which the garbage can is allowed to be placed, of the target region, determining a position, in the region, in which the garbage can is allowed to be placed, closest to the central point position of the second cluster, as a target sub-layout position of the target garbage can.
Through this embodiment, through clustering a plurality of second garbage bins, can improve the rationality of the laying position of the target garbage bin of confirming.
As an alternative embodiment, clustering the plurality of second trash cans according to the second placement position and/or the second usage number to obtain a plurality of target clusters includes:
s41, selecting a plurality of initial centroids, wherein the number of the centroids is the number of a plurality of preconfigured target garbage cans;
s42, the following clustering steps are performed in a loop until the plurality of centroids after updating are the same as the plurality of centroids before updating: determining a distance between each of the plurality of second trashcans and each of the plurality of centroids according to the second placement location; clustering the plurality of second garbage cans according to the distance between each second garbage can and each center of mass to obtain a plurality of reference clusters; updating the plurality of centroids by using the central point positions of the plurality of reference clusters to obtain a plurality of updated centroids;
the target clusters are obtained after the clustering step is executed circularly.
In this embodiment, what is adopted to cluster the plurality of second trash cans may be: the K-means clustering algorithm and the K-means clustering algorithm are used as unsupervised algorithms in machine learning and can be widely applied to the field of data processing.
When the K-means clustering algorithm is used for clustering, the number of the cluster clusters to be clustered, namely the number of the target garbage cans can be configured in advance. For example, the number k of the garbage cans required to be installed to meet the basic subway demand is determined according to the amount of garbage obtained based on experience.
According to the number of the target garbage cans required to be arranged, the terminal device can select a plurality of position points from the target area to serve as a plurality of initial centroids (a plurality of initial centroids), and perform K-means clustering on the plurality of target garbage cans based on the selected plurality of centroids and the second placement position. The end condition of the K-means cluster may be: the plurality of centroids after updating are the same as the plurality of centroids before updating.
In the process of one round of clustering, for a second trash can, the terminal device may determine, according to the second placement position, the distance between the second trash can and each centroid, thereby determining the class cluster divided by the second trash can, where the divided class cluster may be the class cluster corresponding to the centroid closest to the second trash can. After the class cluster divided by each second trash can is determined, a primary clustering result of a plurality of second trash cans can be obtained, that is, a plurality of reference class clusters are obtained.
After obtaining the plurality of reference clusters, the terminal device may update the plurality of centroids using the center point positions of the plurality of reference clusters (the center point positions of the plurality of reference clusters correspond to the plurality of centroids one to one). And if the plurality of updated centroids are the same as the plurality of centroids before updating, finishing clustering, and performing the next round of clustering operation until the plurality of updated centroids are the same as the plurality of centroids before updating. The plurality of target class clusters are a plurality of reference class clusters in the last round of clustering operation.
For example, the garbage can layout can be performed by a K-means clustering algorithm, and the K-means clustering process can include the following steps:
step 1, drawing the position of the screened temporary portable subway garbage can on a plan view through software;
step 2, determining the number k of clustering center points according to the number of the garbage bins required to be installed;
step 3, selecting clustering centers, respectively calculating the distance from each point to each clustering center, and then dividing the point to the nearest clustering center, so that k clusters are formed;
step 4, recalculating the mean value of each cluster;
and 5, repeatedly executing the steps 3 to 4 until the position of the center of mass does not change or the sum of the distances from each point (sample) to the corresponding clustering center does not change greatly, and obtaining the coordinates of the clustering center point, namely the position of the dustbin to be installed.
Through the embodiment, the plurality of second garbage cans are clustered through the K-means clustering algorithm, and the efficiency and convenience for determining the target layout position can be improved.
As an alternative embodiment, after determining the target layout positions of the plurality of target trash cans according to the first placement position and the first number of uses, the method further includes:
s51, acquiring target use times of a plurality of target garbage cans, wherein the target use times comprise target sub-times of use of each target garbage can in a second time period;
s52, determining target variances corresponding to a plurality of target garbage cans, wherein the target variances are the variances of the target sub-times of each target garbage can;
and S53, determining a target evaluation result corresponding to the target arrangement position according to the target variance, wherein the target evaluation result comprises the target variance.
After the layout of the garbage can is completed, an actual sample can be obtained, evaluation is carried out through an evaluation function, and the evaluation function J can be used for representing the reasonable degree of the layout of a plurality of target garbage cans.
The terminal device may first obtain the target use times of the multiple target trash cans, where the target use times include target sub-times that each target trash can is used in the second time period, and then calculate a difference between the target sub-times of each target trash can, so as to obtain target variances corresponding to the multiple target trash cans, and the manner of obtaining the target use times is similar to the manner of obtaining the first use times, which is not described herein again.
According to the target variance, the terminal device may determine a target evaluation result corresponding to the target layout position, for example, the target variance may be used as the target evaluation result, or other description information may be added on the basis of the target variance, for example, analysis information on the target layout position, and the like, which is not limited in this embodiment.
For example, an evaluation function J may be designed to evaluate the quality of the layout, and the evaluation function may be as shown in formula (2):
the sample set of X ═ { X1, X2 … Xi … Xn } is the number of times of use of different garbage cans in practical application, Xi is the average number of times of use of each garbage can, and the smaller the J value, the more reasonable the representation layout.
Through this embodiment, through using the evaluation function to lay the rationality of position to the target and appraise, can guarantee the rationality that the garbage bin laid.
The following explains a method of determining a layout position in the embodiment of the present application with reference to an alternative example. In the example, the target area is a subway, the condition that the subway uses the garbage can is sampled by setting enough garbage cans with the function of counting the use times, and then the sampling data is screened and subjected to K-means clustering treatment to obtain the optimal layout of the mounted garbage cans; and the reasonable degree of the layout of the subway dustbin is represented by using an evaluation function J.
As shown in fig. 2, the flow of the layout position determination method in the present alternative example may include the following steps:
step S202, setting a portable garbage can to perform data sampling on the condition that the garbage can is used by a subway;
step S204, screening the sampled data;
step S206, setting a clustering center point number k;
s208, clustering by using a K-means algorithm to obtain K clusters;
step S210, recalculating the centroid;
step S212, judging whether the centroid is changed, if so, executing step S208, otherwise, executing step S214;
step S214, outputting the optimal layout position;
step S216, acquiring an actual sample (actual use times of distributed garbage statistics);
step S218, evaluating the actual sample by using a J evaluation function;
in step S220, the evaluation result is output.
According to the method, the positions of the subway garbage cans are set through K-means clustering, so that resource waste caused by direct human sexual decision and inconvenience brought to passengers due to unreasonable layout are avoided; meanwhile, by adding the layout evaluation function J, the reasonability degree of the whole layout can be mastered in real time, and guidance can be given to subsequent layout adjustment.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., a ROM (Read-Only Memory)/RAM (Random Access Memory), a magnetic disk, an optical disk) and includes several instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the methods according to the embodiments of the present application.
According to another aspect of the embodiment of the application, a device for determining the layout position is also provided, wherein the device is used for implementing the method for determining the layout position. Fig. 3 is a block diagram of an alternative deployment location determining apparatus according to an embodiment of the present application, and as shown in fig. 3, the apparatus may include:
a first determining unit 302, configured to determine a first placement position of the plurality of first trash cans, where the first placement position includes a first sub-position of each of the plurality of first trash cans within the target area;
a first obtaining unit 304, configured to obtain a first usage count of the plurality of first trash cans, where the first usage count includes a first sub-count of times that each of the first trash cans is used in the first time period;
a second determining unit 306, configured to determine target deployment positions of the multiple target trash cans according to the first placement position and the first number of times of use, where the target deployment positions include target sub-deployment positions of each of the multiple target trash cans within the target area.
It should be noted that the first determining unit 302 in this embodiment may be configured to execute the step S102, the first obtaining unit 304 in this embodiment may be configured to execute the step S104, and the second determining unit 306 in this embodiment may be configured to execute the step S106.
Determining a first placement position of the plurality of first garbage cans through the modules, wherein the first placement position comprises a first sub-position of each first garbage can in the target area; acquiring a first using time of a plurality of first garbage cans, wherein the first using time comprises a first sub-time of each first garbage can used in a first time period; according to the first placement position and the first use times, the target arrangement positions of the target garbage cans are determined, wherein the target arrangement positions comprise the target sub-arrangement positions of each target garbage can in the target area, the problems that in the related art, the labor cost is high and the position arrangement is unreasonable in the garbage can arrangement mode in the specific area are solved, the labor cost is reduced, and the reasonability of the garbage can arrangement positions is improved.
As an alternative embodiment, the second determination unit includes:
the selecting module is used for selecting the garbage cans of which the using times are larger than or equal to the target time threshold value from the plurality of first garbage cans according to the first using times to obtain a plurality of second garbage cans;
the determining module is used for determining target layout positions of the target garbage cans according to a second placement position and/or a second use frequency, wherein the second placement position is a position corresponding to the second garbage cans in the first placement position, and the second use frequency is a frequency corresponding to the second garbage cans in the first use frequency.
As an alternative embodiment, the apparatus further comprises:
the calculating unit is used for calculating a first average value corresponding to the plurality of first garbage cans according to the first using times before the garbage cans with the using times larger than or equal to the target time threshold value are selected from the plurality of first garbage cans according to the first using times, wherein the first average value is the average value of the first sub-times of each first garbage can;
and the third determining unit is used for determining the product of the first average value and the target proportion as a target frequency threshold, wherein the target proportion is less than 1.
As an alternative embodiment, the first determining module includes:
the clustering submodule is used for clustering the second garbage cans according to the second placing position and/or the second using times to obtain a plurality of target clusters;
and the determining submodule is used for determining the target layout positions of the target garbage cans according to the central point positions of the target clusters.
As an alternative embodiment, the clustering submodule includes:
the selecting subunit is used for selecting a plurality of initial centroids, wherein the number of the centroids is the number of a plurality of preconfigured target garbage cans;
a clustering subunit configured to perform the following clustering steps in a loop until the plurality of updated centroids are the same as the plurality of centroids before updating: determining a distance between each of the plurality of second trashcans and each of the plurality of centroids according to the second placement location; clustering the plurality of second garbage cans according to the distance between each second garbage can and each center of mass to obtain a plurality of reference clusters; updating the plurality of centroids by using the central point positions of the plurality of reference clusters to obtain a plurality of updated centroids;
the target clusters are obtained after the clustering step is executed circularly.
As an alternative embodiment, the apparatus further comprises:
a second obtaining unit, configured to obtain target usage times of the plurality of target trash cans after determining target arrangement positions of the plurality of target trash cans according to the first placement position and the first usage times, where the target usage times include a target sub-number of times that each target trash can is used in a second time period;
a fourth determining unit, configured to determine target variances corresponding to a plurality of target trash cans, where the target variance is a variance of a target sub-number of times of each target trash can;
and the fifth determining unit is used for determining a target evaluation result corresponding to the target layout position according to the target variance, wherein the target evaluation result comprises the target variance.
It should be noted here that the modules described above are the same as the examples and application scenarios implemented by the corresponding steps, but are not limited to the disclosure of the above embodiments. It should be noted that the modules described above as a part of the apparatus may be operated in a hardware environment as shown in fig. 1, and may be implemented by software, or may be implemented by hardware, where the hardware environment includes a network environment.
According to another aspect of the embodiments of the present application, there is also provided an electronic device for implementing the method for determining a deployment location, where the electronic device may be a trash can, a terminal, or a combination thereof.
Fig. 4 is a block diagram of an alternative electronic device according to an embodiment of the present application, as shown in fig. 4, including a processor 402, a communication interface 404, a memory 406, and a communication bus 408, where the processor 402, the communication interface 404, and the memory 406 communicate with each other via the communication bus 408, where,
a memory 406 for storing a computer program;
the processor 402, when executing the computer program stored in the memory 406, performs the following steps:
s1, determining a first placement position of the plurality of first trash cans, wherein the first placement position comprises a first sub-position of each of the plurality of first trash cans in the target area;
s2, acquiring first use times of a plurality of first garbage cans, wherein the first use times comprise first sub times of using each first garbage can in a first time period;
and S3, determining target arrangement positions of the target garbage cans according to the first placement positions and the first use times, wherein the target arrangement positions comprise target sub-arrangement positions of each target garbage can in the target area.
Alternatively, in this embodiment, the communication bus may be a PCI (Peripheral Component Interconnect) bus, an EISA (Extended Industry Standard Architecture) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 4, but not only one bus or type of bus. The communication interface is used for communication between the electronic equipment and other equipment.
The memory may include RAM, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory. Alternatively, the memory may be at least one memory device located remotely from the processor.
As an example, the memory 406 may include, but is not limited to, the first determining unit 302, the first acquiring unit 304, and the second determining unit 306 of the above-described arrangement position determining device. In addition, other module units in the device for determining the layout position may also be included, but are not limited to these, and are not described in detail in this example.
The processor may be a general-purpose processor, and may include but is not limited to: a CPU (Central Processing Unit), an NP (Network Processor), and the like; but also a DSP (Digital Signal Processing), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment is not described herein again.
It can be understood by those skilled in the art that the structure shown in fig. 4 is only an illustration, and the device implementing the method for determining a layout position may be a terminal device, and the terminal device may be a terminal device such as a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palm computer, a Mobile Internet Device (MID), a PAD, and the like. Fig. 4 is a diagram illustrating a structure of the electronic device. For example, the electronic device may also include more or fewer components (e.g., network interfaces, display devices, etc.) than shown in FIG. 4, or have a different configuration than shown in FIG. 4.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program instructing hardware associated with the terminal device, where the program may be stored in a computer-readable storage medium, and the storage medium may include: flash disk, ROM, RAM, magnetic or optical disk, and the like.
According to still another aspect of an embodiment of the present application, there is also provided a storage medium. Alternatively, in this embodiment, the storage medium may be a program code for executing any one of the methods for determining a layout position in this embodiment.
Optionally, in this embodiment, the storage medium may be located on at least one of a plurality of network devices in a network shown in the above embodiment.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps:
s1, determining a first placement position of the plurality of first trash cans, wherein the first placement position comprises a first sub-position of each of the plurality of first trash cans in the target area;
s2, acquiring first use times of a plurality of first garbage cans, wherein the first use times comprise first sub times of using each first garbage can in a first time period;
and S3, determining target arrangement positions of the target garbage cans according to the first placement positions and the first use times, wherein the target arrangement positions comprise target sub-arrangement positions of each target garbage can in the target area.
Optionally, the specific example in this embodiment may refer to the example described in the above embodiment, which is not described again in this embodiment.
Optionally, in this embodiment, the storage medium may include, but is not limited to: various media capable of storing program codes, such as a U disk, a ROM, a RAM, a removable hard disk, a magnetic disk, or an optical disk.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
The integrated unit in the above embodiments, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in the above computer-readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including instructions for causing one or more computer devices (which may be personal computers, servers, network devices, or the like) to execute all or part of the steps of the method described in the embodiments of the present application.
In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed client may be implemented in other manners. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, and may also be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution provided in the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.
Claims (10)
1. A method of determining a deployment location, comprising:
determining a first placement location for a plurality of first trashcans, wherein the first placement location comprises a first sub-location of each of the plurality of first trashcans within a target area;
obtaining a first usage number of the plurality of first trash cans, wherein the first usage number comprises a first sub-number of times that each first trash can is used in a first time period;
determining target layout positions of a plurality of target garbage cans according to the first placement position and the first using times, wherein the target layout positions comprise target sub-layout positions of each target garbage can in the target area.
2. The method of claim 1, wherein determining the target deployment position for the plurality of target trashcans based on the first placement position and the first number of uses comprises:
according to the first using times, selecting the garbage cans of which the using times are larger than or equal to a target time threshold value from the first garbage cans to obtain a plurality of second garbage cans;
and determining the target arrangement positions of the target garbage cans according to a second placement position and/or a second use number, wherein the second placement position is the position corresponding to the second garbage cans in the first placement position, and the second use number is the number corresponding to the second garbage cans in the first use number.
3. The method of claim 2, wherein before selecting the trash can with the usage number greater than or equal to the target number threshold from the plurality of first trash cans according to the first usage number, the method further comprises:
calculating a first average value corresponding to the plurality of first garbage cans according to the first using times, wherein the first average value is an average value of the first sub times of each first garbage can;
and determining the product of the first average value and a target proportion as the target time threshold, wherein the target proportion is less than 1.
4. The method of claim 2, wherein determining the target deployment position for the plurality of target trashcans according to the second placement position and/or the second number of uses comprises:
clustering the plurality of second garbage cans according to the second placing positions and/or the second using times to obtain a plurality of target cluster types;
and determining the target layout positions of the target garbage cans according to the central point positions of the target clusters.
5. The method of claim 4, wherein clustering the second plurality of trash cans according to the second placement location and/or the second number of uses comprises:
selecting a plurality of initial centroids, wherein the number of the centroids is the number of the plurality of target garbage cans which are configured in advance;
circularly performing the following clustering steps until the plurality of centroids after updating are the same as the plurality of centroids before updating: determining a distance between each of the plurality of second trashcans and each of the plurality of centroids according to the second placement location; clustering the plurality of second garbage cans according to the distance between each second garbage can and each centroid to obtain a plurality of reference clusters; updating the plurality of centroids by using the central point positions of the plurality of reference clusters to obtain the updated plurality of centroids;
wherein the target clusters are the reference clusters obtained after the clustering step is executed circularly.
6. The method as claimed in any one of claims 1 to 5, wherein after determining the target deployment position of the plurality of target trashcans in accordance with the first placement position and/or the first number of uses, the method further comprises:
obtaining target use times of the target garbage cans, wherein the target use times comprise target sub-times of use of each target garbage can in a second time period;
determining target variances corresponding to the plurality of target trash cans, wherein the target variances are variances of the target sub-times of each target trash can;
and determining a target evaluation result corresponding to the target layout position according to the target variance, wherein the target evaluation result comprises the target variance.
7. A deployment location determining apparatus, comprising:
a first determination unit, configured to determine a first placement position of a plurality of first trashcans, wherein the first placement position includes a first sub-position of each of the plurality of first trashcans within a target area;
a first obtaining unit, configured to obtain a first number of times of use of the plurality of first trash cans, where the first number of times of use includes a first sub-number of times of use of each first trash can in a first time period;
a second determining unit, configured to determine target deployment positions of a plurality of target trash cans according to the first placement position and the first number of times of use, where the target deployment positions include target sub-deployment positions of each of the plurality of target trash cans within the target area.
8. The apparatus according to claim 7, wherein the second determining unit comprises:
the selecting module is used for selecting the garbage cans of which the using times are larger than or equal to a target time threshold value from the plurality of first garbage cans according to the first using times to obtain a plurality of second garbage cans;
the determining module is configured to determine the target layout positions of the target trash cans according to a second placement position and/or a second number of times of use, where the second placement position is a position in the first placement position corresponding to the second trash cans, and the second number of times of use is a number of times in the first number of times of use corresponding to the second trash cans.
9. An electronic device comprising a processor, a communication interface, a memory and a communication bus, wherein said processor, said communication interface and said memory communicate with each other via said communication bus,
the memory for storing a computer program;
the processor for performing the method steps of any one of claims 1 to 6 by running the computer program stored on the memory.
10. A computer-readable storage medium, in which a computer program is stored, wherein the computer program is configured to carry out the method steps of any one of claims 1 to 6 when executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110099303.3A CN112733309A (en) | 2021-01-25 | 2021-01-25 | Method and device for determining layout position, electronic device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110099303.3A CN112733309A (en) | 2021-01-25 | 2021-01-25 | Method and device for determining layout position, electronic device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112733309A true CN112733309A (en) | 2021-04-30 |
Family
ID=75593531
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110099303.3A Pending CN112733309A (en) | 2021-01-25 | 2021-01-25 | Method and device for determining layout position, electronic device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112733309A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114418250A (en) * | 2022-04-01 | 2022-04-29 | 城云科技（中国）有限公司 | Method, device and application for setting environmental sanitation facilities |
| CN114764654A (en) * | 2022-04-24 | 2022-07-19 | 重庆旅游云信息科技有限公司 | Garbage can management method and system suitable for scenic spot |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN204776976U (en) * | 2015-03-20 | 2015-11-18 | 贵州师范学院 | Garbage bin intelligent management system based on internet of things |
| CN106429114A (en) * | 2016-12-27 | 2017-02-22 | 安庆师范大学 | Intelligent trash can based on internet of things and work method thereof |
| CN107682082A (en) * | 2017-10-13 | 2018-02-09 | 朱平 | A kind of cell dustbin management system based on Internet of Things |
| CN108053058A (en) * | 2017-11-29 | 2018-05-18 | 东南大学 | A kind of electric taxi charging pile site selecting method based on big data |
| CN108196455A (en) * | 2017-12-26 | 2018-06-22 | 北京康力优蓝机器人科技有限公司 | A kind of intelligence pickup robot |
| CN108833144A (en) * | 2018-05-30 | 2018-11-16 | 南京海兴电网技术有限公司 | A kind of intelligent electric meter concentrator site selecting method based on class statistic model |
| CN110533081A (en) * | 2019-08-07 | 2019-12-03 | 北京三快在线科技有限公司 | A kind of determination is got on the bus method, apparatus, equipment and the storage medium of information |
-
2021
- 2021-01-25 CN CN202110099303.3A patent/CN112733309A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN204776976U (en) * | 2015-03-20 | 2015-11-18 | 贵州师范学院 | Garbage bin intelligent management system based on internet of things |
| CN106429114A (en) * | 2016-12-27 | 2017-02-22 | 安庆师范大学 | Intelligent trash can based on internet of things and work method thereof |
| CN107682082A (en) * | 2017-10-13 | 2018-02-09 | 朱平 | A kind of cell dustbin management system based on Internet of Things |
| CN108053058A (en) * | 2017-11-29 | 2018-05-18 | 东南大学 | A kind of electric taxi charging pile site selecting method based on big data |
| CN108196455A (en) * | 2017-12-26 | 2018-06-22 | 北京康力优蓝机器人科技有限公司 | A kind of intelligence pickup robot |
| CN108833144A (en) * | 2018-05-30 | 2018-11-16 | 南京海兴电网技术有限公司 | A kind of intelligent electric meter concentrator site selecting method based on class statistic model |
| CN110533081A (en) * | 2019-08-07 | 2019-12-03 | 北京三快在线科技有限公司 | A kind of determination is got on the bus method, apparatus, equipment and the storage medium of information |
Non-Patent Citations (3)
| Title |
|---|
| 周晓晔等: "快递包装回收网络中回收点选址研究", 包装工程, vol. 41, no. 11, pages 201 - 208 * |
| 贾娜: "我国城市生活垃圾收运系统的研究", 中国优秀硕士学位论文全文数据库工程科技Ⅰ辑, no. 10, pages 027 - 510 * |
| 韩琦: "公共自行车系统租赁点动态行为仿真研究", 中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑, no. 02, pages 034 - 538 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114418250A (en) * | 2022-04-01 | 2022-04-29 | 城云科技（中国）有限公司 | Method, device and application for setting environmental sanitation facilities |
| CN114764654A (en) * | 2022-04-24 | 2022-07-19 | 重庆旅游云信息科技有限公司 | Garbage can management method and system suitable for scenic spot |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jagtenberg et al. | An efficient heuristic for real-time ambulance redeployment | |
| CN112733309A (en) | Method and device for determining layout position, electronic device and storage medium | |
| CN105898762B (en) | Base station optimization and deployment method and device | |
| US10642257B2 (en) | Tree search-based scheduling method and electronic apparatus using the same | |
| CN111815169B (en) | Service approval parameter configuration method and device | |
| CN103971170A (en) | Method and device for forecasting changes of feature information | |
| CN106780064B (en) | Region division method, device and network equipment | |
| CN103249063A (en) | Testing method and device for matching rated quantity with actual consumption of telecommunication service | |
| CN110392414B (en) | Wireless network connection method and device, terminal equipment and readable storage medium | |
| WO2021098615A1 (en) | Filling method and device for genotype data missing, and server | |
| EP2416290A1 (en) | Position information analysis device and position information analysis method | |
| CN112784039A (en) | Method, device and storage medium for distributing online customer service | |
| CN105468161A (en) | Instruction execution method and device | |
| CN105300398A (en) | Method, device and system for acquiring site information | |
| CN111797320A (en) | Data processing method, device, equipment and storage medium | |
| Rossit et al. | A bi-objective integer programming model for locating garbage accumulation points: A case study | |
| CN106327236B (en) | Method and device for determining action track of user | |
| KR101028810B1 (en) | Apparatus and method for analyzing advertisement target | |
| CN109618281A (en) | A kind of recognition methods of high-speed rail cell and device | |
| CN112749898A (en) | Order allocation method, model training method and device and electronic equipment | |
| Rossit et al. | Municipal solid waste management in smart cities: facility location of community bins | |
| CN106681803A (en) | Task scheduling method and server | |
| CN115204753A (en) | Intelligent farm trade place behavior monitoring method and system and readable storage medium | |
| CN109242580B (en) | Method for determining recommended emporium of target brand in specified city | |
| CN112561376A (en) | Method and device for splitting project and storage 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 |