CN110544159B - Map information processing method and device, readable storage medium and electronic equipment - Google Patents
Map information processing method and device, readable storage medium and electronic equipment Download PDFInfo
- Publication number
- CN110544159B CN110544159B CN201910848725.9A CN201910848725A CN110544159B CN 110544159 B CN110544159 B CN 110544159B CN 201910848725 A CN201910848725 A CN 201910848725A CN 110544159 B CN110544159 B CN 110544159B
- Authority
- CN
- China
- Prior art keywords
- edge
- distribution range
- target area
- target
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 230000010365 information processing Effects 0.000 title claims abstract description 17
- 238000003672 processing method Methods 0.000 title claims abstract description 11
- 238000004891 communication Methods 0.000 claims abstract description 51
- 238000000034 method Methods 0.000 claims abstract description 26
- 230000004044 response Effects 0.000 claims description 9
- 238000004590 computer program Methods 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000009467 reduction Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 2
- 241001137251 Corvidae Species 0.000 description 1
- 240000007651 Rubus glaucus Species 0.000 description 1
- 235000011034 Rubus glaucus Nutrition 0.000 description 1
- 235000009122 Rubus idaeus Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000009365 direct transmission Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 235000015108 pies Nutrition 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0639—Item locations
Landscapes
- Business, Economics & Management (AREA)
- Economics (AREA)
- Engineering & Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Finance (AREA)
- Marketing (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Human Resources & Organizations (AREA)
- Mobile Radio Communication Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a map information processing method, a map information processing device, a readable storage medium and electronic equipment. The embodiment of the invention determines at least one target area of the target object according to the historical data; determining a connection order of the at least one target area; communicating the at least one target area according to the connection sequence, and determining at least one communication graph; and communicating the at least one communication graph with the initial distribution range to generate the distribution range of the target object. By the method, a new distribution range of the target object is determined, the area to be removed in the initial distribution range is hollowed, the area to be added outside the initial distribution range is increased, the number of tasks is increased, and the utilization rate of distribution resources is improved.
Description
Technical Field
The invention relates to the field of data processing, in particular to a map information processing method, a map information processing device, a readable storage medium and electronic equipment.
Background
With the development of internet technology, emerging takeaway industries are also continuously developed, and more convenience is brought to life. The delivery timeliness requirement of the takeout commodities is high, so that the takeout platform or the takeout system divides the delivery range of the commercial tenant in advance, and then the delivery resources are set for the commercial tenant according to the delivery range, and the commercial tenant can only receive the tasks of the users in the delivery range; since some invalid areas, such as squares, parks, and the like, are included in the distribution range, the actual distributable areas included in the distribution range are reduced, and the number of tasks is reduced, and the distribution resources are set according to the distribution range, the reduction of the actual distributable areas also causes the distribution resources to remain, and the utilization rate of the distribution resources is low.
Disclosure of Invention
In view of this, embodiments of the present invention provide a map information processing method, an apparatus, a readable storage medium, and an electronic device, which can increase the number of tasks and improve the utilization rate of distribution resources.
In a first aspect, an embodiment of the present invention provides a map information processing method, where the method includes: determining at least one target area of a target object according to historical data, wherein the target area is within an initial distribution range of the target object or is out of the initial distribution range and within a set distance from a boundary of the initial distribution range; determining a connection order of the at least one target area; communicating the at least one target area according to the connection sequence, and determining at least one communication graph; and communicating the at least one communication graph with the initial distribution range to generate the distribution range of the target object.
Preferably, the target area includes an area to be removed and an area to be added, wherein the area to be removed is within the initial distribution range, and the area to be added is outside the initial distribution range and at a position within a set distance from a boundary of the initial distribution range.
Preferably, the determining the connection order of the at least one target region specifically includes: and determining the connection sequence of the at least one target area according to a minimum spanning tree mode.
Preferably, the minimum spanning tree manner includes: using the centroids of all the target areas as vertexes to generate a vertex set; taking the distance between the centroids of any two target areas as an edge to generate an edge set; taking the actual distance between the centroids of any two target areas as the weight of the edge; and determining a minimum spanning tree according to the vertex set, the edge set and the weight.
Preferably, the determining at least one connected graph by connecting the at least one target region according to the connection order specifically includes: and communicating every two adjacent target areas according to the connection sequence to determine at least one communication graph.
Preferably, the communicating of every two adjacent target areas specifically includes: determining a first center of mass and a second center of mass, and connecting the first center of mass and the second center of mass to generate a first edge, wherein the first center of mass and the second center of mass respectively belong to the two adjacent target areas; generating a first parallel edge of the first edge; determining the intersection point of the first edge and the first parallel edge with the two adjacent target areas; and taking a connecting line between the two intersection points on the first edge and a connecting line between the two intersection points on the first parallel edge as a communicating channel of the two adjacent target areas to generate the communicating graph.
Preferably, the method further comprises: splitting the connected graph in response to the first edge intersecting a boundary of the initial delivery scope.
Preferably, the splitting the connected graph in response to the intersection of the first edge and the boundary of the initial distribution range specifically includes: disconnecting a communication channel between the target area corresponding to the first mass center and the target area corresponding to the second mass center; and communicating the target area sequenced after the target area corresponding to the second centroid with the target area corresponding to the second centroid according to the connection sequence.
Preferably, the communicating the at least one communication graph with the initial distribution range to generate the distribution range of the target object specifically includes: determining a third centroid, wherein the third centroid is the centroid of a target area closest to the initial distribution range in the at least one connected graph; connecting the third centroid and a fourth centroid to generate a second edge, wherein the fourth centroid is the centroid of the initial distribution range; generating a second parallel edge of the second edge; determining the intersection point of the second edge and the second parallel edge with the initial distribution range and the target area with the closest distance to the initial distribution range; and taking a connecting line between two intersection points on the second edge and a connecting line between two intersection points on the second parallel edge as the initial distribution range and a communication channel of a target area with the closest distance to the initial distribution range, and generating a distribution range of the target object.
In a second aspect, an embodiment of the present invention provides a map information processing apparatus, including: the system comprises a first determining unit, a second determining unit and a third determining unit, wherein the first determining unit is used for determining at least one target area of a target object according to historical data, and the target area is within an initial distribution range of the target object or within a set distance from a boundary of the initial distribution range outside the initial distribution range; a second determination unit for determining a connection order of the at least one target region; the processing unit is used for communicating the at least one target area according to the connection sequence and determining at least one communication graph; the processing unit is further configured to communicate the at least one communication graph with the initial distribution range, and generate a distribution range of the target object.
In a third aspect, an embodiment of the present invention provides a computer-readable storage medium on which computer program instructions are stored, which when executed by a processor implement the method according to the first aspect or any one of the possibilities of the first aspect.
In a fourth aspect, an embodiment of the present invention provides an electronic device, including a memory and a processor, where the memory is used to store one or more computer program instructions, where the one or more computer program instructions are executed by the processor to implement the following steps: determining at least one target area of a target object according to historical data, wherein the target area is within an initial distribution range of the target object or is out of the initial distribution range and within a set distance from a boundary of the initial distribution range; determining a connection order of the at least one target area; communicating the at least one target area according to the connection sequence, and determining at least one communication graph; and communicating the at least one communication graph with the initial distribution range to generate the distribution range of the target object.
Preferably, the target area includes an area to be removed and an area to be added, wherein the area to be removed is within the initial distribution range, and the area to be added is outside the initial distribution range and at a position within a set distance from a boundary of the initial distribution range.
Preferably, the processor specifically executes the following steps: and determining the connection sequence of the at least one target area according to a minimum spanning tree mode.
Preferably, the processor specifically executes the following steps: using the centroids of all the target areas as vertexes to generate a vertex set; taking the distance between the centroids of any two target areas as an edge to generate an edge set; taking the actual distance between the centroids of any two target areas as the weight of the edge; and determining a minimum spanning tree according to the vertex set, the edge set and the weight.
Preferably, the processor specifically executes the following steps: and communicating every two adjacent target areas according to the connection sequence to determine at least one communication graph.
Preferably, the processor specifically executes the following steps: determining a first center of mass and a second center of mass, and connecting the first center of mass and the second center of mass to generate a first edge, wherein the first center of mass and the second center of mass respectively belong to the two adjacent target areas; generating a first parallel edge of the first edge; determining the intersection point of the first edge and the first parallel edge with the two adjacent target areas; and taking a connecting line between the two intersection points on the first edge and a connecting line between the two intersection points on the first parallel edge as a communicating channel of the two adjacent target areas to generate the communicating graph.
Preferably, the processor further performs the steps of: splitting the connected graph in response to the first edge intersecting a boundary of the initial delivery scope.
Preferably, the processor specifically executes the following steps: disconnecting a communication channel between the target area corresponding to the first mass center and the target area corresponding to the second mass center; and communicating the target area sequenced after the target area corresponding to the second centroid with the target area corresponding to the second centroid according to the connection sequence.
Preferably, the processor specifically executes the following steps: determining a third centroid, wherein the third centroid is the centroid of a target area closest to the initial distribution range in the at least one connected graph; connecting the third centroid and a fourth centroid to generate a second edge, wherein the fourth centroid is the centroid of the initial distribution range; generating a second parallel edge of the second edge; determining the intersection point of the second edge and the second parallel edge with the initial distribution range and the target area with the closest distance to the initial distribution range; and taking a connecting line between two intersection points on the second edge and a connecting line between two intersection points on the second parallel edge as the initial distribution range and a communication channel of a target area with the closest distance to the initial distribution range, and generating a distribution range of the target object.
The embodiment of the invention determines at least one target area of the target object according to the historical data; determining a connection order of the at least one target area; communicating the at least one target area according to the connection sequence, and determining at least one communication graph; and communicating the at least one communication graph with the initial distribution range to generate the distribution range of the target object. By the method, a new distribution range of the target object is determined, the area to be removed in the initial distribution range is hollowed, the area to be added outside the initial distribution range is increased, the number of tasks is increased, and the utilization rate of distribution resources is improved.
Drawings
The above and other objects, features and advantages of the present invention will become more apparent from the following description of the embodiments of the present invention with reference to the accompanying drawings, in which:
FIG. 1 is a schematic illustration of an initial delivery range in the prior art;
FIG. 2 is a schematic illustration of yet another prior art initial delivery range;
FIG. 3 is a schematic view of another initial delivery range in the prior art;
fig. 4 is a flowchart of a map information processing method of the first embodiment of the present invention;
FIG. 5 is a schematic view of a target area of a first embodiment of the present invention;
FIG. 6 is a schematic view of yet another target area of the first embodiment of the present invention;
FIG. 7 is a schematic view of yet another target area of the first embodiment of the present invention;
FIG. 8 is a schematic view of another target area of the first embodiment of the present invention;
FIG. 9 is a schematic view of yet another target area of the first embodiment of the present invention;
FIG. 10 is a diagram of an application scenario of the second embodiment of the present invention;
fig. 11 is a schematic view of a map information processing apparatus according to a third embodiment of the present invention;
fig. 12 is a schematic view of an electronic apparatus according to a fourth embodiment of the present invention.
Detailed Description
The present disclosure is described below based on examples, but the present disclosure is not limited to only these examples. In the following detailed description of the present disclosure, certain specific details are set forth. It will be apparent to those skilled in the art that the present disclosure may be practiced without these specific details. Well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present disclosure.
Further, those of ordinary skill in the art will appreciate that the drawings provided herein are for illustrative purposes and are not necessarily drawn to scale.
Unless the context clearly requires otherwise, throughout the description, the words "comprise", "comprising", and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is, what is meant is "including, but not limited to".
In the description of the present disclosure, it is to be understood that the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. In addition, in the description of the present disclosure, "a plurality" means two or more unless otherwise specified.
Usually, a take-out platform or a take-out system divides an initial distribution range of a merchant in advance, and then, distribution resources are set for the merchant according to the distribution range, and the merchant can only receive tasks of users in the initial distribution range; in this embodiment of the present invention, the merchant may also be referred to as an object or a target object, and it is assumed that an initial distribution range of the target object a is as shown in fig. 1, and a portion in the curve is the initial distribution range in the map information. Since some invalid areas, such as squares, parks, large exhibitions, restricted passage areas, etc., may be included in the distribution range, for example, as shown in fig. 2, small boxes in the initial distribution range are invalid areas, and there are no users in these invalid areas, which results in a reduction in the actual distributable area included in the initial distribution range, and further results in a reduction in the number of tasks, and the distribution resources are set according to the distribution range, and the reduction in the actual distributable area also results in a surplus of the distribution resources, and a low utilization rate of the distribution resources. And there may be some high-value areas outside the initial distribution range, for example, buildings with intensive tasks, as shown in fig. 3, small boxes outside the initial distribution range, and although the tasks are intensive, the business cannot take over the tasks of the high-value areas because the tasks are not divided into the initial distribution range. In summary, how to process map information, a new distribution range is divided to increase the number of tasks and improve the utilization rate of distribution resources is a problem that needs to be solved at present.
Fig. 4 is a flowchart of a map information processing method according to a first embodiment of the present invention. As shown in fig. 4, the method specifically includes the following steps:
step S400, determining at least one target area of a target object according to historical data, wherein the target area is within an initial distribution range of the target object or within a set distance from a boundary of the initial distribution range outside the initial distribution range.
Specifically, the initial distribution ranges are set ranges on map information, for example, as shown in fig. 1, the target Area (AOI) is a small box as shown in fig. 2 and 3, the target area includes an area to be removed and an area to be added, where the area to be removed is within the initial distribution range, and the area to be added is outside the initial distribution range and at a position within a set distance from a boundary of the initial distribution range. For example, the regions of the target region 1, the target region 2, the target region 3, and the target region 4 in fig. 5 represent regions to be removed, where the regions to be removed may also be referred to as invalid regions; the areas of the target area 5, the target area 6, and the target area 7 in fig. 5 represent areas to be added, where the areas to be added may also be referred to as high-value areas, the high-value areas may be buildings with intensive tasks, and the distance from the areas to be added to the target object is within a set range, so that the distribution resources may be delivered to the positions within a set time.
Step S401, determining the connection sequence of the at least one target area.
Specifically, the connection order of the at least one target region is determined according to a minimum spanning tree mode. Wherein the minimum spanning tree mode comprises: using the centroids of all the target areas as vertexes to generate a vertex set; taking the distance between the centroids of any two target areas as an edge to generate an edge set; taking the actual distance between the centroids of any two target areas as the weight of the edge; and determining a minimum spanning tree according to the vertex set, the edge set and the weight.
For example, the following steps are carried out: assuming that a Prim (Prim) algorithm is adopted, the center of mass of an AOI is used as a vertex of a graph, a connecting line between the center of mass is used as an edge of the graph, the actual distance between the center of mass is used as a weight, a vertex set is called V, an edge set is called E, a vertex set is called V, and an edge set is called E as input, then initialization operation is carried out, so that Vnew is { x }, wherein x is any point in the set V and is used as a starting point, and Enew is { }, and is empty; the following operations are then performed: 1) selecting an edge < u, V > with the minimum weight value in a set E, wherein u is an element in a set Vnew, V is not in the set Vnew, and V is equal to V (if a plurality of edges which meet the condition and have the same weight value exist, one of the edges can be selected at will); 2) adding v into a set Vnew, and adding < u, v > edges into a set Enew; repeating the operations 1) and 2) until Vnew is equal to V; and finally, describing the obtained minimum spanning tree by using a set Vnew and Enew, and outputting the connection mode of the vertexes in the minimum spanning tree, wherein the connection mode of the vertexes is the connection sequence of the connected graphs. It is assumed that the connected graph has a connection order of target area 1, target area 2, target area 3, target area 5, target area 4, target area 7, and target area 6.
Step S402, communicating the at least one target area according to the connection sequence, and determining at least one communication graph.
Specifically, according to the connection sequence, every two adjacent target areas are connected, and at least one connected graph is determined. Wherein, communicating every two adjacent target areas specifically comprises: determining a first center of mass and a second center of mass, and connecting the first center of mass and the second center of mass to generate a first edge, wherein the first center of mass and the second center of mass respectively belong to the two adjacent target areas; generating a first parallel edge of the first edge; determining the intersection point of the first edge and the first parallel edge with the two adjacent target areas; and taking a connecting line between the two intersection points on the first edge and a connecting line between the two intersection points on the first parallel edge as a communicating channel of the two adjacent target areas to generate the communicating graph.
For example, as shown in fig. 6, taking a target area 1 and a target area 2 as an example, where the target area 1 and the target area 2 are enlarged views of small boxes in fig. 5, assuming that the centroid of the target area 1 is B and the centroid of the target area 2 is C, connecting BC to generate a first edge, and then generating a first parallel edge DE of the first edge, where a vertical distance from a line segment DE to the line segment BC is a preset value, the embodiment of the present invention does not specifically limit the first parallel edge, as long as the first parallel edge intersects the target area 1 and the target area 2, determining an intersection point of BC and the target area 1 as B and an intersection point of BC and the target area 2 as C; the intersection point of DE with the target area 1 is d, the intersection point with the target area 2 is e, the first side is replaced by a connecting line between two intersection points b and c on the first side, the first parallel side is replaced by a connecting line between two intersection points d and e on the first parallel side, that is, a connecting line between two intersection points b and c on the first side and a connecting line between two intersection points d and e on the first parallel side are used as a communication channel between the target area 1 and the target area 2, and the above process is shown in fig. 6.
In the embodiment of the present invention, the method further includes splitting the connected graph in response to the intersection of the first edge and the boundary of the initial distribution range, and disconnecting a connected channel between a target area corresponding to the first centroid and a target area corresponding to the second centroid; according to the connection sequence, communicating the target area sequenced behind the target area corresponding to the second centroid with the target area corresponding to the second centroid, specifically as shown in fig. 7, because the determined connection sequence is the target area 1, the target area 2, the target area 3, the target area 5, the target area 4, the target area 7 and the target area 6, wherein the target area 1, the target area 2 and the target area 3 adopt the method described in fig. 6 when the target area 3 and the target area 5 are connected, when the target area 3 and the target area 5 are continuously connected, the connecting line of the centroids between the target area 3 and the target area 5 intersects with the initial distribution range boundary as shown in fig. 7, therefore, the connected graph needs to be split at this position, the graph after the target area 1, the target area 2 and the target area 3 are connected is taken as a connected subgraph, and the target area 5 is continuously connected with the next target area 4, because the connecting line between the centroid of the target area 5 and the centroid of the target area 4 is also intersected with the boundary of the initial distribution range, the division is continued, the target area 5 is used as a connected subgraph, the target area 4 is continuously connected with the next target area 7, because the connecting line between the centroid of the target area 4 and the centroid of the target area 7 is also intersected with the boundary of the initial distribution range, the division is continued, the target area 7 is continuously connected with the next target area 6, and the target area 7 and the target area 6 form a connected subgraph. And finally, determining 4 connected subgraphs, namely a target area 1, a target area 2, a target area 3, a target area 5, a target area 4, a target area 7 and a target area 6.
In the embodiment of the present invention, when determining the connection order, the connection order may be further divided into two types, the first type is to determine the connection order and the connection graph of the region to be removed, and the second type is to determine the connection order and the connection graph of the region to be added, the schematic diagram is specifically shown in fig. 8, the regions to be added are determined and then connected in series to generate the connection graph, when intersecting line segments occur, the regions to be removed are split, and the processing manner of the regions to be removed is the same, which is not described herein again.
And S403, communicating the at least one communication graph with the initial distribution range to generate a distribution range of the target object.
Specifically, a third centroid is determined, wherein the third centroid is a centroid of a target area closest to the initial distribution range in the at least one connected graph; connecting the third centroid and a fourth centroid to generate a second edge, wherein the fourth centroid is the centroid of the initial distribution range; generating a second parallel edge of the second edge; determining the intersection point of the second edge and the second parallel edge with the initial distribution range and the target area with the closest distance to the initial distribution range; and taking a connecting line between two intersection points on the second edge and a connecting line between two intersection points on the second parallel edge as the initial distribution range and a communication channel of a target area with the closest distance to the initial distribution range, and generating a distribution range of the target object. Or, determining a target area closest to the boundary of the initial distribution range in the connected subgraph, and connecting the boundary of the initial distribution range and the target area through two parallel line segments, wherein the area to be added can also be called an integrated area, and the area to be removed can also be called a hollowed area, which is not limited by the invention.
In the embodiment of the present invention, the target area with the closest distance to the initial distribution range is a target area with a shortest line segment between the centroid of the target area and any point on the boundary of the initial distribution range.
For example, as shown in fig. 9, the delivery range of the target object a is obtained after the initial delivery range is communicated with the target area.
Fig. 10 is an application scenario diagram of a second embodiment of the present invention, where a server, or a takeout platform or a takeout system, a target object terminal and a user terminal are included in the present invention, the server divides a delivery range for a target object, the target object terminal receives a task of the user terminal within the delivery range and then distributes the task to a delivery resource terminal, and specifically, the message interaction is also a forwarding or direct transmission through the server, and at least one target area of the target object is determined according to historical data; determining a connection order of the at least one target area; communicating the at least one target area according to the connection sequence, and determining at least one communication graph; and communicating the at least one communication graph with the initial distribution range to generate the distribution range of the target object. By the method, a new distribution range of the target object is determined, the area to be removed in the initial distribution range is hollowed, the area to be added outside the initial distribution range is increased, the number of tasks is increased, and the utilization rate of distribution resources is improved.
Fig. 11 is a schematic diagram of a map information processing apparatus according to a third embodiment of the present invention. As shown in fig. 11, the apparatus of the present embodiment includes a first determination unit 1101, a second determination unit 1102, and a processing unit 1103.
The first determining unit 1101 is configured to determine at least one target area of a target object according to historical data, where the target area is within an initial distribution range of the target object or is within a set distance from a boundary of the initial distribution range outside the initial distribution range; a second determining unit 1102 for determining a connection order of the at least one target region; a processing unit 1103, configured to connect the at least one target region according to the connection order, and determine at least one connected graph; the processing unit 1103 is further configured to connect the at least one connection graph with the initial distribution range, and generate a distribution range of the target object.
Further, the target area comprises an area to be removed and an area to be added, wherein the area to be removed is within the initial distribution range, and the area to be added is outside the initial distribution range and at a position within a set distance from the boundary of the initial distribution range.
Further, the second determining unit is specifically configured to: and determining the connection sequence of the at least one target area according to a minimum spanning tree mode.
Further, the minimum spanning tree manner includes: using the centroids of all the target areas as vertexes to generate a vertex set; taking the distance between the centroids of any two target areas as an edge to generate an edge set; taking the actual distance between the centroids of any two target areas as the weight of the edge; and determining a minimum spanning tree according to the vertex set, the edge set and the weight.
Further, the processing unit is specifically configured to: and communicating every two adjacent target areas according to the connection sequence to determine at least one communication graph.
Further, the processing unit is specifically configured to: determining a first center of mass and a second center of mass, and connecting the first center of mass and the second center of mass to generate a first edge, wherein the first center of mass and the second center of mass respectively belong to the two adjacent target areas; generating a first parallel edge of the first edge; determining the intersection point of the first edge and the first parallel edge with the two adjacent target areas; and taking a connecting line between the two intersection points on the first edge and a connecting line between the two intersection points on the first parallel edge as a communicating channel of the two adjacent target areas to generate the communicating graph.
Further, the processing unit is further configured to: splitting the connected graph in response to the first edge intersecting a boundary of the initial delivery scope.
Further, the processing unit is specifically configured to: disconnecting a communication channel between the target area corresponding to the first mass center and the target area corresponding to the second mass center;
and communicating the target area sequenced after the target area corresponding to the second centroid with the target area corresponding to the second centroid according to the connection sequence.
Further, the processing unit is specifically configured to: determining a third centroid, wherein the third centroid is the centroid of a target area closest to the initial distribution range in the at least one connected graph; connecting the third centroid and a fourth centroid to generate a second edge, wherein the fourth centroid is the centroid of the initial distribution range; generating a second parallel edge of the second edge; determining the intersection point of the second edge and the second parallel edge with the initial distribution range and the target area with the closest distance to the initial distribution range; and taking a connecting line between two intersection points on the second edge and a connecting line between two intersection points on the second parallel edge as the initial distribution range and a communication channel of a target area with the closest distance to the initial distribution range, and generating a distribution range of the target object.
Fig. 12 is a schematic view of an electronic apparatus according to a fourth embodiment of the present invention. In this embodiment, the electronic device is a server. It should be understood that other electronic devices, such as raspberry pies, are also possible. As shown in fig. 12, the electronic apparatus: at least one processor 1201; and a memory 1202 communicatively coupled to the at least one processor 1201; and a communication component 1203 communicatively coupled to the scanning device, the communication component 1203 receiving and transmitting data under the control of the processor 1201; wherein the memory 1202 stores instructions executable by the at least one processor 1201, the instructions being executable by the at least one processor 1201 to implement: determining at least one target area of a target object according to historical data, wherein the target area is within an initial distribution range of the target object or is out of the initial distribution range and within a set distance from a boundary of the initial distribution range; determining a connection order of the at least one target area; communicating the at least one target area according to the connection sequence, and determining at least one communication graph; and communicating the at least one communication graph with the initial distribution range to generate the distribution range of the target object.
Further, the target area comprises an area to be removed and an area to be added, wherein the area to be removed is within the initial distribution range, and the area to be added is outside the initial distribution range and at a position within a set distance from the boundary of the initial distribution range.
Further, the processor specifically executes the following steps: and determining the connection sequence of the at least one target area according to a minimum spanning tree mode.
Further, the processor specifically executes the following steps: using the centroids of all the target areas as vertexes to generate a vertex set; taking the distance between the centroids of any two target areas as an edge to generate an edge set; taking the actual distance between the centroids of any two target areas as the weight of the edge; and determining a minimum spanning tree according to the vertex set, the edge set and the weight.
Further, the processor specifically executes the following steps: and communicating every two adjacent target areas according to the connection sequence to determine at least one communication graph.
Further, the processor specifically executes the following steps: determining a first center of mass and a second center of mass, and connecting the first center of mass and the second center of mass to generate a first edge, wherein the first center of mass and the second center of mass respectively belong to the two adjacent target areas; generating a first parallel edge of the first edge; determining the intersection point of the first edge and the first parallel edge with the two adjacent target areas; and taking a connecting line between the two intersection points on the first edge and a connecting line between the two intersection points on the first parallel edge as a communicating channel of the two adjacent target areas to generate the communicating graph.
Further, the processor performs the steps of: splitting the connected graph in response to the first edge intersecting a boundary of the initial delivery scope.
Further, the processor specifically executes the following steps: disconnecting a communication channel between the target area corresponding to the first mass center and the target area corresponding to the second mass center; and communicating the target area sequenced after the target area corresponding to the second centroid with the target area corresponding to the second centroid according to the connection sequence.
Further, the processor specifically executes the following steps: determining a third centroid, wherein the third centroid is the centroid of a target area closest to the initial distribution range in the at least one connected graph; connecting the third centroid and a fourth centroid to generate a second edge, wherein the fourth centroid is the centroid of the initial distribution range; generating a second parallel edge of the second edge; determining the intersection point of the second edge and the second parallel edge with the initial distribution range and the target area with the closest distance to the initial distribution range; and taking a connecting line between two intersection points on the second edge and a connecting line between two intersection points on the second parallel edge as the initial distribution range and a communication channel of a target area with the closest distance to the initial distribution range, and generating a distribution range of the target object.
Specifically, the electronic device includes: one or more processors 1201 and a memory 1202, one processor 1201 being exemplified in fig. 12. The processor 1201 and the memory 1202 may be connected by a bus or other means, and fig. 12 illustrates an example of the bus connection. Memory 1202, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The processor 1201 implements the above-described map information processing method by executing various functional applications and data processing of the apparatus by executing nonvolatile software programs, instructions, and modules stored in the memory 1202.
The memory 1202 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store a list of options, etc. Further, the memory 1202 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 1202 may optionally include memory located remotely from processor 1201, which may be connected to an external device through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
One or more modules are stored in the memory 1202, and when executed by the one or more processors 1201, perform the map information processing method in any of the method embodiments described above.
The product can execute the method provided by the embodiment of the application, has corresponding functional modules and beneficial effects of the execution method, and can refer to the method provided by the embodiment of the application without detailed technical details in the embodiment.
A fifth embodiment of the invention is directed to a non-volatile storage medium storing a computer-readable program for causing a computer to perform some or all of the above-described method embodiments.
That is, as can be understood by those skilled in the art, all or part of the steps in the method for implementing the embodiments described above may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific embodiments for practicing the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.
Claims (14)
1. A map information processing method, characterized by comprising:
determining each target area of a target object according to historical data, wherein the target area comprises an area to be removed in an initial distribution range of the target object or an area to be added within a set distance from a boundary of the initial distribution range outside the initial distribution range;
determining the connection sequence of each target area according to the minimum spanning tree mode;
generating a communication channel between each target area according to the connection sequence, and determining at least one communication graph;
and generating a communication channel between the at least one communication graph and the initial distribution range, and generating the distribution range of the target object.
2. The method of claim 1, wherein the minimum spanning tree manner comprises:
using the centroids of all the target areas as vertexes to generate a vertex set;
taking the distance between the centroids of any two target areas as an edge to generate an edge set;
taking the actual distance between the centroids of any two target areas as the weight of the edge;
and determining a minimum spanning tree according to the vertex set, the edge set and the weight.
3. The method of claim 1, wherein the generating of the connected channels between the target regions and the determining of the at least one connected graph comprises:
determining a first center of mass and a second center of mass, and connecting the first center of mass and the second center of mass to generate a first edge, wherein the first center of mass and the second center of mass respectively belong to two adjacent target areas;
generating a first parallel edge of the first edge;
determining the intersection point of the first edge and the first parallel edge with the two adjacent target areas;
and taking a connecting line between the two intersection points on the first edge and a connecting line between the two intersection points on the first parallel edge as a communicating channel of the two adjacent target areas to generate the communicating graph.
4. The method of claim 3, further comprising:
splitting the connected graph in response to the first edge intersecting a boundary of the initial delivery scope.
5. The method of claim 4, wherein said splitting the connected graph in response to the first edge intersecting the boundary of the initial delivery scope, comprises:
disconnecting a communication channel between the target area corresponding to the first mass center and the target area corresponding to the second mass center;
and communicating the target area sequenced after the target area corresponding to the second centroid with the target area corresponding to the second centroid according to the connection sequence.
6. The method of claim 1, wherein generating a communication channel between the at least one communication graph and the initial delivery range to generate the delivery range of the target object comprises:
determining a third centroid, wherein the third centroid is the centroid of a target area closest to the initial distribution range in the at least one connected graph;
connecting the third centroid and a fourth centroid to generate a second edge, wherein the fourth centroid is the centroid of the initial distribution range;
generating a second parallel edge of the second edge;
determining the intersection point of the second edge and the second parallel edge with the initial distribution range and the target area with the closest distance to the initial distribution range;
and taking a connecting line between two intersection points on the second edge and a connecting line between two intersection points on the second parallel edge as the initial distribution range and a communication channel of a target area with the closest distance to the initial distribution range, and generating a distribution range of the target object.
7. A map information processing apparatus, characterized by comprising:
the system comprises a first determining unit, a second determining unit and a third determining unit, wherein the first determining unit is used for determining each target area of a target object according to historical data, and the target areas comprise areas to be removed in an initial distribution range of the target object or areas to be added within a set distance from a boundary of the initial distribution range outside the initial distribution range;
the second determining unit is used for determining the connection sequence of each target area according to the minimum spanning tree mode;
the processing unit is used for generating a communication channel between each target area according to the connection sequence and determining at least one communication graph;
the processing unit is further configured to generate a communication channel between the at least one communication graph and the initial distribution range, and generate a distribution range of the target object.
8. A computer-readable storage medium on which computer program instructions are stored, which, when executed by a processor, implement the method of any one of claims 1-6.
9. An electronic device comprising a memory and a processor, wherein the memory is configured to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to perform the steps of:
determining each target area of a target object according to historical data, wherein the target area comprises an area to be removed in an initial distribution range of the target object or an area to be added within a set distance from a boundary of the initial distribution range outside the initial distribution range;
determining the connection sequence of each target area according to the minimum spanning tree mode;
generating a communication channel between each target area according to the connection sequence, and determining at least one communication graph;
and generating a communication channel between the at least one communication graph and the initial distribution range, and generating the distribution range of the target object.
10. The electronic device of claim 9, wherein the processor is further configured to perform the steps of:
using the centroids of all the target areas as vertexes to generate a vertex set;
taking the distance between the centroids of any two target areas as an edge to generate an edge set;
taking the actual distance between the centroids of any two target areas as the weight of the edge;
and determining a minimum spanning tree according to the vertex set, the edge set and the weight.
11. The electronic device of claim 9, wherein the processor is further configured to perform the steps of:
determining a first center of mass and a second center of mass, and connecting the first center of mass and the second center of mass to generate a first edge, wherein the first center of mass and the second center of mass respectively belong to two adjacent target areas;
generating a first parallel edge of the first edge;
determining the intersection point of the first edge and the first parallel edge with the two adjacent target areas;
and taking a connecting line between the two intersection points on the first edge and a connecting line between the two intersection points on the first parallel edge as a communicating channel of the two adjacent target areas to generate the communicating graph.
12. The electronic device of claim 11, wherein the processor further performs the steps of:
splitting the connected graph in response to the first edge intersecting a boundary of the initial delivery scope.
13. The electronic device of claim 12, wherein the processor is further configured to perform the steps of:
disconnecting a communication channel between the target area corresponding to the first mass center and the target area corresponding to the second mass center;
and communicating the target area sequenced after the target area corresponding to the second centroid with the target area corresponding to the second centroid according to the connection sequence.
14. The electronic device of claim 9, wherein the processor is further configured to perform the steps of:
determining a third centroid, wherein the third centroid is the centroid of a target area closest to the initial distribution range in the at least one connected graph;
connecting the third centroid and a fourth centroid to generate a second edge, wherein the fourth centroid is the centroid of the initial distribution range;
generating a second parallel edge of the second edge;
determining the intersection point of the second edge and the second parallel edge with the initial distribution range and the target area with the closest distance to the initial distribution range;
and taking a connecting line between two intersection points on the second edge and a connecting line between two intersection points on the second parallel edge as the initial distribution range and a communication channel of a target area with the closest distance to the initial distribution range, and generating a distribution range of the target object.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910848725.9A CN110544159B (en) | 2019-09-09 | 2019-09-09 | Map information processing method and device, readable storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910848725.9A CN110544159B (en) | 2019-09-09 | 2019-09-09 | Map information processing method and device, readable storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110544159A CN110544159A (en) | 2019-12-06 |
| CN110544159B true CN110544159B (en) | 2021-02-12 |
Family
ID=68713108
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910848725.9A Active CN110544159B (en) | 2019-09-09 | 2019-09-09 | Map information processing method and device, readable storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110544159B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111461779B (en) * | 2020-03-31 | 2023-10-24 | 拉扎斯网络科技（上海）有限公司 | Map information processing method and device, readable storage medium and electronic equipment |
| CN114077979B (en) * | 2020-08-18 | 2024-05-28 | 北京三快在线科技有限公司 | Method and device for determining distribution service range |
| CN113034087B (en) * | 2021-04-16 | 2023-01-31 | 拉扎斯网络科技（上海）有限公司 | Area correction method, area correction device, electronic apparatus, storage medium, and program product |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105825360A (en) * | 2016-03-31 | 2016-08-03 | 北京小度信息科技有限公司 | Adjustment method and apparatus of merchant distribution scope |
| CN107437122B (en) * | 2016-05-26 | 2019-03-26 | 北京三快在线科技有限公司 | Determine that businessman dispenses the method and device of range |
| CN108446871B (en) * | 2018-02-09 | 2021-01-15 | 北京三快在线科技有限公司 | Order distribution processing method and device |
| CN109636013B (en) * | 2018-11-27 | 2021-06-29 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method and device, electronic equipment and storage medium |
| CN109658034B (en) * | 2018-12-28 | 2022-03-29 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method, distribution pressure adjustment method, distribution range generation device, distribution pressure adjustment device and server |
-
2019
- 2019-09-09 CN CN201910848725.9A patent/CN110544159B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110544159A (en) | 2019-12-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110544159B (en) | Map information processing method and device, readable storage medium and electronic equipment | |
| CN106445473B (en) | container deployment method and device | |
| CN110535679B (en) | Slice management method, architecture, network slice sales platform and management system | |
| CN114039858B (en) | Computing network resource fusion method, device, equipment and storage medium | |
| CN105979007A (en) | Acceleration resource processing method and device and network function virtualization system | |
| CN106815080B (en) | Distributed graph data processing method and device | |
| CN109934537A (en) | Order allocation method, device, server and storage medium | |
| CN115208812A (en) | Service processing method and device, equipment and computer readable storage medium | |
| CN112995303B (en) | Cross-cluster scheduling method and device | |
| CN109347647A (en) | Group message distribution method and device | |
| CN113393553A (en) | Method and device for generating flow chart and electronic equipment | |
| CN114116207A (en) | Flow control method, device, equipment and system | |
| CN104267985A (en) | Software loading method and device | |
| CN111444309A (en) | System for learning graph | |
| CN109309858A (en) | A kind of display methods, device, equipment and the medium of mutual exclusion icon | |
| CN110543994A (en) | Information processing method and device, readable storage medium and electronic equipment | |
| CN110489151A (en) | A kind of terminal staging method and system | |
| CN113568706B (en) | Method and device for adjusting container for business, electronic equipment and storage medium | |
| CN113949666A (en) | Flow control method, device, equipment and system | |
| KR20220127828A (en) | Information processing method, device, system and computer readable storage medium | |
| CN114330807A (en) | Route determination method and device and electronic equipment | |
| CN113691403A (en) | Topological node configuration method, related device and computer program product | |
| CN108520025B (en) | Service node determination method, device, equipment and medium | |
| CN103051528B (en) | A kind of message rapid distribution method for bus and device | |
| CN110363018A (en) | The control method and device of permission |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |