Aggregation area determination method, system, electronic device, and readable storage medium

Abstract

The application relates to the technical field of regional planning, and discloses an aggregation region determination method, system, electronic equipment and readable storage medium, wherein compared with fixed planning regions, the method filters login nodes with a distance greater than a preset minimum distance from original nodes according to node distances, avoids interference caused by target flow, determines a center node and edge nodes of the center node according to the collection quantity of the login nodes, and determines a target aggregation region of the center node according to the node positions of the edge nodes, so that the target aggregation region is determined according to the collection quantity, the aggregation region is dynamically generated according to the target flow condition and the target aggregation condition, the target trend is accurately grasped, the rationality of the distribution of epidemic prevention resources is improved, and the epidemic prevention efficiency is improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of regional planning, and particularly relates to a gathering area determination method and system, an electronic device and a readable storage medium. BACKGROUND

[0002] At present, with the continuous development of epidemic prevention, dividing regions into different areas for epidemic prevention resource allocation can effectively alleviate the epidemic prevention pressure of different regions.

[0003] However, by dividing the epidemic prevention by fixed regions, the personnel gathering situation and personnel flow situation cannot be accurately represented, the personnel trend cannot be accurately grasped, the allocation of epidemic prevention resources is unreasonable, and thus the epidemic prevention efficiency is low and the epidemic prevention effect cannot meet the requirements. SUMMARY

[0004] The following presents a simplified summary of some aspects of the disclosed embodiments in order to provide a basic understanding of such embodiments. This summary is not an extensive overview of the embodiments described in this disclosure, and is intended neither to identify key or critical elements of all embodiments nor to delineate the scope of any of the embodiments. Its sole purpose is to present some aspects of the disclosed embodiments in a simplified form as a prelude to the more detailed description that is presented later.

[0005] In view of the above-mentioned shortcomings of the prior art, the present application discloses a gathering area determination method and system, an electronic device and a readable storage medium to improve the epidemic prevention efficiency.

[0006] The present application discloses a gathering area determination method, comprising: acquiring a plurality of original nodes and the collection quantity of each original node and the node position of each original node; performing node extraction on each original node according to the node position to obtain a login node, wherein the node distance between any two login nodes is greater than or equal to a preset minimum distance; selecting a login node corresponding to the maximum collection quantity from the login nodes as a center node, and in response to any center node, determining an edge threshold of the center node according to the collection quantity of the center node, and performing node screening on the login nodes based on the edge threshold and the node position to obtain an edge node corresponding to the center node, wherein the collection quantity of the edge node is less than the edge threshold; deleting the center node and the edge node from the login nodes to obtain new login nodes, and selecting a login node corresponding to the maximum collection quantity from the new login nodes as a new center node; determining a target gathering area corresponding to the center node according to the edge node corresponding to any center node and the node position of the edge node.

[0007] In an embodiment of the present application, the original nodes are extracted according to the node positions to obtain login nodes, including: sorting the original nodes according to the collection quantity from large to small to obtain an original node sequence, wherein the first original node in the original node sequence is determined as a reference node; in response to any reference node, determining a first node distance between the reference node and each original node according to the node positions, and selecting each original node based on the first node distance to obtain non-related nodes corresponding to the reference node, wherein the first node distance between the non-related node and the reference node is greater than or equal to a preset minimum distance; updating the original nodes in the original node sequence according to the reference node and the non-related nodes corresponding to the reference node; if any original node in the updated original node sequence is located after the reference node, selecting the original node after the reference node in the updated original node sequence as a new reference node; if the reference node is the last original node in the updated original node sequence, determining the original nodes in the updated original node sequence as login nodes.

[0008] In an embodiment of the present application, the preset minimum distance is determined by: obtaining a collection period and a moving speed of a collection target; and calculating the preset minimum distance according to the collection period and the moving speed.

[0009] In an embodiment of the present application, the edge threshold and the node position are used to perform node screening on the login nodes to obtain edge nodes corresponding to the center node, including: establishing a Cartesian coordinate system with the center node as the origin, wherein the Cartesian coordinate system includes a plurality of quadrant regions; determining any quadrant region in the Cartesian coordinate system as a target region, and determining a node query direction corresponding to the target region according to a preset region category of the target region, wherein the node query direction includes at least one of a forward direction, a backward direction, and an expansion direction, the forward direction has a same direction relationship or an opposite direction relationship with a horizontal axis of the Cartesian coordinate system, the backward direction has an opposite direction relationship with the forward direction, and the expansion direction has a same direction relationship or an opposite direction relationship with a vertical axis of the Cartesian coordinate system; determining a first target node from first candidate nodes according to the edge threshold and the node position, wherein the first candidate nodes include login nodes located in the forward direction of the center node, and the collection quantity of the first target node is less than the edge threshold; obtaining a first distance threshold, and determining a reference coordinate point located in the expansion direction of the first target node and away from the first target node by the first distance threshold; in response to any reference coordinate point, determining a second target node from second candidate nodes according to the edge threshold and the node position, wherein the second candidate nodes include login nodes located in the forward direction or the backward direction of the reference coordinate point, and the collection quantity of the second target node is less than the edge threshold; if the second target node is located within the target region, determining a new reference coordinate point located in the expansion direction of the second target node and away from the second target node by the first distance threshold; if the second target node is located outside the target region, deleting the second target node; and determining the first target nodes and the second target nodes corresponding to each of the quadrant regions as the edge nodes corresponding to the center node.

[0010] In an embodiment of the present application, determining a first target node from the first candidate node according to the edge threshold and the node position comprises: obtaining a second distance threshold, and in response to any second distance threshold, determining whether there is a first intermediate node in the first candidate node according to the second distance threshold and the node position, wherein a second node distance between the first intermediate node and the center node is less than the second distance threshold; if there is no first intermediate node in the first candidate node, determining the center node as the first target node; if there is a first intermediate node in the first candidate node, determining whether there is a second intermediate node in the first intermediate node according to the edge threshold, wherein a collection quantity of the second intermediate node is less than the edge threshold; if there is no second intermediate node in the first intermediate node, calculating the second distance threshold according to a preset increase multiple to obtain a new second distance threshold; if there is a second intermediate node in the first intermediate node, determining a second intermediate node quantity of the second intermediate node; if the second intermediate node quantity includes one, determining a login node located in a backward direction of the second intermediate node and closest to the second intermediate node as the first target node; if the second intermediate node quantity includes multiple, determining a second intermediate node closest to the center node as the first target node.

[0011] In an embodiment of the present application, determining a second target node from the second candidate node according to the edge threshold and the node position comprises: the second candidate node comprises an advancing candidate node and a retreating candidate node, wherein a login node located in an advancing direction of the reference coordinate point is determined as the advancing candidate node, and a login node located in a retreating direction of the reference coordinate point is determined as the retreating candidate node; a third distance threshold is obtained, and in response to any third distance threshold, it is determined according to the third distance threshold whether there is a third intermediate node in the advancing candidate node, wherein a third node distance between the third intermediate node and the reference coordinate point is less than the third distance threshold; if there is a third intermediate node in the advancing candidate node, it is determined according to the edge threshold whether there is a fourth intermediate node in the third intermediate node, wherein a collection quantity of the fourth intermediate node is less than the edge threshold; if there is no fourth intermediate node in the third intermediate node, the third distance threshold is calculated according to a preset increase multiple to obtain a new third distance threshold; if there is a fourth intermediate node in the third intermediate node, a fourth intermediate node quantity of the fourth intermediate node is determined; if the fourth intermediate node quantity comprises one, a login node located in a retreating direction of the fourth intermediate node and closest to the fourth intermediate node is taken as a second target node; if the fourth intermediate node quantity comprises multiple, a fourth intermediate node closest to the center node is determined as the second target node; if there is no third intermediate node in the advancing candidate node, a fourth distance threshold is obtained, and in response to any fourth distance threshold, it is determined according to the fourth distance threshold and the node position whether there is a fifth intermediate node in the retreating candidate node, wherein a fourth node distance between the fifth intermediate node and the reference coordinate point is less than the fourth distance threshold; if there is no fifth intermediate node in the retreating candidate node, the fourth distance threshold is calculated according to a preset increase multiple to obtain a new fourth distance threshold; if there is a fifth intermediate node in the retreating candidate node, it is determined according to the edge threshold whether there is a sixth intermediate node in the fifth intermediate node, wherein a collection quantity of the sixth intermediate node is less than the edge threshold; if there is no sixth intermediate node in the fifth intermediate node, the fourth distance threshold is calculated according to a preset increase multiple to obtain a new fourth distance threshold; if there is a sixth intermediate node in the fifth intermediate node, a sixth intermediate node quantity of the sixth intermediate node is determined; if the sixth intermediate node quantity comprises one, a login node located in a retreating direction of the sixth intermediate node and closest to the sixth intermediate node is taken as a second target node; if the sixth intermediate node quantity comprises multiple, a sixth intermediate node closest to the center node is determined as the second target node.

[0012] In an embodiment of the present application, the first distance threshold, the second distance threshold, the third distance threshold or the fourth distance threshold is obtained by the following method: obtaining an exploration multiple, calculating a preset minimum distance according to the exploration multiple to obtain an exploration distance; and determining the exploration distance as the first distance threshold, the second distance threshold, the third distance threshold or the fourth distance threshold.

[0013] The application discloses a cluster area determination system, comprising: an acquisition module, configured to acquire a plurality of original nodes, and the collection quantity of each original node and the node position of each original node; an extraction module, configured to perform node extraction on each original node according to the node position to obtain a login node, wherein the node distance between any two login nodes is greater than or equal to a preset minimum distance; a screening module, configured to select a login node corresponding to the maximum collection quantity as a center node from the login nodes, and in response to any center node, determine the edge threshold of the center node according to the collection quantity of the center node, and perform node screening on the login nodes based on the edge threshold and the node position to obtain an edge node corresponding to the center node, wherein the collection quantity of the edge node is less than the edge threshold; a deletion module, configured to delete the center node and the edge node from the login nodes to obtain new login nodes, and select a login node corresponding to the maximum collection quantity as a new center node from the new login nodes; and a determination module, configured to determine the target cluster area corresponding to the center node according to the edge node corresponding to any center node and the node position of the edge node.

[0014] The application discloses an electronic device, comprising: a processor and a memory; the memory is used for storing a computer program, and the processor is used for executing the computer program stored in the memory to enable the electronic device to execute the method.

[0015] The application discloses a computer readable storage medium, which stores a computer program: the computer program is executed by a processor to realize the method.

[0016] The application has the following beneficial effects:

[0017] By acquiring a plurality of original nodes and the collection quantity of each original node, the node position of each original node, determining a login node from each original node according to the node position, selecting a login node corresponding to the maximum collection quantity as a center node from the login nodes, determining an edge threshold of the center node according to the collection quantity of the center node, and performing node screening on the login nodes based on the edge threshold and the node position, an edge node corresponding to the center node is obtained, and then a target aggregation area corresponding to the center node is determined according to the edge node corresponding to any center node and the node position corresponding to the edge node. In this way, compared with fixed planning areas, the login nodes with a distance greater than a preset minimum distance are screened from the original nodes according to the node distance, interference caused by target flow is avoided, the center node and the edge node of the center node are determined according to the collection quantity of the login node, and the target aggregation area of the center node is determined according to the node position of the edge node, so as to determine the target aggregation area according to the collection quantity, realize dynamic generation of the aggregation area according to the target flow condition and the target aggregation condition, accurately grasp the target trend, improve the rationality of the distribution of the epidemic prevention resources, and improve the epidemic prevention efficiency.

[0018] It should be understood that the foregoing general description and the following detailed description are only exemplary and explanatory and are not restrictive of the application. BRIEF DESCRIPTION OF DRAWINGS

[0019] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and serve to explain the principles of the application. It is apparent that the accompanying drawings described below are only some embodiments of the application, and other drawings can be obtained according to these drawings without creative labor for those skilled in the art. In the drawings:

[0020] Figure 1 is a flow diagram of an aggregation area determination method in an embodiment of the application;

[0021] Figure 2 is a schematic diagram of an original node in an embodiment of the application;

[0022] Figure 3 is a schematic diagram of a second target node determination method in an embodiment of the application;

[0023] Figure 4-a is a schematic diagram of a first target node determination method in an embodiment of the application;

[0024] Figure 4-b is a schematic diagram of another first target node determination method in an embodiment of the application;

[0025] Figure 4-c is a schematic diagram of another first target node determination method in an embodiment of the application;

[0026] Figure 5-a is a schematic diagram of another second target node determination method in an embodiment of the present application;

[0027] Figure 5-b is a schematic diagram of another second target node determination method in an embodiment of the present application;

[0028] Figure 5-c is a schematic diagram of another second target node determination method in an embodiment of the present application;

[0029] Figure 5-d is a schematic diagram of another second target node determination method in an embodiment of the present application;

[0030] Figure 5-e is a schematic diagram of another second target node determination method in an embodiment of the present application;

[0031] Figure 5-f is a schematic diagram of another second target node determination method in an embodiment of the present application;

[0032] Figure 6 is a flowchart of a login node determination method in an embodiment of the present application;

[0033] Figure 7 is a flowchart of an aggregation area determination method in an embodiment of the present application;

[0034] Figure 8 is a structural diagram of an aggregation area determination system in an embodiment of the present application;

[0035] Figure 9 is a structural diagram of an electronic device in an embodiment of the present application. DETAILED DESCRIPTION

[0036] The present application is herein described, by way of example only, with reference to certain embodiments thereof. It is to be understood that variations and modifications of the embodiments can be made based on the description set forth herein, without departing from the scope and spirit of the application. Further, it is to be understood that not necessarily all objects or advantages described can be achieved in accordance with any particular embodiment. Thus, for example, those skilled in the art will recognize that the embodiments can be practiced with modification and alteration, and are not limited to the examples described and illustrated herein. Moreover, the embodiments described and illustrated herein are not meant to be cumulative, and the application is not meant to be limited to any one embodiment described or illustrated.

[0037] It should be noted that the drawings provided in the following embodiments are only schematic and are non-limiting examples of embodiments of the application, and that for the purpose of clarity of the figures, the dimensions of some of the elements are exaggerated compared to others.

