Method, device and electronic equipment for controlling grid boundary drawing in electronic map

Abstract

The present disclosure provides a method and device for controlling grid boundary drawing in an electronic map and an electronic device, and relates to the technical field of automatic driving and high-precision map. The method comprises: obtaining grid data of a plurality of grids, the plurality of grids being divided in advance based on a work area of an electronic map and comprising work grids and non-work grids; taking each grid as a current grid respectively, determining a neighborhood grid of the current grid in the plurality of grids according to the grid data, matching the neighborhood grid with the work grid, and determining a boundary marker value of the current grid according to a matching result; and controlling whether to draw a boundary of each of the plurality of grids according to the boundary marker value of each of the plurality of grids. In the technical scheme of the present disclosure, by controlling the drawing of the grid boundary, the work grids can be aggregated together, and the work grids in a task package can be intuitively displayed through the drawn grid boundary, so as to display the distribution of task allocation.

Description

Technical Field

[0001] This disclosure relates to the field of computer technology, and in particular to the fields of autonomous driving and high-precision mapping. Background Technology

[0002] In the high-precision map production operation allocation process, the grid range to be operated is selected and the operation is assigned to the operators. The selected grid is called the operation grid. A task may contain multiple adjacent or non-adjacent operation grids. The collection of multiple operation grids is called a task package. How to display the operation grids in the task package in a more intuitive way is a problem that needs to be solved. Summary of the Invention

[0003] This disclosure provides a method, apparatus, and electronic device for controlling the drawing of grid boundaries in an electronic map.

[0004] According to one aspect of this disclosure, a method for drawing control grid boundaries in an electronic map is provided, comprising:

[0005] Acquire grid data for multiple grids, which are pre-divided based on the work area of ​​the electronic map, including work grids and non-work grids;

[0006] Each grid is taken as the current grid. Based on the grid data, the neighboring grids of the current grid are determined among multiple grids. The neighboring grids are matched with the working grid. The boundary marker value of the current grid is determined based on the matching result.

[0007] Based on the boundary marker values ​​of each of the multiple grids, control whether to draw the boundaries of each of the multiple grids.

[0008] According to another aspect of this disclosure, an apparatus for controlling the drawing of grid boundaries in an electronic map is provided, comprising:

[0009] The acquisition module is used to acquire grid data from multiple grids, which are pre-divided based on the work area of ​​the electronic map, including work grids and non-work grids;

[0010] The matching module is used to treat each grid as the current grid, determine the neighboring grids of the current grid among multiple grids based on the grid data, match the neighboring grids with the job grid, and determine the boundary marker value of the current grid based on the matching result;

[0011] The control module is used to control whether to draw the boundaries of each of the multiple grids based on their respective boundary marker values.

[0012] According to another aspect of this disclosure, an electronic device is provided, comprising:

[0013] At least one processor; and

[0014] The memory is communicatively connected to the at least one processor; wherein,

[0015] The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the methods in any embodiment of this disclosure.

[0016] According to another aspect of this disclosure, a non-transitory computer-readable storage medium is provided storing computer instructions for causing a computer to perform the methods of any embodiment of this disclosure.

[0017] According to another aspect of this disclosure, a computer program product is provided, including a computer program that, when executed by a processor, implements the methods of any embodiment of this disclosure.

[0018] This disclosure provides a method, apparatus, and electronic device for controlling the drawing of grid boundaries in an electronic map. The method involves matching the neighboring grids of each grid with the task grid, determining the boundary marker value of the current grid based on the matching results, and controlling whether to draw the boundaries of multiple grids based on their respective boundary marker values. By controlling the drawing of grid boundaries, task grids can be aggregated together, and the drawn grid boundaries can visually display the task grids in the task package, thereby showing the distribution of task allocation.

[0019] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of this disclosure, nor is it intended to limit the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0020] The accompanying drawings are provided to better understand this solution and do not constitute a limitation of this disclosure. Wherein:

[0021] Figure 1 This is a flowchart of a method for drawing control grid boundaries in an electronic map according to an embodiment of the present disclosure;

[0022] Figure 2 This is a flowchart of a method for drawing control grid boundaries in an electronic map according to an embodiment of the present disclosure;

[0023] Figure 3 This is a schematic diagram of a mesh boundary drawn in one embodiment of the present disclosure;

[0024] Figure 4 This is a schematic diagram of a device for controlling the drawing of grid boundaries in an electronic map according to an embodiment of the present disclosure;

[0025] Figure 5This is a block diagram of an electronic device used to implement the method for controlling the drawing of grid boundaries in an electronic map according to embodiments of the present disclosure. Detailed Implementation

[0026] The exemplary embodiments of this disclosure are described below with reference to the accompanying drawings, including various details of the embodiments to aid understanding, and should be considered merely exemplary. Therefore, those skilled in the art will recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of this disclosure. Similarly, for clarity and brevity, descriptions of well-known functions and structures are omitted in the following description.

[0027] This disclosure provides a method for drawing control grid boundaries in an electronic map. Figure 1 This is a flowchart of a method for drawing control grid boundaries in an electronic map according to an embodiment of the present disclosure. This method can be applied to an apparatus for drawing control grid boundaries in an electronic map. For example, when the apparatus is deployed on a terminal, server, or other processing device, it can execute the method for drawing control grid boundaries in an electronic map. The terminal can be a user equipment (UE), mobile device, cellular phone, cordless phone, personal digital assistant (PDA), handheld device, computing device, vehicle-mounted device, wearable device, etc. In some possible implementations, the method can also be implemented by the terminal device or processor calling computer-readable instructions stored in memory. Figure 1 As shown, it includes:

[0028] Step S101: Obtain grid data for multiple grids. These grids are pre-divided based on the work area of ​​the electronic map, including work grids and non-work grids.

[0029] Electronic maps can include high-precision maps for autonomous driving and electronic maps for navigation of ordinary vehicles.

[0030] In the production workflow of electronic maps, the scope of the work grid is determined in advance on the electronic map. Then, multiple continuously arranged grids are drawn on the electronic map using visualization charts (e.g., ECharts), including work grids and non-work grids. Work grids are those where workers in the next process need to perform tasks, while non-work grids are those where tasks are not required in the next process.

[0031] Grid data for multiple grids is retrieved from a pre-defined database by calling an interface. These grids can include both job grids and non-job grids, and job grids can include job grids for multiple task packages. The grid data includes grid identifiers. If a grid is a job grid, its grid data may also include task package identifiers in addition to the grid identifiers. The task package identifiers represent the task package corresponding to the job grid.

[0032] Step S102: Each grid is taken as the current grid. Based on the grid data, the neighboring grids of the current grid are determined among multiple grids. The neighboring grids are matched with the working grid. The boundary marker value of the current grid is determined based on the matching result.

[0033] Each grid in the multiple grids is processed sequentially. Based on the grid identifier in the grid data, the neighboring grids of the current grid can be determined. The neighboring grids can be the grids adjacent to the current grid above, below, to the left, and to the right. After determining the neighboring grids based on the grid identifier of the current grid, it cannot be determined whether the neighboring grids are the working grids. By matching the grid data of the neighboring grids with the grid data of the working grids, it can be determined whether each neighboring grid is a working grid. Based on whether the neighboring grids of the current grid are working grids, the upper, lower, left, and right boundaries of the current grid are marked, resulting in the four boundary mark values ​​of the current grid.

[0034] Step S103: Based on the boundary marker values ​​of each of the multiple grids, control whether to draw the boundaries of each of the multiple grids.

[0035] Different boundary marker values ​​can indicate whether or not the boundary is drawn. Therefore, based on the four boundary marker values ​​for each grid, it is possible to control whether or not the boundary marked by the boundary marker value of that grid is drawn.

[0036] The method for controlling grid boundary drawing in an electronic map provided in this disclosure matches the neighboring grids of each grid with the task grids, and determines the boundary marker value of the current grid based on the matching result; based on the boundary marker values ​​of multiple grids, it controls whether to draw the boundaries of each of the multiple grids. By controlling the drawing of grid boundaries, task grids can be aggregated together, and the drawn grid boundaries can be used to intuitively display the task grids in the task package, thereby showing the distribution of task allocation.

[0037] In one possible implementation, the neighboring grid is matched with the job grid, and the boundary marker value of the current grid is determined based on the matching result, including:

[0038] If the current grid is a non-operational grid and its neighboring grids are successfully matched with the operational grid, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a first preset value.

[0039] In practical applications, the current grid can be determined as a task grid or a non-task grid based on its grid data. If the current grid data includes both a grid identifier and a task package identifier, then the current grid is a task grid. If the current grid data only includes a grid identifier and does not include a task package identifier, then the current grid is a non-task grid.

[0040] If the current grid is determined to be a non-operational grid, its neighboring grids are determined based on the grid identifier of the current grid. The grid data of each neighboring grid is then matched against the grid data of multiple operational grids. If a match is successful, the neighboring grid is considered an operational grid, and the boundary marker value of the common boundary between the current grid and its neighboring grids is marked with a first preset value. The first preset value can be `true`, indicating that the common boundary is drawn. If a match fails, the neighboring grid is considered a non-operational grid, and the boundary marker value of the common boundary between the current grid and its neighboring grids is marked with a second preset value. The second preset value can be `false`, indicating that the common boundary does not need to be drawn. The first and second preset values ​​can also be in other forms, which are not limited in this application.

[0041] In one example, if the upper neighboring grid of the current grid is a job grid, then the boundary marker value of the common boundary between the current grid and the upper neighboring grid is set to true. The common boundary between the current grid and the upper neighboring grid is also the upper boundary of the current grid.

[0042] In this embodiment of the disclosure, when the current grid is a non-operational grid and the neighboring grid is an operational grid, the boundary marker value is determined to be a first preset value. Based on the first preset value, the boundary corresponding to the boundary marker value of the current grid can be drawn.

[0043] In one possible implementation, the neighboring grid is matched with the job grid, and the boundary marker value of the current grid is determined based on the matching result, including:

[0044] The current grid is identified as the task grid, and the task grid that successfully matches the neighboring grid of the current grid is identified within the task grid.

[0045] Compare the task package identifiers in the current grid's grid data with the task package identifiers in the grid data of the successfully matched job grid;

[0046] If the comparison results are different, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be the first preset value.

[0047] In practical applications, the current grid can be determined as a task grid or a non-task grid based on its grid data. If the current grid data includes both a grid identifier and a task package identifier, then the current grid is a task grid. If the current grid data only includes a grid identifier and does not include a task package identifier, then the current grid is a non-task grid.

[0048] If the current grid is determined to be a job grid, its neighboring grids are identified based on the grid identifier of the current grid. The grid data of each neighboring grid is then matched with the grid data of multiple job grids. Among these job grids, the job grid that successfully matches the neighboring grid of the current grid is identified. By comparing the task package identifier of the current grid with the task package identifier of the successfully matched job grid, it can be determined whether the current grid and the successfully matched job grid belong to the same task package. If the task package identifiers are different, they do not belong to the same task package. The boundary marker value of the common boundary between the current grid and its neighboring grids is then determined as a first preset value. The first preset value can be `true`, indicating that the common boundary is drawn. The first preset value can also be in other forms, which are not limited in this application.

[0049] In one example, if the current grid is a job grid, the job grid that successfully matches the next neighbor grid of the current grid is determined through grid identifier matching among multiple job grids. Then, the task package identifier of the current grid is compared with the task package identifier of the successfully matched job grid. If they are different, the current grid and the successfully matched job grid do not belong to the same job package, and the boundary marker value of the common boundary between the current grid and the next neighbor grid is set to true. Here, the common boundary between the current grid and the next neighbor grid is also the lower boundary of the current grid.

[0050] In this embodiment of the disclosure, when the current grid is a task grid and the neighboring grid is successfully matched with the task grid, if the current grid and the successfully matched task grid belong to different task packages, the boundary marker value of the common boundary between the current grid and its neighboring grid is determined as a first preset value. Based on the first preset value, the boundary corresponding to the boundary marker value of the current grid can be drawn.

[0051] In one possible implementation, the neighboring grid is matched with the job grid, and the boundary marker value of the current grid is determined based on the matching result, including:

[0052] If all four neighboring grids of the current grid fail to match the task grid, and if the current grid is the task grid, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be the first preset value.

[0053] If the current grid is a non-operational grid, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be the second preset value.

[0054] In practical applications, when all four neighboring grids of the current grid fail to match the task grid (i.e., all four neighboring grids are non-task grids), if the current grid is a task grid, the boundary marker value of the common boundary (the four boundaries of the current grid) between the current grid and its four neighboring grids is determined to be a first preset value; if the current grid is a non-task grid, the boundary marker value of the common boundary (the four boundaries of the current grid) between the current grid and its four neighboring grids is determined to be a second preset value. The first preset value can be `true`, indicating that the common boundary is drawn. The second preset value can be `false`, indicating that the common boundary does not need to be drawn. The first and second preset values ​​can also be in other forms, and this application does not limit them.

[0055] In this embodiment of the disclosure, if all four neighboring grids and the job grid of the current grid fail to match, the boundary marker value of the current grid is determined based on whether the current grid is a job grid, which serves as the basis for controlling whether to draw the grid boundary.

[0056] In one possible implementation, the neighboring grid is matched with the job grid, and the boundary marker value of the current grid is determined based on the matching result, including:

[0057] The current grid is identified as the task grid, and the task grid that successfully matches the neighboring grid of the current grid is identified within the task grid.

[0058] Compare the task package identifiers in the current grid's grid data with the task package identifiers in the grid data of the successfully matched job grid;

[0059] If the comparison results are the same, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be the second preset value.

[0060] In practical applications, the current grid can be determined as a task grid or a non-task grid based on its grid data. If the current grid data includes both a grid identifier and a task package identifier, then the current grid is a task grid. If the current grid data only includes a grid identifier and does not include a task package identifier, then the current grid is a non-task grid.

[0061] If the current grid is determined to be a job grid, its neighboring grids are identified based on the grid identifier of the current grid. The grid data of each neighboring grid is then matched with the grid data of multiple job grids. Among these job grids, the job grid that successfully matches the neighboring grid of the current grid is identified. By comparing the task package identifier of the current grid with the task package identifier of the successfully matched job grid, it can be determined whether the current grid and the successfully matched job grid belong to the same task package. If the task package identifiers are the same, they belong to the same task package, and the boundary marker value of the common boundary between the current grid and its neighboring grids is determined as a second preset value. The second preset value can be false, indicating that the common boundary does not need to be drawn. The second preset value can also be in other forms, which are not limited in this application.

[0062] In one example, if the current grid is a job grid, by matching grid identifiers, a job grid that successfully matches the left neighbor grid of the current grid is identified among multiple job grids. Then, the task package identifier of the current grid is compared with the task package identifier of the successfully matched job grid. If they match, the current grid and the successfully matched job grid belong to the same job package, and the boundary marker value of the common boundary between the current grid and its left neighbor grid is set to false. The common boundary between the current grid and its left neighbor grid is also the left boundary of the current grid.

[0063] In this embodiment of the disclosure, when the current grid is a task grid and the neighboring grid is successfully matched with the task grid, if the current grid and the successfully matched task grid belong to the same task package, the boundary marker value of the common boundary between the current grid and its neighboring grid is determined as a second preset value. Based on the second preset value, it is possible to control that the boundary corresponding to the boundary marker value of the current grid does not need to be drawn.

[0064] In one possible implementation, the decision to draw the boundaries of the multiple meshes is controlled based on their respective boundary marker values, including:

[0065] If the boundary marker value of the grid is a first preset value, draw the boundary of the grid corresponding to the boundary marker value.

[0066] In practical applications, the drawing of grid boundaries is controlled based on the top, bottom, left, and right boundary marker values ​​for each grid. If a grid's boundary marker value is a first preset value, then that boundary is drawn. For example, if the top boundary marker value of the current grid is the first preset value, then the common boundary of the current grid and its upper neighboring grids is drawn, which is the top boundary of the current grid.

[0067] The first preset value can be true, indicating that the common boundary is drawn. The first preset value can also be in other forms, which are not limited in this application.

[0068] In this embodiment of the disclosure, when the boundary marker value of the grid is a first preset value, the boundary of the grid corresponding to the boundary marker value is drawn, so that the grid boundary finally displayed can intuitively show the job grid in the task package, thereby showing the distribution of task allocation.

[0069] In one possible implementation, the decision to draw the boundaries of the multiple meshes is controlled based on their respective boundary marker values, including:

[0070] When the boundary marker value of the grid is the second preset value, the boundary of the grid corresponding to the boundary marker value is ignored.

[0071] In practical applications, the drawing of grid boundaries is controlled based on the top, bottom, left, and right boundary marker values ​​for each grid. If a grid boundary marker value is a second preset value, the grid boundary is ignored, meaning it does not need to be drawn. For example, if the bottom boundary marker value of the current grid is the second preset value, then the bottom boundary of the current grid does not need to be drawn.

[0072] The second preset value can be false, indicating that the common boundary does not need to be drawn. The second preset value can also be in other forms, which are not limited in this application.

[0073] In this embodiment of the disclosure, when the boundary marker value of the grid is a first preset value, the boundary of the grid corresponding to the boundary marker value is drawn; when the boundary marker value of the grid is a second preset value, it is not necessary to draw the boundary of the grid corresponding to the boundary marker value. This makes the grid boundary finally displayed intuitively show the job grid in the task package, thereby showing the distribution of task allocation.

[0074] In one possible implementation, based on grid data, the neighboring grids of the current grid are determined among multiple grids, including:

[0075] Determine the position coordinates of the current grid based on the grid identifier in the current grid data;

[0076] Based on the position coordinates, determine at least one of the four neighboring grids that are adjacent to the current grid on the top, bottom, left, and right.

[0077] In practical applications, a relationship is established between grid identifiers and position coordinates in advance. For any grid, the position coordinates of the current grid can be determined based on the grid identifier and the relationship between the grid identifier and position coordinates. Based on the position coordinates of the current grid, the position coordinates of the four neighboring grids that are adjacent to the current grid above, below, left, and right can be determined. Based on the position coordinates, the grid identifiers of the neighboring grids can be determined, thus determining the neighboring grids.

[0078] In this embodiment of the disclosure, the neighboring grids can be determined based on the grid data of the current grid. The neighboring grids can serve as the data basis for determining the boundary marker value of the current grid, and then the boundary marker value is used to determine whether to draw the grid boundary.

[0079] Figure 2 This is a flowchart illustrating a method for drawing control grid boundaries in an electronic map according to an embodiment of this disclosure. Figure 2 As shown, the method includes:

[0080] Step S201: Obtain grid data for multiple grids. These grids are pre-divided based on the work area of ​​the electronic map, including work grids and non-work grids.

[0081] Step S202: Take each grid as the current grid and determine the position coordinates of the current grid based on the grid identifier in the grid data of the current grid.

[0082] Step S203: Based on the position coordinates, determine at least one of the four neighboring grids that are adjacent to the current grid on the top, bottom, left, and right.

[0083] Step S204: Determine the current grid as the task grid, and identify the task grids that successfully match the neighboring grids of the current grid.

[0084] Step S205: Compare the task package identifier in the grid data of the current grid with the task package identifier in the grid data of the successfully matched job grid;

[0085] Step S206: If the comparison results are different, determine the boundary marker value of the common boundary between the current mesh and its neighboring meshes as a first preset value. If the comparison results are the same, determine the boundary marker value of the common boundary between the current mesh and its neighboring meshes as a second preset value.

[0086] Step S207: Based on the boundary marker values ​​of each of the multiple grids, control whether to draw the boundaries of each of the multiple grids.

[0087] In this embodiment of the disclosure, by controlling the drawing of the grid boundaries, the job grids can be aggregated together. The drawn grid boundaries can be used to visually display the job grids in the task package, thereby showing the distribution of task allocation.

[0088] Figure 3 This is a schematic diagram of a mesh boundary drawn in one embodiment of this disclosure. Figure 3As shown, the number in the upper left corner of each grid represents the grid identifier, such as "1287361", "1287364", and "1287365" as shown in the figure. The thick black border represents the drawn grid boundary. For the grid with identifier "1287279" and the grid with identifier "1287290", the grid with identifier "1287279" is the job grid, and the grid with identifier "1287290" is its right neighbor grid, which is also a job grid. Furthermore, the grids with identifiers "1287279" and "1287290" share the same task package identifier, indicating they belong to the same task package. Therefore, the boundary marker value of the common boundary (the right boundary of the grid with identifier "1287279") between the grids with identifiers "1287279" and "1287290" is the second preset value, and this grid boundary does not need to be drawn. Figure 3 As can be seen, adjacent grids in the same task package are clustered together. The drawn grid boundaries can be used to visually display the task grids in the task package, thus showing the distribution of task allocation.

[0089] Figure 4 This is a schematic diagram of a device for controlling the drawing of grid boundaries in an electronic map according to an embodiment of this disclosure. Figure 4 As shown, the device for controlling the drawing of grid boundaries in an electronic map may include:

[0090] The acquisition module 401 is used to acquire grid data of multiple grids, which are pre-divided based on the work area of ​​the electronic map, including work grids and non-work grids;

[0091] The matching module 402 is used to take each grid as the current grid, determine the neighboring grids of the current grid in multiple grids according to the grid data, match the neighboring grids with the working grid, and determine the boundary marker value of the current grid according to the matching result.

[0092] The control module 403 is used to control whether to draw the boundaries of the multiple grids based on their respective boundary marker values.

[0093] The apparatus for controlling the drawing of grid boundaries in an electronic map provided in this disclosure matches the neighboring grids of each grid with the task grids, and determines the boundary marker value of the current grid based on the matching result; based on the boundary marker values ​​of multiple grids, it controls whether to draw the boundaries of each of the multiple grids. By controlling the drawing of grid boundaries, task grids can be aggregated together, and the drawn grid boundaries can be used to intuitively display the task grids in the task package, thereby showing the distribution of task allocation.

[0094] In one possible implementation, the matching module 402, when matching the neighboring grid with the job grid and determining the boundary marker value of the current grid based on the matching result, is used to:

[0095] If the current grid is a non-operational grid and its neighboring grids are successfully matched with the operational grid, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a first preset value.

[0096] In one possible implementation, the matching module 402, when matching the neighboring grid with the job grid and determining the boundary marker value of the current grid based on the matching result, is used to:

[0097] The current grid is identified as the task grid, and the task grid that successfully matches the neighboring grid of the current grid is identified within the task grid.

[0098] Compare the task package identifiers in the current grid's grid data with the task package identifiers in the grid data of the successfully matched job grid;

[0099] If the comparison results are different, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be the first preset value.

[0100] In one possible implementation, the matching module 402, when matching the neighboring grid with the job grid and determining the boundary marker value of the current grid based on the matching result, is used to:

[0101] If all four neighboring grids of the current grid fail to match the task grid, and if the current grid is the task grid, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be the first preset value.

[0102] If the current grid is a non-operational grid, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be the second preset value.

[0103] In one possible implementation, the matching module 402, when matching the neighboring grid with the job grid and determining the boundary marker value of the current grid based on the matching result, is used to:

[0104] The current grid is identified as the task grid, and the task grid that successfully matches the neighboring grid of the current grid is identified within the task grid.

[0105] Compare the task package identifiers in the current grid's grid data with the task package identifiers in the grid data of the successfully matched job grid;

[0106] If the comparison results are the same, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be the second preset value.

[0107] In one possible implementation, the control module 403 is used for:

[0108] If the boundary marker value of the grid is a first preset value, draw the boundary of the grid corresponding to the boundary marker value.

[0109] In one possible implementation, the control module 403 is used for:

[0110] When the boundary marker value of the grid is the second preset value, the boundary of the grid corresponding to the boundary marker value is ignored.

[0111] In one possible implementation, when the matching module 402 determines the neighboring grids of the current grid among multiple grids based on grid data, it is used to:

[0112] Determine the position coordinates of the current grid based on the grid identifier in the current grid data;

[0113] Based on the position coordinates, determine at least one of the four neighboring grids that are adjacent to the current grid on the top, bottom, left, and right.

[0114] The functions of each unit, module, or sub-module in the various devices of this disclosure embodiment can be found in the corresponding descriptions in the above method embodiments, and will not be repeated here.

[0115] The acquisition, storage, and application of user personal information involved in the technical solution disclosed herein comply with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0116] According to another aspect of this disclosure, an electronic device is provided, comprising:

[0117] At least one processor; and

[0118] The memory is communicatively connected to the at least one processor; wherein,

[0119] The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the methods in any embodiment of this disclosure.

[0120] According to another aspect of this disclosure, a non-transitory computer-readable storage medium is provided storing computer instructions for causing a computer to perform the methods of any embodiment of this disclosure.

[0121] According to another aspect of this disclosure, a computer program product is provided, including a computer program that, when executed by a processor, implements the methods of any embodiment of this disclosure.

