CN110211204B - Method, device and storage medium for determining road task package - Google Patents
Method, device and storage medium for determining road task package Download PDFInfo
- Publication number
- CN110211204B CN110211204B CN201810183493.5A CN201810183493A CN110211204B CN 110211204 B CN110211204 B CN 110211204B CN 201810183493 A CN201810183493 A CN 201810183493A CN 110211204 B CN110211204 B CN 110211204B
- Authority
- CN
- China
- Prior art keywords
- grid
- road
- task
- abnormal
- roads
- 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
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/10—Office automation; Time management
- G06Q10/101—Collaborative creation, e.g. joint development of products or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/60—Editing figures and text; Combining figures or text
Abstract
The invention provides a method, a device and a storage medium for determining a road task packet, which can eliminate abnormal task packets in the road task packet after combination, so that the road task packet after optimization is more beneficial to the collection of a user. The method comprises the following steps: acquiring a target area to be updated in a map; dividing the target area by taking a road as a boundary to obtain a first grid set; when an abnormal grid exists in the first grid set, determining the form of the abnormal grid; processing the abnormal grids in the first grid set according to the forms of the abnormal grids to obtain a second grid set; merging two adjacent grids according to the grid types in the second grid set to obtain a third grid set; and determining a road task packet set according to the third grid set.
Description
Technical Field
The present invention relates to the field of map updating, and in particular, to a method, an apparatus, and a storage medium for determining a road task package.
Background
The network map is a map stored and consulted in a digital mode by utilizing a computer technology, is a system for map making and application, is a map generated by the control of an electronic computer, is a screen map based on a digital cartographic technology, and is a visual map. When data updating is performed on a network map, a professional map collecting vehicle is used for collecting and updating the data.
Road crowdsourcing is to divide the road into blocks to form a task package, so that common users can collect the task package, and the collection of a traditional professional collection vehicle is replaced. Each user is responsible for collecting the task road in one task package, and the aim of quickly updating road data is achieved. The existing task package splitting scheme is as follows: and selecting a road according to the road function grade, splitting the area surface into grids, combining the grids in pairs until the road mileage in the grids exceeds a threshold value, and forming a task package.
However, the split-merge scheme is easy to form an abnormal task packet (for example, the task packet boundary is a concave polygon), which is not favorable for the user to collect.
Disclosure of Invention
The invention provides a method, a device and a storage medium for determining a road task packet, which can eliminate abnormal task packets in combined road task packets, so that optimized road task packets are more beneficial to collection of users.
A first aspect of an embodiment of the present invention provides a method for determining a road task package, where the method includes:
acquiring a target area to be updated in a map;
dividing the target area by taking a road as a boundary to obtain a first grid set, wherein the total mileage of the road in each grid in the first grid set is smaller than a first preset value;
when abnormal grids exist in the first grid set, determining the form of the abnormal grids;
processing the abnormal grids in the first grid set according to the form of the abnormal grids to obtain a second grid set, wherein the grids in the second grid set comprise at least one grid type;
merging two adjacent grids according to the grid types in the second grid set to obtain a third grid set;
and determining a road task packet set according to the third grid set.
A second aspect of embodiments of the present invention provides an apparatus for determining a road task package, which has a function of implementing the user relationship discovery method provided in the first aspect. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above functions, which may be software and/or hardware. In one possible design, the apparatus for user relationship discovery, the apparatus comprising:
the device comprises an acquisition unit, a processing unit and a display unit, wherein the acquisition unit is used for acquiring a target area to be updated in a map;
the dividing unit is used for dividing the target area by taking a road as a boundary to obtain a first grid set, wherein the total mileage of the road in each grid in the first grid set is smaller than a first preset value;
a first determining unit, configured to determine, when an abnormal mesh exists in the first mesh set, a morphology of the abnormal mesh;
the processing unit is used for processing the abnormal grids in the first grid set according to the forms of the abnormal grids to obtain a second grid set, and the grids in the second grid set comprise at least one grid type;
a merging unit, configured to merge two adjacent grids according to the grid type in the second grid set to obtain a third grid set;
and the second determining unit is used for determining the road task packet set according to the third grid set.
A third aspect of an embodiment of the present invention provides a server, which specifically includes:
the device comprises a central processing unit, a memory, a storage medium, a power supply, a wireless network interface and an input/output interface;
the central processing unit is configured to, by invoking the operating instructions stored in the memory or the storage medium, perform the following steps:
acquiring a target area to be updated in a map;
dividing the target area by taking a road as a boundary to obtain a first grid set, wherein the total mileage of each grid road in the first grid set is smaller than a first preset value;
when an abnormal grid exists in the first grid set, determining the form of the abnormal grid;
and processing the abnormal grids in the first grid set according to the form of the abnormal grids to obtain a second grid set, wherein the grids in the second grid set comprise at least one grid type.
Merging two adjacent grids according to the grid types in the second grid set to obtain a third grid set;
and determining a road task packet set according to the third grid set.
A fourth aspect of the embodiments of the present invention provides a computer apparatus, which includes at least one connected processor, a memory and a transceiver, where the memory is configured to store program code, and the processor is configured to call the program code in the memory to perform the operations described in the foregoing aspects.
A fifth aspect of the embodiments of the present invention provides a computer storage medium including instructions that, when executed on a computer, cause the computer to perform the operations of the above aspects.
In summary, an embodiment of the present invention provides a method for determining a road task package, including: acquiring a target area to be updated in a map; dividing the target area by taking a road as a boundary to obtain a first grid set, wherein the total mileage of the road in each grid in the first grid set is smaller than a first preset value; when an abnormal grid exists in the first grid set, determining the form of the abnormal grid; and processing the abnormal grids in the first grid set according to the form of the abnormal grids to obtain a second grid set, wherein the grids in the second grid set comprise at least one grid type. Merging two adjacent grids according to the grid types in the second grid set to obtain a third grid set; and obtaining a road task packet set according to the third grid set. According to the method and the device, after the target area is divided, the abnormal grids are processed according to the form of the abnormal grids, the abnormal grids in the grids are eliminated, meanwhile, the two adjacent grids are merged according to the grid types, so that when the grids are merged into the road task packet, the abnormal task packet in the merged road task packet can be eliminated, and the optimized road task packet is more beneficial to collection of a user.
Drawings
Fig. 1 is a network architecture diagram of a method for determining a road task package according to an embodiment of the present invention;
fig. 2 is a schematic diagram of an embodiment of a method for determining a road task package according to an embodiment of the present invention;
fig. 3A is a schematic diagram of an N-sided polygon self-intersecting grid according to an embodiment of the present invention;
fig. 3B is a schematic diagram of an N-sided polygon after processing the self-intersecting grid according to an embodiment of the present invention;
FIG. 4A is a schematic diagram of an M-gon shaped edge reentrant grid provided by an embodiment of the present invention;
fig. 4B is a schematic diagram of a processed line grid within an M-polygonal boundary according to an embodiment of the present invention;
FIG. 5A is a schematic diagram of an exception task package including a road with a discontinuous boundary according to an embodiment of the present invention;
fig. 5B is a schematic diagram of an optimized abnormal task packet including a road with a discontinuous boundary according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of a task package including discrete roads according to an embodiment of the present invention;
fig. 7A is a schematic diagram of an exception task package including a short road according to an embodiment of the present invention;
fig. 7B is a schematic diagram of an optimized exception task package including a short road according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of an embodiment of a device for determining a road task package according to an embodiment of the present invention;
fig. 9 is a schematic diagram of another embodiment of the apparatus for determining a road task package according to an embodiment of the present invention;
fig. 10 is a schematic diagram of a hardware structure of a server according to an embodiment of the present invention.
Detailed Description
The invention provides a method, a device and a storage medium for determining a road task packet, which can eliminate abnormal task packets in the road task packet after combination, so that the road task packet after optimization is more beneficial to the collection of a user.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
The terms "first," "second," and the like in the description and in the claims, and in the drawings described above, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprise," "include," and "have," as well as any other polygonal shapes thereof, are intended to cover non-exclusive inclusions, such that a process, method, system, article, or apparatus that comprises a list of steps or modules is not necessarily limited to those steps or modules expressly listed, but may include other steps or modules not expressly listed or inherent to such process, method, article, or apparatus, wherein the partitioning of the blocks as presented herein is merely a logical partitioning and may be implemented in a practical application in a different manner, such that multiple blocks may be combined or integrated into another system or certain features may be omitted, or not implemented, and wherein shown or discussed as coupled or directly coupled or communicatively coupled to each other may be through interfaces, and wherein indirectly coupled or communicatively coupled to each other blocks may be electrically or similarly configured, the present invention is not limited to these examples. The modules or sub-modules described as separate components may or may not be physically separated, may or may not be physical modules, or may be distributed in a plurality of circuit modules, and some or all of the modules may be selected according to actual needs to implement the purpose of the solution of the present invention.
Referring to fig. 1, fig. 1 is a network architecture diagram of a method for determining a road task package according to an embodiment of the present invention, which specifically includes:
a network map platform 100, a local server 200 and a task package issuing platform 300;
the network map platform 100 issues a map updating instruction, the local server 200, when receiving the map updating instruction issued by the network map platform 100, divides an area requiring updating by taking a road as a boundary to obtain a first grid set, determines the form of an abnormal grid when the abnormal grid exists in the first grid set, processes the abnormal grid in the first grid set according to the form of the abnormal grid to obtain a second grid set, merges the grids in the second grid set according to grid types to obtain a third grid set, obtains a road task packet set according to the third grid set, and issues the road task packet in the road task packet set through the task packet issuing platform 300.
Referring to fig. 2, fig. 2 is a schematic diagram of an embodiment of a method for determining a road task package according to an embodiment of the present invention, and specifically includes:
201. and acquiring a target area to be updated in the map.
In this embodiment, when the map of the target area in the network map network needs to be updated, the target area to be updated in the map may be acquired. For example, when a map of beijing city in the network map needs to be updated, the whole area of beijing city may be obtained.
202. And dividing the target area by taking the road as a boundary to obtain a first grid set.
In this embodiment, after a target area (e.g., beijing city) is obtained, the target area may be divided into one grid by using a road as a boundary, so as to obtain a first grid set, where for convenience of acquisition, a total mileage of a road in each grid in the first grid set may be set to be smaller than a first preset value, for example, 100 kilometers, and may be other values, which is not limited specifically.
203. And when the abnormal grids exist in the first grid set, determining the form of the abnormal grids.
In this embodiment, after the first grid set is obtained, all grids in the first grid set may be determined to find abnormal grids existing in the first grid set, for example, the first grid set may be traversed to find abnormal grids existing in the first grid set, and then the form of the abnormal grids in the first grid set is determined, that is, what form of the abnormal grids in the first grid set is determined.
204. And processing the abnormal grids in the first grid set according to the forms of the abnormal grids to obtain a second grid set.
In this embodiment, the abnormal grids in the first grid set may be processed according to the form of the abnormal grids, so that the abnormal grids in the first grid set are updated to be normal grids, and a second grid set is obtained, where each grid in the second grid set is a normal grid, and the grids in the second grid set include at least one grid type.
205. And merging the two adjacent grids according to the grid types in the second grid set to obtain a third grid set.
In this embodiment, after the abnormal grids in the first grid set are processed to obtain the second grid set, the grids in the second grid set may be merged according to the grid types in the second grids to obtain the third grid set.
It should be noted that, when the grids in the second grid set are merged, the road mileage included in the merged grid may be limited, for example, the total mileage of the roads in the merged grid cannot exceed one preset value (for example, 120 kilometers, which may be other numerical values, and is not limited specifically), that is, the total mileage of the roads in each grid in the third grid set does not exceed one preset value (for example, 120 kilometers, which may be other numerical values, and is not limited specifically).
206. And determining a road task packet set according to the third grid set.
In this embodiment, each mesh in the third mesh set may be processed to generate a road task packet set. The processing method is not particularly limited as long as the road task package set can be obtained from the third mesh set.
In summary, the present embodiment provides a method for determining a road task package, including: acquiring a target area to be updated in a map; dividing a target area by taking a road as a boundary to obtain a first grid set; when the abnormal grids exist in the first grid set, determining the forms of the abnormal grids; and processing the abnormal grids in the first grid set according to the forms of the abnormal grids to obtain a second grid set, merging two adjacent grids according to the grid types in the second grid set to obtain a third grid set, and obtaining a road task packet set according to the third grid set. Therefore, when the grids are combined into the road task packet, the abnormal task packet in the combined road task packet can be eliminated, so that the optimized road task packet is more beneficial to collection of a user.
Optionally, on the basis of the embodiment corresponding to fig. 2, in an optional embodiment of the method for determining a road task package according to the embodiment of the present invention, dividing the target area by using the road as a boundary to obtain the first mesh set includes:
dividing a target area by a road of a first grade to obtain a grid set;
judging whether the total mileage of the road in each grid in the grid set is larger than a first preset value or not;
when grids with the total mileage of the roads being larger than a first preset value exist in the grid set, the grids with the total mileage of the roads being larger than the first preset value in the grid set are divided according to the roads with a second grade to obtain a first grid set, and the first grade is higher than the second grade.
Specifically, when dividing the target area, the target area may be first divided by a first level of roads (e.g., high speed), resulting in a set of meshes, when the road is divided according to the first level, the area of the divided grids is larger, at this time, it can be determined whether the total mileage of the road in each grid in the grid set is greater than a first preset value (for example, 50 km), when the grids with the total mileage of the roads being more than a first preset value exist in the grid set, the grids with the total mileage of the roads being more than the first preset value in the grid set are divided according to the roads (such as national roads) of a second grade, after the division into another set of grids, it is determined whether the total mileage of the roads in each grid in the another set of grids is greater than a first preset value (e.g., 50 km), and repeating the steps until the total mileage of all the roads in the grids divided by the target area is smaller than the first preset value.
It should be noted that, the above-mentioned exemplary road of the first level (for example, high speed) and the road of the second level (for example, national road) are only examples, and it is needless to say that other roads may also be used, such as provincial road, city road, etc., and the specific limitations are not limited, as long as the total mileage of the roads in the grid divided by the target area is smaller than the first preset value.
In this embodiment, the target area is sequentially divided from a high-level road to a low-level road, so that the total mileage of all the divided roads in the grid meets the requirement (is smaller than the first preset value). Therefore, the total mileage of the roads in the grid divided by the target area can not be too large or too small, and the subsequent acquisition is facilitated.
Optionally, on the basis of the embodiment corresponding to fig. 2, in an optional embodiment of the method for determining a road task package according to the embodiment of the present invention, the form of the abnormal mesh includes an N-polygon self-intersecting mesh and an M-polygon boundary invagination mesh, and processing the abnormal mesh in the first mesh set according to the form of the abnormal mesh to obtain the second mesh set includes:
the abnormal grids may include only one type of abnormal grid in the first grid set, such as the N-sided self-intersecting grid, or both types of abnormal grid in the first grid set, and may also be all normal grids.
And when the abnormal grid is in the form of the N-edge self-intersecting grid, taking a self-intersecting boundary in the N-edge self-intersecting grid as a starting point, and carrying out outward expansion along a direction far away from the grid connected with the N-edge self-intersecting grid until the self-intersecting shape in the N-edge disappears, so as to obtain a second grid set.
Fig. 3A is a schematic diagram of an N-sided polygon self-intersecting grid according to an embodiment of the present invention, and fig. 3B is a schematic diagram of the N-sided polygon self-intersecting grid after being processed according to the embodiment of the present invention. For convenience of understanding, in fig. 3A, only squares are taken as an example for explanation, the a region is a self-intersecting grid region, and when the a region grid is processed, the self-intersecting boundary a1 side is taken as a starting point, and the processing is performed in a direction away from the B region until the self-intersecting shape in the squares disappears, so as to obtain a second grid set. For example, in fig. 3B, the a area grid in the square has disappeared, and only the B area grid, i.e. the normal grid, remains, and the B area grid is the processed grid.
When the abnormal grid is in the M-edge border invagination grid, determining a target group of roads in the M-edge border invagination grid, wherein the target group of roads are two adjacent roads, the starting points of the target group of roads are intersected with the M-edge border, and the distance between the two adjacent roads is smaller than a second preset value;
and deleting the target group road to obtain a second grid set.
Fig. 4A is a schematic diagram of an M-polygonal border invagination grid provided in an embodiment of the present invention, and fig. 4B is a schematic diagram of a linear grid within a processed M-polygonal border provided in an embodiment of the present invention. First, a target group of roads in the M-polygon boundary invagination mesh may be determined, where the target group of roads is two adjacent roads, the start points of the target group of roads are intersected with the boundary of the M-polygon, and the distance between the two adjacent roads in the target group of roads is smaller than a second preset value (e.g., 0.1M, which may be other values, specifically, but not limited), for example, the C region in fig. 4A is an internal line mesh of the M-polygon boundary, where C1 to C10 are target group of roads in the C region, and when the M-polygon boundary invagination mesh is processed, the target group of roads represented by C1 to C10 may be deleted, so as to obtain a second mesh set. For example, the D region in fig. 4B is the mesh after processing of the C region, and as can be seen from fig. 4B, the target group roads of C1 to C10 in the D region have been deleted, and a processed normal mesh (D region) is obtained.
In this embodiment, a method for processing the abnormal mesh is introduced, and the abnormal mesh is processed according to the form of the abnormal mesh to obtain the normal mesh. The two different abnormal grids are processed in two different modes, so that the realizability of the scheme is improved, and the probability of generating an abnormal task package subsequently can be reduced.
Optionally, on the basis of the embodiment corresponding to fig. 2, in an optional embodiment of the method for determining a road task package provided in the embodiment of the present invention, the second grid set at least includes one of a first type grid, a second type grid, a third type grid and a fourth type grid, an area of the first type grid is smaller than or equal to a first threshold (for example, 200 square meters), a ratio of an area of a circumscribed rectangle of the second type grid to an area of the second type grid is greater than a third preset value (for example, 2), or a ratio of a long side to a wide side of a circumscribed rectangle of the second type grid is greater than a fourth preset value (for example, 3), where the circumscribed rectangle is the circumscribed rectangle with the smallest area in the circumscribed rectangle corresponding to the second type grid, an area of the third type grid is greater than a second threshold (for example, 20000 square meters), and an area of the fourth type grid is greater than the first threshold, and less than the second threshold.
Specifically, in practical application, the first type grid is a micro grid, that is, a grid with an area less than or equal to 200 square meters, the second type grid is a slender grid, that is, the ratio of the area of the external rectangle of the grid to the area of the second type grid is greater than 2, or the ratio of the long side of the external rectangle of the grid to the wide side is greater than 3, the third type grid is a large grid, that is, a grid with an area greater than or equal to 20000 square meters, and the fourth type grid is a small grid, that is, a grid with an area between 200 square meters and 20000 square meters.
It should be noted that the above-mentioned exemplified numerical values may be other numerical values, for example, the first type grid is a grid with an area smaller than or equal to 300 square meters, the second type grid is a grid with a ratio of an area of a circumscribed rectangle to an area of the second type grid larger than 4, and the third type grid is a grid with an area larger than 30000 square meters, which is not limited specifically.
In the embodiment, specific numerical values of each type of grid are defined, and the realizability of the mode is improved.
Optionally, on the basis of the embodiment corresponding to fig. 2, in an optional embodiment of the method for determining a road task package provided in the embodiment of the present invention, merging two adjacent meshes according to the mesh type in the second mesh set, and obtaining a third mesh set includes:
merging the first type grid, the third type grid and the fourth type grid with adjacent grids thereof, and merging the second type grid with other adjacent types of grids thereof to obtain an initial grid set;
determining a first initial grid, wherein the first initial grid is any initial grid in the initial grid set;
selecting a second initial grid having a longest common boundary with the first initial grid among a plurality of initial grids adjacent to the first initial grid;
and merging the first initial grid and the second grid to obtain a third grid set.
Specifically, referring to the above description, the first type mesh is a micro mesh, the second type mesh is an elongated mesh, the third type mesh is a large mesh, and the fourth type mesh is a small mesh, when the second mesh set is merged, the micro mesh in the third set and surrounding meshes may be merged first, then the elongated mesh and surrounding non-elongated meshes are merged (such as the micro mesh, the large mesh, and the small mesh), then the large mesh and surrounding meshes are merged to obtain an initial mesh set, finally, the first initial mesh may be selected, and a selection of a plurality of initial meshes adjacent to the first initial mesh and a second initial mesh having a longest common boundary with the first initial mesh may be determined, the first initial mesh and the second initial mesh are merged, and so on until the initial meshes in the initial mesh set are merged completely, a third set of grids is obtained.
In this embodiment, the merging manner of various types of meshes is described, where the micro meshes are merged first, the slender meshes and the non-slender meshes are merged, the large meshes are merged toward the periphery, and the meshes with the longest common boundary are merged. By the mode, the number of times of grid combination can be reduced, the combination efficiency is improved, and meanwhile, the probability of generating a road abnormal task packet subsequently can be reduced.
Optionally, on the basis of the embodiment corresponding to fig. 2, in an optional embodiment of the method for determining a road task package according to the embodiment of the present invention, obtaining a road task package set according to a third grid set includes:
correspondingly generating a task packet for each grid in the third grid set to obtain a first task packet set;
merging adjacent task packages in the first task package set to generate a second task package set, wherein the total mileage of a road in each task package in the second task package set is smaller than a fifth threshold value;
when the second task packet has an abnormal task packet, determining the type of the abnormal task packet;
and optimizing the abnormal task packets in the second task packet set according to the types of the abnormal task packets to obtain a road task packet set.
Specifically, after the third network set is obtained, a task package can be correspondingly generated for each grid of the third grid set to obtain a first task package set, that is, because a grid is a plane, a center point of a road is a point, and as long as the center point of the road falls into a certain grid, the road belongs to the task package corresponding to the certain grid; meanwhile, adjacent task packages in the first task package set can be merged to obtain a second task package set, the total mileage of a road in each task package in the second task package set is smaller than a fifth preset value (for example, 150 kilometers), after the second task package set is generated, each task package in the second task package set can be respectively judged to determine whether an abnormal task package exists in the second task package set, when the abnormal task package exists in the second task package set, the type of the abnormal task package can be determined, meanwhile, the abnormal task package in the second task package set can be optimized according to the type of the abnormal task package to obtain a road task package set, namely, all task packages in the optimized road task package set do not have abnormality.
In this embodiment, each grid in the grid set correspondingly generates a task packet to obtain a task packet set, the task packets in the task packet set are merged, and the merged task packet is optimized according to the type of an abnormal task packet in the merged task packet to obtain a road task packet set. Because the road task packet set is generated after the task packet is optimized, the probability of generating an abnormal road task packet can be effectively reduced when the road task packet is generated.
Optionally, on the basis of the embodiment corresponding to fig. 2, in an optional embodiment of the method for determining a road task package according to an embodiment of the present invention, when an abnormal task package includes a road with a discontinuous boundary, optimizing an abnormal task package in a first task package set according to a type of the abnormal task package, and obtaining a road task package set includes:
and classifying the discontinuous boundary roads into the task packet with small area in the adjacent abnormal task packets to obtain a road task packet set.
Optimization of the abnormal task package including the boundary discontinuous road will be described with reference to fig. 5A and 5B. Fig. 5A is a schematic diagram of an abnormal task package including a discontinuous boundary road according to an embodiment of the present invention, and fig. 5B is a schematic diagram of an abnormal task package including a discontinuous boundary road according to an embodiment of the present invention after optimization, when the abnormal task package of the discontinuous boundary road is processed, it is first determined which road belongs to the boundary road, in this embodiment, the boundary road is determined by a distance between the road and a task package border being less than 1m, and a distance between a road center point and the task package border being less than 1m, and of course, other manners may be adopted as long as the boundary road can be determined.
With continued reference to fig. 5A, after the boundary links have been determined, it can be seen that in fig. 5A, three boundary discontinuous links are included in the F task package, namely F1, F2 and F3 roads, the G task package comprises a boundary discontinuous road G1, when the discontinuous boundary road is optimized, the discontinuous boundary road can be classified into a task packet with less road mileage in adjacent abnormal tasks, for example, in fig. 5B, the roads F1, F2, F3 and G1 are classified into the E task package, the reason of the E task package is less than that of the F task package and the G task package, a boundary continuous road is formed, namely a normal task package H, the task package H is a road task package after the E task package is optimized, the E task package is only taken as an example for explanation, and so on, all abnormal task packets including the boundary discontinuous roads in the merged task packet set can be processed.
In the embodiment, a processing mode for processing the abnormal task packet comprising the road with discontinuous boundaries is limited, the realizability is enhanced, and the integrity of the collection of the road task packet is improved.
Optionally, on the basis of the embodiment corresponding to fig. 2, in an optional embodiment of the method for determining a road task package provided in the embodiment of the present invention, when the abnormal task package includes a scattered road, the abnormal task package in the second task package set is optimized according to the type of the abnormal task package, and the obtaining of the road task package set includes:
grouping all roads in each task package in the abnormal task packages according to continuity to obtain P groups, wherein the roads in each group are mutually communicated, and P is a positive integer greater than or equal to 2;
judging whether the length of the road of each group in the P groups is smaller than a sixth preset value or not;
if yes, the roads smaller than the sixth preset value are classified into a target task packet to obtain a road task packet set, and the target task packet is a task packet communicated with the roads smaller than the sixth preset value.
An embodiment of the present invention will be described below with reference to fig. 6. Referring to fig. 6, fig. 6 is a schematic diagram of a task package including discrete roads according to an embodiment of the present invention, and fig. 6 includes an I task package and a J task package, where the roads in the I task package are grouped according to continuity, and for simplicity, it is assumed that the I task package includes two groups of roads, I1, I2, and the length of the I1 road is 50 meters, where the I1 road intersects with the J task package, at this time, the I1 road may be classified into the J task package to optimize the discrete roads in the I task package, enhance connectivity of the roads, and ensure that the same road is in the same task package as much as possible.
Optionally, on the basis of the embodiment corresponding to fig. 2, in an optional embodiment of the method for determining a road task package according to an embodiment of the present invention, when an abnormal task package includes a short road, optimizing the abnormal task package in the second task package set according to a type of the abnormal task package, and obtaining the road task package set includes:
respectively judging whether the length of the short road in the abnormal task packet is smaller than a seventh preset value;
and deleting short roads with the length smaller than a seventh preset value in the abnormal task packet to obtain a road task packet set.
An embodiment of the present invention will be described below with reference to fig. 7A and 7B.
Fig. 7A is a schematic view of an abnormal task package including a short road according to an embodiment of the present invention, and fig. 7B is a schematic view of an abnormal task package including a short road according to an embodiment of the present invention after optimization, where referring to fig. 7A, a K task package in fig. 7A is an abnormal task package including a short road, where K1, K2, K3, K4, K5, and K6 are all short roads, the short road is a road between an internal road and a social road, the internal road is a road that a specific person can walk, for example, a road inside a cell, the social road is a road that all persons can walk, for example, a national road, it is first determined whether the length of a segment road is less than a seventh preset value (for example, 500 meters), and when the length of the segment road is less than 500 meters, the short road is deleted, so as to obtain a set of road task packages. In fig. 7A, the lengths of K1, K2, K3, K4 and K5 are all less than 500 meters, i.e. they are deleted, and the length of K6 is more than 500 meters, so the K6 road is reserved, resulting in the L task package as shown in fig. 7B, wherein the K1, K2, K3, K4 and K5 short roads have been deleted, and the K6 short road is reserved.
It should be noted that the K task package in fig. 7A naturally includes other short links, and for simplicity of description, only K1, K2, K3, K4, K5, and K6 are used as examples for description, and are not specifically limited.
In the embodiment, an optimization mode of the abnormal task packet including the short road is defined, namely the short road with the length smaller than the sixth preset value is deleted, so that the realizability of the scheme is enhanced, and meanwhile, the subsequent acquisition efficiency can also be improved.
The embodiments of the present invention are described above from the perspective of a method of determining a road task package, and the embodiments of the present invention are described below from the perspective of an apparatus for determining a road task package.
Referring to fig. 8, fig. 8 is a schematic diagram of an embodiment of an apparatus 800 for determining a road task package according to an embodiment of the present invention, where the apparatus may be a server installed with a server, or a server installed on a server, and the apparatus for determining a road task package includes:
an obtaining unit 801, configured to obtain a target area to be updated in a map;
a dividing unit 802, configured to divide the target area by taking a road as a boundary to obtain a first grid set, where a total mileage of the road in each grid in the first grid set is smaller than a first preset value;
a first determining unit 803, configured to determine, when an abnormal mesh exists in the first mesh set, a morphology of the abnormal mesh;
a processing unit 804, configured to process the abnormal grids in the first grid set according to the form of the abnormal grids to obtain a second grid set, where a grid in the second grid set includes at least one grid type;
a merging unit 805, configured to merge two adjacent grids according to the grid type in the second grid set to obtain a third grid set;
a second determining unit 806, configured to determine a road task package set according to the third mesh set.
For ease of understanding, the following detailed description of the embodiments of the present invention is provided in conjunction with fig. 9.
Referring to fig. 9, fig. 9 is a schematic diagram of another embodiment of the apparatus for determining a road task package according to the embodiment of the present invention, which specifically includes:
an obtaining unit 901, configured to obtain a target area to be updated in a map;
a dividing unit 902, configured to divide the target area by using a road as a boundary to obtain a first grid set, where a total mileage of the road in each grid in the first grid set is less than a first preset value;
a first determining unit 903, configured to determine, when an abnormal mesh exists in the first mesh set, a morphology of the abnormal mesh;
a processing unit 904, configured to process the abnormal grids in the first grid set according to the form of the abnormal grids, to obtain a second grid set, where a grid in the second grid set includes at least one grid type;
a merging unit 905, configured to merge two adjacent grids according to the grid type in the second grid set to obtain a third grid set, where an area of each grid in the third grid set is smaller than a second threshold, and the second threshold is greater than the first preset value;
a second determining unit 906, configured to determine a road task package set according to the third mesh set.
Optionally, the dividing unit 902 is specifically configured to:
dividing the target area by a road of a first grade to obtain a grid set;
judging whether the total mileage of the road in each grid in the grid set is greater than the first preset value or not;
when the total mileage of the roads is larger than the grids of the first preset value, the grids of the grid set larger than the first preset value are divided according to the roads of a second grade to obtain the first grid set, and the first grade is higher than the second grade.
Optionally, the morphology of the abnormal mesh includes an N-sided polygon self-intersecting mesh and an M-sided polygon boundary invagination mesh, and the processing unit 904 is specifically configured to:
when the abnormal grid is in the N-edge self-intersection grid, taking a self-intersection boundary in the N-edge self-intersection grid as a starting point, and performing outward expansion in a direction away from a grid connected with the N-edge self-intersection grid until the self-intersection shape in the N-edge disappears to obtain a second grid set;
alternatively, the first and second liquid crystal display panels may be,
when the abnormal grid is in the M-edge border invagination grid, determining a target group of roads in the M-edge border invagination grid, wherein the target group of roads are two adjacent roads, the starting points of the target group of roads are intersected with the border of the M-edge, and the distance between the two adjacent roads is smaller than a first preset value;
and deleting the target group road to obtain the second grid set.
Optionally, the second grid set at least includes one of a first type grid, a second type grid, a third type grid and a fourth type grid, an area of the first type grid is smaller than or equal to a first threshold, a ratio of an area of a circumscribed rectangle of the second type grid to an area of the second type grid is greater than a third preset value, or a ratio of a long side to a wide side of the circumscribed rectangle of the second type grid is greater than a fourth preset value, the circumscribed rectangle is a circumscribed rectangle with a smallest area in the circumscribed rectangles corresponding to the second type grid, an area of the third type grid is greater than or equal to a second threshold, and an area of the fourth type grid is greater than the first threshold and smaller than the second threshold.
Optionally, the merging unit 905 is specifically configured to:
merging the first type grid, the third type grid and the fourth type grid with adjacent grids thereof, and merging the second type grid with other adjacent grids thereof to obtain an initial grid set;
determining a first initial grid, wherein the first initial grid is any one initial grid in the initial grid set;
selecting a second initial grid having a longest common boundary with the first initial grid among a plurality of initial grids adjacent to the first initial grid;
merging the first initial grid and the second initial grid to obtain the third grid set.
Optionally, the second determining unit 906 includes:
a processing subunit 9061, configured to generate a task packet for each grid in the third grid set correspondingly, so as to obtain a first task packet set;
a merging subunit 9062, configured to merge adjacent task packages in the first task package set to generate a second task package set, where a total mileage of a road in each task package in the second task package set is smaller than a fifth preset value;
a determining subunit 9063, configured to determine, when an abnormal task packet exists in the first task packet, a type of the abnormal task packet;
and the optimization subunit 9064 is configured to optimize, according to the type of the abnormal task packet, the abnormal task packet in the second task packet set, to obtain the road task packet set.
Optionally, when the abnormal task package includes a road with a discontinuous boundary, the optimizing subunit 9064 is specifically configured to:
and classifying the discontinuous boundary roads into the task packet with less total road mileage in the adjacent abnormal task packets to obtain the road task packet set.
Optionally, when the exception task package includes a stray road, the optimizing subunit 9064:
grouping all roads in each task package in the abnormal task packages according to continuity to obtain P groups, wherein the roads in each group are mutually communicated, and P is a positive integer greater than or equal to 2;
judging whether the length of the road of each group in the P groups is smaller than a sixth preset value or not;
if yes, the roads smaller than the sixth preset value are classified into a target task packet to obtain the road task packet set, and the target task packet is a task packet communicated with the roads smaller than the sixth preset value.
Optionally, when the abnormal task package includes a short link, the optimizing subunit 9064 is specifically configured to:
judging whether the length of the short road in the abnormal task packet is smaller than the seventh preset value or not;
and deleting the short roads with the length smaller than the seventh preset value in the abnormal task packet to obtain the road task packet set.
In this embodiment, an acquisition unit 901 acquires a target area to be updated in a map, the target area is divided by using a road as a boundary through a dividing unit 902 to obtain a first grid set, when an abnormal grid exists in the first grid set, a first determining unit 903 determines a form of the abnormal grid, a processing unit 904 processes the abnormal grid in the first grid set according to the form of the abnormal grid to obtain a second grid set, a merging unit 905 merges two adjacent grids according to a grid type in the second grid set to obtain a third grid set, and a second determining unit 906 determines a road task package set according to the third grid set. According to the method and the device, after the target area is divided, the abnormal grids are processed according to the form of the abnormal grids, the abnormal grids in the grids are eliminated, meanwhile, the two adjacent grids are merged according to the grid types, so that when the grids are merged into the road task packet, the abnormal task packet in the merged road task packet can be eliminated, and the optimized road task packet is more beneficial to collection of a user.
The device for determining a road task package in the embodiment of the present invention is described above from the perspective of a modular functional entity, and the servers in the embodiment of the present invention are described below from the perspective of hardware processing.
Fig. 10 is a schematic structural diagram of a server according to an embodiment of the present invention, where the server 10 may have a relatively large difference due to different configurations or performances, and may include one or more Central Processing Units (CPUs) 1022 (e.g., one or more processors) and a memory 1032, and one or more storage media 1030 (e.g., one or more mass storage devices) for storing application programs 1042 or data 1044. Memory 1032 and storage medium 1030 may be transitory or persistent storage, among other things. The program stored on the storage medium 1030 may include one or more modules (not shown), each of which may include a series of instruction operations for the server. Still further, a central processor 1022 may be disposed in communication with the storage medium 1030, for executing a series of instruction operations in the storage medium 1030 on the server 10.
The Server 10 may also include one or more power supplies 1026, one or more wired or wireless network interfaces 1050, one or more input-output interfaces 1058, and/or one or more operating systems 1041, such as Windows Server, Mac OS X, Unix, Linux, FreeBSD, etc.
The steps performed by the server in the above embodiment may be based on the server structure shown in fig. 10.
For example, the central processor 1022 may invoke the instructions stored in the storage medium 1030 to perform the following operations:
acquiring a target area to be updated in a map;
dividing the target area by taking a road as a boundary to obtain a first grid set, wherein the total mileage of the road in each grid in the first grid set is smaller than a first preset value;
when an abnormal grid exists in the first grid set, determining the form of the abnormal grid;
and processing the abnormal grids in the first grid set according to the form of the abnormal grids to obtain a second grid set, wherein the grids in the second grid set comprise at least one grid type.
Merging two adjacent grids according to the grid types in the second grid set to obtain a third grid set;
and determining a road task packet set according to the third grid set.
An embodiment of the present invention further provides a storage medium, on which a program is stored, and the program, when executed by a processor, implements the method for determining a road task package.
The embodiment of the invention also provides a processor, which is used for running the program, wherein the method for determining the road task package is executed when the program runs.
The embodiment of the invention also provides equipment, which comprises a processor, a memory and a program which is stored on the memory and can run on the processor, wherein the processor realizes the steps of the method for determining the road task packet when executing the program.
The invention also provides a computer program product adapted to perform the steps of the above-described method of determining a road task package when executed on a data processing device.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to the related descriptions of other embodiments.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the module described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both permanent and non-permanent, removable and non-removable media, may implement the information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above are merely examples of the present invention, and are not intended to limit the present invention. Various modifications and alterations to this invention will become apparent to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.
Claims (11)
1. A method of determining a road task package, comprising:
acquiring a target area to be updated in a map;
dividing the target area by taking a road as a boundary to obtain a first grid set, wherein the total mileage of the road in each grid in the first grid set is smaller than a first preset value;
when an abnormal grid exists in the first grid set, determining the form of the abnormal grid;
processing the abnormal grids in the first grid set according to the forms of the abnormal grids to obtain a second grid set, wherein the grids in the second grid set comprise at least one grid type;
merging two adjacent grids according to the grid types in the second grid set to obtain a third grid set;
determining a road task packet set according to the third grid set;
the abnormal grid form includes an N-polygon self-intersecting grid and an M-polygon boundary invagination grid, and the processing of the abnormal grid in the first grid set according to the abnormal grid form to obtain a second grid set includes:
when the abnormal grid is in the N-edge self-intersection grid, taking a self-intersection boundary in the N-edge self-intersection grid as a starting point, and performing outward expansion along a direction far away from grids connected with the N-edge self-intersection grid until the self-intersection shape in the N-edge disappears to obtain a second grid set;
alternatively, the first and second electrodes may be,
when the abnormal grid is in the M-edge border invagination grid, determining a target group of roads in the M-edge border invagination grid, wherein the target group of roads are two adjacent roads, the starting points of the target group of roads are intersected with the border of the M-edge, and the distance between the two adjacent roads is smaller than a second preset value;
deleting the target group road to obtain the second grid set;
the determining a set of road task packages according to the third set of grids comprises:
correspondingly generating a task packet for each grid in the third grid set to obtain a first task packet set;
merging adjacent task packages in the first task package set to generate a second task package set, wherein the total mileage of a road in each task package in the second task package set is smaller than a fifth preset value;
when an abnormal task packet exists in the first task packet, determining the type of the abnormal task packet, wherein the abnormal task packet comprises a road with discontinuous boundaries, scattered roads and short roads;
and optimizing the abnormal task packets in the second task packet set according to the types of the abnormal task packets to obtain the road task packet set.
2. The method of claim 1, wherein the dividing the target area around the road to obtain the first set of meshes comprises:
dividing the target area by a road of a first grade to obtain a grid set;
judging whether the total mileage of the road in each grid in the grid set is greater than the first preset value or not;
when the total mileage of the roads in the grid set is larger than the grid of the first preset value, dividing the grid of which the total mileage of the roads in the grid set is larger than the first preset value according to the roads of a second grade to obtain the first grid set, wherein the first grade is higher than the second grade.
3. The method according to claim 1, wherein the second grid set includes at least one of a first type grid, a second type grid, a third type grid, and a fourth type grid, the area of the first type grid is smaller than or equal to a first threshold, the ratio of the area of the circumscribed rectangle of the second type grid to the area of the second type grid is greater than a third preset value, or the ratio of the long side to the wide side of the circumscribed rectangle of the second type grid is greater than a fourth preset value, the circumscribed rectangle is the circumscribed rectangle with the smallest area in the circumscribed rectangles corresponding to the second type grid, the area of the third type grid is greater than or equal to a second threshold, and the area of the fourth type grid is greater than the first threshold and smaller than the second threshold.
4. The method according to claim 3, wherein said merging two adjacent grids according to the grid type in the second grid set to obtain a third grid set comprises:
merging the first type grid, the third type grid and the fourth type grid with adjacent grids thereof, and merging the second type grid with other adjacent grids thereof to obtain an initial grid set;
determining a first initial grid, wherein the first initial grid is any initial grid in the initial grid set;
selecting a second initial grid having a longest common boundary with the first initial grid among a plurality of initial grids adjacent to the first initial grid;
merging the first initial grid and the second initial grid to obtain the third grid set.
5. The method according to claim 1, wherein when the abnormal task package includes a road with a discontinuous boundary, the optimizing the abnormal task package in the first task package set according to the type of the abnormal task package to obtain the road task package set includes:
and classifying the discontinuous boundary roads into the task packet with less road mileage in the adjacent abnormal task packets to obtain the road task packet set.
6. The method according to claim 1, wherein when the abnormal task package includes a scattered road, the optimizing the abnormal task package in the second task package set according to the type of the abnormal task package to obtain the road task package set includes:
grouping all roads in each task package in the abnormal task packages according to continuity to obtain P groups, wherein the roads in each group are mutually communicated, and P is a positive integer greater than or equal to 2;
judging whether the length of the road of each group in the P groups is smaller than a sixth preset value or not;
if yes, the roads smaller than the sixth preset value are classified into a target task packet to obtain the road task packet set, and the target task packet is a task packet communicated with the roads smaller than the sixth preset value.
7. The method according to claim 1, wherein when the exception task package includes a short link, the optimizing the exception task package in the second task package set according to the type of the exception task package to obtain the link task package set includes:
judging whether the length of the short road in the abnormal task packet is smaller than a seventh preset value or not;
and deleting the short roads with the length smaller than the seventh preset value in the abnormal task packet to obtain the road task packet set.
8. An apparatus for determining a road task package, comprising:
the device comprises an acquisition unit, a processing unit and a display unit, wherein the acquisition unit is used for acquiring a target area to be updated in a map;
the dividing unit is used for dividing the target area by taking a road as a boundary to obtain a first grid set, wherein the total mileage of the road in each grid in the first grid set is less than a first preset value;
a first determining unit, configured to determine, when an abnormal mesh exists in the first mesh set, a morphology of the abnormal mesh;
the processing unit is used for processing the abnormal grids in the first grid set according to the forms of the abnormal grids to obtain a second grid set, and the grids in the second grid set comprise at least one grid type;
a merging unit, configured to merge two adjacent grids according to the grid type in the second grid set to obtain a third grid set;
the second determining unit is used for determining a road task packet set according to the third grid set;
the morphology of the abnormal mesh includes an N-gon self-intersecting mesh and an M-gon boundary invagination mesh, and the processing unit is specifically configured to:
when the abnormal grid is in the N-edge self-intersection grid, taking a self-intersection boundary in the N-edge self-intersection grid as a starting point, and performing outward expansion in a direction away from a grid connected with the N-edge self-intersection grid until the self-intersection shape in the N-edge disappears to obtain a second grid set;
alternatively, the first and second electrodes may be,
when the abnormal grid is in the M-edge border invagination grid, determining a target group of roads in the M-edge border invagination grid, wherein the target group of roads are two adjacent roads, the starting points of the target group of roads are intersected with the border of the M-edge, and the distance between the two adjacent roads is smaller than a second preset value;
deleting the target group road to obtain the second grid set;
the second determining unit is specifically configured to:
correspondingly generating a task packet for each grid in the third grid set to obtain a first task packet set;
merging adjacent task packages in the first task package set to generate a second task package set, wherein the total mileage of a road in each task package in the second task package set is smaller than a fifth preset value;
when an abnormal task packet exists in the first task packet, determining the type of the abnormal task packet, wherein the abnormal task packet comprises a discontinuous boundary road, a scattered road and a short road;
and optimizing the abnormal task packet in the second task packet set according to the type of the abnormal task packet to obtain the road task packet set.
9. The apparatus according to claim 8, wherein the partitioning unit is specifically configured to:
dividing the target area by a road of a first grade to obtain a grid set;
judging whether the total mileage of the road in each grid in the grid set is greater than the first preset value or not;
when the total mileage of the roads is larger than the grids of the first preset value, the grids of the grid set with the total mileage of the roads larger than the first preset value are divided according to the roads of a second grade to obtain the first grid set, wherein the first grade is higher than the second grade.
10. A computer apparatus, the apparatus comprising:
at least one processor, memory, and transceiver;
wherein the memory is configured to store program code and the processor is configured to call the program code stored in the memory to perform the method of any of claims 1-7.
11. A computer storage medium comprising instructions which, when run on a computer, cause the computer to perform the method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810183493.5A CN110211204B (en) | 2018-03-06 | 2018-03-06 | Method, device and storage medium for determining road task package |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810183493.5A CN110211204B (en) | 2018-03-06 | 2018-03-06 | Method, device and storage medium for determining road task package |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110211204A CN110211204A (en) | 2019-09-06 |
| CN110211204B true CN110211204B (en) | 2022-07-26 |
Family
ID=67778787
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810183493.5A Active CN110211204B (en) | 2018-03-06 | 2018-03-06 | Method, device and storage medium for determining road task package |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110211204B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110737741B (en) * | 2019-09-30 | 2021-03-16 | 口口相传(北京)网络技术有限公司 | Standard grid division method and device based on road circulation capacity |
| CN111737379B (en) * | 2020-04-13 | 2023-07-18 | 腾讯科技（深圳）有限公司 | Road collection task generation device, electronic equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104125638A (en) * | 2010-01-15 | 2014-10-29 | 苹果公司 | Managing a location database for network-based positioning system |
| CN106228302A (en) * | 2016-07-21 | 2016-12-14 | 上海仙知机器人科技有限公司 | A kind of method and apparatus for carrying out task scheduling in target area |
| WO2017200889A1 (en) * | 2016-05-19 | 2017-11-23 | Microsoft Technology Licensing, Llc | Classifying entities in digital maps using discrete non-trace positioning data |
| CN107402955A (en) * | 2017-06-02 | 2017-11-28 | 阿里巴巴集团控股有限公司 | The method and apparatus for determining the index grid of geography fence |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100981661B1 (en) * | 2009-06-05 | 2010-09-10 | 주식회사 하만네비스 | Apparatus and method for displaying 3d path |
| JP5059132B2 (en) * | 2010-01-06 | 2012-10-24 | ヤフー株式会社 | Regional information retrieval server and regional information retrieval method |
| CN102819953B (en) * | 2012-08-23 | 2014-07-02 | 北京世纪高通科技有限公司 | Method and device for discovering suspected newly-added roads |
| CN103150328B (en) * | 2013-01-05 | 2016-06-22 | 武汉中地数码科技有限公司 | A kind of integrated approach utilizing data base's autodraft |
| CN103944932B (en) * | 2013-01-18 | 2017-07-14 | 阿里巴巴集团控股有限公司 | Search for, determine the method and server of active regions |
| CN104613976B (en) * | 2014-08-26 | 2017-12-15 | 腾讯科技（深圳）有限公司 | Determine the method and device in path |
| CN105528955B (en) * | 2014-09-30 | 2018-02-06 | 国际商业机器公司 | Generate the method and its device of road network |
| CN105825242B (en) * | 2016-05-06 | 2019-08-27 | 南京大学 | The real-time method for detecting abnormality in cluster communication terminal track and system based on hybrid grid hierarchical cluster |
-
2018
- 2018-03-06 CN CN201810183493.5A patent/CN110211204B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104125638A (en) * | 2010-01-15 | 2014-10-29 | 苹果公司 | Managing a location database for network-based positioning system |
| WO2017200889A1 (en) * | 2016-05-19 | 2017-11-23 | Microsoft Technology Licensing, Llc | Classifying entities in digital maps using discrete non-trace positioning data |
| CN106228302A (en) * | 2016-07-21 | 2016-12-14 | 上海仙知机器人科技有限公司 | A kind of method and apparatus for carrying out task scheduling in target area |
| CN107402955A (en) * | 2017-06-02 | 2017-11-28 | 阿里巴巴集团控股有限公司 | The method and apparatus for determining the index grid of geography fence |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110211204A (en) | 2019-09-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9535752B2 (en) | Systems and methods of host-aware resource management involving cluster-based resource pools | |
| CN103871234A (en) | Grid mapping growth-based traffic network division method and configuration server | |
| CN110222029A (en) | A kind of big data multidimensional analysis computational efficiency method for improving and system | |
| CN110211204B (en) | Method, device and storage medium for determining road task package | |
| CN105574194A (en) | Coordinate point processing method and device for electronic map interface | |
| CN102819953B (en) | Method and device for discovering suspected newly-added roads | |
| CN113722314B (en) | Space connection query method and device, electronic equipment and storage medium | |
| CN103177417A (en) | GPGPU (general purpose computing on graphics processing unit) based mathematical-morphology LiDAR (Light detection and ranging) point cloud quick-filtering method | |
| CN103164529B (en) | A kind of anti-k nearest neighbor query method based on Voronoi diagram | |
| CN106202092A (en) | The method and system that data process | |
| CN103729378A (en) | Updating method and device for IP geographic information | |
| CN102495888B (en) | Parallel digital terrain analysis oriented data splitting and distributing method | |
| CN106250566A (en) | A kind of distributed data base and the management method of data operation thereof | |
| Xhafa et al. | Allocation of applications to Fog resources via semantic clustering techniques: With scenarios from intelligent transportation systems | |
| CN114386536B (en) | Region determination method, device, computing equipment and storage medium | |
| CN106598559A (en) | Rapid deployment method and system of cloud platform | |
| CN109839119B (en) | Method and device for acquiring bridge floor area of bridge of cross-road bridge | |
| CN115271250A (en) | Land resource space optimal configuration method | |
| CN102004771B (en) | Method for querying reverse neighbors of moving object based on dynamic cutting | |
| CN104219088A (en) | Hive-based network alarm information OLAP method | |
| CN113191029B (en) | Traffic simulation method, program, and medium based on cluster computing | |
| CN103914461B (en) | Traffic information enquiry method and device | |
| CN104680782A (en) | Traffic control cloud system | |
| CN113449052A (en) | Method for establishing spatial index, method and device for querying spatial region | |
| CN116050159A (en) | Simulation scene set generation method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |