CN112564930A

CN112564930A - Access side optical cable route planning method and system based on map

Info

Publication number: CN112564930A
Application number: CN201910854706.7A
Authority: CN
Inventors: 周憧; 王尉霖; 胡适; 王珏
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Group Zhejiang Co Ltd
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Group Zhejiang Co Ltd
Priority date: 2019-09-10
Filing date: 2019-09-10
Publication date: 2021-03-26
Anticipated expiration: 2039-09-10
Also published as: CN112564930B

Abstract

The invention discloses a map-based access side optical cable route planning method and a map-based access side optical cable route planning system, wherein the method comprises the steps of obtaining map original data in a specified range containing an optical cable access point; identifying the objects in the specified range according to the map original data; setting a passing cost value for all pixel points in the map original data according to the identification result; the passing cost value of the object edge pixel points identified as the building is smaller than the passing cost values of the other object pixel points; performing route planning calculation according to longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain an optimal optical cable route planning route of the optical cable access point, and facilitating optical cable route planning and selecting to route along the welt of a building by setting a passing cost value so as to meet the requirement of actual optical cable installation and wiring; the effectiveness of optical cable routing planning is improved, and the practicability of optical cable installation is also improved.

Description

Access side optical cable route planning method and system based on map

Technical Field

The invention relates to the technical field of communication, in particular to a map-based access side optical cable route planning method and a map-based access side optical cable route planning system.

Background

With the development of social economy, network users multiply, and the requirements of individual network users or unit network users on the network are higher and higher at present. With the development of communication technology, optical cables are often used as communication transmission tools, and have the advantages of large capacity, small attenuation, small volume, light weight, good anti-interference performance, convenient expansion and the like, so that the optical cables become the mainstream of current network construction.

The optical cable access is specifically a full-service access optical cable network, the full-service access optical cable network comprises optical cables from access side equipment such as an access machine room, an optical cross-connecting box and an optical branching box to client side equipment, the tasks of home broadband access and enterprise private line access are borne, the tasks are similar to capillary vessels in a human body, the access distance is short, the access quantity is large, the lowest level in the optical cable network is the most basic level, and the network can normally and healthily work only if the basic level is arranged safely and reasonably.

When the optical cable is installed and accessed, the optical cable route planning is needed, different optical cable route planning is different in line length, layout difficulty and reasonability, so that the optical cable route planning is important in the construction of an optical cable network, and the reasonable planning can effectively reduce the construction cost of the optical cable network.

The existing optical cable routing planning is mainly completed manually, specifically, when the daily optical cable is installed and connected, no special personnel is responsible for planning an optical cable route, a service opening person only conducts optical cable access according to the survey and experience of the field condition, most of the service opening persons calculate the optical cable access according to the on-site condition, no better and complete route planning exists, when the distance is longer, the manual drawing planning is conducted on a map, and then the optical cable installation is conducted according to the drawn line.

However, the drawback of completing the cable routing access for manual field operation is as follows: the manual field operation basically simply surveys the distance from the access side (namely the position of a user object needing to access the optical cable) to the optical cable box, then the optical cable laying is carried out by experience, a complete planned route is not provided during the laying, uncertainty exists, the optical cable access easily takes a long time after the optical cable is received, the optical cable laying is easily unreasonable, a large amount of optical cables are consumed for optical cable installation, the cost is increased, and the optical cable installation effect is not necessarily good. In addition, when the distance between the access side and the optical cable box is long, an installer can only draw a line on a map and lay the optical cable according to the drawn line, and the defects of inaccurate planning and high planning difficulty exist. Therefore, the existing planning of the optical cable routing is carried out simply by manpower, and the defects of lack of unified planning basis, dependence on manual spot check whether the planning is reasonable and lack of supervision means exist.

In the prior art, research and development personnel also research and develop a method for automatically planning an optical cable route, for example, chinese patent document discloses an ODN wiring management method and system based on a GIS platform with application number CN201510163585.3, and the management method includes: the method comprises the steps of automatically planning an ODN network structure according to resource information, future population distribution trend and service growth condition of an ODN deployment area and existing station and machine room information, automatically selecting corresponding ODN equipment to generate optimized ODN network laying distribution, finishing design operations such as area division, site selection, equipment selection, optical cable route design, civil engineering design, optical cable laying and the like on a GIS map by importing the GIS map and existing network stock resources based on a GIS platform, outputting serial design documents such as an optical cable route diagram, an equipment terminal and fiber core distribution diagram and a material and service cost list, calculating a shortest path according to road information provided by the GIS map, and automatically generating the optimized ODN network laying distribution.

The above patent documents disclose the drawbacks of optical cable routing planning:

although the above patent document gives a technical hint of automatically generating an optical cable laying route through a map, it does not specifically give a method of planning an optical cable laying route, and only gives a method of generating an optical cable laying route according to a map, and on the basis that a person skilled in the art does not clearly determine how to plan an optical cable route to be an optimal route, and discloses that "calculating a shortest route according to road information provided by a GIS map, and automatically generating an optimized ODN network laying distribution", the person skilled in the art can think that only optical cable laying and shortest route planning are also adopted, and the shortest route planning is not reasonable, and although the optical cable laying route is short, the optical cable laying route may need to cross a mountain or directly cross a main trunk road, so that the laying of the optical cable is not convenient, and the cost investment of auxiliary equipment (such as a bracket, a mounting rack and the like) is increased, and thus do not have an economical and efficient method of optical cable routing planning. Therefore, the content given by the patent document is too wide to substantially influence the patent application of the invention, and the patent document also has the defect that the optical cable routing planning is not reasonable, economic and effective enough.

Disclosure of Invention

In view of the above, the present invention has been developed to provide a map-based access side cable routing method and system that overcomes, or at least partially solves, the above-mentioned problems.

According to an aspect of the present invention, there is provided a map-based access-side cable routing planning method, including the steps of: acquiring original map data in a specified range containing an optical cable access point; identifying the objects in the specified range according to the map original data; setting a passing cost value for all pixel points in the map original data according to the identification result; and carrying out route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point.

Further, the obtaining of the map raw data within the specified range including the optical cable access point further comprises: determining that the presentation range of a terminal screen containing an optical cable access point is an appointed range, and judging whether an optical cable box is arranged in a geographic position area corresponding to the appointed range; if yes, obtaining map original data in a terminal screen presentation range containing the optical cable access point; and if not, expanding the specified range by a preset step range until an optical cable box is arranged in the geographic position area corresponding to the specified range, and acquiring the original map data in the specified range including the optical cable access point.

Further, after the obtaining of the map raw data within the specified range including the cable access point, the method further includes: if the map original data is in the RGB format, converting the map original data into the HSV format; the identifying the object in the specified range according to the map original data specifically comprises: and identifying the object in the specified range according to the H channel data of the map data.

Further, after the identifying the objects within the specified range, the method further comprises: selecting object pixel points identified as buildings, and performing binarization image processing; and searching edge pixel points of the building through a self-adaptive contour retrieval algorithm.

Further, the setting of the passing cost value for all the pixel points in the map original data further includes: setting self passing cost values and moving passing cost values for all pixel points in the map original data; and the moving passage cost value is the passage cost value of the current pixel point moving to the adjacent pixel points in the preset horizontal and vertical range and the preset oblique range.

Further, the performing route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point further comprises: calculating absolute distance values of every two pixel points according to longitude and latitude information of each pixel point in the route to be planned; calculating a route optimization value according to the absolute distance value of every two pixel points and the passing cost value of the pixel points in the route to be planned; and selecting the route with the minimum route optimization value as the optimal optical cable route planning route of the optical cable access point.

According to yet another aspect of the present invention, there is provided a map-based access-side cable routing planning system, comprising: the data acquisition module is used for acquiring original map data in a specified range containing the optical cable access point; the identification module is used for identifying the objects in the specified range according to the map original data; the setting module is used for setting passing cost values for all pixel points in the map original data according to the identification result; and the route planning module is used for carrying out route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point.

Further, the route planning module is further to: calculating absolute distance values of every two pixel points according to longitude and latitude information of each pixel point in the route to be planned; calculating a route optimization value according to the absolute distance value of every two pixel points and the passing cost value of the pixel points in the route to be planned; and selecting the route with the minimum route optimization value as the optimal optical cable route planning route of the optical cable access point.

According to still another aspect of the present invention, there is provided a server including: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus; the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the operation corresponding to the map-based access side cable routing planning method.

According to a final aspect of the present invention, there is provided a computer storage medium having at least one executable instruction stored therein, the executable instruction causing a processor to perform operations corresponding to the map-based access-side cable routing method as described above.

The invention relates to a map-based access side optical cable route planning method and a map-based access side optical cable route planning system, which are characterized in that map original data in a specified range containing optical cable access points are obtained; identifying the objects in the specified range according to the map original data; setting a passing cost value for all pixel points in the map original data according to the identification result; the passing cost value of the object edge pixel points identified as the building is smaller than the passing cost values of the other object pixel points; performing route planning calculation according to longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain an optimal optical cable route planning route of the optical cable access point, and facilitating optical cable route planning and selecting to route along the welt of a building by setting a passing cost value so as to meet the requirement of actual optical cable installation and wiring; the validity of optical cable route planning is improved, the practicability of optical cable installation is also improved, the absolute distance and the passing cost are comprehensively considered, the situation that the distance is short is ensured, and pixel points with low passing cost are selected, so that the optical cable line is reasonably arranged, the cost can be ensured to be low when the optical cable line is actually connected, the wiring mode of wiring along a building is ensured, the optical cable route is planned through the above method, automatic generation is realized, the speed is high due to the fact that the calculated amount is small, the actual installation situation is considered at the same time, and economic and effective optical cable routes are obtained.

