Map navigation route processing method, code table and electronic equipment

By processing the navigation routes in segments and binding them to the map tiles, the problem of excessive MCU load is solved, and the accurate processing of navigation route data and the improvement of system efficiency is achieved.

CN119063725APending Publication Date: 2024-12-03QINGDAO MAGENE INTELLIGENCE TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411107975.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-13
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

In electronic map navigation, complex routes lead to excessive computing power and memory load of the hardware MCU, affecting the accuracy of navigation route retrieval and system operation speed.

Method used

By segmenting the navigation route and binding it to the map tiles, only the segmented route coordinate points corresponding to the current location are loaded, reducing the calculation amount and reducing the MCU load.

Benefits of technology

Ensure the accuracy of navigation route data, while reducing hardware load, improving system operation efficiency and user experience.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119063725A_ABST
    Figure CN119063725A_ABST
Patent Text Reader

Abstract

The invention discloses a map navigation route processing method, a code table and electronic equipment, and the processing method comprises the steps: S1, obtaining a planned navigation route, and carrying out the segmentation processing of the planned navigation route; s2, processing a map area space where each section of planned navigation route is located to generate a map block, and binding each section of planned navigation route with the corresponding map block; s3, obtaining coordinates of the current position, and searching a map block where the coordinates of the current position are located; s4, loading all coordinate points of the segmented routes corresponding to the map blocks in the S3; s5, traversing all the coordinate points in the step S4, calculating the position of the current position in the planned navigation route, and displaying the position; and S6, acquiring the current traveling speed, and loading the next map block according to the current traveling speed. According to the invention, the load of the MCU can be reduced on the premise of ensuring accurate navigation route data processing.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of map navigation, and in particular relates to a method for processing a map navigation route, a code table, and an electronic device. Background Art

[0002] Electronic map navigation routes are mainly digital expressions of real-world routes. When people go out for cycling, they can use the electronic map navigation routes for positioning and navigation. With the advancement of technology, people can plan navigation routes from major cycling platforms and convert fit files they have ridden into routes for navigation.

[0003] For cycling enthusiasts, electronic navigation maps are particularly important when faced with unfamiliar or more complex routes. The complexity of navigation routes varies from place to place. When the route is long or complex, the computing power and memory of the hardware MCU will be greatly limited, resulting in a high cost for map navigation route retrieval and processing, which affects the operating speed of the entire device system and interferes with the accuracy of route navigation instructions.

[0004] In view of this, how to design a technology to reduce the MCU load while ensuring accurate processing of navigation route data is a technical problem to be solved by the present invention. Summary of the invention

[0005] The present invention provides a method for processing a map navigation route, a code table, and an electronic device, which can reduce the MCU load while ensuring accurate processing of navigation route data.

[0006] In order to achieve the above technical objectives, the present invention adopts the following technical solutions:

[0007] In one aspect, the present invention provides a method for processing a map navigation route, comprising the following steps:

[0008] S1, obtaining a planned navigation route, and processing the planned navigation route in sections;

[0009] S2, processing the map area space where each section of the planned navigation route is located to generate a map block, and binding each section of the planned navigation route with the corresponding map block;

[0010] S3, obtaining the coordinates of the current position, and searching for the map block where the coordinates of the current position are located;

[0011] S4, loading all coordinate points of the segmented route corresponding to the map block in S3;

[0012] S5, traversing all the coordinate points in S4, calculating the position of the current position in the planned navigation route and displaying it;

[0013] S6, obtaining the current traveling speed, and loading the next map block according to the current traveling speed.

[0014] In the method for processing the map navigation route as described above, the step of processing the map area space where each section of the planned navigation route is located to generate a map block in step S2 includes:

[0015] S21, encoding the latitude and longitude of the coordinates in the map area space according to the interval range to obtain a multi-bit latitude binary code and a multi-bit longitude binary code respectively;

[0016] S22, respectively splitting and recombining the latitude binary code and the longitude binary code into a binary sequence;

[0017] S23, encoding the binary sequence to obtain a first character string encoding, where the first character string encoding is printable characters;

[0018] S24, calculating a first character string code of each coordinate, wherein coordinates having the same first character string code belong to the same map block.

[0019] In the above-mentioned method for processing a map navigation route, the step S21 of encoding the latitude and longitude of the coordinates in the map area space according to the interval range to obtain a multi-bit latitude binary code and a multi-bit longitude binary code respectively comprises:

[0020] Divide the latitude in the map area space into two intervals a and b in a plane, wherein interval a is on the left side of interval b, and if the coordinate latitude is in interval a, it is encoded as 0, and if the coordinate latitude is in interval b, it is encoded as 1;

[0021] If the coordinate latitude is within interval a, divide interval a into two intervals a again. 1 and a 2 , the interval a 1 In the interval a 2 On the left side, if the coordinate latitude is a 1 If the coordinate latitude is within a range, it is coded as 0. 2 If the coordinate latitude is within the interval b, the code is 1; if the coordinate latitude is within the interval b, the interval b is divided into two intervals b again. 1 and b 2 , the interval b 1 In the interval b 2 On the left side, if the coordinate latitude is b 1 If the coordinate latitude is within the range, it is encoded as 0. 2 If it is within the interval, it is coded as 1;

[0022] And so on to obtain the n-digit latitude binary code;

[0023] Similarly, an n-digit binary code of longitude can be obtained.

[0024] In the above-mentioned method for processing the map navigation route, the step of respectively splitting and recombining the latitude binary code and the longitude binary code into a binary sequence in step S22 includes:

[0025] The n-bit longitude binary code after fission is placed in an even-numbered position, and the n-bit latitude binary code after fission is placed in an odd-numbered position, to obtain a binary sequence of 2n digits.

[0026] In the above-mentioned method for processing a map navigation route, the step of searching for the map block where the coordinates of the current position are located in step S3 comprises:

[0027] First, the acquired coordinates of the current position are converted into a second string code, and the first string code and the second string code are compared. When the first string code and the second string code are consistent, the coordinates of the current position are in the map block corresponding to the first string code.

[0028] In the above-mentioned method for processing a map navigation route, the step of calculating the position of the current position in the planned navigation route in S5 includes:

[0029] S51, converting the longitude and latitude of the current position coordinates into radian longitude and radian latitude respectively;

[0030] S52, converting the radian longitude and the radian latitude into plane coordinates (x, y);

[0031] S53, displaying the plane coordinates (x, y) in the planned navigation route.

[0032] In the method for processing the map navigation route as described above, if the current position deviates, the target point with the minimum distance between the planned navigation route and the plane coordinates of the current position is solved, and an indicator line is set between the current position and the target point.

[0033] In another aspect, the present invention provides a code table, comprising:

[0034] Positioning module, used to obtain the coordinates of the current location;

[0035] Speed ​​acquisition module, used to obtain the current travel speed;

[0036] A control processing module having a built-in method for processing a map navigation route as described in any of the above items;

[0037] The display module is used to display the current position, current travel speed and planned navigation route.

[0038] In another aspect, the present invention further provides an electronic device, comprising: a processor, and a memory and a transceiver communicatively connected to the processor;

[0039] The memory stores computer-executable instructions; the transceiver is used to send and receive data;

[0040] The processor executes the computer-executable instructions stored in the memory to implement any of the above methods.

[0041] In another aspect, the present invention also provides a computer-readable storage medium,

[0042] The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement any of the above methods.

[0043] Compared with the prior art, the advantages and positive effects of the present invention are: by dividing the planned navigation route into segments, and binding each segment of the planned navigation route with a map block, specifying the corresponding relationship, the corresponding segmented planned navigation route can be obtained while loading the map block after obtaining the current position, and the calculation amount is reduced from all the coordinate points of the entire planned navigation route to all the coordinate points of the segmented planned navigation route corresponding to the current map block, the calculation amount is greatly reduced, and the hardware load is reduced while ensuring the accuracy of processing the navigation route data. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0045] Figure 1 A flowchart of an embodiment of a method for processing a map navigation route according to the present invention;

[0046] Figure 2 A schematic diagram of fission and recombination of latitude binary coding and longitude binary coding in an embodiment of a method for processing a map navigation route of the present invention;

[0047] Figure 3 This is a schematic diagram of indicating the deviation of the current position in an embodiment of a method for processing a map navigation route of the present invention;

[0048] Figure 4A schematic diagram of loading a corresponding map block in an embodiment of a method for processing a map navigation route according to the present invention;

[0049] Figure 5 A route map that does not use the map navigation route processing method of the present invention;

[0050] Figure 6 A schematic diagram of dividing a map block into blocks using the map navigation route processing method of the present invention. DETAILED DESCRIPTION

[0051] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the 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.

[0052] It should be noted that in the description of the present invention, the terms "upper", "lower", "left", "right" and the like indicating directions or positional relationships are based on the directions or positional relationships shown in the drawings, which are only for the convenience of description, and do not indicate or imply that the device or element must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first" and "second" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance.

[0053] In the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", "connected" and the like should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be an indirect connection through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0054] In the present invention, unless otherwise clearly specified and limited, a first feature being "above" or "below" a second feature may include that the first and second features are in direct contact, or may include that the first and second features are not in direct contact but are in contact through another feature between them. Moreover, a first feature being "above", "above" and "above" a second feature includes that the first feature is directly above and obliquely above the second feature, or simply indicates that the first feature is higher in level than the second feature. A first feature being "below", "below" and "below" a second feature includes that the first feature is directly below and obliquely below the second feature, or simply indicates that the first feature is lower in level than the second feature.

[0055] The disclosure below provides many different embodiments or examples to realize different structures of the present invention. In order to simplify the disclosure of the present invention, the parts and settings of specific examples are described below. Of course, they are only examples, and the purpose is not to limit the present invention. In addition, the present invention can repeat reference numbers and / or reference letters in different examples, and this repetition is for the purpose of simplicity and clarity, which itself does not indicate the relationship between the various embodiments and / or settings discussed. In addition, the present invention provides various specific examples of processes and materials, but those of ordinary skill in the art can be aware of the application of other processes and / or the use of other materials.

[0056] like Figures 1 to 3 As shown, this embodiment provides a method for processing a map navigation route, which can solve the system freeze problem and the problem of untimely data update caused by insufficient computing power of the microcontroller unit (MCU), thereby improving the user experience.

[0057] A method for processing a map navigation route comprises the following steps:

[0058] S1, obtain the planned navigation route, and process the planned navigation route in sections, specifically:

[0059] When riding, the user will enter the destination on the meter, the MCU obtains the current location and destination, and plans and generates a navigation route; but there may be multiple routes from the starting point to the destination, so the user needs to first select a navigation route according to his own situation, and then obtain the road network data information in the map. The road network data information includes the number of sections in the planned navigation route, and then the planned navigation route is segmented according to the number of sections in the road network information. It should be noted that the road network data information contained in the map application is existing technology and will not be elaborated here.

[0060] The planned navigation route needs to be converted into a road book format so that it can be displayed on the meter. The road book format uses the common protocol buffer format.

[0061] S2, processing the map area space where each section of the planned navigation route is located to generate a map block, and binding each section of the planned navigation route with the corresponding map block.

[0062] The steps to generate a map block include:

[0063] S21, encoding the latitude and longitude of the coordinates in the map area space according to the interval range to obtain a multi-bit latitude binary code and a multi-bit longitude binary code respectively.

[0064] Divide the latitude in the map area space into two intervals a and b in a plane. If the coordinate latitude is in interval a, it is encoded as 0, and if the coordinate latitude is in interval b, it is encoded as 1;

[0065] If the coordinate latitude is within interval a, divide interval a into two intervals a again. 1 and a 2 , if the coordinate latitude is a 1 If the coordinate latitude is within a range, it is coded as 0. 2 If the coordinate latitude is within the interval b, the code is 1; if the coordinate latitude is within the interval b, the interval b is divided into two intervals b again. 1 and b 2 , if the coordinate latitude is b 1 If the coordinate latitude is within the range, it is encoded as 0. 2 If it is within the interval, it is coded as 1;

[0066] And so on, the n-digit latitude binary code is obtained;

[0067] Similarly, an n-digit binary code of longitude can be obtained.

[0068] Taking the coordinates in the map area space (23.15° north latitude, 113.50° east longitude) as an example, the latitude range is (-90, 90) and the longitude range is (-180, 180).

[0069] To encode the latitude coordinates, first divide (-90,90) into (-90,0) and (0,90). 23.15° north latitude falls within the interval (0,90), so the 0th bit of the latitude binary code is 1; then divide (0,90) into (0,45) and (45,90). 23.15° north latitude falls within the interval (0,45), so the 1st bit of the latitude binary code is 0; then divide (0,45) into (0,22.5) and (22.5,45). 23.15° north latitude falls within the interval (22.5,45), so the 1st bit of the latitude binary code is 0. The second bit of the latitude binary code is 1; then divide (22.5, 45) into (22.5, 33.75) and (33.75, 45), and the latitude 23.15° north falls into the interval (22.5, 33.75), then the third bit of the latitude binary code is 0; and so on, the fourth bit of the latitude binary code is 0, the fifth bit is 0, the sixth bit is 0, the seventh bit is 0, the eighth bit is 1, and the ninth bit is 1; in this embodiment, the 10-bit latitude binary code is used for explanation, and the latitude binary code of 23.15° north latitude is 1010000011.

[0070] To encode the longitude coordinates, first divide (-180,180) into (-180,0) and (0,180). 113.50° east longitude falls within the interval (0,180), so the 0th bit of the longitude binary code is 1; then divide (0,180) into (0,90) and (90,180). 113.50° east longitude falls within the interval (90,180), so the 1st bit of the longitude binary code is 1; then divide (90,180) into (90,135) and (135,180). 113.50° east longitude falls within the interval (90,1 35), the second bit of the longitude binary code is 0; then divide (90,135) into (90,112.5) and (112.5,135), 113.50° east longitude falls into the interval (112.5,135), then the third bit of the longitude binary code is 1; and so on, the fourth bit of the longitude binary code is 0, the fifth bit is 0, the sixth bit is 0, the seventh bit is 0, the eighth bit is 1, and the ninth bit is 0; in this embodiment, the 10-bit longitude binary code is used for explanation, and the longitude binary code of 113.50° east longitude is 1101000010.

[0071] The more bits of the latitude binary code and the longitude binary code, the more accurate the interval division is and the smaller the map navigation error is. Different bits of latitude binary code and longitude binary code represent map blocks of different levels (indicated by the precision length in the following table). If the current position is at the junction of two map blocks of the current level, the level of the map block will be enlarged, thereby further enlarging the map area space to lock the position.

[0072] The relationship between the map block level and the coordinate error is shown in Table 1 below:

[0073] Table 1

[0074]

[0075]

[0076] S22, respectively fissioning the latitude binary code and the longitude binary code and then combining them into a binary sequence, specifically: placing the n-bit precision binary code after fission in an even position, and placing the n-bit dimension binary code after fission in an odd position, to obtain a 2n-bit binary sequence.

[0077] like Figure 2As shown, the 10-bit latitude binary code 1010000011 and the 10-bit longitude binary code 1101000010 are first fissioned respectively, and the longitude binary code after fission is placed in the even position. It should be noted that the even position starts from the 0th position, and the latitude binary code after fission is placed in the odd position to obtain the 20-bit binary sequence 11100110000000001101.

[0078] S23, encode the binary sequence to obtain a first character string code, where the first character string code is printable characters.

[0079] In this embodiment, base32 encoding is used, and 10 numbers 0-9 and 22 letters bz (excluding a, i, 1, o) are used for encoding. A, i, l, and o are removed because letters are easily confused with numbers. The process of encoding the binary sequence 11100110000000001101 includes first splitting the 20-bit binary sequence from left to right into groups of 5 bits each, into 11100, 11000, 00000, and 01101, and converting the binary of the four groups of sequences into decimal:

