Map-based demand task processing method and map task processing platform

By setting up a unified access interface in the map data processing system, the automation of map data processing is achieved, the problem of low automation in the existing technology is solved, and processing efficiency and accuracy are improved.

CN119474563AInactive Publication Date: 2025-02-18ZHEJIANG GEELY HLDG GRP CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411522783.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-29
Publication Date
2025-02-18
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

In the prior art, the degree of automation of map data processing is low, resulting in complex operations and easy human errors, and the efficiency and accuracy of map information processing are low.

Method used

By setting up a unified access interface between the requirements management system and the task processing system, users can initiate requirements instructions through the requirements management system, and the task processing system automatically calls the matching algorithm to process map data and returns the processing results.

Benefits of technology

It improves the degree of automation of processing processes of map-related tasks, reduces the probability of human error, improves processing efficiency and accuracy, and ensures the timeliness and reliability of map data.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119474563A_ABST
    Figure CN119474563A_ABST
Patent Text Reader

Abstract

The invention provides a demand task processing method based on a map and a map task processing platform, and the method comprises the steps: responding to a demand instruction initiated by a user for a to-be-processed map, and transmitting a target task to a task processing system through a first access interface; wherein the target task is a demand task indicated by the demand instruction, and different demand tasks are sent to the task processing system through the first access interface; and receiving target task information returned by the task processing system for the target task through a second access interface, wherein the target task information is obtained by processing the to-be-processed map through a target algorithm matched with the target task.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of map technology, and in particular to a map-based demand task processing method and a map task processing platform. Background Art

[0002] In order to maintain the relative accuracy of map data, it is usually necessary to conduct in-depth information processing on massive amounts of data. However, since these data come from multiple channels, they not only cover different languages ​​and formats, but also have different information dimensions.

[0003] In the relevant technology, a relatively decentralized data processing method is still used. Technicians need to select the appropriate processing algorithm according to the characteristics of each data source, and call different algorithms for information processing through different algorithm access interfaces. After obtaining multiple processing results, they need to manually collect and integrate each processing result. The whole process has a low degree of automation, and due to the complex operation, human errors are prone to occur, and the efficiency and accuracy of map information processing are low. Summary of the invention

[0004] In view of this, the present application provides a map-based demand task processing method and a map task processing platform to solve the defects existing in the relevant technology. The technical solution of the present application is as follows:

[0005] According to an embodiment of the first aspect of the present application, a map-based demand task processing method is provided, the method comprising:

[0006] In response to a demand instruction initiated by a user for a map to be processed, a target task is sent to a task processing system through a first access interface; wherein the target task is a demand task indicated by the demand instruction, and different demand tasks are sent to the task processing system through the first access interface;

[0007] Receive target task intelligence returned by the task processing system for the target task through the second access interface, where the target task intelligence is obtained by processing the map to be processed through a target algorithm matching the target task.

[0008] According to an embodiment of the second aspect of the present application, a map-based demand task processing method is provided, the method comprising:

[0009] Receiving a target task sent by the demand management system through a first access interface; wherein the target task is a demand task corresponding to a demand instruction initiated by a user for a map to be processed, and the demand management system sends different demand tasks through the first access interface;

[0010] The target algorithm matching the target task is called to process the map to be processed to obtain target task intelligence for the target task; and the target task intelligence is returned to the demand management system through a second access interface.

[0011] According to an embodiment of the third aspect of the present application, a map task processing platform is provided, including a demand management system and a task processing system; wherein:

[0012] The demand management system is used to: respond to a demand instruction initiated by a user for a map to be processed, and send a target task to the task processing system through a first access interface; wherein the target task is a demand task corresponding to the demand instruction, and different demand tasks are sent to the task processing system through the first access interface;

[0013] The task processing system is used to: call a target algorithm matching the target task to process the map to be processed to obtain target task intelligence for the target task; and return the target task intelligence to the demand management system through a second access interface.

[0014] According to an embodiment of the fourth aspect of the present application, a computer device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method described in the first aspect or the second aspect when executing the computer program.

[0015] According to an embodiment of the fourth aspect of the present application, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the method described in the first aspect or the second aspect are implemented.

[0016] In the technical solution provided in the present application, a user can initiate a demand instruction (i.e., a target task) for a map to be processed through a demand management system; the demand management system can respond to the demand instruction and send different demand tasks to the task processing system through a unified first access interface; and then, after receiving the target task through the first access interface, the task processing system can process the map to be processed through a target algorithm that matches the target task to obtain target task intelligence, and return the target task intelligence to the demand management system through a second access interface; a unified first access interface is set between the demand management system and the task processing system, and then different demand tasks triggered by the same user or different users can be sent to the task processing system through a unified first access interface, and the user does not need to spend energy to query the access interface corresponding to the adaptation algorithm that matches the corresponding demand task for a specific demand task or different demand tasks, which effectively improves the convenience of user operation, reduces the dependence on the user's professional knowledge in demand management and task processing, reduces the difficulty of demand management and task management, and effectively improves the efficiency of demand management and task management. At the same time, the task processing system can automatically call the target algorithm that matches the received demand task (such as the aforementioned target task) to process the map to be processed, and return the obtained target task intelligence to the demand management system through the second access interface, thereby realizing efficient management of the target task intelligence, thereby improving the overall degree of automation of the processing flow of map-related tasks, reducing the probability of human errors, improving the efficiency and accuracy of processing map-related tasks, and ensuring the timeliness and reliability of map data updates.

[0017] It should be understood that the above general description and the following detailed description are merely exemplary and explanatory and do not limit the embodiments of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the embodiments of the present application. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0019] Figure 1 is an architecture diagram of a map task processing platform shown in an exemplary embodiment of the present application;