The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.

Drawings

Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:

fig. 1 is a schematic flowchart of a map-based access-side optical cable routing planning method according to an embodiment of the present invention;

fig. 2 is a schematic flowchart of another map-based access-side cable routing planning method according to an embodiment of the present invention;

fig. 3 is a schematic flow chart of a building edge finding algorithm of a map-based access-side optical cable routing planning method according to an embodiment of the present invention;

fig. 4 is a schematic flowchart of an optical cable routing planning algorithm of an access-side optical cable routing planning method based on a map according to an embodiment of the present invention;

fig. 5 is a schematic structural diagram of another map-based access-side cable routing planning system according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of another map-based access-side cable routing planning system according to an embodiment of the present invention;

fig. 7 is a schematic structural diagram of a server according to an embodiment of the present invention.

Detailed Description

Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

Example one

As shown in fig. 1, the method for planning the route of the access-side optical cable based on the map provided by this embodiment includes the following steps:

s101, obtaining map original data in a specified range containing optical cable access points.

As a preferred implementation manner of this embodiment, the acquiring the map raw data within the specified range including the optical cable access point further includes:

determining that the presentation range of a terminal screen containing an optical cable access point is an appointed range, and judging whether an optical cable box is arranged in a geographic position area corresponding to the appointed range;

if yes, obtaining map original data in a terminal screen presentation range containing the optical cable access point;

and if not, expanding the specified range by a preset step range until an optical cable box is arranged in the geographic position area corresponding to the specified range, and acquiring the original map data in the specified range including the optical cable access point.

For example, by inputting coordinates of the access side (i.e., the cable access point) including longitude and latitude of the access side through the mobile terminal or the computer, the mobile terminal or the computer automatically acquires map raw data within a certain range around the coordinates of the access side, the map raw data being acquired based on a map application in the mobile terminal or the computer (e.g., a Baidu map or a Gade map). The map application loaded in the mobile phone is used by an operator, the map application can be opened on site to input the coordinates of the access side, and the positioning point can be pulled to the map position of the access side in an input mode or the longitude and latitude of the access side can be directly input.

In the step, a map page presented by the mobile phone display screen is selected, namely, map original data of the map presented by the mobile phone display screen under the size is obtained, whether an optical cable box exists in the range is judged by judging the longitude and latitude of each pixel point in the range to be compared with the prestored longitude and latitude of each optical cable box, if yes, the range of the obtained map data is not expanded, the range can be planned according to the requirement, the range does not need to be expanded, the map original data quantity obtained is minimum by obtaining the map page presented by the mobile phone display screen, subsequent path planning is facilitated, data required to be processed in path planning is reduced, the processing quantity of the planning process is greatly reduced, and the planning speed is improved. Certainly, if there is no optical cable box in the range, that is, there is no optical cable box for pulling out and accessing the optical cable to the access side, the obtained map raw data needs to be expanded, the obtained map raw data is gradually increased, and the range increased once can be calibrated until there is an optical cable box in the obtained map raw data.

And S102, identifying the object in the specified range according to the map original data.

And S103, setting a passing cost value for all pixel points in the original map data according to the identification result.

The passing cost value of the object edge pixel points identified as the building is smaller than the passing cost values of the other object pixel points.

Because the particularity of the optical cable access is that the optical cable needs to be routed along the welt of the building, a lower passing cost needs to be set for the outline of the edge of the building (the passing cost is a numerical value which needs to be added when the optical cable passes through the pixel point, and the larger the numerical value is, the larger the cost paid by the pixel point is), and the premise that the lower passing cost is set for the outline of the edge of the building is that the outline information of the outermost periphery of the building is found.

Specifically, the boundary value of the outer frame is set by using the retrieval mode of the outline, and the self-adaptive retrieval algorithm only keeps the outline edge range interval of the building. The specific implementation is that the surrounding relation of the binary image boundary, the hole boundary and the hierarchical relation of the boundary and the hole boundary are determined, and the boundaries and the area of the original image have a one-to-one correspondence relationship: the outer boundary corresponds to a connected region with a pixel value of 1, the hole boundary corresponds to an inner region with a pixel value of 0, and pixel points of other objects are all set to have a pixel value of 0. The building edge is specifically found by using the principle of an adaptive contour search algorithm, as shown in fig. 3, the boundary value of the outer frame is set to 1, that is, NBD is 1, the input binary image is an image of 0 and 1 according to the one-to-one correspondence, and the pixel value of the image is represented by (i, j). Then (i, j) is the current pixel, (i, j-1) is the left pixel, and (i, j +1) is the right pixel, and each line scan is terminated when the following two conditions are met:

(1) (i, j) is 1 and (i, j-1) is 0, then (i, j) is the starting point of the outer contour;

(2) if (i, j) is 1 and (i, j +1) is 0, (i, j) is the starting point of the inner contour.

Then, starting from the starting point, marking pixels on the boundary and carrying out contour extraction.

As an improved implementation manner of this embodiment, further, the setting a passage cost value for all pixel points in the map original data further includes:

setting self passing cost values and moving passing cost values for all pixel points in the map original data, wherein the moving passing cost values are the passing cost values of the current pixel points moving to the adjacent pixel points in the preset horizontal and vertical range and the preset oblique range. The method specifically comprises the following steps:

setting a first self passing cost value for an object edge pixel point of a building according to the identification result of the object; and setting the second self-passing cost values with different numerical values for the pixel points of other objects.

Setting a first moving passing cost value of moving to the pixel points in the preset horizontal and vertical range for all the pixel points, and setting a second moving passing cost value of moving to the pixel points in the preset oblique range for all the pixel points.

The first self-passing cost value is the lowest, and each second self-passing cost value is higher than the first self-passing cost value; the second move-through cost value is greater than the first move-through cost value.

Thus, after obtaining the contour information, the parameters can be set such that the first move-through cost is 10 for the lateral-longitudinal movement and the second move-through cost is 14 for the four diagonal directions. The first self passage cost value, i.e., the passage cost of the building edge, is set to 3. After the cost is passed through to the border setting of building, carry out the second respectively to the pixel of other objects departments and self to pass through the cost setting, wherein all pixels of arterial road all set up self and pass through the cost to be 99, all pixels of river course all set up self and pass through the cost to be 99, all pixels of little road all set up self and pass through the cost to be 50, all pixels of mountain area all set up self and pass through the cost to be 80, the pixel inside the building all sets up self and passes through the cost to be 99.

Through the arrangement, the optical cable route can be conveniently planned and selected to be routed along the welt of the building when an optical cable route is searched, so that the requirement of actual optical cable installation and wiring is met. And optical cable routing planning is considered from the practical situation, so that the effectiveness of the optical cable routing planning is greatly improved, and the practicability of optical cable installation is also improved. The setting of the passing cost also provides a calculation basis for the following path planning algorithm.

And S104, performing route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point.

As an improved implementation manner of this embodiment, the performing route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point further includes:

calculating absolute distance values of every two pixel points according to longitude and latitude information of each pixel point in the route to be planned; calculating a route optimization value according to the absolute distance value of every two pixel points and the passing cost value of the pixel points in the route to be planned; and selecting the route with the minimum route optimization value as the optimal optical cable route planning route of the optical cable access point.

Specifically, the longitude and latitude of each pixel point are obtained in step S101, the passing cost value of each different pixel point is obtained in step S103, route planning calculation is performed according to the values, the access side is used as a starting point, one pixel point where the optical cable box is located is used as an end point, when a plurality of optical cable boxes are provided, one of the optical cable boxes is selected as the end point, and after calculation is completed, the other optical cable box is replaced as the end point until each optical cable box is calculated once. There are 8 pixels around each pixel, and start calculation with the starting point, calculate the route optimization values from the starting point to the 8 pixels around, hereinafter referred to as F value, F (n) ═ g (n) + h (n), where g (n) is the passing cost value of the pixels in the route to be planned (calculated from the self passing cost value and the moving passing cost value set in step S103), h (n) is the absolute distance value of two pixels (the value is the sum of the absolute values subtracted from the latitudes and longitudes of the pixels, longitude minus longitude, latitude minus latitude), since the current starting point is the selected pixel, it only needs to calculate the absolute distance values from the starting point to the 8 pixels and the passing cost value of the pixels in the route to be planned, and then select the point with the minimum F value among the 8 pixels as the pixel to be passed through in the optical cable route, and then, continuously selecting the selected point to select the pixel point with the minimum F value around the selected point, eliminating the pixel point which is selected before when the pixel point is selected (for example, after the starting point selects the next passing pixel point, when the pixel point calculates the next required selected point, the starting point is eliminated at the moment, the loop is avoided), and then connecting the selected pixel points to form the optical cable planning route. Because the shortest pixel of absolute distance is not selected when selecting the pixel, neither select the pixel that passes through the cost minimum, but the absolute distance and the cost of passing through are considered comprehensively, guarantee promptly that the condition that the distance is short selects the pixel that passes through the cost less again to optical cable line arranges rationally and can guarantee promptly that the cost is less when actually inserting, guarantee again to walk the wiring mode of line along the building.

The specific path planning algorithm is shown in fig. 4:

s401: the starting point is added to the OPEN table.

Specifically, an OPEN linked list and a CLOSED linked list are respectively created, wherein the CLOSED linked list is used for storing the detected nodes, and the starting point A is placed in the OPEN list. I.e. the pixel point on the access side as the starting point.

S402: and judging whether the OPEN table is empty or not.

In this step, it is determined whether the OPEN table is empty, if so, that is, there is no node in the OPEN table, it indicates that the pixel point on the access side is the detected node inserted into the CLOSE chain table, step S407 is executed to execute a line function to traverse the parent node stored in the CLOSE chain table in reverse order, connect the points on the map layer, and draw the cable routing path. If there are nodes, the step S403 is continued.

S403: and finding out the node with the minimum F value from the OPEN linked list, and adding the node into the CLOSE linked list.

In the step, the nodes to be detected are sequentially inserted into an OPEN table, the F value of the nodes is calculated, the node with the minimum F value in the OPEN table is selected and added into a CLOSE table, and the F value is calculated by the following formula: f (n) ═ g (n) + h (n), h (n) is the value of the absolute distance between two pixel points, and g (n) is the value of the passing cost of the pixel point to be selected (calculated from the self passing cost value and the moving passing cost value set in the step S103).

S404: and judging whether the node is an end point.

In this step, it is determined that when the end point, i.e., the last cable box position point, appears in the OPEN table, the traversal is terminated and a jump is made to step S407, otherwise, step S405 is continued.

S405: and searching the adjacent node of the node as the expanded node.

Specifically, the nodes adjacent to the node in step S404 are found. In order to avoid walking around during route planning, this step also needs to filter out the nodes in the CLOSE table from the found neighbor nodes, i.e., continue to find the neighbor nodes of the node that are not in the CLOSE table.

S406: and calculating the G value of the expanded node, and updating the G value of the node in the OPEN table if the G value of the original node in the OPEN table is larger than the currently calculated G value of the node.

Specifically, it is first determined whether the node is in the OPEN table, and if the node is in the OPEN table, the G value of the node is recalculated, and the G value is calculated according to the passing cost value and the moving passing cost value of the node set in step S103, and a calculation formula is determined according to the object edge pixel point corresponding to the node, and if the node G value in the OPEN table is greater than the currently calculated G value, the node G value in the OPEN table is updated. If the node is not in the OPEN table, the node is inserted into the OPEN table.

It is noted that if the node already exists in the CLOSE table, i.e., it represents that the node is a detected node, it ignores and continues to find neighboring nodes.

It should be noted that the G value is equal to the moving passing cost value of moving from the starting point to the designated pixel point plus the passing cost value of the pixel point itself.

For example, the first move-through cost value, i.e., the lateral-longitudinal move cost, is 10, and the second move-through cost value, i.e., the four diagonal costs, is 14. The first self passage cost value, i.e., the passage cost of the building edge, is set to 3. After the cost is passed through to the border setting of building, carry out the second respectively to the pixel of other objects departments and self to pass through the cost setting, wherein all pixels of arterial road all set up self and pass through the cost to be 99, all pixels of river course all set up self and pass through the cost to be 99, all pixels of little road all set up self and pass through the cost to be 50, all pixels of mountain area all set up self and pass through the cost to be 80, the pixel inside the building all sets up self and passes through the cost to be 99.

When a river channel pixel point is right of the starting point, the value G moved from the starting point to the river channel pixel point is 10+99 which is 109; when a pixel point of the small road is located obliquely above the starting point, the value G of the pixel point moving from the starting point to the small road is 14+50 or 64.

And further updating the F value of the node in the OPEN table according to the updated G value.

S407: and recording each accessed node as a father node, and traversing all father node data in a reverse order until a starting point after finding a target point to obtain an optical cable routing planning route.

And after finding a target point, traversing father node data in a reverse order until the target point reaches a starting point, connecting each father node with the starting point to form a path, traversing the father nodes stored from the end point by executing a line function, connecting the points on a common map layer of a map, displaying a routing path, and obtaining a shortest path array by an arcLength function, so that the shortest route of welting routing is screened out, and the optical cable routing path is obtained.

And adding the distance measured and calculated by each terminal into a sequencing queue to screen out the minimum terminal, connecting all the points in a reverse order, converting the measured and calculated result into an actual distance result according to a hundred-degree scale, namely adopting multiple calculations when a plurality of optical cable boxes are used to obtain a route from the starting point to each optical cable box, and selecting the route with the shortest route distance as the optimal optical cable route planning route under the current access side.

The route calculated by the method provided by the embodiment comprehensively considers the passing cost and the absolute distance to obtain the optical cable route which best meets the current access side.

Example two

As shown in fig. 2, another map-based access-side cable routing planning method provided for this embodiment includes the following steps:

s201, obtaining map original data in a specified range containing optical cable access points.

And S202, converting the map original data in the RGB format into map data in the HSV format.

And S203, identifying the object in the specified range according to the map original data.

The identifying the object in the specified range according to the map original data specifically comprises: and identifying the object in the specified range according to the H channel data of the map data.

Specifically, the map original data acquired in step S201 includes image information of an RGB format model, the image information of the RGB format model is subjected to model conversion, an image of the RGB format model is converted into an HSV hexagonal pyramid model, and after the conversion is completed, the azimuth information of a main road, a building, a small road, a river channel and a mountain area is distinguished by using an H channel and converted into a two-dimensional array. The specific conversion formula for converting the RGB format model into the HSV hexagonal pyramid model is as follows:

max＝max(R,G,B),min＝min(R,G,B),V＝max(R,G,B),S＝(max-min)/max,

ifR＝max,H＝(G-B)/(max-min)*60,ifG＝max,H＝120+(B-R)/(max-min)*60,ifB＝max,H＝240 +(R-G)/(max-min)*60,ifH<0,H＝H+360。

each pixel point has the largest (R, G, B) and the smallest (R, G, B), the HSV value is given to each pixel point in the mode, in the HSV model, the H channel represents hue information, the S channel represents saturation, and the V channel represents brightness, so that the hue of the pixel point can be represented through the value of the H channel, the pixel points can be distinguished into different color systems, therefore, the azimuth information is distinguished only through the H channel, and the road and different obstacle information is screened by adjusting the sensitivity of the HSV model to different colors. For example, the specific screening parameters may be: red color 0-20, 160-180, blue color 100-120, green color 60-80, yellow color 23-38, black 0. And respectively judging the displayed color system according to the H value of the pixel, if the H value is 15, the displayed color system is a red color system, so that the color system represented by the pixel is known according to different H values, and the object information represented by the pixel is obtained according to different color systems, such as the red color system is a main road, the blue color system is a river channel, the green color system is a small street, the yellow color system is a mountain area, and the black color system is a building.

The image information of the RGB format model has other colors besides red, blue, green, yellow and black, and objects represented by the other colors do not have an effect on optical cable routing planning, so that the objects of the colors can interfere with calculation and increase the calculated amount, the optical cable routing planning is not accurate enough, and each pixel point of the image information of the RGB format model has R elements, G elements and B elements. The color system of each pixel point can be obtained only by synthesizing the R element, the G element and the B element, so that the amount of comprehensive calculation for distinguishing different objects is far greater than the amount of calculation for distinguishing by only H value. Compared with the calculated amount of the color system where each pixel is located obtained by adopting the image information of the RGB format model, the calculated amount of the color system difference by adopting the H value is two thirds less. Therefore, the calculation amount can be greatly reduced by adopting image model conversion, the calculation speed is improved, the calculation amount is greatly reduced by adopting the method for carrying out model conversion treatment on the obtained map original data, the interference color can be eliminated, and the accuracy and the effectiveness of optical cable routing planning are improved.

S204, selecting the object pixel points identified as the building, and performing binarization image processing;

s205, searching edge pixel points of the building through a self-adaptive contour retrieval algorithm.

As shown in fig. 3, after the objects are distinguished in the HSV-formatted map model data map in steps S203 and S204, the selected building pixel points are selected, the binarization image processing is performed, and the boundary value of the outer frame is set by using the contour search mode on the basis of the building binarization image, so that the adaptive search algorithm only keeps the contour edge range section of the building. The specific implementation is that the surrounding relation of the binary image boundary, the hole boundary and the hierarchical relation of the boundary and the hole boundary are determined, and the boundaries and the area of the original image have a one-to-one correspondence relationship: the outer boundary corresponds to a connected region with a pixel value of 1, the hole boundary corresponds to an inner region with a pixel value of 0, and pixel points of other objects are all set to have a pixel value of 0.

S206, setting passing cost values for all pixel points in the map original data according to the identification result; the passing cost value of the object edge pixel points identified as the building is smaller than the passing cost values of the other object pixel points.

And S207, carrying out route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point.

And S208, outputting the optimal optical cable routing route.

Specifically, the current optimal optical cable routing route is calculated and then sent to the mobile phone of the installer, and the construction cost is converted and the return result is also sent to the mobile phone of the installer. And the installation personnel install the optical cable according to the planned route.

By adopting the system provided by the embodiment, route planning calculation is carried out according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point, and the cost value is set to facilitate the optical cable route planning and selecting to route along the welt of the building, so that the requirement of actual optical cable installation and wiring is met; the validity of optical cable route planning is improved, the practicability of optical cable installation is also improved, the absolute distance and the passing cost are comprehensively considered, the situation that the distance is short is ensured, and pixel points with low passing cost are selected, so that the optical cable line is reasonably arranged, the cost can be ensured to be low when the optical cable line is actually connected, the wiring mode of wiring along a building is ensured, the optical cable route is planned through the above method, automatic generation is realized, the speed is high due to the fact that the calculated amount is small, the actual installation situation is considered at the same time, and economic and effective optical cable routes are obtained.

EXAMPLE III

Fig. 5 is a diagram of a map-based access-side cable routing planning system disclosed in this embodiment, as shown in fig. 5, including:

a data obtaining module 301, configured to obtain map raw data in a specified range including the optical cable access point.

Further, the data obtaining module 301 is further configured to: determining that the presentation range of a terminal screen containing an optical cable access point is an appointed range, and judging whether an optical cable box is arranged in a geographic position area corresponding to the appointed range; if yes, obtaining map original data in a terminal screen presentation range containing the optical cable access point; and if not, expanding the specified range by a preset step range until an optical cable box is arranged in the geographic position area corresponding to the specified range, and acquiring the original map data in the specified range including the optical cable access point.

For example, if coordinates of the access side including longitude and latitude of the access side are input through the mobile terminal or the computer, the mobile terminal or the computer automatically acquires map raw data within a certain range around the coordinates of the access side, the map raw data being acquired based on a map application in the mobile terminal or the computer (such as a Baidu map or a Gade map). The map application loaded in the mobile phone is used by an operator, the map application can be opened on site to input the coordinates of the access side, and the positioning point can be pulled to the map position of the access side in an input mode or the longitude and latitude of the access side can be directly input.

In the module, a map page presented by a mobile phone display screen is selected firstly, namely, map original data of the map presented by the mobile phone display screen under the size is obtained firstly, whether an optical cable box exists in the range is judged by judging the longitude and latitude of each pixel point in the range to be compared with the prestored longitude and latitude of each optical cable box, if yes, the range of the obtained map data is not expanded, the planning of the optical cable route can be met, the range does not need to be expanded, the obtained map original data is minimum by obtaining the map page presented by the mobile phone display screen, the subsequent path planning is facilitated, the data required to be processed in the path planning is reduced, the processing capacity in the planning process is greatly reduced, and the planning speed is improved. Certainly, if there is no optical cable box in the range, that is, there is no optical cable box for pulling out and accessing the optical cable to the access side, the obtained map raw data needs to be expanded, the obtained map raw data is gradually increased, and the range increased once can be calibrated until there is an optical cable box in the obtained map raw data.

An identifying module 302, configured to identify an object within the specified range according to the map raw data.

A setting module 303, configured to set a passing cost value for all pixel points in the map original data according to the identification result; the passing cost value of the object edge pixel points identified as the building is smaller than the passing cost values of the other object pixel points.

Further, the setting module 303 is further configured to: setting self passing cost values and moving passing cost values for all pixel points in the map original data, wherein the moving passing cost values are the passing cost values of the current pixel points moving to the adjacent pixel points in the preset horizontal and vertical range and the preset oblique range. The method specifically comprises the following steps:

And the route planning module 304 is configured to perform route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point, so as to obtain an optimal optical cable route planning route of the optical cable access point.

The route planning module 304 is further configured to: taking an optical cable access point as a starting point and each optical cable box position point as an end point to perform optical cable routing planning; in the optical cable route planning process, calculating absolute distance values of every two pixel points according to longitude and latitude information of each pixel point in a route to be planned; calculating a route optimization value according to the absolute distance value of every two pixel points and the passing cost value of the pixel points in the route to be planned; and selecting the route with the minimum route optimization value as the optimal optical cable route planning route of the optical cable access point.

The route calculated by the system provided by the embodiment comprehensively considers the passing cost and the absolute distance to obtain the optical cable route which best meets the current access side.

Example four

Fig. 6 is another map-based access-side cable routing planning system provided in this embodiment, as shown in fig. 6, including:

a data obtaining module 401, configured to obtain map raw data in a specified range including the optical cable access point.

Further, the data obtaining module 401 is further configured to: determining that the presentation range of a terminal screen containing an optical cable access point is an appointed range, and judging whether an optical cable box is arranged in a geographic position area corresponding to the appointed range; if yes, obtaining map original data in a terminal screen presentation range containing the optical cable access point; and if not, expanding the specified range by a preset step range until an optical cable box is arranged in the geographic position area corresponding to the specified range, and acquiring the original map data in the specified range including the optical cable access point.

An identifying module 402, configured to identify an object within the specified range according to the map raw data.

A conversion module 403, configured to convert map raw data in RGB format into map data in HSV format;

A setting module 404, configured to set a passing cost value for all pixel points in the map original data according to the identification result; the passing cost value of the object edge pixel points identified as the building is smaller than the passing cost values of the other object pixel points.

Further, the setting module 404 is further configured to: setting self passing cost values and moving passing cost values for all pixel points in the map original data, wherein the moving passing cost values are the passing cost values of the current pixel points moving to the adjacent pixel points in the preset horizontal and vertical range and the preset oblique range. The method specifically comprises the following steps:

And the processing module 405 is configured to select the object pixel points identified as the building, and perform binarization image processing.

And the edge calculation module 406 is configured to find edge pixel points of the building through an adaptive contour search algorithm.

And the route planning module 407 is configured to perform route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point, so as to obtain an optimal optical cable route planning route of the optical cable access point.

EXAMPLE five

An embodiment of the present application provides a non-volatile computer storage medium, where the computer storage medium stores at least one executable instruction, and the computer executable instruction may execute a method for map-based access-side cable routing planning in any of the above method embodiments.

EXAMPLE six

Fig. 7 is a schematic structural diagram of a server according to a sixth embodiment of the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the server.

As shown in fig. 7, the server may include: a processor (processor), a Communications Interface (Communications Interface), a memory (memory), and a Communications bus.

Wherein:

the processor, the communication interface, and the memory communicate with each other via a communication bus.

A communication interface for communicating with network elements of other devices, such as clients or other servers.

The processor is configured to execute a program, and may specifically execute relevant steps in the above described map-based access-side cable routing method embodiment.

In particular, the program may include program code comprising computer operating instructions.

The processor may be a central processing unit CPU or an application Specific Integrated circuit asic or one or more Integrated circuits configured to implement embodiments of the present invention. The server comprises one or more processors, which can be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.

And the memory is used for storing programs. The memory may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.

The program may specifically be adapted to cause a processor to perform the following operations: acquiring original map data in a specified range containing an optical cable access point;

identifying the objects in the specified range according to the map original data;

setting a passing cost value for all pixel points in the map original data according to the identification result; the passing cost value of the object edge pixel points identified as the building is smaller than the passing cost values of the other object pixel points;

and carrying out route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point.

The algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.

In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.

Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.

Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.

Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.

It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names.

Claims

1. A map-based access side optical cable route planning method is characterized by comprising the following steps:

acquiring original map data in a specified range containing an optical cable access point;

setting a passing cost value for all pixel points in the map original data according to the identification result;

2. The method of claim 1, wherein obtaining map raw data within a specified range including a cable access point further comprises:

3. The method of claim 1, wherein after said obtaining map raw data within a specified range containing a cable access point, the method further comprises: if the map original data is in the RGB format, converting the map original data into the HSV format;

4. The method of claim 1, wherein after the identifying objects within the specified range, the method further comprises:

selecting object pixel points identified as buildings, and performing binarization image processing;

and searching edge pixel points of the building through a self-adaptive contour retrieval algorithm.

5. The method of claim 1, wherein setting a pass cost value for all pixels in the map raw data further comprises:

setting self passing cost values and moving passing cost values for all pixel points in the map original data; and the moving passage cost value is the passage cost value of the current pixel point moving to the adjacent pixel points in the preset horizontal and vertical range and the preset oblique range.

6. The method of any one of claims 1 to 5, wherein performing a route planning calculation according to the longitude and latitude information of each pixel point of the map raw data and the passing cost value of each pixel point to obtain the optimal optical cable routing route of the optical cable access point further comprises:

calculating absolute distance values of every two pixel points according to longitude and latitude information of each pixel point in the route to be planned; calculating a route optimization value according to the absolute distance value of every two pixel points and the passing cost value of the pixel points in the route to be planned;

and selecting the route with the minimum route optimization value as the optimal optical cable route planning route of the optical cable access point.

7. A map-based access-side cable routing planning system, comprising:

the data acquisition module is used for acquiring original map data in a specified range containing the optical cable access point;

the identification module is used for identifying the objects in the specified range according to the map original data;

the setting module is used for setting passing cost values for all pixel points in the map original data according to the identification result;

and the route planning module is used for carrying out route planning calculation according to the longitude and latitude information of each pixel point of the map original data and the passing cost value of each pixel point to obtain the optimal optical cable route planning route of the optical cable access point.

8. The system of claim 7, wherein the route planning module is further configured to:

9. A server, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;

the memory is configured to store at least one executable instruction that causes the processor to perform operations corresponding to the map-based access-side cable routing method of any of claims 1-6.

10. A computer storage medium having stored therein at least one executable instruction for causing a processor to perform operations corresponding to the map-based access-side cable routing method of any one of claims 1-6.