[0080] 11100=2 4 +2 3 +2 2 =28;

[0081] 11000=2 4 +2 3 =24;

[0082] 00000=0;

[0083] 01101=2 3 +2 2 +2 0 =13;

[0084] Each group of base32 encoding table looks up the corresponding encoding value. The base32 encoding table is shown in Table 2 below:

[0085] Table 2

[0086]

[0087] Therefore, the first string of the binary sequence 11100110000000001101 after base32 encoding is encoded as ws0e.

[0088] S24, calculating a first character string code of each coordinate, and coordinates having the same first character string code belong to the same map block.

[0089] Since each planned navigation route has its corresponding road book file, the operation of binding each planned navigation route with the corresponding map block is to add a first string encoding field in the road book file of each planned navigation route. The steps of adding the first string encoding field include: first defining the first string encoding in roadfile.proto, xx.proto is a road book file, roadfile is the file name, and then using the protoc compiler to compile the roadfile.proto file to generate a lock-to-use road book file.

[0090] S3, obtain the coordinates of the current position, and find the map block where the coordinates of the current position are located.

[0091] A GPS positioning device is set in the code table. The GPS positioning device can obtain the coordinates of the current position in real time, convert the coordinates of the current position into a second string code using the same steps as converting the first string code, compare the first string code and the second string code, and when the second string code is consistent with a first string code, the coordinates of the current position are in the map block corresponding to the first string code.

[0092] Each planned navigation route has at least one corresponding map block. The cases where each planned navigation route corresponds to multiple map blocks include: when some sections are very long and straight, but the accuracy of one map block cannot cover this section, so this section may be bound to these two map blocks; another case is when the section is at the boundary of two map blocks, a section will be partially included by two map blocks. However, it should be noted that as long as a map block has at least one corresponding bound section, the current nearest route location can be found.

[0093] S4, loading all coordinate points of the segmented route corresponding to the map block in S3, and drawing all coordinate points into a continuous route to be displayed on the code table.

[0094] S5, traverses all coordinate points in S4, calculates the position of the current position in the planned navigation route and displays it, specifically:

[0095] S51, converting the longitude and latitude of the current position coordinates into radian longitude and radian latitude respectively.

[0096] The formula for calculating longitude in radians is as follows:

[0097]

[0098] Among them, Rad lon Indicates longitude in radians; deg lon Indicates the longitude of the current location coordinates;

[0099] The formula for calculating latitude in radians is as follows:

[0100]

[0101] Among them, Rad lat Indicates latitude in radians; deg lat Indicates the latitude of the current location coordinates.

[0102] S52, converting the radian longitude and the radian latitude into plane coordinates (x, y).

[0103] The calculation formula for plane coordinates (x, y) is as follows:

[0104]

[0105] Among them, Rad lon Indicates longitude in radians; TILESIZE indicates tile size, which refers to the pixel width of the map block inside the code table; zoom indicates the zoom level of the code table map display, refer to Table 2 for details;

[0106]

[0107] Among them, Rad lat Indicates latitude in radians; TILESIZE indicates tile size, which is calculated as the square of tile width; zoom indicates the zoom level of the code table map display, refer to Table 3 for details;

[0108] Table 3

[0109]

[0110] S53, displaying the plane coordinates (x, y) in the planned navigation route.

[0111] like Figure 3 As shown, the planned navigation route may deviate during the travel process. If the current position deviates, the target point with the minimum distance between the planned navigation route and the plane coordinates of the current position is solved, and an indicator line is set between the current position and the target point.

[0112] The distance calculation formula between the planned navigation route and the plane coordinates of the current location is as follows:

[0113]

[0114] Where d represents the distance between the planned navigation route and the plane coordinates of the current position; x represents the horizontal coordinate of the current position; x i represents the horizontal coordinate of any point on the planned navigation route; y represents the vertical coordinate of the current position; y iIndicates the vertical coordinate of any point on the planned navigation route.

[0115] It is necessary to calculate the distance between all coordinate points on the planned navigation route and the coordinate point of the current location. The distance between the point with the smallest distance and the current location is the closest point from the current location to the planned navigation route. The closest point is taken as the target point, and an indicator line is set from the current location to the target point. The user can return to the planned navigation route according to the indicator line.

[0116] It should be noted that if the current location is on the planned navigation route, d=0.

[0117] S6, obtain the current travel speed, and load the next map block according to the current travel speed. Specifically:

[0118] The estimated mileage is calculated based on the current travel speed, and then the estimated mileage is compared with the width of the tile. If the estimated mileage is greater than the width of the tile, the next target map block and the 8 map blocks around the target map block are loaded, for a total of 9 map blocks. Figure 4 As shown in the figure, ☆ indicates the location after traveling the estimated mileage, and the map block where ☆ is located is the next target map block.

[0119] The calculation formula for the estimated mileage is as follows:

[0120] s=v×t

[0121] Among them, s represents the estimated mileage; v represents the current travel speed; and t represents the set time range.

[0122] The calculation formula for tile width is as follows:

[0123]

[0124] Where S tile Indicates tile width, unit: meter; C indicates equatorial circumference, unit: meter; latitude indicates the latitude of any point on the planned navigation route; zoom indicates the zoom level of the code table map display.

[0125] For example, given a point on the planned navigation route with a latitude of 35.4094 and a zoom of 14, we can calculate S tile That is, the tile width is about 1994 meters.

[0126] When entering the navigation riding for the first time, follow the above method to quickly lock the nearest road section. After determining the corresponding map block, each time you load along the route, take the current section as the center, and locally load the information of the sections above and below the current section. Slide and load the corresponding sections in turn as you drive, ensuring that each loaded section is a fixed number of sections. When you deviate from the route, the map block will be recalculated as above.

[0127] Figure 5 The figure shows a route without using the map navigation route processing method of the present invention. If all the routes are loaded, it is necessary to calculate nearly 2000 coordinate points on the route. Figure 6 The figure shows the same route segment using the map navigation route processing method of the present invention, which is divided into 7 map blocks, each map block corresponds to at least one segmented route. When in use, one of the map blocks is first located according to the current position, and then the corresponding bound segmented route is loaded. If the current map block is at the bottom of the figure, only the bottom map block and the upper map block adjacent to the bottom map block need to be loaded, and then only all the coordinate points on the segmented route corresponding to these two map blocks are calculated, which is more than 200. Compared with the map navigation route processing method that does not use this method, the amount of calculation is greatly reduced.

[0128] The present invention also provides a code computer, which is installed on a bicycle and includes:

[0129] The positioning module uses a GPS positioning device, which can obtain the current position of the user when riding in real time.

[0130] The speed acquisition module uses a speed sensor, which can obtain the user's riding speed in real time.

[0131] The control processing module adopts MCU and has a built-in method for processing the map navigation route as described above; the control processing module is connected to the positioning module, the speed acquisition module and the display module, the control processing module receives the position information and speed information transmitted by the positioning module and the speed acquisition module, and controls the display module to display.

[0132] The display module is a display screen of the code computer, and the display module is used to display the current position, current travel speed and planned navigation route.

[0133] The present invention also provides an electronic device, comprising: a processor, and a memory and a transceiver communicatively connected to the processor;

[0134] The memory stores computer executable instructions; the transceiver is used to send and receive data;

[0135] The processor executes the computer-executable instructions stored in the memory to implement the method described above.

[0136] The present invention also provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the method described above.

[0137] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "illustrative embodiments", "examples", "specific examples", or "some examples" means that the specific features, structures, materials, or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0138] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, it is still possible for a person skilled in the art to modify the technical solutions described in the aforementioned embodiments, or to replace some of the technical features therein by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions claimed to be protected by the present invention.

Claims