[0020] Figure 2 is an interactive schematic diagram of a map task processing platform shown in an exemplary embodiment of the present application;

[0021] Figure 3 is a flow chart of a method for processing demand tasks based on a map, shown in an exemplary embodiment of the present application;

[0022] Figure 4 It is a schematic diagram of a visualization platform interface related to map segmentation shown in an exemplary embodiment of the present application;

[0023] Figure 5 It is a schematic diagram of a splitting method for a map to be processed shown in an exemplary embodiment of the present application;

[0024] Figure 6 is a schematic diagram of another splitting method for a map to be processed, shown in an exemplary embodiment of the present application;

[0025] Figure 7 is a flowchart of a process for processing a demand task in a case where a map management system is included, shown in an exemplary embodiment of the present application;

[0026] Figure 8 is a flow chart of another method for processing demand tasks based on a map, shown in an exemplary embodiment of the present application;

[0027] Fig. 9 It is a schematic diagram of a visualization platform interface for adding a new image, shown in an exemplary embodiment of the present application;

[0028] Fig.10 It is a schematic diagram of a visualization platform interface for algorithm flow configuration shown in an exemplary embodiment of the present application;

[0029] FIG11(1) is a schematic diagram of a serial algorithm flow diagram of an exemplary embodiment of the present application;

[0030] FIG11(2) is a schematic diagram of a parallel algorithm flow shown in an exemplary embodiment of the present application;

[0031] FIG11(3) is a schematic diagram of a single-step algorithm flow diagram of an exemplary embodiment of the present application;

[0032] FIG11(4) is a schematic diagram of an algorithm flow for constructing a directed acyclic graph in multiple steps, shown in an exemplary embodiment of the present application;

[0033] Fig.12 It is a schematic diagram of a process of performing task scheduling by a task processing system shown in an exemplary embodiment of the present application;

[0034] Fig.13 It is a schematic diagram of a computer device shown in an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0035] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with one or more embodiments of the present application. Instead, they are merely examples of devices and methods consistent with some aspects of one or more embodiments of the present application as detailed in the appended claims.

[0036] It should be noted that: in other embodiments, the steps of the corresponding method are not necessarily performed in the order shown and described in this application. In some other embodiments, the steps included in the method may be more or less than those described in this application. In addition, a single step described in this application may be decomposed into multiple steps for description in other embodiments; and multiple steps described in this application may also be combined into a single step for description in other embodiments.

[0037] Figure 1 is an architecture diagram of a map task processing platform shown in an exemplary embodiment of the present application. Figure 1 The map task processing platform includes a demand management system 111 and a task processing system 112 , and a first access interface 121 and a second access interface 122 are opened between the demand management system 111 and the task processing system 112 .

[0038] As an embodiment, the demand management system 111 and the task processing system 112 can be deployed on different execution entities respectively. The aforementioned execution entities may be but are not limited to any one or more devices including terminal devices, servers, cloud, blockchain, distributed systems, Internet of Things control terminals, and other electronic devices; the aforementioned server can be a physical server including an independent host, or it can be a virtual server hosted by a host cluster.

[0039] When any of the aforementioned execution entities runs the program corresponding to the demand management system 111, the functions of the demand management system 111 can be realized, such as creating and issuing demand tasks, map segmentation, task process management, task dynamic configuration, intelligence task scheduling, and target task intelligence collection.

[0040] When any of the aforementioned execution entities runs the program corresponding to the task processing system 112, the functions of the task processing system 112 can be realized, including task scheduling and intelligence processing. In terms of task scheduling, the functions of image configuration, machine configuration, parameter template, task coordination and task scheduling can be realized; and in terms of intelligence processing, the mining function of access control, speed limit signs, roads under construction, new roads, broken roads, trajectories, and lane dividing lines can be realized, and the processed target task intelligence can be returned to the demand management system.

[0041] As an embodiment, the demand management system 111 and the task processing system 112 may respectively provide corresponding visualization platform interfaces to facilitate user operations; for example, a user may initiate a demand instruction for a map to be processed on the visualization platform interface corresponding to the demand management system 111, and a user may configure the execution process of each algorithm and the mirror address used on the visualization platform interface corresponding to the task processing system 112.

[0042] The first access interface 121 and the second access interface 122 may be application programming interfaces that rely on network implementation, and respectively define the interaction methods between the demand management system 111 and the task processing system 112. The aforementioned interaction methods may specifically include, but are not limited to, the format of data exchange and / or HTTP request methods, as well as executable operations, etc. The first access interface 121 and the second access interface 122 may be the same interface or different interfaces. In the case where the first access interface 121 and the second access interface 122 are different interfaces, the interaction method defined by the first access interface 121 may be the same as or different from the interaction defined by the second access interface 122. For example, the HTTP request method of the first access interface 121 may be of the POST type, and the HTTP request method of the second access interface 122 may be of the PUT type. Technical personnel may flexibly define the first access interface and the second access interface according to actual conditions and needs, and this application does not impose any restrictions on this.

[0043] Specifically, the demand management system 111 is used to: respond to a demand instruction initiated by a user for a map to be processed, and send a target task to the task processing system through a first access interface; wherein the target task is a demand task corresponding to the demand instruction, and different demand tasks are sent to the task processing system through the first access interface;

[0044] The task processing system 112 is used to: call a target algorithm matching the target task to process the map to be processed to obtain target task intelligence for the target task; and return the target task intelligence to the demand management system through a second access interface.

[0045] As for the system embodiment, it basically corresponds to the method embodiment, so the implementation process of the functions and effects of each system in the above-mentioned map task processing platform can be specifically referred to the implementation process of the corresponding steps in the following method embodiment. And the system embodiment described above is only schematic, wherein the subsystems described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present application. Ordinary technicians in this field can understand and implement it without creative work.