[0122] Figure 5A schematic block diagram of an example electronic device 500 that can be used to implement embodiments of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0123] like Figure 5 As shown, device 500 includes a computing unit 501, which can perform various appropriate actions and processes based on a computer program stored in read-only memory (ROM) 502 or a computer program loaded from storage unit 508 into random access memory (RAM) 503. RAM 503 may also store various programs and data required for the operation of device 500. The computing unit 501, ROM 502, and RAM 503 are interconnected via bus 504. Input / output (I / O) interface 505 is also connected to bus 504.

[0124] Multiple components in device 500 are connected to I / O interface 505, including: input unit 506, such as keyboard, mouse, etc.; output unit 507, such as various types of monitors, speakers, etc.; storage unit 508, such as disk, optical disk, etc.; and communication unit 509, such as network card, modem, wireless transceiver, etc. Communication unit 509 allows device 500 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0125] The computing unit 501 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the computing unit 501 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 501 performs the various methods and processes described above. For example, in some embodiments, the methods in the embodiments of this disclosure can be implemented as a computer software program tangibly contained in a machine-readable medium, such as storage unit 508. In some embodiments, part or all of the computer program can be loaded and / or installed on device 500 via ROM 502 and / or communication unit 509. When the computer program is loaded into RAM 503 and executed by the computing unit 501, one or more steps of the methods in any of the embodiments described above can be performed. Alternatively, in other embodiments, the computing unit 501 can be configured to perform the methods in the embodiments of this disclosure by any other suitable means (e.g., by means of firmware).

[0126] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0127] The program code used to implement the methods of this disclosure may be written in any combination of one or more programming languages. This program code may be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing apparatus, such that when executed by the processor or controller, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code may be executed entirely on a machine, partially on a machine, as a standalone software package partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0128] In the context of this disclosure, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can be, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0129] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor); and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the computer. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0130] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as a data server), or computing systems that include middleware components (e.g., an application server), or computing systems that include frontend components (e.g., a user computer with a graphical user interface or web browser through which a user can interact with embodiments of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., a communication network). Examples of communication networks include local area networks (LANs), wide area networks (WANs), and the Internet.

[0131] Computer systems can include clients and servers. Clients and servers are generally located far apart and typically interact via communication networks. Client-server relationships are created by computer programs running on the respective computers and having a client-server relationship with each other. Servers can be cloud servers, servers in distributed systems, or servers incorporating blockchain technology.

[0132] It should be understood that the various forms of processes shown above can be used to rearrange, add, or delete steps. For example, the steps described in this disclosure can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution disclosed in this disclosure can be achieved, and this is not limited herein.

[0133] The specific embodiments described above do not constitute a limitation on the scope of protection of this disclosure. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this disclosure should be included within the scope of protection of this disclosure.

Claims

1. A method for drawing control grid boundaries in an electronic map, the method comprising: Acquire grid data for multiple grids, which are pre-divided based on the work area of ​​an electronic map, including work grids and non-work grids; Each grid is taken as the current grid, and the neighboring grids of the current grid are determined among the plurality of grids based on the grid data; The neighborhood grid is matched with the job grid, and the type of the neighborhood grid is determined based on the matching result. The type of the neighborhood grid is either a job grid or a non-job grid. The boundary marker value of the current grid is determined based on the type of the neighboring grid and the type of the current grid. Based on the boundary marker values ​​of each of the multiple grids, control whether to draw the boundaries of each of the multiple grids.

2. The method according to claim 1, wherein, Determining the boundary marker value of the current grid based on the type of the neighboring grid and the type of the current grid includes: When the current grid is a non-operational grid and its neighboring grids are operational grids, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a first preset value.

3. The method according to claim 1, wherein, Determining the boundary marker value of the current grid based on the type of the neighboring grid and the type of the current grid includes: If the current grid is a job grid and the neighboring grids include job grids, compare the task package identifier in the grid data of the current grid with the task package identifier in the grid data of the job grids in the neighboring grids. If the comparison results are different, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a first preset value.

4. The method according to claim 1, wherein, Determining the boundary marker value of the current grid based on the type of the neighboring grid and the type of the current grid includes: If the current grid is a working grid, and all four neighboring grids of the current grid are non-working grids, then the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a first preset value. If the current grid is a non-operational grid, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a second preset value.