1. A method for processing a map navigation route, characterized in that: The following steps are involved: S1, obtaining a planned navigation route, and processing the planned navigation route in sections; S2, processing the map area space where each section of the planned navigation route is located to generate a map block, and binding each section of the planned navigation route with the corresponding map block; S3, obtaining the coordinates of the current position, and searching for the map block where the coordinates of the current position are located; S4, loading all coordinate points of the segmented route corresponding to the map block in S3; S5, traversing all the coordinate points in S4, calculating the position of the current position in the planned navigation route and displaying it; S6, obtaining the current traveling speed, and loading the next map block according to the current traveling speed.

2. The method for processing a map navigation route according to claim 1, characterized in that: The step of processing the map area space where each section of the planned navigation route is located to generate a map block in step S2 includes: S21, encoding the latitude and longitude of the coordinates in the map area space according to the interval range to obtain a multi-bit latitude binary code and a multi-bit longitude binary code respectively; S22, respectively splitting and recombining the latitude binary code and the longitude binary code into a binary sequence; S23, encoding the binary sequence to obtain a first character string encoding, where the first character string encoding is printable characters; S24, calculating a first character string code of each coordinate, wherein coordinates having the same first character string code belong to the same map block.

3. The method for processing a map navigation route according to claim 2, characterized in that: The step of encoding the latitude and longitude of the coordinates in the map region space according to the interval range to obtain a multi-bit latitude binary code and a multi-bit longitude binary code in step S21 includes: Divide the latitude in the map area space into two intervals a and b in a plane, wherein interval a is on the left side of interval b, and if the coordinate latitude is in interval a, it is encoded as 0, and if the coordinate latitude is in interval b, it is encoded as 1; If the coordinate latitude is in interval a, the interval a is divided into two intervals a1 and a2, the interval a1 is on the left side of the interval a2, if the coordinate latitude is in interval a1, it is encoded as 0, if the coordinate latitude is in interval a2, it is encoded as 1; if the coordinate latitude is in interval b, the interval b is divided into two intervals b1 and b2, the interval b1 is on the left side of the interval b2, if the coordinate latitude is in interval b1, it is encoded as 0, if the coordinate latitude is in interval b2, it is encoded as 1; And so on to obtain the n-digit latitude binary code; Similarly, an n-digit binary code of longitude can be obtained.

4. The method for processing a map navigation route according to claim 3, characterized in that: The step of respectively splitting and recombining the latitude binary code and the longitude binary code into a binary sequence in step S22 includes: The n-bit longitude binary code after fission is placed in an even-numbered position, and the n-bit latitude binary code after fission is placed in an odd-numbered position, to obtain a binary sequence of 2n digits.

5. The method for processing a map navigation route according to claim 2, characterized in that: The step of searching the map block where the coordinates of the current position are located in step S3 includes: First, the acquired coordinates of the current position are converted into a second string code, and the first string code and the second string code are compared. When the first string code and the second string code are consistent, the coordinates of the current position are in the map block corresponding to the first string code.

6. The method for processing a map navigation route according to claim 1, characterized in that: The step of calculating the position of the current position in the planned navigation route in S5 includes: S51, converting the longitude and latitude of the current position coordinates into radian longitude and radian latitude respectively; S52, converting the radian longitude and the radian latitude into plane coordinates (x, y); S53: Display the plane coordinates (x, y) in the planned navigation route.

7. The method for processing a map navigation route according to claim 6, characterized in that: If the current position deviates, a target point with a minimum distance between the planned navigation route and the plane coordinates of the current position is solved, and an indicator line is set between the current position and the target point.

8. A code table, characterized in that: include: Positioning module, used to obtain the coordinates of the current location; Speed ​​acquisition module, used to obtain the current travel speed; A control processing module, having a built-in method for processing a map navigation route as claimed in any one of claims 1 to 7; The display module is used to display the current position, current travel speed and planned navigation route.

9. An electronic device, characterized in that: include: A processor, and a memory and a transceiver communicatively connected to the processor; The memory stores computer-executable instructions; the transceiver is used to send and receive data; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 7 when executed by a processor.