[0046] Figure 2 FIG. 1 is an interactive schematic diagram of a map task processing platform shown in an exemplary embodiment of the present application. Figure 2 As shown, this method can be applied to Figure 1 The map task processing platform shown; the method may include the following steps:

[0047] Step S201: The user initiates a demand instruction for the map to be processed through the demand management system.

[0048] The user can determine the map to be processed and other related demand information in the visualization platform interface provided by the demand management system by configuring a form, entering corresponding information in an input box, selecting corresponding information in a selection box, and any other method or combination thereof. In the method of initiating demand instructions for the map to be processed by configuring a form, the visualization platform interface can, but is not limited to, provide a form containing any one or any combination of items such as demand name, intelligence source, priority, and map range for the user to fill in. After the user submits the form, it can be regarded as the user initiating a demand instruction for the map to be processed that he has determined.

[0049] Step S202: The demand management system responds to a demand instruction initiated by a user for a map to be processed by sending a target task indicated by the demand instruction to the task processing system through a first access interface.

[0050] It should be noted that in the embodiment of the present application, the aforementioned first access interface is set between the demand management system and the task management system. The first access interface can be used by the demand management system to transmit different target tasks to the task management system. Different target tasks can be tasks corresponding to demand instructions triggered by the same user / different users for the same map to be processed / different maps to be processed.

[0051] Step S203, the task management system receives the target task sent by the demand management system through the first access interface, and calls a target algorithm matching the target task to process the map to be processed, to obtain target task intelligence for the target task.

[0052] Step S204: The task management system returns the target task information to the demand management system through the second access interface.

[0053] Step S205: the demand management system receives the target task information returned by the task processing system.

[0054] Furthermore, after receiving the target task information in step S205, the demand management system may display the target task information.

[0055] The following Figure 2 The specific implementation methods of the demand management system and task processing system in the provided map task processing platform are further explained.

[0056] Figure 3 FIG. 1 is a flowchart of a method for processing demand tasks based on a map in an exemplary embodiment of the present application. Figure 3 As shown, this method can be applied to Figure 1 The demand management system in the map task processing platform shown. The method may include the following steps:

[0057] Step 301, in response to a demand instruction initiated by a user for a map to be processed, a target task is sent to a task processing system through a first access interface; wherein the target task is a demand task indicated by the demand instruction, and different demand tasks are sent to the task processing system through the first access interface.

[0058] In one embodiment, the map to be processed can be a map determined by the user to have a processing demand, and the map may contain one or more map intelligence that the user wants to obtain. Here, map intelligence can be information used to describe physical and cultural features in geographic space, including but not limited to any one or any combination of access control, speed limit signs, roads under construction, road breaks, lane dividers, etc. The user may have multiple different processing requirements and initiate multiple different demand instructions. The demand management system will create corresponding demand tasks for each demand instruction, and the target task can be any demand task. The user can initiate a demand instruction for a map to be processed, and the demand management system will create the demand task indicated by the demand instruction as the target task in response to the demand instruction, and send the target task to the task processing system through the first access interface. For example, if a user wants to obtain all speed limit signs in City A, then the user can initiate a demand instruction for the speed limit signs in City A, and the demand management system will create a demand task for the speed limit signs in City A as the target task, and send the target task to the task processing system through the first access interface.

[0059] It should be emphasized that after creating corresponding demand tasks for multiple demand instructions in the demand management system, each demand task is sent to the task processing system through the same first access interface. Therefore, the user who initiates the demand instruction no longer needs to pay attention to the algorithms matched by each demand task and the access interface corresponding to each algorithm, which effectively improves the efficiency of task management and reduces the difficulty of management.

[0060] In one embodiment, the demand management system can respond to the demand instruction initiated for the map to be processed, divide the map to be processed, and determine K sub-maps. After that, the sub-tasks corresponding to each sub-map can be determined according to the demand instruction initiated by the user, and a total of K sub-tasks can be obtained, and these K sub-tasks are sent to the task processing system through the first access interface. Here, K is an integer not less than 1, that is, the map to be processed is divided into multiple sub-maps, and the tasks corresponding to each sub-map are determined respectively. Figure 1 A corresponding subtask. For any two sub-maps obtained by segmentation, the two sub-tasks corresponding to each other can have the same or different task contents. For example, the sub-maps obtained by segmenting the same map to be processed include A1 and A2, then the sub-task corresponding to sub-map A1 is T1 (T1 is a processing task for speed limit signs) and the sub-task corresponding to sub-map A2 is also T1, the sub-task corresponding to sub-map A1 is T1 but the sub-task corresponding to sub-map A2 is T2 (T2 can be a processing task for access control).

[0061] In one embodiment, the demand management system may segment the map to be processed in different ways.

[0062] In one embodiment, the demand management system can segment the map to be processed based on at least one data processing information of map attribute characteristics of the map to be processed, preset map segmentation characteristics, and personalized map segmentation characteristics indicated by the user.

[0063] Among them, the map attribute features are used to characterize the attribute features of the map to be processed, which may include any one or more map segmentation factors such as the area, shape, administrative district features (such as X city is divided into Y1 district, Y2 district, etc.), and landform features (such as plains, hills, mountains, etc.) of the map to be processed. For example, if the map to be processed is the map of X city, and the administrative district features in the map attribute features are used to segment the map to be processed, the demand management system will segment the map of X city according to the boundaries of 16 administrative districts such as Y1 district and Y2 district, and obtain 16 sub-maps. Figure 4 As shown, the setting items of the aforementioned map segmentation factors can be provided in the visualization platform interface of the demand management system; the map segmentation factor can be set to "administrative district characteristics", such as being able to segment the map to be processed based on but not limited to the set cities or counties, etc.; the map segmentation factor can also be set to "area of ​​the map to be processed", such as being able to set to use a specified map sheet for segmentation. When the user chooses to use a specified map sheet for segmentation, the map to be processed can also be segmented according to the preset map segmentation characteristics as described in the following embodiments.

