Method, device, equipment and medium for navigating factory-owned route data
By integrating the factory's own route data with national general route data in the navigation system, and selecting applicable path planning algorithms based on the position relationship between the navigation starting point and the end point, the problem of route planning in the navigation system being restricted during navigation within the factory is solved, and the route planning problem is improved. Accuracy and applicability of navigation algorithms.
Patent Information
- Application Number
- CN202111043510.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-09-07
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2041-09-07
AI Technical Summary
The existing navigation system is difficult to effectively store and utilize the complex road network data in the factory, resulting in limited route planning of freight vehicles during factory navigation.
By creating electronic fences, demarcate the boundary range of the factory area, and integrate the national general route data with the factory's own route data, navigate by using preset route planning methods, and select the applicable path planning algorithm based on the position relationship between the navigation starting point and the end point, and select the applicable path planning algorithm according to the location relationship between the navigation starting point and the end point. , navigate with road data inside and outside the factory.
The accuracy of the navigation algorithm is improved, and new routes in truck long-distance navigation are deeply explored to ensure the accuracy and applicability of the route, especially in the mixed situation of multiple factories.
Smart Images

Figure CN113865591B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of vehicle navigation technology, and in particular to a method, device, equipment and medium for navigating in combination with factory-owned route data. Background Art
[0002] The road network is the most important geographical element in intelligent transportation systems and location-based service applications, and is the backbone of the entire navigation electronic map. The main purpose of the navigation electronic map is to complete route planning through the road network and provide navigation services to users on this basis. Route planning based on the road network is the core function of the navigation system.
[0003] In the existing technology, standard national route data is generally used for navigation. However, with the expansion of urban scale and the development of transportation in my country, the road network is becoming larger and larger. It is difficult for an independent navigation system to store road network data covering all levels. Especially for the scenario of factory navigation of freight vehicles, the factory road data is often unique and complex, and the planned route is often limited by the road data within the factory.
[0004] Therefore, how to combine the road data within the factory to perform route planning is a technical problem that needs to be urgently solved by technical personnel in this field. Summary of the invention
[0005] The disclosed embodiments provide a method, apparatus, device and medium for navigating in conjunction with factory-owned route data. In order to have a basic understanding of some aspects of the disclosed embodiments, a simple summary is given below. This summary is not a general review, nor is it intended to identify key / important components or to describe the scope of protection of these embodiments. Its sole purpose is to present some concepts in a simple form as a preface to the detailed description that follows.
[0006] In a first aspect, an embodiment of the present disclosure provides a method for navigating in combination with factory-owned route data, including:
[0007] Make an electronic fence according to the factory boundary;
[0008] The national general route data is integrated with the factory's own route data to obtain the integrated national basic road data;
[0009] Receive the uploaded starting point and end point of the route to be navigated;
[0010] Navigation is performed using a preset route planning method based on the starting and ending points of the route to be navigated, the locations of the electronic fences, and the integrated national basic road data.
[0011] In one embodiment, an electronic fence is created according to the boundary range of the factory area, including:
[0012] With the center point of the factory as the center of the circle and the distance from the center point to the farthest factory boundary point as the radius, a circular electronic fence is formed;
[0013] Among them, the entrances and exits of the factory area are the fusion points of the electronic fence and are stored in the fusion point subset.
[0014] In one embodiment, the national general route data is integrated with the factory's own route data to obtain integrated national basic road data, including:
[0015] Delete the part of the national general route data that corresponds to the factory's own route data;
[0016] Convert the factory's own route data into the format of national common route data;
[0017] The factory-owned route data after format conversion and the deleted national general route data are compiled and integrated to obtain the integrated national basic road data.
[0018] In one embodiment, after forming a circular electronic fence, the method further includes:
[0019] Draw a ray from the starting point and the end point of the route to be navigated respectively;
[0020] When the number of intersections between the ray and the electronic fence is even, it is determined that the starting point or the end point is outside the electronic fence;
[0021] When the number of intersections between the ray and the electronic fence is odd, it is determined that the start point or the end point is within the electronic fence.
[0022] In one embodiment, according to the starting point and the end point of the route to be navigated and the location of the electronic fence and the integrated national basic road data, a preset route planning method is used for navigation, including:
[0023] When the starting point and end point of the route to be navigated are both within the electronic fence, the preset factory route planning method is used for navigation in combination with the integrated national basic road data;
[0024] When the starting point and the end point of the route to be navigated are not within the electronic fence, the route planning method of the general road data is used for navigation in combination with the integrated national basic road data;
[0025] When the starting point of the route to be navigated is within the electronic fence, but the end point is not within the electronic fence, the exit with the shortest distance to the electronic fence is selected as the fusion point in the fusion point subset. Combined with the fused national basic road data, the preset factory route planning method is used for navigation between the starting point and the fusion point, and the route planning method of the general road data is used for navigation between the fusion point and the end point.
[0026] When the starting point of the route to be navigated is not within the electronic fence, but the end point is within the electronic fence, the entrance with the shortest distance to the electronic fence is selected as the fusion point in the fusion point subset. Combined with the fused national basic road data, the route planning method of the general road data is used for navigation between the starting point and the fusion point, and the preset factory route planning method is used for navigation between the fusion point and the end point.
[0027] In one embodiment, the preset factory route planning method includes:
[0028] Determine the starting point and the end point of the factory route planning, and search the starting section and the end point corresponding to the starting point and the end point of the factory route planning in the section identification database;
[0029] When the identifier of the starting section is different from the identifier of the end section, initializing the search unit to remove duplicate sets;
[0030] Determine the current search node according to the starting section, and determine the end node according to the end section;
[0031] Querying a target road section connected to the current search node from the node map, and generating a first search unit, a first weight value, and a second weight value based on the target road section;
[0032] When the first search unit does not exist in the search unit deduplication set, placing the first search unit and a previous search unit of the first search unit in a route planning queue, and recording the first search unit and the previous search unit in the search unit deduplication set;
[0033] Execute a dequeue operation of the route planning queue based on the first weight value and the second weight value to generate a second search unit;
[0034] When the rear node of the road section corresponding to the second search unit is the end node, a planned intra-factory route is generated according to the second search unit.
[0035] In one embodiment, when a preset factory route planning method is used to plan a route within the factory, the method further includes:
[0036] Determine whether there are small factories nested within the factory area;
[0037] When a small factory area is nested within a factory area, a prohibited route database is constructed based on the relationship between the starting and ending positions of the factory area route planning and the position of the small factory area;
[0038] When planning using the preset factory route planning method, avoid prohibited routes.
[0039] In a second aspect, an embodiment of the present disclosure provides a device for navigating in combination with factory-owned route data, including:
[0040] A production module is used to produce an electronic fence according to the boundary range of the factory area;
[0041] The fusion module is used to merge the national general route data with the factory's own route data to obtain the merged national basic road data;
[0042] The acquisition module is used to receive the uploaded starting point and end point of the route to be navigated;
[0043] The navigation module is used to navigate using a preset route planning method based on the starting point and end point of the route to be navigated, the location of the electronic fence, and the integrated national basic road data.
[0044] In a third aspect, an embodiment of the present disclosure provides a device for navigation combined with a factory's own route data, comprising a processor and a memory storing program instructions, wherein the processor is configured to execute the method for navigation combined with a factory's own route data provided in the above embodiment when executing the program instructions.
[0045] In a fourth aspect, an embodiment of the present disclosure provides a computer-readable medium having computer-readable instructions stored thereon, and the computer-readable instructions can be executed by a processor to implement a method of navigating in combination with the factory's own route data provided in the above embodiment.
[0046] The technical solution provided by the embodiments of the present disclosure may have the following beneficial effects:
[0047] According to the method for navigating in combination with the factory's own route data provided by the embodiment of the present disclosure, the factory's own route data can be integrated with the national general route data, and different path planning algorithms can be used for navigation according to the positional relationship between the starting point and the end point of the route to be navigated and the factory area, including navigating within the factory area according to the factory's own route data and using a path planning algorithm suitable for the factory area, and navigating on the road section outside the factory area according to the national general route data and using a navigation method suitable for the national general route data. This will greatly give play to the advantages of the path planning algorithm in navigation, improve the accuracy of the navigation algorithm, and deeply mine new routes in the long-distance navigation process of trucks. The route will be more accurate when combined with the local own route and the national route.
[0048] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0049] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention.
[0050] Figure 1It is a flowchart of a method for navigating in combination with factory-owned route data according to an exemplary embodiment;
[0051] Figure 2 It is a flowchart of a method for navigating in combination with factory-owned route data according to an exemplary embodiment;
[0052] Figure 3 is a schematic diagram of route data before fusion according to an exemplary embodiment;
[0053] Figure 4 is a schematic diagram of fused route data according to an exemplary embodiment;
[0054] Figure 5 It is a structural schematic diagram of a device for navigating in combination with factory-owned route data according to an exemplary embodiment;
[0055] Figure 6 It is a schematic diagram of the structure of a device for navigating in combination with factory-owned route data according to an exemplary embodiment;
[0056] Figure 7 It is a schematic diagram of a computer storage medium according to an exemplary embodiment. DETAILED DESCRIPTION
[0057] The following description and the drawings sufficiently illustrate specific embodiments of the invention to enable those skilled in the art to practice them.
[0058] It should be clear that the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0059] When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. Instead, they are only examples of systems and methods consistent with some aspects of the present invention as detailed in the attached claims.
[0060] In the description of the present invention, it should be understood that the terms "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or implying relative importance. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances. In addition, in the description of the present invention, unless otherwise specified, "plurality" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the previously associated objects are in an "or" relationship.
[0061] In the field of intelligent navigation, for factory navigation, the planned routes are often limited by the road data within the factory. The national general road data is comprehensive, standard, and unified, while the road data of proprietary routes is more unique, targeted, and diverse. If the two can be combined to form a set of road data we need, after basic data compilation, initialization, determination of fusion range, and acquisition of navigation results, the advantages of the path planning algorithm in navigation will be greatly utilized, the accuracy of the navigation algorithm will be improved, and new routes can be deeply excavated during the long-distance navigation of trucks. The route will be more accurate when combined with local proprietary routes and national routes.
[0062] Figure 1 is a flowchart of a method for navigating in combination with factory-owned route data according to an exemplary embodiment, see Figure 1 , the method specifically includes the following steps.
[0063] S101 creates an electronic fence based on the factory boundary.
[0064] In the application scenario of factory navigation, the navigation results are often more accurate when the route data of the local factory is used for path planning. Therefore, the factory's own route data is integrated with the national general route data. First, the boundary range of the factory is determined, and an electronic fence is made according to the boundary range of the factory, and the electronic fence is used as the fusion boundary.
[0065] Specifically, a circular electronic fence is formed with the center point of the factory area as the center and the distance from the center point to the farthest factory area boundary point as the radius, and the formed electronic fence at least includes the entire factory area. The entrance and exit of the factory area are the fusion points of the electronic fence and are stored in the fusion point subset.
[0066] According to this step, an electronic fence covering the entire factory area can be constructed.
[0067] S102 integrates the national general route data with the factory's own route data to obtain integrated national basic road data.
[0068] Specifically, the national general route data and the factory's own route data are obtained, and according to the constructed electronic fence, the part of the national general route data corresponding to the factory's own route data is deleted, and then the factory's own route data is converted into the format of the national general route data, including a method of using the national unified route data format as a standard to adapt the factory's internal own routes, integrating the address, map sheet number, longitude and latitude, road number, road grade, speed limit, direction, administrative division code, prefecture-level city number and other information in the POI (Point of Interest) information, and adapting and compiling the factory's own route data after format conversion and the deleted national general route data to obtain the integrated national basic road data.
[0069] S103 receives the uploaded starting point and end point of the route to be navigated. Further, receives the starting point and end point of the route to be navigated input by the user terminal. When determining the starting point and end point, first display the starting point position input box and the end point position input box, then receive the starting point position description text and the end point position description text input for the starting point position input box and the end point position input box, and finally, when receiving the submit text instruction, convert the starting point position description text into the starting point of the route to be navigated, and convert the end point position description text into the end point of the route to be navigated.
[0070] S104 uses a preset route planning method for navigation according to the starting point and end point of the route to be navigated, the location of the electronic fence, and the integrated national basic road data.
[0071] In a possible implementation, different route planning methods are used for navigation according to the positional relationship between the starting point and the end point of the route to be navigated and the electronic fence of the factory area.
[0072] First, determine the positional relationship between the starting point and end point of the navigation route and the factory electronic fence.
[0073] Specifically, a ray is drawn from the starting point and the end point of the route to be navigated respectively. When the number of intersections between the ray and the electronic fence is an even number, it is determined that the starting point or the end point is outside the electronic fence. When the number of intersections between the ray and the electronic fence is an odd number, it is determined that the starting point or the end point is inside the electronic fence.
[0074] Furthermore, according to the starting point and end point of the route to be navigated and the location of the electronic fence and the integrated national basic road data, a preset route planning method is used for navigation, including:
[0075] When the starting point and end point of the route to be navigated are both within the electronic fence, the preset factory route planning method is used in combination with the integrated national basic road data. At this time, the road data used for navigation is the factory's own route data.
[0076] When the starting point and end point of the route to be navigated are not within the electronic fence, the route planning method of the general road data is used for navigation in combination with the integrated national basic road data. At this time, the road data used for navigation is the national general road data outside the factory.
[0077] When the starting point of the route to be navigated is within the electronic fence, but the end point is not within the electronic fence, the exit with the shortest distance from the electronic fence is selected as the fusion point in the fusion point subset. Combined with the fused national basic road data, the route from the starting point to the fusion point is navigated using the preset factory route planning method, and the route from the fusion point to the end point is navigated using the route planning method of the general road data. At this time, the route within the factory is navigated using the factory's own route data, and the route outside the factory is navigated using the national general road data.
[0078] When the starting point of the route to be navigated is not within the electronic fence, but the end point is within the electronic fence, the entrance with the shortest distance to the electronic fence is selected as the fusion point in the fusion point subset, and the route planning method of the general road data is used for navigation between the starting point and the fusion point in combination with the fused national basic road data, and the preset factory route planning method is used for navigation between the fusion point and the end point. At this time, the route within the factory is navigated using the factory's own route data, and the route outside the factory is navigated using the national general road data.
[0079] In one possible implementation, when there are small factory areas nested in the factory area, these small factory areas may only allow specific vehicles to pass through. Therefore, it is first determined whether there are small factory areas nested in the factory area. When there are small factory areas nested in the factory area, a prohibited route database is constructed based on the relationship between the starting and ending positions of the factory route planning and the position of the small factory area; when using the preset factory route planning method for planning, the prohibited routes are avoided.
[0080] Specifically, all small factory areas are traversed to determine whether the starting position and the end position of the route planning within the factory area are within the small factory area; when the starting position of the route planning within the factory area is within the small factory area, all the doors of the small factory area are accessible, and the doors of other small factory areas are prohibited. When the end position of the route planning within the factory area is within the small factory area, all the doors of the small factory area are accessible, and the doors of other small factory areas are prohibited. When the end position of the route planning within the factory area is not within the small factory area, the distance from the end position of the route planning within the factory area to the nearest small factory area door is calculated; if the distance is less than the preset distance threshold, for example, less than 50 meters, the nearest small factory area door is accessible, and if the distance is greater than or equal to the preset distance threshold, the nearest small factory area door is prohibited. The doors of other small factory areas are also prohibited. The roads associated with the prohibited small factory area doors are stored in the prohibited route database, and the prohibited routes are avoided when planning the route.
[0081] According to this step, the prohibited route data is analyzed and obtained, and combined with the nested plant scene, the applicability of the path planning algorithm in the mixed situation of multiple plants is greatly improved, thereby solving the problem of deviation caused by the influence of the plant in the route planning process.
[0082] In a possible implementation, when planning routes within a factory, a preset factory route planning algorithm is used, which is more suitable for factory route planning.
[0083] Specifically, the starting position and the end position of the factory route planning are first determined, and the starting section and the end section corresponding to the starting position and the end position of the factory route planning are searched in the section identification database. Usually, the section identification database can be recorded as STRTree, which is an R-tree spatial index created in advance using the location information of all sections, and the index is used to query the section according to the location.
[0084] Further, when the identifier of the starting section is different from the identifier of the ending section, the search unit is initialized to remove duplicate sets.
[0085] Usually, the search unit deduplication set can be recorded as a closeset set, which is created in advance and stores a search unit array. The first value of the array is a search unit, and the second value is the preceding search unit of the search unit, that is, from which road section this road section is entered.
[0086] In one possible implementation, after searching for the starting section and the end section, the identifiers corresponding to the starting section and the end section are obtained, and the starting section identifier and the end section identifier are obtained, and it is determined whether the starting section identifier and the end section identifier are the same; if they are the same, it is determined whether the starting point to the end point is reachable on the section, if it is reachable, the route planning ends, if it is not reachable, a search unit de-duplication set is initialized; if the starting section identifier and the end section identifier are different, a search unit de-duplication set is directly initialized.
[0087] Furthermore, the current search node is determined according to the starting point section, and the end node is determined according to the end point section.
[0088] The starting section or the ending section includes a front node and a back node; the front node is the node at the beginning of the section; the back node is the node at the end of the section. In a possible implementation, the back node of the starting section is first determined as the starting node, then the starting node is determined as the current search node curnode, and finally the front node of the ending section is determined as the ending node.
[0089] Furthermore, a target road section connected to the current search node is queried from the node map, and a first search unit, a first weight value, and a second weight value are generated based on the target road section.
[0090] Usually, a node map can be recorded as nodemap, which is pre-established and used to query detailed information of each road section connected at the node according to the node ID.
[0091] In an embodiment of the present application, the target road section connected to the current search node is first queried from the nodemap, the identifier of the target road section is obtained, and the current road section information corresponding to the identifier of the target road section is queried in the road map. Then, the first search unit is generated with the current road section information, and then the first weight of the first search unit is determined based on the current road section information. Finally, the straight-line distance between the rear node and the end node of the target road section is determined as the second weight of the first search unit.
[0092] Furthermore, when the first search unit does not exist in the search unit deduplication set, the first search unit and the previous search unit of the first search unit are placed in the route planning queue, and the first search unit and the previous search unit are recorded in the search unit deduplication set.
[0093] In an embodiment of the present application, it is first determined whether the first search unit exists in the search unit deduplication set; if not, the first search unit and the previous search unit of the first search unit are placed in the route planning queue, and the first search unit and the previous search unit are recorded in the search unit deduplication set; if so, the step of querying the target road section connected to the current search node from the node map is continued.
[0094] Further, a dequeue operation of the route planning queue is performed based on the first weight value and the second weight value to generate a second search unit.
[0095] In one possible implementation, when performing a dequeue operation, first obtain two weight values of each search unit in the route planning queue, then add the two weight values of each search unit to generate a target weight for each search unit, then sort each search unit based on the target weight of each search unit to generate a sorted search unit, then intercept a preset number of search units from the sorted search units in turn, finally obtain the first weight value of each search unit from the preset number of search units, and dequeue the search unit corresponding to the smallest first weight value to generate a second search unit.
[0096] Furthermore, when the rear node of the road section corresponding to the second search unit is an end node, a planned intra-factory route is generated according to the second search unit.
[0097] In a possible implementation, after the second search unit is generated, it is determined whether the rear node of the road section corresponding to the second search unit is the end node; if so, the route within the factory area is generated according to the second search unit. If not, the rear node of the second search unit is determined as the current search node curdnode, and the step of querying the target road section connected to the current search node from the node map is continued; or, when the number of routes in the search unit deduplication set exceeds a preset value, the route within the factory area is generated according to the second search unit.
[0098] Common navigation route planning algorithms include Dijkstra, A-star, and hierarchical reduction algorithms. Dijkstra's algorithm can calculate the minimum weight very accurately, but it runs slowly. The hierarchical reduction method runs very fast, but after the data weight rule changes, a long period of data compilation is required, and the timeliness is poor. Although the A-star algorithm is much faster than Dijkstra, errors may occur when calculating the minimum weight, and it cannot accurately meet the user's route requirements. The factory route planning method in the embodiment of the present application is more suitable for short-distance route planning such as the factory area. The route planning queue is used for cyclic traversal search of entering and exiting the queue, which makes the final road section more accurate, so that the route with the minimum weight can be efficiently planned within a shorter range, thereby providing users with a reasonable navigation route.
[0099] In a possible implementation, when planning a route outside the factory, national general road data may be used for navigation, for example, by accessing a Baidu map interface and navigating based on an existing Baidu map.
[0100] Optionally, the factory-owned route data in the embodiment of the present application may also be replaced by local owned route data of other specific areas, such as local owned route data of a certain administrative village, local owned route data of a certain large botanical garden, local owned route data of a certain amusement park, etc. The data fusion and navigation method is similar to the fusion and navigation method of the factory-area local route data in the embodiment of the present application and will not be elaborated in detail.
[0101] In order to facilitate understanding of the method for navigating with factory-owned route data provided in the embodiment of the present application, the following is a method for navigating with factory-owned route data provided in the embodiment of the present application. Figure 2 For explanation. Figure 2 As shown, the method includes the following steps.
[0102] First, delete the part of the national common route data that corresponds to the factory's own route data, and then merge the factory's own route data with the national common route data.
[0103] Furthermore, a navigation start point and a navigation end point are input.
[0104] Further, the positional relationship between the starting point and the end point and the factory fence is determined. When the starting point and the end point are both within the electronic fence, the preset factory route planning method is used for navigation. When the starting point and the end point are not within the electronic fence, the route planning method of the general road data is used for navigation. When the starting point is within the electronic fence and the end point is not within the electronic fence, the exit with the shortest distance from the electronic fence is selected from the fusion point subset as the fusion point, and the preset factory route planning method is used for navigation from the starting point to the fusion point, and the route planning method of the general road data is used for navigation from the fusion point to the end point. When the starting point is not within the electronic fence and the end point is within the electronic fence, the entrance with the shortest distance from the electronic fence is selected from the fusion point subset as the fusion point, and the route planning method of the general road data is used for navigation from the starting point to the fusion point, and the preset factory route planning method is used for navigation from the fusion point to the end point.
[0105] Finally, return the navigation result and end.
[0106] Figure 3 is a schematic diagram of route data before fusion according to an exemplary embodiment. Figure 4 FIG. 1 is a schematic diagram of fused route data according to an exemplary embodiment. Figure 3 As shown in the figure, there are two roads in the factory before fusion. One is the route planned according to the factory's own road data, and the other is the route planned according to the national road data. It can be seen that the route planned according to the national road data is relatively long and the road is relatively tortuous. Then, the factory's own route data is combined for fusion, as shown in the figure. Figure 4 As shown in the figure, after the integration, there is a route in the factory area, and the route is planned based on the factory area's own road data. This improves the accuracy of factory area navigation.
[0107] According to the method for navigation combined with the factory's own route data provided by the embodiment of the present disclosure, the factory's own route data can be integrated with the national general route data, and different path planning algorithms can be used for navigation based on the positional relationship between the starting point and end point of the route to be navigated and the factory. This greatly leverages the strengths of the path planning algorithm in navigation, improves the accuracy of the navigation algorithm, and can deeply discover new routes in the process of long-distance navigation of trucks. This route will be more accurate when combined with local owned routes and national routes.
[0108] The present disclosure also provides a device for navigating in combination with the factory's own route data, and the device is used to execute the method for navigating in combination with the factory's own route data in the above embodiment, such as Figure 5 As shown, the device comprises:
[0109] A production module 501 is used to produce an electronic fence according to the boundary range of the factory area;
[0110] Fusion module 502, used to fuse the national general route data with the factory's own route data to obtain the fused national basic road data;
[0111] The acquisition module 503 is used to receive the uploaded starting point and end point of the route to be navigated;
[0112] The navigation module 504 is used to perform navigation using a preset route planning method according to the starting point and end point of the route to be navigated, the location of the electronic fence, and the integrated national basic road data.
[0113] It should be noted that the device for combining navigation with the factory's own route data provided in the above embodiment only uses the division of the above functional modules as an example when executing the method for navigation with the factory's own route data. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above. In addition, the device for combining navigation with the factory's own route data provided in the above embodiment and the method embodiment for combining navigation with the factory's own route data belong to the same concept. The implementation process is detailed in the method embodiment and will not be repeated here.
[0114] The disclosed embodiment also provides an electronic device corresponding to the method for navigating in combination with the factory's own route data provided in the aforementioned embodiment, so as to execute the aforementioned method for navigating in combination with the factory's own route data.
[0115] Please refer to Figure 6 , which shows a schematic diagram of an electronic device provided by some embodiments of the present application. Figure 6 As shown, the electronic device includes: a processor 600, a memory 601, a bus 602 and a communication interface 603, and the processor 600, the communication interface 603 and the memory 601 are connected via the bus 602; the memory 601 stores a computer program that can be run on the processor 600, and when the processor 600 runs the computer program, it executes the method for navigation combined with the factory's own route data provided in any of the aforementioned embodiments of the present application.
[0116] The memory 601 may include a high-speed random access memory (RAM), and may also include a non-volatile memory, such as at least one disk memory. The communication connection between the system network element and at least one other network element is realized through at least one communication interface 603 (which may be wired or wireless), and the Internet, wide area network, local area network, metropolitan area network, etc. may be used.
[0117] The bus 602 may be an ISA bus, a PCI bus, or an EISA bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. The memory 601 is used to store programs, and the processor 600 executes the programs after receiving the execution instructions. The method for navigating in combination with the factory's own route data disclosed in any of the embodiments of the present application may be applied to the processor 600, or implemented by the processor 600.
[0118] The processor 600 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the processor 600. The above processor 600 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware decoding processor to be executed, or the hardware and software modules in the decoding processor can be executed. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 601, and the processor 600 reads the information in the memory 601 and completes the steps of the above method in combination with its hardware.
[0119] The electronic device provided in the embodiment of the present application and the method for navigating in combination with the factory's own route data provided in the embodiment of the present application are based on the same inventive concept and have the same beneficial effects as the methods adopted, operated or implemented therein.
[0120] The present application also provides a computer-readable storage medium corresponding to the method for navigating the factory's own route data provided in the above embodiment. Figure 7 The computer-readable storage medium shown is a CD 700 on which a computer program (i.e., a program product) is stored. When the computer program is run by the processor, it will execute the method for navigating in combination with the factory's own route data provided in any of the aforementioned embodiments.
[0121] It should be noted that examples of computer-readable storage media may also 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 optical or magnetic storage media, which are not listed here one by one.
[0122] The computer-readable storage medium provided in the above-mentioned embodiments of the present application and the method for navigating in combination with the factory's own route data provided in the embodiments of the present application are based on the same inventive concept and have the same beneficial effects as the methods adopted, run or implemented by the application programs stored therein.
[0123] The above embodiments only express several implementation methods of the present invention, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present invention. It should be pointed out that, for a person of ordinary skill in the art, several modifications and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the present invention patent shall be subject to the attached claims.
Claims
1. A method for navigating in combination with the factory's own route data, characterized in that: include: Make an electronic fence according to the factory boundary; The national general route data is integrated with the factory's own route data to obtain the integrated national basic road data; Receive the uploaded starting point and end point of the route to be navigated; According to the starting point and the end point of the route to be navigated and the position of the electronic fence and the integrated national basic road data, a preset route planning method is used for navigation, including: when the starting point and the end point of the route to be navigated are both within the electronic fence, a preset factory route planning method is used for navigation in combination with the integrated national basic road data; Among them, the preset factory route planning method includes: determining the starting point and the end point of the factory route planning, and searching the starting point and the end point corresponding to the starting point and the end point of the factory route planning in the road section identification database; when the identification of the starting point section is different from the identification of the end point section, initializing the search unit deduplication set; determining the current search node according to the starting point section, and determining the end node according to the end point section; querying the target road section connected to the current search node from the node map, and generating a first search unit, a first weight value and a second weight value based on the target road section; when the first search unit does not exist in the search unit deduplication set, placing the first search unit and the previous search unit of the first search unit in the route planning queue, and recording the first search unit and the previous search unit in the search unit deduplication set; performing the dequeue operation of the route planning queue based on the first weight value and the second weight value to generate a second search unit; when the rear node of the road section corresponding to the second search unit is the end node, generating a planned factory route according to the second search unit.
2. The method according to claim 1, characterized in that Make an electronic fence according to the factory boundary, including: A circular electronic fence is formed with the center point of the plant area as the center and the distance from the center point to the farthest plant area boundary point as the radius; Among them, the entrance and exit of the factory area are the fusion points of the electronic fence and are stored in the fusion point subset.
3. The method according to claim 1, characterized in that The national general route data is integrated with the factory's own route data to obtain the integrated national basic road data, including: Delete the portion of the national general route data corresponding to the factory's own route data; Converting the factory's own route data into a national common route data format; The factory-owned route data after format conversion and the deleted national general route data are compiled and integrated to obtain the integrated national basic road data.
4. The method according to claim 2, characterized in that: After forming a circular electric fence, it also includes: Draw a ray from the starting point and the end point of the route to be navigated respectively; When the number of intersections between the ray and the electronic fence is an even number, determining that the starting point or the end point is outside the electronic fence; When the number of intersections between the ray and the electronic fence is an odd number, it is determined that the start point or the end point is within the electronic fence.
5. The method according to claim 2, characterized in that: According to the starting point and the end point of the route to be navigated, the position of the electronic fence and the integrated national basic road data, a preset route planning method is used for navigation, which also includes: When the starting point and the end point of the route to be navigated are not within the electronic fence, the route planning method of the general road data is used for navigation in combination with the integrated national basic road data; When the starting point of the route to be navigated is within the electronic fence and the end point is not within the electronic fence, the exit with the shortest distance from the electronic fence is selected as the fusion point in the fusion point subset, and the preset factory route planning method is used for navigation between the starting point and the fusion point in combination with the fused national basic road data, and the route planning method of the general road data is used for navigation between the fusion point and the end point; When the starting point of the route to be navigated is not within the electronic fence and the end point is within the electronic fence, the entrance with the shortest distance to the electronic fence is selected as the fusion point in the fusion point subset, and combined with the fused national basic road data, the route planning method of general road data is used for navigation between the starting point and the fusion point, and the preset factory route planning method is used for navigation between the fusion point and the end point.
6. The method according to claim 1, characterized in that When the preset factory route planning method is used to plan the route within the factory, it also includes: Determine whether there is a small factory area nested in the factory area; When a small factory area is nested in the factory area, a prohibited route database is constructed according to the relationship between the starting position and the end position of the factory area route planning and the position of the small factory area; When planning using the preset factory route planning method, avoid prohibited routes.
7. A device for navigating in combination with the factory's own route data, characterized in that: include: A production module is used to produce an electronic fence according to the boundary range of the factory area; The fusion module is used to merge the national general route data with the factory's own route data to obtain the merged national basic road data; The acquisition module is used to receive the uploaded starting point and end point of the route to be navigated; A navigation module, for navigating by using a preset route planning method according to the starting point and the end point of the route to be navigated, the position of the electronic fence and the integrated national basic road data, including: when the starting point and the end point of the route to be navigated are both within the electronic fence, navigating by using a preset factory route planning method in combination with the integrated national basic road data; Among them, the preset factory route planning method includes: determining the starting point and the end point of the factory route planning, and searching the starting point and the end point corresponding to the starting point and the end point of the factory route planning in the road section identification database; when the identification of the starting point section is different from the identification of the end point section, initializing the search unit deduplication set; determining the current search node according to the starting point section, and determining the end node according to the end point section; querying the target road section connected to the current search node from the node map, and generating a first search unit, a first weight value and a second weight value based on the target road section; when the first search unit does not exist in the search unit deduplication set, placing the first search unit and the previous search unit of the first search unit in the route planning queue, and recording the first search unit and the previous search unit in the search unit deduplication set; performing the dequeue operation of the route planning queue based on the first weight value and the second weight value to generate a second search unit; when the rear node of the road section corresponding to the second search unit is the end node, generating a planned factory route according to the second search unit.
8. A device for navigating in combination with the factory's own route data, characterized in that: It comprises a processor and a memory storing program instructions, wherein the processor is configured to execute the method for navigating in combination with the factory's own route data as described in any one of claims 1 to 6 when executing the program instructions.
9. A computer-readable medium, characterized in that Computer-readable instructions are stored thereon, and the computer-readable instructions can be executed by a processor to implement a method for navigation in combination with factory-owned route data as described in any one of claims 1 to 6.