[0038] In the following description, numerous specific details are discussed in order to provide a thorough understanding of the embodiments of the present application. However, those skilled in the art will recognize that the embodiments of the present application can be practiced without these specific details. In other instances, well-known structures and devices are not described in exhaustive detail in order to avoid obscuring the embodiments of the present application.

[0039] The terms "first", "second", and the like, as used in the description and the claims of the present disclosure and the foregoing drawings, are used to differentiate between similar objects, and are not necessarily used to describe a particular sequential or chronological order. It is to be understood that the use of the terms so

[0040] Unless otherwise specified, the term "a plurality of" means two or more.

[0041] In the embodiments of the present disclosure, the character " / " represents an "or" relationship between the preceding and following objects. For example, A / B means A or B.

[0042] The term "and / or" is a description of the association relationship between objects, which means that there can be three relationships. For example, A and / or B means that there are three relationships of A or B, or A and B.

[0043] In combination Figure 1 As shown, the embodiments of the present disclosure provide a cluster area determination method, comprising:

[0044] Step S101, acquiring a plurality of original nodes and the collection quantity of each original node, the node position of each original node;

[0045] Step S102, performing node extraction on each original node according to the node position to obtain a login node;

[0046] Wherein, the node distance between any two login nodes is greater than or equal to a preset minimum distance;

[0047] Step S103, selecting the login node corresponding to the maximum collection quantity as the center node from the login nodes, and in response to any center node, determining the edge threshold of the center node according to the collection quantity of the center node, and performing node screening on the login nodes based on the edge threshold and the node position to obtain the edge node corresponding to the center node;

[0048] Wherein, the collection quantity of the edge node is less than the edge threshold;

[0049] Step S104, deleting the center node and the edge node from the login node to obtain a new login node, and selecting a login node corresponding to the maximum collection quantity as a new center node from the new login node;

[0050] Step S105, determining a target aggregation area corresponding to the center node according to the edge node corresponding to any center node and the node position corresponding to the edge node.

[0051] The embodiment of the present disclosure provides an aggregation area determination method. The method comprises the following steps: obtaining a plurality of original nodes, a collection quantity of each original node, and a node position of each original node; determining a login node from each original node according to the node position; selecting a login node corresponding to the maximum collection quantity as a center node from the login node; determining an edge threshold of the center node according to the collection quantity of the center node; performing node screening on the login node based on the edge threshold and the node position to obtain an edge node corresponding to the center node; and determining a target aggregation area corresponding to the center node according to the edge node corresponding to any center node and the node position corresponding to the edge node. In this way, compared with a fixed planning area, the login node with a distance greater than a preset minimum distance is screened from the original node according to the node distance, the interference caused by the target flow is avoided, the center node and the edge node of the center node are determined according to the collection quantity of the login node, and the target aggregation area of the center node is determined according to the node position of the edge node, so as to determine the target aggregation area according to the collection quantity, dynamically generate the aggregation area according to the target flow condition and the target aggregation condition, accurately grasp the target trend, improve the rationality of the distribution of the epidemic prevention resources, and improve the epidemic prevention efficiency.

[0052] In some embodiments, the original node comprises an IPC (IP CAMERA, network camera), an NVR (Network Video Recorder, network video recorder), or the like, the collection target comprises one or more of a person and a vehicle, and the original node is configured to identify the collection target and count the identification quantity to obtain the collection quantity.

[0053] In some embodiments, one center node is selected from the login node, the corresponding edge node is determined according to the edge threshold of the center node, the center node and the edge node are deleted from the login node, the new center node and the corresponding edge node are selected from the login node after the deletion, until the ratio of the number of the login node after the deletion to the number of the login node at the beginning is lower than a preset ratio, or a preset number of target aggregation areas in a preset area are obtained.

[0054] In this way, a plurality of original nodes are arranged in a preset area, and the target aggregation area is recursively obtained from the login node to determine a plurality of aggregation areas in the entire preset area, so as to accurately grasp the target trend, improve the rationality of the distribution of the epidemic prevention resources, and improve the epidemic prevention efficiency.

[0055] Optionally, before the node extraction of each original node according to the node position to obtain the login node, the method further comprises: converting the node position of each original node into longitude and latitude according to the earth coordinate system, wherein the actual distance of the longitude difference value 0.00001144 is 1 m, and the actual distance of the latitude difference value 0.00000899 is 1 m.

[0056] Optionally, the edge threshold is determined by the following formula:

[0057] N T =N×α,

[0058] In the formula, N T is the edge threshold, N is the collection quantity of the central node, and α is the preset edge proportion.

[0059] In some embodiments, the preset edge proportion comprises 30%-70%, for example, the preset edge proportion is 50%.

[0060] Optionally, the preset minimum distance is determined by: obtaining a collection period and a moving speed of the collection target; and calculating the preset minimum distance according to the collection period and the moving speed.

[0061] Optionally, the preset minimum distance is determined by the following formula:

[0062] L=V·T,

[0063] In the formula, L is the preset minimum distance, V is the expected moving distance of the collection target, and T is the statistical period.

[0064] Optionally, the node extraction of each original node according to the node position to obtain the login node comprises: sorting each original node according to the collection quantity from large to small to obtain an original node sequence, wherein the first original node in the original node sequence is determined as a reference node; in response to any reference node, determining a first node distance between the reference node and each original node according to the node position, and selecting each original node according to the first node distance to obtain a non-relevant node corresponding to the reference node, wherein the first node distance between the non-relevant node and the reference node is greater than or equal to the preset minimum distance; updating the original node in the original node sequence according to the reference node and the non-relevant node corresponding to the reference node; if any original node in the updated original node sequence is located after the reference node, selecting the original node after the reference node in the updated original node sequence as a new reference node; and if the reference node is the last original node in the updated original node sequence, determining the original node in the updated original node sequence as the login node.

[0065] Thus, the preset minimum distance is determined by the statistical period and the moving speed, the reference nodes are selected in the order of the collection quantity from large to small, and the original nodes with the node distance from the reference nodes less than or equal to the preset minimum distance are deleted to obtain the login nodes, so that the node distance between the login nodes is greater than the preset minimum distance, the collection target of any login node cannot theoretically reach other login nodes, the collection target of each login node is ensured not to be repeated, the interference caused by the target flow is avoided, the aggregation area is dynamically generated according to the target flow condition and the target aggregation condition, the target trend is accurately grasped, the rationality of the distribution of the epidemic prevention resources is improved, and the epidemic prevention efficiency is improved.

[0066] In some embodiments, if the node position of the reference node is (30, 35), the longitude screening threshold is determined as 30-L to 30+L, the latitude screening threshold is determined as 35-L to 35+L, the original nodes with the longitude located in the longitude screening threshold and the latitude located in the latitude screening threshold are screened out, the screened original nodes are deleted from the original node sequence, the node extraction is performed, the next original node of the reference node is determined as the reference node to recursively perform the node extraction, and the last original node of the original node sequence is determined.

[0067] In combination with Figure 2 As shown in the figure, the original node sequence sequentially includes four original nodes of an A1 node (1, 0), an A2 node (3, 0), an A3 node (1, 1) and an A4 node (1, 3), the preset minimum distance is 1.5, A1 is taken as the reference node, the node distance between the A1 node and the A3 node is 1, and the A3 node is deleted from the original node sequence; the A2 node is taken as the reference node, and the original node does not need to be deleted; the A4 node is taken as the reference node, and the original node does not need to be deleted; and the node extraction is completed.

[0068] Optionally, the node screening is performed on the login nodes based on the edge threshold and the node position to obtain edge nodes corresponding to the center node, including: establishing a Cartesian coordinate system with the center node as the origin, wherein the Cartesian coordinate system includes a plurality of quadrant regions; determining any quadrant region in the Cartesian coordinate system as a target region, and determining a node query direction corresponding to the target region according to a preset region category of the target region, wherein the node query direction includes at least one of a forward direction, a backward direction, and an expansion direction, the forward direction has a same direction relationship or an opposite direction relationship with a horizontal axis of the Cartesian coordinate system, the backward direction has an opposite direction relationship with the forward direction, and the expansion direction has a same direction relationship or an opposite direction relationship with a vertical axis of the Cartesian coordinate system; determining a first target node from first candidate nodes according to the edge threshold and the node position, wherein the first candidate nodes include the login nodes located in the forward direction of the center node, and the collection quantity of the first target node is less than the edge threshold; obtaining a first distance threshold, and determining a reference coordinate point located in the expansion direction of the first target node and away from the first target node by the first distance threshold; in response to any reference coordinate point, determining a second target node from second candidate nodes according to the edge threshold and the node position, wherein the second candidate nodes include the login nodes located in the forward direction or the backward direction of the reference coordinate point, and the collection quantity of the second target node is less than the edge threshold; if the second target node is located within the target region, determining a new reference coordinate point located in the expansion direction of the second target node and away from the second target node by the first distance threshold; if the second target node is located outside the target region, deleting the second target node; and determining the first target node and the second target node corresponding to each quadrant region as the edge nodes corresponding to the center node.

[0069] Optionally, the quadrant region includes a first quadrant region, a second quadrant region, a third quadrant region, and a fourth quadrant region.

[0070] Optionally, determining any quadrant region in the Cartesian coordinate system as a target region, and determining a node query direction corresponding to the target region according to a preset region category of the target region, includes: if the target region includes the first quadrant region, the forward direction has a same direction relationship with the horizontal axis, the backward direction has an opposite direction relationship with the horizontal axis, and the expansion direction has a same direction relationship with the vertical axis; if the target region includes the second quadrant region, the forward direction has an opposite direction relationship with the horizontal axis, the backward direction has a same direction relationship with the horizontal axis, and the expansion direction has a same direction relationship with the vertical axis; if the target region includes the third quadrant region, the forward direction has an opposite direction relationship with the horizontal axis, the backward direction has a same direction relationship with the horizontal axis, and the expansion direction has an opposite direction relationship with the vertical axis; and if the target region includes the fourth quadrant region, the forward direction has a same direction relationship with the horizontal axis, the backward direction has an opposite direction relationship with the horizontal axis, and the expansion direction has an opposite direction relationship with the vertical axis.

[0071] In some embodiments, the same direction relationship with the horizontal axis is the positive direction of the X axis, the opposite direction relationship with the horizontal axis is the negative direction of the X axis, the same direction relationship with the vertical axis is the positive direction of the Y axis, and the opposite direction relationship with the vertical axis is the negative direction of the Y axis.

[0072] In combination Figure 3 As shown, the target region is a first quadrant region, the first target node is the B1 node (5, 0), and the first distance threshold is L1; a coordinate point located in the expansion direction of the first target node and at a distance of the first distance threshold from the first target node is determined as a reference coordinate point, that is, the B2 coordinate point (5, L1); a second target node is determined according to the reference coordinate point, and the second target node is the B3 node (3, L1) or the B4 node (-1, L1); if the second target node is the B3 node, the B3 node is located within the target region, and a coordinate point located in the expansion direction of the second target node and at a distance of the first distance threshold from the second target node is determined as a new reference coordinate point, that is, the B5 coordinate point (3, L1+L1); if the second target node is the B4 node, the B4 node is located outside the target region, and the B4 node is deleted, that is, the B4 node is excluded from the edge nodes.

[0073] Optionally, the first target node is determined from the first candidate node according to the edge threshold and the node position, including: obtaining a second distance threshold, and in response to any second distance threshold, determining whether there is a first intermediate node in the first candidate node according to the second distance threshold and the node position, where the second node distance between the first intermediate node and the center node is less than the second distance threshold; if there is no first intermediate node in the first candidate node, the center node is determined as the first target node; if there is a first intermediate node in the first candidate node, it is determined whether there is a second intermediate node in the first intermediate node according to the edge threshold, where the collection quantity of the second intermediate node is less than the edge threshold; if there is no second intermediate node in the first intermediate node, the second distance threshold is calculated according to a preset increase multiple to obtain a new second distance threshold; if there is a second intermediate node in the first intermediate node, the second intermediate node quantity of the second intermediate node is determined; if the second intermediate node quantity includes one, the login node located in the retreat direction of the second intermediate node and closest to the second intermediate node is taken as the first target node; if the second intermediate node quantity includes multiple, the second intermediate node closest to the center node is determined as the first target node.

[0074] Optionally, the second distance threshold is calculated according to a preset increase multiple to obtain a new second distance threshold, including: the original second distance threshold is determined as L2; on the basis of the second distance threshold this time, L2 is added to obtain a new second distance threshold, until the first intermediate node has a second intermediate node.

[0075] In some embodiments, in combination Figure 4-aAs shown, the target region is a first quadrant region, a center node and a second distance threshold are obtained, wherein the C1 node (0, 0) is the center node, and the second distance threshold is L2; in response to each time obtaining the second distance threshold, a C2 coordinate point (0, L2) is determined according to the C1 node and the second distance threshold; if there is no first intermediate node between the C1 node and the C2 coordinate point, the C1 node is determined as the first target node; if there is a first intermediate node between the C1 node and the C2 coordinate point, the second intermediate node number of a second intermediate node in the first intermediate node is determined; if the second intermediate node number is equal to 0, L2 is added on the basis of the second distance threshold this time to obtain a new second distance threshold, until the second intermediate node number is greater than 0; in combination with Figure 4-b As shown, if the second intermediate node number is equal to 1, the second intermediate node is the C3 node (0, 3), a login node located in the retreat direction of the second intermediate node and closest to the second intermediate node is determined as the C4 node (0, 2), and the C4 node is taken as the first target node; in combination with Figure 4-c As shown, if the second intermediate node number is greater than 1, the second intermediate node includes the C5 node (0, 5) and the C6 (0, 6) node, and the C5 node is determined as the first target node.

[0076] Optionally, determining the second target node from the second candidate node according to the edge threshold and the node position comprises: the second candidate node comprises the forward candidate node and the backward candidate node, wherein the login node located in the forward direction of the reference coordinate point is determined as the forward candidate node, and the login node located in the backward direction of the reference coordinate point is determined as the backward candidate node; a third distance threshold is obtained, and in response to any third distance threshold, it is determined whether there is a third intermediate node in the forward candidate node according to the third distance threshold, wherein the third node distance between the third intermediate node and the reference coordinate point is less than the third distance threshold; if there is the third intermediate node in the forward candidate node, it is determined whether there is a fourth intermediate node in the third intermediate node according to the edge threshold, wherein the collection quantity of the fourth intermediate node is less than the edge threshold; if there is no fourth intermediate node in the third intermediate node, the third distance threshold is calculated according to the preset increase multiple to obtain a new third distance threshold; if there is the fourth intermediate node in the third intermediate node, the fourth intermediate node quantity of the fourth intermediate node is determined; if the fourth intermediate node quantity includes one, the login node located in the backward direction of the fourth intermediate node and closest to the fourth intermediate node is taken as the second target node; if the fourth intermediate node quantity includes multiple, the fourth intermediate node closest to the center node is determined as the second target node; if there is no third intermediate node in the forward candidate node, a fourth distance threshold is obtained, and in response to any fourth distance threshold, it is determined whether there is a fifth intermediate node in the backward candidate node according to the fourth distance threshold and the node position, wherein the fourth node distance between the fifth intermediate node and the reference coordinate point is less than the fourth distance threshold; if there is no fifth intermediate node in the backward candidate node, the fourth distance threshold is calculated according to the preset increase multiple to obtain a new fourth distance threshold; if there is the fifth intermediate node in the backward candidate node, it is determined whether there is a sixth intermediate node in the fifth intermediate node according to the edge threshold, wherein the collection quantity of the sixth intermediate node is less than the edge threshold; if there is no sixth intermediate node in the fifth intermediate node, the fourth distance threshold is calculated according to the preset increase multiple to obtain a new fourth distance threshold; if there is the sixth intermediate node in the fifth intermediate node, the sixth intermediate node quantity of the sixth intermediate node is determined; if the sixth intermediate node quantity includes one, the login node located in the backward direction of the sixth intermediate node and closest to the sixth intermediate node is taken as the second target node; if the sixth intermediate node quantity includes multiple, the sixth intermediate node closest to the center node is determined as the second target node.

[0077] In some embodiments, in conjunction with Figure 5-aAs shown, the target region is a first quadrant region, a reference coordinate point and a third distance threshold are obtained, wherein the D1 coordinate point (5, 2) is the reference coordinate point, and the third distance threshold is L3; in response to each time obtaining the third distance threshold, the D2 coordinate point (5+L3, 2) is determined according to the D1 coordinate point and the third distance threshold; if there is a third intermediate node between the D1 coordinate point and the D2 coordinate point, the fourth intermediate node quantity of the fourth intermediate node in the third intermediate node is determined; if the fourth intermediate node quantity is equal to 0, L3 is added on the basis of the third distance threshold this time to obtain a new third distance threshold, until the fourth intermediate node quantity is greater than zero; in combination with Figure 5-b As shown, if the fourth intermediate node quantity is equal to 1, the fourth intermediate node is the D3 node (7, 2), the login node located in the retreat direction of the fourth intermediate node and closest to the fourth intermediate node is determined as the D4 node (6, 2), and the D4 node is taken as the second target node; in combination with Figure 5-c As shown, if the fourth intermediate node quantity is greater than 1, the fourth intermediate node includes the D5 node (9, 2) and the D6 node (8, 2), and the D6 node is taken as the second target node; in combination with Figure 5-d As shown, if there is no third intermediate node between the D1 coordinate point and the D2 coordinate point, a fourth distance threshold is obtained, wherein the fourth distance threshold is L4; in response to each time obtaining the fourth distance threshold, the D7 coordinate point (5-L4, 2) is determined according to the D1 coordinate point and the fourth distance threshold; if there is no fifth intermediate node between the D1 coordinate point and the D7 coordinate point, L4 is added on the basis of the fourth distance threshold this time to obtain a new fourth distance threshold, until there is a fifth intermediate node quantity between the D1 coordinate point and the D7 coordinate point; if there is a fifth intermediate node between the D1 coordinate point and the D7 coordinate point, the sixth intermediate node quantity of the sixth intermediate node in the fifth intermediate node is determined; if the sixth intermediate node quantity is equal to 0, L4 is added on the basis of the fourth distance threshold this time to obtain a new fourth distance threshold, until the sixth intermediate node quantity is greater than 0; in combination with Figure 5-e As shown, if the sixth intermediate node quantity is equal to 1, the sixth intermediate node is the D8 node (2, 2), the login node located in the retreat direction of the sixth intermediate node and closest to the sixth intermediate node is determined as the D9 node (1, 2), and the D9 node is taken as the second target node; in combination with Figure 5-f As shown, if the sixth intermediate node quantity is greater than 1, the sixth intermediate node includes the D10 node (3, 2) and the D11 node (4, 2), and the D10 node is taken as the second target node.

[0078] Optionally, the first distance threshold, the second distance threshold, the third distance threshold or the fourth distance threshold is obtained by the following method: obtaining an exploration multiple, calculating a preset minimum distance according to the exploration multiple to obtain an exploration distance; and determining the exploration distance as the first distance threshold, the second distance threshold, the third distance threshold or the fourth distance threshold.

[0079] In some embodiments, the exploration multiple comprises 1.5 times to 3 times, for example, the exploration multiple is 2 times.

[0080] In combination with Figure 6 The embodiment of the present disclosure provides a login node determination method, which comprises the following steps:

[0081] In step S601, a plurality of original nodes and the collection quantity of each original node and the node position of each original node are obtained.

[0082] In step S602, each original node is sorted from large to small according to the collection quantity to obtain an original node sequence.

[0083] In step S603, the first original node in the original node sequence is determined as a reference node.

[0084] In step S604, the first node distance between the reference node and each original node is determined according to the node position, and each original node is selected based on the first node distance to obtain the non-correlation node corresponding to the reference node.

[0085] In step S605, the original node in the original node sequence is updated according to the reference node and the non-correlation node corresponding to the reference node.

[0086] In step S606, it is judged whether any original node in the updated original node sequence is located after the reference node, if yes, the step S603 is jumped to, and if no, the step S607 is jumped to.

[0087] In step S606, the original node in the updated original node sequence is determined as a login node.

[0088] In combination with Figure 7 The embodiment of the present disclosure provides an aggregation area determination method, which comprises the following steps:

[0089] In step S701, a login node is obtained.

[0090] In step S702, the login node corresponding to the maximum collection quantity is selected from the login node as a center node.

[0091] In step S703, the edge threshold of the center node is determined according to the collection quantity of the center node.

[0092] Step S704, node screening is performed on the login nodes based on the edge threshold and the node positions, to obtain the edge nodes corresponding to the center nodes;

[0093] Step S705, the center nodes and the edge nodes are deleted from the login nodes, to obtain new login nodes;

[0094] Step S706, it is judged whether the number of the center nodes is greater than or equal to a preset number of center nodes, if yes, step S707 is jumped to, if not, step S702 is jumped to;

[0095] Step S707, the target aggregation area corresponding to the center nodes is determined according to the edge nodes corresponding to any center node and the node positions corresponding to the edge nodes.

[0096] The embodiment of the disclosure provides an aggregation area determination method, a plurality of original nodes and the collection quantity of each original node, the node position of each original node are obtained, the login nodes are determined from each original node according to the node position, and the login node corresponding to the maximum collection quantity is selected as the center node from the login nodes. The edge threshold of the center node is determined according to the collection quantity of the center node, and the login nodes are screened based on the edge threshold and the node position, to obtain the edge nodes corresponding to the center nodes. Then, the target aggregation area corresponding to the center nodes is determined according to the edge nodes corresponding to any center node and the node positions corresponding to the edge nodes. The method has the following advantages:

[0097] Firstly, compared with fixed planning area, the login nodes greater than a preset minimum distance are screened from the original nodes according to the node distance, to avoid the interference caused by the target flow. Then, the center nodes and the edge nodes of the center nodes are determined according to the collection quantity of the login nodes, and the target aggregation area of the center nodes is determined according to the node positions of the edge nodes. The target aggregation area is determined according to the collection quantity, the aggregation area is dynamically generated according to the target flow condition and the target aggregation condition, so that the target trend can be accurately grasped, the rationality of the distribution of the epidemic prevention resources is improved, and the epidemic prevention efficiency is improved.

[0098] Secondly, a plurality of original nodes are arranged in a preset area, and the target aggregation area is recursively obtained from the login nodes, to determine a plurality of aggregation areas in the entire preset area, so that the target trend can be accurately grasped, the rationality of the distribution of the epidemic prevention resources is improved, and the epidemic prevention efficiency is improved.

[0099] Third, by determining the preset minimum distance through the statistical period and the moving speed, selecting the reference nodes in the order from large to small according to the collection quantity, and deleting the original nodes with the node distance from the reference nodes less than or equal to the preset minimum distance, the login nodes are obtained, so that the node distance between the login nodes is greater than the preset minimum distance, and the collection target of any login node cannot theoretically reach other login nodes, which ensures that the collection target of each login node will not be repeated, avoids the interference caused by the target flow, and realizes the dynamic generation of the aggregation area according to the target flow condition and the target aggregation condition, so as to accurately grasp the target trend, improve the rationality of the prevention and control resource distribution, and improve the prevention and control efficiency.

[0100] In combination with Figure 8 The embodiments of the present disclosure provide an aggregation area determination system, including an acquisition module 801, an extraction module 802, a screening module 803, a deletion module 804, and a determination module 805. The acquisition module 801 is configured to acquire a plurality of original nodes and the collection quantity of each original node, and the node position of each original node. The extraction module 802 is configured to perform node extraction on each original node according to the node position, to obtain login nodes, wherein the node distance between any two login nodes is greater than or equal to a preset minimum distance. The screening module 803 is configured to select the login node corresponding to the maximum collection quantity as a center node from the login nodes, and in response to any center node, determine the edge threshold of the center node according to the collection quantity of the center node, and perform node screening on the login nodes based on the edge threshold and the node position, to obtain the edge nodes corresponding to the center node, wherein the collection quantity of the edge nodes is less than the edge threshold. The deletion module 804 is configured to delete the center nodes and the edge nodes from the login nodes, to obtain new login nodes, and select the login node corresponding to the maximum collection quantity as a new center node from the new login nodes. The determination module 805 is configured to determine the target aggregation area corresponding to the center node according to the edge nodes corresponding to any center node and the node position of the edge nodes

[0101] The embodiment of the present disclosure provides a gathering area determination system, a plurality of original nodes and the collection quantity of each original node, the node position of each original node are acquired, the login node is determined from each original node according to the node position, and the login node corresponding to the maximum collection quantity is selected as the center node from the login node, the edge threshold of the center node is determined according to the collection quantity of the center node, and the login node is screened according to the edge threshold and the node position, to obtain the edge node corresponding to the center node, and then the target gathering area corresponding to the center node is determined according to the edge node corresponding to any center node and the node position corresponding to the edge node. In this way, compared with fixed planning area, the login node greater than the preset minimum distance is screened from the original node according to the node distance, the interference caused by the target flow is avoided, the center node and the edge node of the center node are determined according to the collection quantity of the login node, and the target gathering area of the center node is determined according to the node position of the edge node, so as to determine the target gathering area according to the collection quantity, realize the dynamic generation of the gathering area according to the target flow condition and the target gathering condition, accurately grasp the target trend, improve the rationality of the prevention and control resource distribution, and improve the prevention and control efficiency.

[0102] Figure 9 The structural schematic diagram of the computer system of the electronic device suitable for realizing the embodiments of the present application is shown. It should be noted that, Figure 9 The computer system 900 of the electronic device shown is only an example, and should not bring any limitation to the functions and use range of the embodiments of the present application.

[0103] As Figure 9 shown, the computer system 900 includes a central processing unit (CPU) 901, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 902 or the program loaded from the storage part 908 to the random access memory (RAM) 903, such as performing the method in the above-mentioned embodiments. In the RAM 903, various programs and data required for system operation are also stored. The CPU 901, the ROM 902 and the RAM 903 are connected to each other through a bus 904. The input / output (I / O) interface 905 is also connected to the bus 904.

[0104] The following components are connected to the I / O interface 905: an input part 906 including a keyboard, a mouse, etc.; an output part 907 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), etc., and a speaker, etc.; a storage part 908 including a hard disk, etc.; and a communication part 909 including a network interface card such as a LAN (Local Area Network) card, a modem, etc. The communication part 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to the I / O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc. is attached to the drive 910 as necessary, so that a computer program read out therefrom is installed in the storage part 908 as necessary.

[0105] In particular, according to embodiments of the present application, the processes described above with reference to the flowcharts can be implemented as a computer software program. For example, embodiments of the present application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing a computer program for executing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network by the communication part 909, and / or installed from the removable medium 911. When the computer program is executed by the central processing unit (CPU) 901, various functions defined in the system of the present application are executed.