[0064] The preset map segmentation feature is used to characterize the preset segmentation feature for the map to be processed, which can be called the first segmentation feature, and can specifically include at least one of the number of first sub-maps, the area of ​​the first sub-map, the size of the first sub-map, etc. Here, the specific values ​​corresponding to the number of first sub-maps, the area of ​​the first sub-map, and the size of the first sub-map in the preset map segmentation feature can be fixed values ​​set by technicians based on experience. In this case, no matter what the scope of the area covered by the map to be processed is, or what the amount of map intelligence to be obtained contained in the map to be processed is, the map to be processed is split according to the fixed value; and the specific values ​​corresponding to the number of first sub-maps, the area of ​​the first sub-map, and the size of the first sub-map can also be the adaptive map sheet calculated in advance according to the map to be processed and the target task, that is, according to the scope of the area covered by the current map to be processed and the historical quantity of the target task intelligence that the user wants to obtain, the splitting size that is suitable for the current situation is determined, which can avoid too many sub-maps after splitting due to too small a size, and avoid too much time to process each sub-map due to too large a size. If the map to be processed is Figure 5If the map 51 shown in FIG. 1 is used and the first sub-map size in the map preset map segmentation feature is used to segment the map to be processed, the map 51 will be segmented according to the fixed map size corresponding to the first sub-map size. Figure 5 As shown, during splitting, multiple map sheets corresponding to the size of the first sub-map (such as map sheet 521, map sheet 522, etc.) can be used to cover the map to be processed 51, and the intersections of each preset map sheet and the map to be processed 51 are obtained (such as intersection 531, intersection 532), and then the areas indicated by each intersection can be used as each sub-map after splitting (such as sub-map 541, sub-map 542).

[0065] The personalized map segmentation feature includes a segmentation feature for the map to be processed that is used to characterize the segmentation feature set by the user, which can be called the second segmentation feature, and can specifically include the number of second sub-maps, the area of ​​the second sub-map, and the size of the second sub-map. The user segments the map to be processed using the segmentation features set by the user, which can better meet the user's personalized needs and improve the user experience.

[0066] In another embodiment, the demand management system may also determine the map areas selected by each map area selection operation as the sub-map in response to at least one map area selection operation triggered by the user through the displayed map to be processed. For example, the user may determine each sub-map by multiple selections based on the map to be processed. Figure 6 As shown, for the map to be processed 61, the user first selects the area shown by the rectangular frame 621, and then obtains the first sub-map 631; the user again selects the area shown by the rectangular frame 622 in the remaining area, and then obtains the second sub-map 632. It should be noted that after the user completes multiple selection operations, the sum of the areas of the sub-maps determined can be the entire map to be processed, or a part of the map to be processed, and this application does not limit this.

[0067] When the task processing system receives K subtasks, it will process each subtask separately to obtain the subtask intelligence corresponding to each subtask. Afterwards, the task processing system can return the obtained task intelligence to the demand management system in different ways.

[0068] In one way, the demand management system can receive the subtask intelligence corresponding to each subtask directly returned by the task processing system through the second access interface, and then the demand management system can integrate the received subtask intelligence to determine the final target task intelligence. For example, when the demand management system receives the subtask intelligence R1 corresponding to subtask T1 and the subtask intelligence R2 corresponding to subtask T2 returned by the task processing system, the demand task associated with the subtask intelligence R1 and the demand task associated with the subtask intelligence R2 can be determined respectively according to the identification information related to the target task carried therein. If the demand tasks associated with the subtask intelligence R1 and the subtask intelligence R2 are the same, R1 and R2 can be integrated as part or all of the final task intelligence (such as the target task intelligence) obtained by the demand management system (here it depends on whether the demand management system has also received other subtask intelligence related to the demand task). In another way, the demand management system can also receive the final target task situation returned by the task processing system; the final target task intelligence can be determined by the task processing system based on the received subtask intelligence, and the specific way in which the task processing system determines the final target task intelligence is shown below.

[0069] In one embodiment, the demand management system may determine the subtasks corresponding to each submap in different ways.

[0070] In one approach, the demand management system can determine the target task indicated by the demand instruction as the subtasks corresponding to each submap. In this case, the task content of each subtask is consistent. For example, if the target task indicated by the demand instruction is to obtain all speed limit signs in the map to be processed, then the subtasks corresponding to each submap are all to obtain all speed limit signs in the corresponding submap.

[0071] In another way, the demand management system can allow the user to indicate the demand tasks corresponding to each sub-map respectively, and determine the demand tasks specified by the user as the sub-tasks corresponding to each sub-map. Specifically, after the demand management system divides the map to be processed, it can display the divided sub-maps to the user. The user can determine the sub-map of the task to be indicated by clicking, and the user is prompted to indicate the sub-task of the sub-map in the corresponding window or pop-up page; or, a corresponding configuration window can be displayed near each displayed sub-map, prompting the user to indicate the demand tasks corresponding to each sub-map by inputting or selecting a configuration. It should be noted that in this way, the task content of each demand task indicated by the user for each sub-map can be exactly the same, partially the same, or completely different. For example, when the user indicates subtasks T1, T2, and T3 for submaps A1, A2, and A3, respectively, T1, T2, and T3 may be completely consistent (e.g., all are tasks for obtaining speed limit signs in the map); T1, T2, and T3 may be partially consistent (e.g., T1 and T2 are tasks for obtaining speed limit signs in the map, while T3 is a task for obtaining access control in the map); T1, T2, and T3 may be completely different (e.g., T1 is a task for obtaining speed limit signs in the map, T2 is a task for obtaining roads under construction in the map, and T3 is a task for obtaining access control in the map). Users may determine the subtasks corresponding to each submap according to actual needs, and this application does not impose any restrictions on this.