5. The method according to claim 1, wherein, Determining the boundary marker value of the current grid based on the type of the neighboring grid and the type of the current grid includes: When the current grid is a job grid, and the neighboring grids include job grids, Compare the task package identifier in the grid data of the current grid with the task package identifier in the grid data of the job grid in the neighboring grid; If the comparison results are the same, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a second preset value.

6. The method according to any one of claims 2-4, wherein, The step of controlling whether to draw the boundaries of the multiple grids based on their respective boundary marker values ​​includes: When the boundary marker value of the grid is the first preset value, the boundary of the grid corresponding to the boundary marker value is drawn.

7. The method according to claim 4 or 5, wherein, The step of controlling whether to draw the boundaries of the multiple grids based on their respective boundary marker values ​​includes: When the boundary marker value of the grid is the second preset value, the boundary of the grid corresponding to the boundary marker value is ignored.

8. The method according to claim 1, wherein, The step of determining the neighboring grids of the current grid among the plurality of grids based on the grid data includes: The position coordinates of the current grid are determined based on the grid identifier in the grid data of the current grid. Based on the position coordinates, determine at least one of the four neighboring grids that are adjacent to the current grid on the top, bottom, left, and right.

9. An apparatus for controlling the drawing of grid boundaries in an electronic map, the apparatus comprising: The acquisition module is used to acquire grid data of multiple grids, which are pre-divided based on the work area of ​​the electronic map, including work grids and non-work grids; The matching module is used to take each grid as the current grid, determine the neighboring grids of the current grid among the multiple grids based on the grid data, match the neighboring grids with the task grids, determine the type of the neighboring grids based on the matching results, and the type of the neighboring grids is either a task grid or a non-task grid; and determine the boundary marker value of the current grid based on the type of the neighboring grids and the type of the current grid. The control module is used to control whether to draw the boundaries of the multiple grids based on their respective boundary marker values.

10. The apparatus according to claim 9, wherein, When determining the boundary marker value of the current grid based on the type of the neighboring grid and the type of the current grid, the matching module is used to: When the current grid is a non-operational grid and its neighboring grids are operational grids, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a first preset value.

11. The apparatus according to claim 9, wherein, When determining the boundary marker value of the current grid based on the type of the neighboring grid and the type of the current grid, the method is used for: If the current grid is a job grid and the neighboring grids include job grids, compare the task package identifier in the grid data of the current grid with the task package identifier in the grid data of the job grids in the neighboring grids. If the comparison results are different, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a first preset value.

12. The apparatus according to claim 9, wherein, When the matching module determines the boundary marker value of the current grid based on the type of the neighboring grid and the type of the current grid, it is used for: If the current grid is a working grid, and all four neighboring grids of the current grid are non-working grids, then the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a first preset value. If the current grid is a non-operational grid, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a second preset value.

13. The apparatus according to claim 9, wherein, When determining the boundary marker value of the current grid based on the type of the neighboring grid and the type of the current grid, the matching module is used to: If the current grid is a job grid and the neighboring grids include job grids, compare the task package identifier in the grid data of the current grid with the task package identifier in the grid data of the job grids in the neighboring grids. If the comparison results are the same, the boundary marker value of the common boundary between the current grid and its neighboring grids is determined to be a second preset value.

14. The apparatus according to any one of claims 10-12, wherein, The control module is used for: When the boundary marker value of the grid is the first preset value, the boundary of the grid corresponding to the boundary marker value is drawn.

15. The apparatus according to claim 12 or 13, wherein, The control module is used for: When the boundary marker value of the grid is the second preset value, the boundary of the grid corresponding to the boundary marker value is ignored.

16. The apparatus according to claim 9, wherein, When the matching module determines the neighboring grids of the current grid among the plurality of grids based on the grid data, it is used to: The position coordinates of the current grid are determined based on the grid identifier in the grid data of the current grid. Based on the position coordinates, determine at least one of the four neighboring grids that are adjacent to the current grid on the top, bottom, left, and right.

17. An electronic device, characterized in that, include: At least one processor; as well as A memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-8.

18. A non-transitory computer-readable storage medium storing computer instructions, characterized in that, The computer instructions are used to cause the computer to perform the method according to any one of claims 1-8.

19. A computer program product comprising a computer program that, when executed by a processor, implements the method according to any one of claims 1-8.

Images