[0106] It should be noted that the computer readable medium shown in the embodiments of the present application can be a computer readable signal medium or a computer readable storage medium or any combination of the two. The computer readable storage medium may, for example, be an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or apparatus, or any combination thereof. More specific examples of the computer readable storage medium can include, but are not limited to, an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (Compact Disc Read-Only Memory, CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, the computer readable signal medium can include a data signal propagating in the baseband or as a carrier wave part of a signal propagating in the baseband, in which the computer readable computer program is carried. Such a propagating data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. The computer readable signal medium can also be any computer readable medium other than the computer readable storage medium, which can send, propagate or transmit programs for use by or in connection with an instruction execution system, device or apparatus. The computer program contained on the computer readable medium can be transmitted by any suitable medium, including but not limited to wireless, wired, etc., or any suitable combination thereof.

[0107] The embodiments of the present disclosure also provide a computer readable storage medium having a computer program stored thereon, which is executed by a processor to implement any of the methods in the embodiments.

[0108] The computer readable storage medium in the embodiments of the present disclosure can be understood by those skilled in the art that all or part of the steps of the above-mentioned method embodiments can be completed by a computer program related hardware. The aforementioned computer program can be stored in a computer readable storage medium. The program is executed to perform the steps of the above-mentioned method embodiments; and the aforementioned storage medium includes ROM, RAM, magnetic disk or optical disk and various media that can store program codes.

[0109] The electronic device disclosed in the embodiments includes a processor, a memory, a transceiver and a communication interface. The memory and the communication interface are connected with the processor and the transceiver and complete communication between each other. The memory is used to store a computer program, the communication interface is used for communication, and the processor and the transceiver are used to run the computer program, so that the electronic device executes each step of the method as above.

[0110] In the present embodiment, the memory can include a random access memory (RAM) and can also include a non-volatile memory, such as at least one disk memory.

[0111] The processor described above can be a general processor, including a central processing unit (CPU), a graphics processing unit (GPU), a network processor (NP), etc.; can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component.

[0112] The above description and drawings are illustrative of embodiments of the present disclosure and are not intended to be limiting. Other embodiments can include structural, logical, electrical, process, and other changes. Embodiments are merely representative of possible variations. Individual components and functions are optional and the order of operations can vary. Portions and sub-combinations of some embodiments can be included or replaced in or by other embodiments. Also, the phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting. As used in the description of the embodiments and the claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Similarly, the term "and / or" as used herein refers to any and all possible combinations of one or more of the associated listed items. Additionally, as used in this application, the term "comprises" and variations thereof do not intend to preclude the presence or addition of one or more other items to those stated in the compositions, integers, steps, operations, elements, and / or components. Without more limitations, an element defined by the phrase "comprises a..." does not exclude the presence of additional identical elements in the process, method, or apparatus including the element. In this document, each embodiment focuses on the differences from other embodiments, and the same or similar parts between embodiments can be referred to each other. For the method, product, etc. disclosed by the embodiments, if it corresponds to the method part disclosed by the embodiments, the relevant part can be referred to the description of the method part.

[0113] Those skilled in the art can understand that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be realized in electronic hardware or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the embodiments of the present disclosure. Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

[0114] In the embodiments disclosed herein, the disclosed methods, products (including but not limited to devices, apparatuses, etc.) can be implemented in other manners. For example, the described device embodiments are merely schematic. For example, the division of the units is merely a logical function division. There can be another division manner for the actual implementation, for example, multiple units or components can be combined or integrated into another system, or some of the components can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections can be indirect couplings or communication connections through some interfaces, devices or units, and can be in electrical, mechanical or other forms. The unit illustrated as a separate component can or can not be physically separate, and can or can not be a physical component. Some or all of the units can be selected according to actual needs to implement the embodiments. In addition, the units in the embodiments disclosed herein can be integrated into one processing unit, or each unit can exist physically as a separate unit, or two or more units can be integrated into one unit.

[0115] The flowcharts and block diagrams in the drawings show the possible implementation architectures, functions and operations of the system, method and computer program product according to the embodiments of the present disclosure. In this regard, each block in the flowcharts or block diagrams can represent a module, a program segment or a part of code containing one or more executable instructions for implementing the specified logical function. In some alternative implementations, the functions noted in the blocks can occur in different orders than those noted in the drawings. For example, two consecutive blocks can actually be executed substantially in parallel, and sometimes they can be executed in reverse order, depending on the functions involved. In the descriptions corresponding to the flowcharts and block diagrams in the drawings, the operations or steps corresponding to different blocks can also occur in different orders from those disclosed in the descriptions, and sometimes there is no specific order between different operations or steps. For example, two consecutive operations or steps can actually be executed substantially in parallel, and sometimes they can be executed in reverse order, depending on the functions involved. Each block in the block diagrams and / or flowcharts, and the combination of blocks in the block diagrams and / or flowcharts, can be implemented by a dedicated hardware-based system that performs the specified functions or actions, or can be implemented by a combination of dedicated hardware and computer instructions.

Claims

1. A method of determining an aggregation area, characterized by, The method comprises the following steps: obtaining a plurality of original nodes and the collection quantity of each original node, and the node position of each original node; performing node extraction on each original node according to the node position to obtain a login node, wherein the node distance between any two login nodes is greater than or equal to a preset minimum distance; selecting a login node corresponding to the maximum collection quantity as a center node from the login nodes, and in response to any center node, determining an edge threshold of the center node according to the collection quantity of the center node, and performing node screening on the login nodes based on the edge threshold and the node position to obtain an edge node corresponding to the center node, wherein the collection quantity of the edge node is less than the edge threshold; deleting the center node and the edge node from the login nodes to obtain new login nodes, and selecting a login node corresponding to the maximum collection quantity as a new center node from the new login nodes; determining a target aggregation area corresponding to the center node according to the edge node corresponding to any center node and the node position of the edge node; performing node extraction on each original node according to the node position to obtain a login node, comprising: sorting each original node in descending order according to the collection quantity to obtain an original node sequence, wherein the first original node in the original node sequence is determined as a reference node; in response to any reference node, determining the first node distance between the reference node and each original node according to the node position, and performing node selection on each original node based on the first node distance to obtain an irrelevant node corresponding to the reference node, wherein the first node distance between the irrelevant node and the reference node is greater than or equal to a preset minimum distance; updating the original node in the original node sequence according to the reference node and the irrelevant node corresponding to the reference node; if any original node in the updated original node sequence is located after the reference node, selecting the original node after the reference node in the updated original node sequence as a new reference node; if the reference node is the last original node in the updated original node sequence, determining the original node in the updated original node sequence as a login node; determining the preset minimum distance by: obtaining a collection period and a moving speed of a collection target; and calculating the preset minimum distance according to the collection period and the moving speed.

2. The method of claim 1, wherein, performing node screening on the login nodes based on the edge threshold and the node position to obtain the edge node corresponding to the center node, comprising: establishing a Cartesian coordinate system with the center node as the origin, wherein the Cartesian coordinate system comprises a plurality of quadrant regions; Any quadrant region in the Cartesian coordinate system is determined as a target region, and a node query direction corresponding to the target region is determined according to a preset region category of the target region, wherein the node query direction includes at least one of a forward direction, a backward direction and an expansion direction, the forward direction has a same direction relationship or a reverse direction relationship with a horizontal axis of the Cartesian coordinate system, the backward direction has a reverse direction relationship with the forward direction, and the expansion direction has a same direction relationship or a reverse direction relationship with a vertical axis of the Cartesian coordinate system; A first target node is determined from a first candidate node according to the edge threshold and the node position, wherein the first candidate node includes a login node located in the forward direction of the center node, and the collection quantity of the first target node is less than the edge threshold; A first distance threshold is obtained, and a coordinate point located in the expansion direction of the first target node and away from the first target node by the first distance threshold is determined as a reference coordinate point; In response to any reference coordinate point, a second target node is determined from a second candidate node according to the edge threshold and the node position, wherein the second candidate node includes a login node located in the forward direction or the backward direction of the reference coordinate point, and the collection quantity of the second target node is less than the edge threshold; If the second target node is located within the target region, a coordinate point located in the expansion direction of the second target node and away from the second target node by the first distance threshold is determined as a new reference coordinate point; If the second target node is located outside the target region, the second target node is deleted; The first target node and the second target node corresponding to each quadrant region are determined as edge nodes corresponding to the center node.

3. The method of claim 2, wherein, A first target node is determined from a first candidate node according to the edge threshold and the node position, including: A second distance threshold is obtained, and simultaneously, in response to any second distance threshold, it is determined whether a first intermediate node exists in the first candidate node according to the second distance threshold and the node position, wherein a second node distance between the first intermediate node and the center node is less than the second distance threshold; If the first intermediate node does not exist in the first candidate node, the center node is determined as the first target node; If the first intermediate node exists in the first candidate node, it is determined whether a second intermediate node exists in the first intermediate node according to the edge threshold, wherein the collection quantity of the second intermediate node is less than the edge threshold; If the second intermediate node does not exist in the first intermediate node, the second distance threshold is calculated according to a preset increase multiple to obtain a new second distance threshold; If the second intermediate node exists in the first intermediate node, a second intermediate node quantity of the second intermediate node is determined; If the second intermediate node quantity includes one, a login node located in the backward direction of the second intermediate node and closest to the second intermediate node is taken as the first target node; If the second intermediate node quantity includes multiple, the second intermediate node closest to the center node is determined as the first target node.

4. The method of claim 3, wherein, determining a second target node from the second candidate nodes according to the edge threshold and the node position, comprising: the second candidate nodes include forward candidate nodes and backward candidate nodes, wherein the login nodes in the forward direction of the reference coordinate point are determined as the forward candidate nodes, and the login nodes in the backward direction of the reference coordinate point are determined as the backward candidate nodes; obtaining a third distance threshold, and in response to any third distance threshold, determining whether there is a third intermediate node in the forward candidate nodes according to the third distance threshold, wherein the third node distance between the third intermediate node and the reference coordinate point is less than the third distance threshold; if there is no fourth intermediate node in the third intermediate nodes, calculating the third distance threshold according to a preset increase multiple to obtain a new third distance threshold; if the fourth intermediate node quantity includes multiple, the fourth intermediate node closest to the center node is determined as the second target node; if there is no fifth intermediate node in the backward candidate nodes, obtaining a fourth distance threshold, and in response to any fourth distance threshold, determining whether there is a fifth intermediate node in the backward candidate nodes according to the fourth distance threshold and the node position, wherein the fourth node distance between the fifth intermediate node and the reference coordinate point is less than the fourth distance threshold; if there is no sixth intermediate node in the fifth intermediate nodes, calculating the fourth distance threshold according to a preset increase multiple to obtain a new fourth distance threshold; if the sixth intermediate node quantity includes multiple, the sixth intermediate node closest to the center node is determined as the second target node. if there is no fifth intermediate node in the backward candidate nodes, obtaining a fourth distance threshold, and in response to any fourth distance threshold, determining whether there is a fifth intermediate node in the backward candidate nodes according to the fourth distance threshold and the node position, wherein the fourth node distance between the fifth intermediate node and the reference coordinate point is less than the fourth distance threshold; if there is no sixth intermediate node in the fifth intermediate nodes, calculating the fourth distance threshold according to a preset increase multiple to obtain a new fourth distance threshold; if the sixth intermediate node quantity includes multiple, the sixth intermediate node closest to the center node is determined as the second target node. if there is no fifth intermediate node in the backward candidate nodes, obtaining a fourth distance threshold, and in response to any fourth distance threshold, determining whether there is a fifth intermediate node in the backward candidate nodes according to the fourth distance threshold and the node position, wherein the fourth node distance between the fifth intermediate node and the reference coordinate point is less than the fourth distance threshold; if there is no sixth intermediate node in the fifth intermediate nodes, calculating the fourth distance threshold according to a preset increase multiple to obtain a new fourth distance threshold; if the sixth intermediate node quantity includes multiple, the sixth intermediate node closest to the center node is determined as the second target node. if there is no fifth intermediate node in the backward candidate nodes, obtaining a fourth distance threshold, and in response to any fourth distance threshold, determining whether there is a fifth intermediate node in the backward candidate nodes according to the fourth distance threshold and the node position, wherein the fourth node distance between the fifth intermediate node and the reference coordinate point is less than the fourth distance threshold; if there is no sixth intermediate node in the fifth intermediate nodes, calculating the fourth distance threshold according to a preset increase multiple to obtain a new fourth distance threshold; if the sixth intermediate node quantity includes multiple, the sixth intermediate node closest to the center node is determined as the second target node. if there is no fifth intermediate node in the backward candidate nodes, obtaining a fourth distance threshold, and in response to any fourth distance threshold, determining whether there is a fifth intermediate node in the backward candidate nodes according to the fourth distance threshold and the node position, wherein the fourth node distance between the fifth intermediate node and the reference coordinate point is less than the fourth distance threshold; if there is no sixth intermediate node in the fifth intermediate nodes, calculating the fourth distance threshold according to a preset increase multiple to obtain a new fourth distance threshold; if the sixth intermediate node quantity includes multiple, the sixth intermediate node closest to the center node is determined as the second target node.

5. The method of claim 4, wherein, The first distance threshold, the second distance threshold, the third distance threshold or the fourth distance threshold is obtained by the following method: An exploration multiple is obtained, and a preset minimum distance is calculated according to the exploration multiple to obtain an exploration distance; The exploration distance is determined as the first distance threshold, the second distance threshold, the third distance threshold or the fourth distance threshold.

6. An aggregated area determination system characterized by, Comprise: An acquisition module is configured to acquire a plurality of original nodes, a collection quantity of each original node, and a node position of each original node; An extraction module is configured to perform node extraction on each original node according to the node position to obtain login nodes, wherein a node distance between any two login nodes is greater than or equal to a preset minimum distance; A screening module is configured to select a login node corresponding to a maximum collection quantity as a center node from the login nodes, and in response to any center node, determine an edge threshold of the center node according to the collection quantity of the center node, and perform node screening on the login nodes based on the edge threshold and the node position to obtain edge nodes corresponding to the center node, wherein a collection quantity of the edge nodes is less than the edge threshold; A deletion module is configured to delete the center node and the edge nodes from the login nodes to obtain new login nodes, and select a login node corresponding to a maximum collection quantity as a new center node from the new login nodes; A determination module is configured to determine a target aggregation area corresponding to the center node according to the edge nodes corresponding to any center node and the node positions of the edge nodes; The extraction module performs node extraction on each original node according to the node position to obtain login nodes by the following method: sorting each original node in descending order according to the collection quantity to obtain an original node sequence, wherein a first original node in the original node sequence is determined as a reference node; in response to any reference node, determining a first node distance between the reference node and each original node according to the node position, and performing node selection on each original node based on the first node distance to obtain non-related nodes corresponding to the reference node, wherein the first node distance between the non-related nodes and the reference node is greater than or equal to a preset minimum distance; updating the original nodes in the original node sequence according to the reference node and the non-related nodes corresponding to the reference node; if any original node in the updated original node sequence is located after the reference node, selecting a next original node of the reference node in the updated original node sequence as a new reference node; if the reference node is the last original node in the updated original node sequence, determining the original nodes in the updated original node sequence as login nodes; The extraction module determines the preset minimum distance by the following method: acquiring a collection period and a moving speed of a collection target; calculating the preset minimum distance according to the collection period and the moving speed.

7. An electronic device, comprising: Comprise: A processor and a memory; The memory is configured to store a computer program, and the processor is configured to execute the computer program stored in the memory, so that the electronic device executes the method in any one of claims 1 to 5.

8. A computer readable storage medium having stored thereon a computer program, the computer program comprising computer readable program means configured to cause a processor to perform the method of any one of claims 1 to 5 when the computer program is executed by the processor. The computer program is configured to cause a processor to perform the method in any one of claims 1 to 5 when the computer program is executed by the processor.

Images