[0072] Step 302: Receive target task intelligence returned by the task processing system for the target task through the second access interface, wherein the target task intelligence is obtained by processing the map to be processed through a target algorithm matching the target task.

[0073] In one embodiment, different algorithms are required to process different demand tasks. If all access control points in a map are to be acquired, an access control mining algorithm is required. If all speed limit signs in a map are to be acquired, a speed limit sign mining algorithm is required. After the demand management system creates a target task in response to a user's demand instruction, it sends the target task to the task processing system through a first access interface opened by the demand management system to the task processing system. After receiving the target task, the task processing system calls the corresponding target algorithm to process the map to be processed.

[0074] In one embodiment, any algorithm registered in the task processing system is a candidate algorithm, and the detailed algorithm registration and algorithm configuration process can be seen in the subsequent embodiment description. After completing the configuration of each registered candidate algorithm, the task processing system can synchronize the algorithm identification information and function description information of each candidate algorithm to the demand management system, so that the demand management system maintains the function description information of each candidate algorithm. In this case, the demand management system can directly determine the target algorithm matching the target task according to the function description information, and obtain the algorithm identification of the target algorithm, and then send the algorithm identification of the target algorithm directly to the task processing system through the first access interface. Here, the target algorithm identification and the corresponding target task can be carried in two messages and sent, and the demand task corresponding to the target algorithm identification can be clarified in the message carrying the target algorithm identification, that is, the matching relationship between the target algorithm identification carried in the message and the target task can be clarified. Of course, the target algorithm identification and the target task can also be carried in one message and sent uniformly. Specifically, the target task created by the demand management system can carry parameters of multiple dimensions, including but not limited to the algorithm identification and map parameters for indicating the target algorithm to be called by the task processing system. Accordingly, when receiving a target task, the task processing system may determine the candidate algorithm represented by the target algorithm identifier carried in the task as the target algorithm matching the target task, and call the target algorithm to process the map to be processed.

[0075] In one embodiment, since the original map data provided by different data sources are not uniform in language, format, etc., Figure 1 The map task processing platform shown may also include a map management system, and the original map data of each data source is preprocessed through the map management system; wherein the map management system may be deployed in Figure 1In the map task platform, the map management system can also be set up independently of the map task platform. Specifically, the map management system can obtain original map data from various different data sources by regularly pulling, or it can passively receive original map data actively sent by different data sources. After collecting a variety of original map data provided by multiple data sources, each original map data can be cleaned to eliminate redundant data in the data and erroneous data that may be caused by acquisition equipment failure and transmission failure, thereby improving data quality; at the same time, the original map data from different data sources can be converted into a unified format to facilitate data processing and analysis in subsequent operations. It should be noted that the map data involved in the technical solution of the present application can be a non-visualized picture, but a file format that can store vector data, such as Shapefile, GeoJSON, GML (Geography Markup Language), KML (Keyhole Markup Language), etc. Afterwards, the original map data after data cleaning and format conversion can be used as a usable map, and the map to be processed recorded in the aforementioned embodiment is any usable map here.

[0076] In one embodiment, the target task created by the demand management system may carry parameters of multiple dimensions, and in addition to the algorithm identifier recorded in the above embodiment, may also include map description information of the map to be processed, and the map description information is used to indicate the map to be processed for the demand instruction initiated by the user. After the demand management system sends the target task to the task processing system, the task processing system can read the map to be processed corresponding to the target task from the map management system according to the map description information of the map to be processed, and call the target algorithm to process the read map to be processed.

[0077] Specifically, the demand management system can send the association between the target task and its corresponding map to be processed to the task processing system through the first access interface; in the case of splitting the map to be processed, each subtask can be associated with the corresponding submap and sent to the task processing system. Taking the sending of the target task and the map to be processed as an example, in order to ensure that the target task and the map to be processed can be correctly associated and sent, the demand management system can encapsulate the parameters (such as the target algorithm identifier) ​​carried in the target task and the map to be processed into a structured message, and then send the structured message to the task processing system through the first access interface. In this case, the task processing system does not need to read the map to be processed from the map management system, avoiding frequent reading operations of the map management system and reducing the burden on the map management system. Of course, the demand management system can also add the map identification information corresponding to the map to be processed to the parameters carried by the target task, so that after receiving the message carrying the target task, the task processing system can obtain the corresponding map to be processed from the map management system according to the map identification information carried therein, and process the map to be processed. This method effectively reduces the amount of data in the communication messages between the demand management system and the task processing system, and reduces the risk of information loss.

[0078] It can be seen from the above embodiments that the technical solution of the present application sets a unified first access interface between the demand management system and the task processing system, so that different demand tasks triggered by the same user or different users can be sent to the task processing system through the unified first access interface. Users do not need to spend energy to query the access interface corresponding to the adaptation algorithm that matches the corresponding demand task for specific demand tasks or different demand tasks, which effectively improves the convenience of user operation, reduces the dependence on the user's professional knowledge in demand management and task processing, reduces the difficulty of demand management and task management, and effectively improves the efficiency of demand management and task management. At the same time, the task processing system can automatically call the algorithm that matches the received demand task (such as the aforementioned target task) to process the map to be processed, and return the obtained target task intelligence to the demand management system through the second access interface, thereby realizing efficient management of the target task intelligence, and overall improving the automation level of the processing flow of map-related tasks, reducing the probability of human errors, improving the efficiency and accuracy of processing map-related tasks, and ensuring the timeliness and reliability of map data updates.

[0079] In one embodiment, the demand management system can receive demand instructions initiated by multiple users, or the same user may also initiate multiple different demand instructions. In this case, the demand management system will create different demand tasks according to different demand instructions. In the case where the demand management system creates multiple demand tasks, the demand management system can send the demand tasks corresponding to each to-be-processed map to the task processing system through the first access interface according to the predefined sending rules. The predefined sending rules may include at least one of the following: sending each demand task according to a preset time interval, sending the current demand task (i.e., the target task) in response to the target task intelligence returned by the task processing system, and sending the target task at a preset time. Specifically, the technician can set a fixed time interval to constrain the sending frequency of each demand task as a target task, such as sending a demand task every 1 minute; or when the demand management system receives the target task intelligence for the previous demand task returned by the task processing system, it can send the current demand task (i.e., the target task) to be sent; it can also calculate in real time the time when the task processing system can carry the current demand task (i.e., the target task) to be sent according to the resource occupancy of the task processing system, and send the target task at that time. In the case where the map task processing platform includes a map management system and the task processing system needs to read the map to be processed from the map management system, the task processing platform can also read the map to be processed from the map management system based on the reading rules corresponding to the above-defined sending rules and perform corresponding processing. Figure 7 As shown, after the user initiates a demand instruction for the map to be processed, the demand management system can segment the map to be processed in the manner described in the above embodiment, and the map management system stores the segmented sub-maps. Afterwards, the task processing system can read the map to be processed corresponding to the target task from the map management system for processing based on predefined reading rules (such as timed reading, reading in response to obtaining target task intelligence, etc.).

[0080] Of course, the demand management system can also sort multiple demand tasks before sending them to the task processing system. For example, they can be sorted according to the priority order carried in the demand instructions initiated by the user, and the demand tasks with higher priorities can be sent to the task processing system first; they can also be sorted according to the data preparation status of the demand tasks. For example, if it is necessary to split the map A to be processed and the map B to be processed separately, if the demand management system completes the splitting of map B first, the demand task for map B to be processed can be sent to the task processing system as the target task first. The technicians can select the applicable sorting method according to the actual needs, and this application does not limit this. It should also be noted that the sending rules for multiple demand tasks recorded in the above embodiments are also applicable to the situation where the demand management system needs to send multiple subtasks.

[0081] It can be seen from the above embodiments that the demand management system sends multiple demand tasks to the task processing system based on predefined sending rules, which can reasonably arrange the task sending time and ensure that each task can be processed in a timely manner, thereby avoiding task blocking and improving the overall performance and reliability of the system.

[0082] Figure 8 FIG. 1 is a flowchart of another method for processing demand tasks based on a map, as shown in an exemplary embodiment of the present application. Figure 8 As shown, this method can be applied to Figure 1 The task processing system in the map task processing platform shown. The method may include the following steps:

[0083] Step 801, receiving a target task sent by the demand management system through a first access interface; wherein the target task is a demand task corresponding to a demand instruction initiated by a user for a map to be processed, and the demand management system sends different demand tasks through the first access interface.

[0084] Step 802, calling a target algorithm matching the target task to process the map to be processed, and obtaining target task intelligence for the target task; and returning the target task intelligence to the demand management system through a second access interface.

[0085] This embodiment describes the specific implementation process of the present application solution from the perspective of the task processing system in the map task processing platform. Figure 3 Corresponding to the technical solution from the perspective of the demand management system in the illustrated embodiment, the solution of the present application realizes a complete interactive process by cooperating between the demand management system and the task processing system in the map task processing platform. Figure 3 The descriptions of the embodiment shown in the figure in terms of determining and sending the target task, dividing the map to be processed and determining the corresponding subtasks, and returning the task intelligence, etc., are also applicable to Figure 5 The illustrated embodiments will not be described in detail here.

[0086] As mentioned above, in one embodiment, the demand management system can divide the map to be processed, determine K sub-maps, and send K sub-tasks for these K sub-maps to the task processing system. When the task processing system receives the K sub-tasks sent by the demand management system, it will process each sub-task separately to obtain the sub-task intelligence corresponding to each sub-task. Afterwards, the task processing system can return the obtained task intelligence to the demand management system in different ways.

[0087] In one method, the final target task intelligence is determined by the demand management system by integrating the received subtask intelligence, as described in the above embodiment for details. In another method, the final task intelligence is determined by the task processing system based on the received subtask intelligence, and the final target task intelligence is returned directly to the demand management system. For example, if the task processing system processes submap A1, it obtains subtask intelligence R1 corresponding to subtask T1, and processes submap A2 at the same time, it obtains subtask intelligence R2 corresponding to subtask T2. Thereafter, the task processing system can send R1 and R2 to the demand management system respectively through the second access interface, and the demand management system obtains the target task intelligence R based on R1 and R2; alternatively, the task processing system can obtain the target task intelligence R based on R1 and R2, and send the target task intelligence R to the demand management system through the second access interface.

[0088] In one embodiment, a plurality of different algorithms may be registered in the task processing system to process different required tasks and obtain different map intelligence. Any algorithm registered in the task processing system is a candidate algorithm, and any candidate algorithm may be determined as a target algorithm matching a target task.

[0089] Specifically, the technicians can upload the image files related to each candidate algorithm to the task processing system, and configure the operating environment of the algorithm container of the corresponding candidate algorithm through each image file. Fig. 9 As shown, when adding an image file, at least one of the information such as the image repository recording the image address, the image tag marking the image characteristics, the image type representing the algorithm type, and the person in charge can be set in the form of a form. At the same time, the technician can also configure each registered candidate algorithm in the form of a form in the task processing system to clarify any one or more of the information such as the algorithm identification information, algorithm function description information, algorithm name, algorithm process type, and resource code of each candidate algorithm, such as Fig.10As shown. Among them, any candidate algorithm has unique algorithm identification information, and the target algorithm identification is the identification information of the target algorithm matching the target task. The task processing system can identify the target algorithm to be called from multiple candidate algorithms according to the target algorithm identification. The algorithm function description information is used to indicate the functions that can be realized by the corresponding algorithm, such as access control mining function, speed limit sign mining function, etc. For each candidate algorithm, the algorithm flow it executes may be different. For example, for the algorithm for mining speed limit signs, its possible execution flow is: first identify all signs, and then filter out the signs indicating the speed limit from all signs. Then in this algorithm flow, the second step depends on the execution result of the first step. The second step must be executed after the first step is executed. Then the algorithm flow of the algorithm is a serial flow, as shown in Figure 11 (1). The tasks in the flow are serial. The execution of task2 is based on the result of task1, and the execution of task3 is based on the result of task2. Similarly, if there is no dependency between the steps in an algorithm, then the algorithm flow of the algorithm is a parallel flow, as shown in Figure 11(2), task2, task3 and task4 can be executed simultaneously. In addition, there are algorithms that only contain a single step, as shown in Figure 11(3); and algorithms whose steps form a directed acyclic graph, as shown in Figure 11(4). Here, algorithms with any of the above algorithm flows can be registered in the task processing system as candidate algorithms. When any candidate algorithm is determined as the target algorithm, the target algorithm adopts the corresponding algorithm flow, that is, the algorithm flow of the target algorithm can be the above Figure 11(1) to Figure 11(4) Any of the processes shown.

[0090] At the same time, since each candidate algorithm actually runs in an algorithm container, and each algorithm container is deployed in a Kubernetes (or k8s) cluster, when configuring the candidate algorithm, a resource code is also required to indicate which machines in the cluster the algorithm container that can run the candidate algorithm is deployed on. Fig.12 As shown in the figure, after the demand management system sends the demand task to the task processing system, its own configured task scheduler can coordinate and schedule each demand task, determine the machine node in the Kubernetes cluster that can process the demand task, and schedule the corresponding demand task to the machine node. For any machine node, the algorithm container deployed inside it can process the received demand task and send the obtained target task intelligence to the demand management system.

[0091] In one embodiment, any candidate algorithm registered in the task processing system may be deployed in only one algorithm container or in multiple different algorithm containers; at the same time, different candidate algorithms may be deployed in the same algorithm container or in different algorithm containers. For example, a gate mining algorithm is registered in the task processing system, and the gate mining algorithm may be deployed in only algorithm container A, or may be deployed in multiple different algorithm containers such as algorithm container A, algorithm container B, and algorithm container C; at the same time, for any algorithm container, such as algorithm container A, there may be only a gate mining algorithm deployed therein, or other algorithms may be deployed at the same time, such as a speed limit sign mining algorithm. Technicians may set the deployment method of the candidate algorithm according to actual conditions (such as the storage capacity and computing performance of the algorithm container), and this application does not limit this.

[0092] When any candidate algorithm is determined as the target algorithm and the target algorithm is deployed in multiple different algorithm containers, multiple algorithm containers in which the target algorithm is deployed can be determined, and the target algorithms in these algorithm containers are called to process the map to be processed. It is understandable that if the area covered by the map to be processed is large, or contains a large amount of map intelligence, the corresponding target task will consume a lot of time and computing resources, which will not only delay the completion time of the target task, but also aggravate the tension of computing resources. In this case, the map to be processed can be split into multiple sub-maps, and the same sub-tasks can be created for these multiple sub-maps, so that the task processing system can process each sub-map separately. When the map to be processed is split into multiple sub-maps and processed in different algorithm containers, each sub-task can be executed in parallel, which reduces the time required for the target task as a whole and significantly improves the processing efficiency of map intelligence. At the same time, the sub-tasks do not interfere with each other. In the case of an error in any sub-task, only the sub-task can be re-executed, and other sub-tasks can still be executed normally, which improves the fault tolerance and stability of the map task processing platform.

[0093] As can be seen from the above embodiments, the task processing system can automatically call the algorithm that matches the received demand task (such as the aforementioned target task) to process the map to be processed, and return the obtained target task intelligence to the demand management system through the second access interface, thereby realizing efficient management of the target task intelligence. By cooperating with the demand management system, the overall automation level of the processing flow of map-related tasks is improved, the probability of human errors is reduced, the efficiency and accuracy of processing map-related tasks are improved, and the timeliness and reliability of map data updates are guaranteed.

[0094] Fig.13 This is a schematic diagram of a computer device provided by an exemplary embodiment. Fig.13 At the hardware level, the computer device includes a processor 1302, an internal bus 1304, a network interface 1306, a memory 1308, and a non-volatile memory 1310, and may also include hardware required for other services. The processor 1302 reads the corresponding computer program from the non-volatile memory 1310 into the memory 1308 and then runs it, forming a map task processing platform at the logical level. Of course, in addition to the software implementation, this application does not exclude other implementation methods, such as logic devices or a combination of software and hardware, etc., that is to say, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0095] Correspondingly, the present application also provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the map-based demand task processing method described in any of the above embodiments is implemented.

[0096] Accordingly, the present specification also provides a computer program product, including a computer program / instruction, which implements the steps of the method described in any of the above embodiments when executed by a processor.

[0097] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer, which may be in the form of a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email transceiver, a game console, a tablet computer, a wearable device or a combination of any of these devices.

[0098] In a typical configuration, a computer includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0099] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0100] Computer-readable media include permanent and non-permanent, removable and non-removable media that can be used to store information by any method or technology. Information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, disk storage, quantum memory, graphene-based storage media or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include temporary computer-readable media (transitory media), such as modulated data signals and carrier waves.

Claims

1. A map-based demand task processing method, characterized in that: The method comprises: In response to a demand instruction initiated by a user for a map to be processed, a target task is sent to a task processing system through a first access interface; wherein the target task is a demand task indicated by the demand instruction, and different demand tasks are sent to the task processing system through the first access interface; Receive target task intelligence returned by the task processing system for the target task through the second access interface, where the target task intelligence is obtained by processing the map to be processed through a target algorithm matching the target task.

2. The method according to claim 1, characterized in that: The step of responding to a user's demand instruction for a map to be processed, sending a target task to a task processing system through a first access interface, includes: In response to a demand instruction initiated for a map to be processed, K sub-maps obtained by segmenting the map to be processed are determined; and sub-tasks corresponding to each sub-map are determined according to the demand instruction to obtain K sub-tasks, where K is an integer not less than 1; Sending the K subtasks to the task processing system through the first access interface; Receiving target task intelligence returned by the task processing system for the target task through the second access interface includes: Receive subtask intelligence returned by the task processing system through the second access interface for each of the K subtasks, and obtain the target task intelligence based on the received subtask intelligence; or, receive target task intelligence returned by the task processing system through the second access interface, the target task intelligence is determined by the task processing system based on the subtask intelligence corresponding to each of the K subtasks.

3. The method according to claim 2, characterized in that The step of determining, in response to a demand instruction initiated for a map to be processed, K sub-maps obtained by segmenting the map to be processed comprises: According to at least one data processing information of the map attribute feature of the map to be processed, the preset map segmentation feature, and the personalized map segmentation feature indicated by the user, the map to be processed is segmented to obtain K sub-maps; wherein the map attribute feature includes at least one of the area, shape, administrative district feature, and landform feature of the map to be processed; the preset map segmentation feature includes at least one of the preset number of first sub-maps, the area of ​​the first sub-map, and the size of the first sub-map; and the personalized map segmentation feature includes at least one of the number of second sub-maps, the area of ​​the second sub-map, and the size of the second sub-map indicated by the user for the map to be processed; and / or In response to at least one map area selection operation triggered by a user through a displayed map to be processed, the map areas selected by each map area selection operation are respectively determined as the sub-maps.

4. The method according to claim 2, characterized in that: The subtasks corresponding to each submap are determined according to the demand instruction to obtain K subtasks, including: Determine the target task indicated by the demand instruction as the subtask corresponding to each submap; or The required tasks indicated by the user for each subtask are determined as the subtasks corresponding to each submap.

5. The method according to any one of claims 1 to 4, characterized in that: Applied to a demand management system, the task processing system has multiple candidate algorithms registered, and the demand management system maintains functional description information of each candidate algorithm; the method further includes: Determine a target algorithm identifier according to the function description information, wherein the target algorithm identifier is identification information of a target algorithm matching the target task; The target algorithm identifier is sent to the task processing system through the first access interface, so that the task processing system determines the target algorithm from multiple candidate algorithms.

6. A map-based demand task processing method, characterized in that: include: Receiving a target task sent by the demand management system through a first access interface; wherein the target task is a demand task corresponding to a demand instruction initiated by a user for a map to be processed, and the demand management system sends different demand tasks through the first access interface; The target algorithm matching the target task is called to process the map to be processed to obtain target task intelligence for the target task; and the target task intelligence is returned to the demand management system through a second access interface.

7. The method according to claim 6, characterized in that The receiving of the target task sent by the demand management system through the first access interface includes: receiving K subtasks sent by the demand management system through the first access interface, wherein the K subtasks are determined by the demand management system in response to the demand instruction initiated for the map to be processed, and the K subtasks are demand tasks corresponding to K submaps obtained by segmenting the map to be processed, and K is an integer not less than 1; The calling of a target algorithm matching the target task to process the map to be processed, obtaining target task intelligence for the target task, and returning the target task intelligence to the demand management system through a second access interface includes: Call the target sub-algorithm that matches each of the K sub-tasks to process the corresponding sub-task and obtain the sub-task intelligence corresponding to each sub-task; Return the subtask information corresponding to each subtask to the demand management system through the second access interface; or, determine the target task information based on the subtask information corresponding to each subtask in the K subtasks, and return the target task information to the demand management system through the second access interface.

8. The method according to claim 6, characterized in that Applied to a task processing system, wherein a plurality of candidate algorithms are registered in the task processing system, and the demand management system maintains functional description information of each candidate algorithm; Before calling the target algorithm matching the target task to process the map to be processed and obtaining the target task intelligence for the target task, the method further includes: Receiving a target algorithm identifier sent by the demand management system through the first access interface, wherein the target algorithm identifier is determined by the demand management system according to the function description information, and the target algorithm identifier is identification information of a target algorithm matching the target task; A candidate algorithm that matches the target algorithm identifier among multiple candidate algorithms is determined as a target algorithm that matches the target task.

9. The method according to claim 7, characterized in that: The target algorithm is deployed in M ​​algorithm containers, where M is an integer not less than 1; calling the target algorithm matching the target task to process the map to be processed includes: The target algorithm is called from the M algorithm containers in which the target algorithm is deployed to process the map to be processed.

10. A map task processing platform, characterized in that: It includes demand management system and task processing system; among them, The demand management system is used to: respond to a demand instruction initiated by a user for a map to be processed, and send a target task to the task processing system through a first access interface; wherein the target task is a demand task corresponding to the demand instruction, and different demand tasks are sent to the task processing system through the first access interface; The task processing system is used to: call a target algorithm matching the target task to process the map to be processed to obtain target task intelligence for the target task; and return the target task intelligence to the demand management system through a second access interface.

11. A computer device, characterized in that: include: processor; a memory for storing processor-executable instructions; The processor is configured to implement the method of any one of claims 1-5 or 6-9.

12. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps of the method described in any one of claims 1 to 5 or 6 to 9 are implemented.