Method and device for configuring regional information in map, storage medium and electronic device

Automatically configure the information of the new area of ​​the mobile robot through the region matching degree, the inefficiency problem caused by manual reconfiguration of the new area information in the existing technology is solved, and the configuration efficiency and user experience are improved.

CN119025600APending Publication Date: 2024-11-26DREAM INNOVATION TECH (SUZHOU) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310565389.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-18
Publication Date
2024-11-26

AI Technical Summary

Technical Problem

In the prior art, when a mobile robot generates a new area when the environment changes, the user needs to manually reconfigure the area information, resulting in low efficiency in configuration of the area information and affecting the user experience.

Method used

By determining the matching degree of the area in the reference map and the map to be matched, the information of the reference area to the area to be matched is automatically configured, and the information configuration of the new partition map is used to reduce the need for manual configuration.

Benefits of technology

It improves the efficiency of regional information configuration, reduces the amount of regional information manually configured, and improves the intelligence and user experience of mobile robots.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119025600A_ABST
    Figure CN119025600A_ABST
Patent Text Reader

Abstract

The invention provides an area information configuration method and device in a map, a storage medium and an electronic device.The method comprises the steps that a set of reference areas in a reference map and a set of to-be-matched areas in a to-be-matched map are determined, and the reference map and the to-be-matched map are different maps corresponding to a target area; according to a region matching degree between a reference region in the group of reference regions and a to-be-matched region in the group of to-be-matched regions, determining a group of matching region pairs, each matching region pair in the group of matching region pairs comprising a reference region belonging to the group of reference regions and a to-be-matched region belonging to the group of to-be-matched regions; and configuring the specified area information of the reference area in each matching area pair to the matched to-be-matched area. Through the method and the device, the problem of low regional information configuration efficiency caused by manual reconfiguration of the regional information of the new region in a regional information configuration method in a map in the related technology is solved.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present application relates to the field of smart home, and more specifically, to a method and device for configuring area information in a map, a storage medium, and an electronic device. [Background technology]

[0002] At present, the working range of a mobile robot is usually determined by the various areas set in the map of the mobile robot, and the area information of each area (such as the order of executing work, etc.) can be set by the user. The various areas in the map can be manually set and planned by the user, or they can be determined by the mobile robot itself. In the event of changes in the environment or other situations where the area needs to be updated, the mobile robot can generate a new area based on the current environment detected during the task.

[0003] In the related art, since there is no area information in the generated new area, for example, area information manually set by the user, the user is usually required to manually re-enter the area information, which results in low efficiency of information configuration of the mobile robot and affects the user experience.

[0004] It can be seen from this that the method for configuring area information in a map in the related art has the problem of low efficiency of area information configuration because the area information of a new area needs to be manually reconfigured. [Summary of the invention]

[0005] The purpose of the present application is to provide a method and device for configuring area information in a map, a storage medium and an electronic device, so as to at least solve the problem of low efficiency of area information configuration in the method for configuring area information in a map in the related art due to the need to manually reconfigure the area information of the new area.

[0006] The purpose of this application is to achieve the following technical solutions:

[0007] According to one aspect of an embodiment of the present application, a method for configuring area information in a map is provided, comprising: determining a group of reference areas in a reference map and a group of to-be-matched areas in a to-be-matched map, wherein the reference map and the to-be-matched map are different maps corresponding to a target area; determining a group of matching area pairs according to the degree of area matching between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas, wherein each matching area pair in the group of matching area pairs includes a reference area belonging to the group of reference areas and a to-be-matched area belonging to the group of to-be-matched areas; and configuring the specified area information of the reference areas in each matching area pair to the matching to-be-matched areas.

[0008] According to another aspect of an embodiment of the present application, a device for configuring area information in a map is also provided, including: a first determination unit, used to determine a group of reference areas in a reference map and a group of to-be-matched areas in a to-be-matched map, wherein the reference map and the map to be matched are different maps corresponding to the target area; a second determination unit, used to determine a group of matching area pairs according to the area matching degree between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas, wherein each matching area pair in the group of matching area pairs includes a reference area belonging to the group of reference areas and a to-be-matched area belonging to the group of to-be-matched areas; a configuration unit, used to configure the specified area information of the reference areas in each matching area pair to the matching to-be-matched areas.

[0009] According to another aspect of the embodiment of the present application, a computer-readable storage medium is provided, in which a computer program is stored, wherein the computer program is configured to execute the above-mentioned method for configuring area information in the map when running.

[0010] According to another aspect of an embodiment of the present application, an electronic device is also provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the method for configuring area information in the map through the computer program.

[0011] In an embodiment of the present application, a method of automatically configuring regional information based on regional matching relationships in different maps of the same area is adopted to determine a group of reference areas in the reference map and a group of to-be-matched areas in the to-be-matched map, wherein the reference map and the to-be-matched map are different maps corresponding to the target area; a group of matching area pairs is determined according to the regional matching degree between the reference area in a group of reference areas and the to-be-matched area in a group of to-be-matched areas, wherein each matching area pair in a group of matching area pairs includes a reference area belonging to a group of reference areas and a to-be-matched area belonging to a group of to-be-matched areas; the specified area information of the reference area in each matching area pair is configured to the matching to-be-matched area, since the historical map partition of the same area has a reference to the current map partition The invention discloses a method for configuring the regional information of a partition in a new partition map (i.e., a map to be matched), by performing regional matching between the partition in the old partition map (i.e., the reference area) and the partition in the new partition map, a matching area pair with a matching relationship is determined, each matching area pair includes a partition belonging to the old partition map and a partition belonging to the new partition map, and the regional information of the partition in the old partition map can be configured to the corresponding partition in the old partition map based on the matching relationship between the partitions, thereby reducing the need for manual configuration of regional information and achieving the technical effect of improving the efficiency of regional information configuration, thereby solving the problem of low efficiency of regional information configuration caused by the need to manually reconfigure the regional information of the new area in the method for configuring regional information in the map in the related art.

Brief Description of the Drawings

[0012] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0013] 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, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0014] Figure 1 is a schematic diagram of a hardware environment of an optional method for configuring area information in a map according to an embodiment of the present application;

[0015] Figure 2 is a flowchart of an optional method for configuring area information in a map according to an embodiment of the present application;

[0016] Figure 3 is a schematic diagram of an optional method for configuring area information in a map according to an embodiment of the present application;

[0017] Figure 4 is a schematic diagram of another optional method for configuring area information in a map according to an embodiment of the present application;

[0018] Figure 5 is a schematic diagram of another optional method for configuring area information in a map according to an embodiment of the present application;

[0019] Figure 6 is a schematic diagram of another optional method for configuring area information in a map according to an embodiment of the present application;

[0020] Figure 7 is a schematic diagram of another optional method for configuring area information in a map according to an embodiment of the present application;

[0021] Figure 8 is a schematic diagram of another optional method for configuring area information in a map according to an embodiment of the present application;

[0022] Fig. 9 is a schematic diagram of another optional method for configuring area information in a map according to an embodiment of the present application;

[0023] Fig.10 is a structural block diagram of an optional device for configuring area information in a map according to an embodiment of the present application;

[0024] Fig.11 It is a structural block diagram of an optional electronic device according to an embodiment of the present application. [Specific implementation method]

[0025] The present application will be described in detail below with reference to the accompanying drawings and in combination with embodiments. It should be noted that the embodiments and features in the embodiments of the present application can be combined with each other without conflict.

[0026] It should be noted that the terms "first", "second", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0027] According to one aspect of an embodiment of the present application, a method for configuring area information in a map is provided. Optionally, in this embodiment, the method for configuring area information in a map can be applied to Figure 1 In the hardware environment including the mobile robot 102, the terminal device 104 and the server 106 shown in FIG. Figure 1 As shown, the mobile robot 102 can be connected to the terminal device 104 and / or the server 106 (e.g., a voice cloud platform) through a network to achieve interaction between the mobile robot 102 and the terminal device 104 and / or the server 106.

[0028] The above-mentioned network may include but is not limited to at least one of the following: wired network, wireless network. The above-mentioned wired network may include but is not limited to at least one of the following: wide area network, metropolitan area network, local area network, and the above-mentioned wireless network may include but is not limited to at least one of the following: WIFI (Wireless Fidelity), Bluetooth, infrared. The network used by the mobile robot 102 to communicate with the terminal device 104 and / or the server 106 and the network used by the terminal device 104 to communicate with the server 106 may be the same or different. The mobile robot 102 may include but is not limited to: cleaning robots, such as sweeping robots, floor washing robots, robots that combine washing and sweeping, self-cleaning robots, etc., delivery robots, such as food delivery robots, object delivery robots, etc., and other types of movable robots.

[0029] The method for configuring area information in a map according to the embodiment of the present application may be executed by any one of the mobile robot 102, the terminal device 104, and the server 106 alone, or may be executed by at least two of the mobile robot 102, the terminal device 104, and the server 106 together. The method for configuring area information in a map according to the embodiment of the present application may be executed by the mobile robot 102 or the terminal device 104, or may be executed by a client installed thereon.

[0030] Taking the method for configuring area information in a map in this embodiment executed by the terminal device 104 as an example, Figure 2 is a flow chart of an optional method for configuring area information in a map according to an embodiment of the present application, such as Figure 2 As shown, the process of the method may include the following steps:

[0031] Step S202: determining a group of reference areas in the reference map and a group of to-be-matched areas in the to-be-matched map, wherein the reference map and the to-be-matched map are different maps corresponding to the target area.

[0032] The method for configuring regional information in a map in this embodiment can be applied to a scenario where a mobile robot configures map information of a generated new regional map. The new regional map can be a regional map generated by the mobile robot based on the collected regional environment. The old regional map corresponding to the new regional map can be a regional map used by the mobile robot before the new regional map is generated. It can be a regional map generated based on the regional environment collected by the mobile robot, or it can be a regional map configured by the user of the mobile robot. For other scenarios where regional information configuration is required (not limited to regional maps used by mobile robots), the method for configuring regional information in a map provided in this embodiment is also applicable.

[0033] The area map can be divided into multiple partitions, that is, the area map can contain multiple areas. In this case, the new area map can be a new partition map, the old area map can be an old partition map, and the area can be a range where the mobile robot can move or needs to perform tasks. Taking a room as an example, the area can include but is not limited to at least one of the following: bedroom, living room, dining room, etc. From a functional perspective, the mobile robot can be the aforementioned cleaning robot, delivery robot, etc. From a morphological perspective, the mobile robot can be a bionic robot, for example, a quadruped robot, a crawling robot, etc., which is not limited in this embodiment.

[0034] In the related art, the working range of a mobile robot is usually determined by various areas set in a map of the mobile robot, and the area information of each area (such as the order of executing work, etc.) can be specified by the user. After generating a new area map, if the mobile robot is required to perform the corresponding task with the previously specified area information, the user is generally required to input the area information again, resulting in low efficiency of area information configuration and affecting the user experience.

[0035] In order to at least partially solve the above problems, in this embodiment, the new partitions in the new partition map can be area matched with the old partitions in the old partition map, and based on the matching results, the area information of the old partitions in the old partition map can be configured to the corresponding new partitions in the new partition map. Since the above process is automatically completed by the machine, the amount of area information that needs to be manually configured can be reduced, thereby improving the efficiency of area information configuration and further improving the intelligence level of the mobile robot.

[0036] The new partition map and the old partition map can be generated based on the collected regional environment information, or they can be obtained by manually configuring the partitions. For the scenario of manually input partition maps, the new partition map and the old partition map can also be called the true partition map and the current partition map (the true partition map is the partition map input manually). The generation operation of the regional map can be triggered by the mobile robot after each task, or it can be triggered manually, and this embodiment does not limit this.

[0037] In this embodiment, when it is necessary to configure the area information of the area to be matched in the map to be matched, the reference map and the map to be matched can be obtained first, the reference map can be an old area map, and the map to be matched can be a new area map; then, a group of reference areas in the reference map and a group of areas to be matched in the map to be matched are determined. Here, the reference map and the map to be matched are different maps corresponding to the target area. In other words, the two are different partition maps of the same area. The target area can be the working range area of ​​the mobile robot, such as a house, a shopping mall, etc. A group of reference areas can be a group of reference partitions in the reference map determined according to the partition information of the reference map, and a group of areas to be matched can be a group of partitions to be matched in the map to be matched determined according to the partition information of the map to be matched. Here, a group of reference areas in the reference map can be determined based on the scanned obstacle information and the received partition configuration information, and a group of areas to be matched can also be determined based on the scanned obstacle information and the received partition configuration information, which is not limited in this embodiment.

[0038] Step S204, determining a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas, wherein each matching area pair in the group of matching area pairs includes a reference area belonging to the group of reference areas and a to-be-matched area belonging to the group of to-be-matched areas.

[0039] In this embodiment, since a group of reference areas and a group of areas to be matched are obtained by dividing different area maps of the same area, there can be multiple positional relationships between the reference areas in a group of reference areas and the areas to be matched in a group of areas to be matched, for example, the reference areas and the areas to be matched completely overlap, the reference areas and the areas to be matched partially overlap, and the reference areas and the areas to be matched do not overlap at all. Based on the positional relationship between different reference areas and different areas to be matched, the area matching degree between each reference area and each area to be matched can be determined. Here, the area matching degree can be the area area of ​​the overlapping area between two areas, or the ratio between the area area of ​​the overlapping area between two areas and the area area of ​​at least one area, or other ways of determining the area matching degree, which are not limited in this embodiment.

[0040] According to the area matching degree between the reference area in a group of reference areas and the to-be-matched area in a group of to-be-matched areas, a group of matching area pairs can be determined. Here, each matching area pair contains two areas with a matching relationship, one of which is the reference area, and the other is the to-be-matched area. The reference areas in different matching area pairs are different from each other, and the to-be-matched areas are also different. The number of matching area pairs contained in a group of matching area pairs can be one or more, which is not limited in this embodiment.

[0041] Optionally, the regional matching degree between the reference area and the area to be matched can be of two kinds, which can be the regional matching degree of the area to be matched relative to the reference area, or the regional matching degree of the reference area relative to the area to be matched, and the two can be the same or different. For example, if the regional matching degree is the area of ​​the overlapped area, then the two regional matching degrees are the same. For another example, if the regional matching degree is the ratio between the area of ​​the overlapped area and the area of ​​the corresponding area, then the two regional matching degrees are generally different (this is because the area of ​​the reference area is generally different from the area of ​​the area to be matched).

[0042] There are many ways to determine a set of matching area pairs based on the regional matching between the reference area and the area to be matched. For example, the area to be matched with the highest regional matching degree with a reference area in a set of areas to be matched can be selected as a matching area pair. If a to be matched area is the area to be matched with the highest matching degree among multiple reference areas, it can be used as the area to be matched that matches the reference area with the largest area. For another example, a reference area with the highest regional matching degree with a to be matched area in a set of reference areas is selected as a matching area pair, and the other processing logic is similar. For another example, a reference area and an area to be matched with the highest regional matching degree can be selected as a matching area pair. The reference area in a matching area pair is a reference area in a set of reference areas with the highest regional matching degree with the area to be matched in the same matching area pair, and the area to be matched in the same matching area pair is also a to be matched area in a set of areas to be matched with the highest regional matching degree with the reference area. In addition, a mapping relationship between a set of reference regions and a set of regions to be matched may be determined to obtain a plurality of possible region matching results, and a final region matching result may be selected by evaluating different region matching results, thereby determining a set of matching region pairs according to the mapping relationship indicated by the final region matching result. In this embodiment, the method for determining the matching region pairs is not limited.

[0043] It should be noted that the goal of determining the matching area pair is to find two partitions that may have a corresponding relationship in two different partition maps corresponding to the same area. Therefore, any area matching method based on the above goal can be applied to this embodiment.

[0044] Optionally, in order to avoid the same reference area matching multiple areas to be matched or the same area to be matched matching multiple reference areas, the reference areas in a group of reference areas can be sorted, and the reference areas are selected in turn as the current reference areas according to the sorting results to perform the operation of selecting a matching area to be matched from a group of areas to be matched, or the areas to be matched in a group of areas to be matched can be sorted, and the areas to be matched are selected in turn as the current areas to be matched according to the sorting results to perform the operation of selecting a matching reference area from a group of reference areas. The above-mentioned sorting method can be sorting according to area area, for example, sorting a group of reference areas and / or a group of areas to be matched in order from large to small area area, or sorting according to position in a partition map, for example, sorting a group of reference areas and / or a group of areas to be matched in order from left to right and from top to bottom according to area position, or other sorting methods can be used, which are not limited in this embodiment.

[0045] Step S206: assigning the designated area information of the reference area in each matching area pair to the matching area to be matched.

[0046] The reference area in each matching area pair is a set of reference areas corresponding to the area to be matched in the same matching area pair. Then, the area information configured for it can be used as the area information of the area to be matched in the same matching area pair. Therefore, the designated area information of the reference area in each matching area pair can be configured to the matching area to be matched. Here, the designated area information can be any area information that is not configured in the area to be matched, such as area number, area nickname, area remarks, area parameters (such as area color, etc.), area association information, etc.

[0047] Optionally, when configuring the designated area information of the reference area in each matching area pair to the matching area to be matched, the designated area information configured to be displayed in the area to be matched in the map to be matched displayed on the target device can be controlled, and when receiving the area information configuration instruction returned by the target device, the area information of at least one area to be matched can be configured according to the area information indicated by the area information configuration instruction. Here, at least one area to be matched can include areas to be matched that belong to a set of matching area pairs, and can also include areas to be matched that do not belong to a set of matching area pairs, thereby improving the flexibility and completeness of the area information configuration.

[0048] It should be noted that a set of reference areas may include reference areas that do not belong to any matching area pair, and such reference areas may be considered as lost areas. A set of to-be-matched areas may include to-be-matched areas that do not belong to any matching area pair, and such to-be-matched areas may be considered as newly added areas. The lost areas and newly added areas may be marked with special marks to distinguish the areas belonging to a set of matching area pairs. In addition, the area information of the newly added areas may be configured by the user, which is not limited in this embodiment.

[0049] For example, when matching rooms in two partition maps, two partition maps (old partition map and new partition map, or true partition map and current partition map) are input on the terminal device, and the partitions in the two partition maps are matched to obtain the corresponding matching relationship between the rooms in the two partition maps. For example, the old room A corresponds to the new room A, the old room B corresponds to the new room C, the old room C corresponds to the new room D, and so on.

[0050] It should be noted that, although in the present embodiment, region matching is performed by selecting a reference region and matching it with the region to be matched in sequence, region matching can also be performed by selecting a region to be matched and matching it with the reference region in sequence. The matching process is similar, as long as the reference region and the region to be matched that have a matching relationship can be found.

[0051] Through the above steps S202 to S206, a group of reference areas in the reference map and a group of to-be-matched areas in the to-be-matched map are determined, wherein the reference map and the to-be-matched map are different maps corresponding to the target area; a group of matching area pairs are determined according to the area matching degree between the reference areas in a group of reference areas and the to-be-matched areas in a group of to-be-matched areas, wherein each matching area pair in a group of matching area pairs includes a reference area belonging to a group of reference areas and a to-be-matched area belonging to a group of to-be-matched areas; the specified area information of the reference area in each matching area pair is configured to the matching to-be-matched area, thereby solving the problem of low efficiency of area information configuration due to the need to manually reconfigure the area information of the new area in the area information configuration method in the related art, thereby improving the efficiency of area information configuration.

[0052] In an exemplary embodiment, determining a set of matching area pairs according to the area matching degree between a reference area in a set of reference areas and an area to be matched in a set of areas to be matched includes:

[0053] S11, determining a group of matching region pairs according to the overlapping areas between the reference regions in a group of reference regions and the to-be-matched regions in a group of to-be-matched regions.

[0054] In this embodiment, before determining a set of matching region pairs, the region matching degree (for example, region overlapping area) between each reference region and each region to be matched may be determined in sequence, so that the subsequent operation of determining the matching region pairs may be performed based on the region matching degree between each reference region and each region to be matched. The region matching degree may be the region overlapping area. When determining a set of matching region pairs, a set of matching region pairs may be determined based on the region overlapping area between the reference region in a set of reference regions and the region to be matched in a set of regions to be matched.

[0055] Optionally, the reference regions in a group of reference regions may be sorted in descending order of area area to obtain a reference region sequence, and the to-be-matched regions in a group of to-be-matched regions may be sorted in descending order of area area to obtain a to-be-matched region sequence; and the regional matching degree (for example, the regional overlapping area) between each reference sequence in the reference region sequence and each to-be-matched region in the to-be-matched region sequence is calculated in sequence. The obtained regional matching degrees may be saved as a regional matching degree matrix or other types of data structures, so as to determine a group of matching region pairs based on the saved regional matching degrees.

[0056] For example, Figure 3 As shown, the old partition map (gt_img, Figure 3 The partition map on the left in the figure) contains 8 old room partitions, and the new partition map (my_img, Figure 3 The partition map on the right in the figure contains 7 new room partitions. The overlapping area of ​​each old room partition and each new room partition can be calculated in advance. The calculated overlapping area can be shown in Table 1:

[0057] Table 1

[0058]

[0059] Through this embodiment, the overlapping area of ​​the regions can be used as the region matching degree to determine the matching region pair. Compared with other characterization parameters of the region matching degree (for example, combining the region position, the region center point position, etc.), the efficiency of region matching can be improved, and the convenience of region matching can be improved.

[0060] In an exemplary embodiment, a set of matching area pairs can be determined in a variety of ways, including but not limited to one of the following: taking the reference area and the area to be matched that has the highest area match with the current reference area and has not matched any reference area as a matching area pair, and taking the reference area and the area to be matched that have the greatest area match with each other as a matching area pair.

[0061] As an optional implementation manner, determining a set of matching area pairs according to the area matching degree between the reference area in the set of reference areas and the to-be-matched area in the set of to-be-matched areas includes:

[0062] S21, determining each reference region in a group of reference regions and the unmatched region with the highest region matching degree with each reference region in order from large to small in area as a matching region pair, thereby obtaining a group of matching region pairs.

[0063] In this embodiment, each reference area can be used as the current reference area in order from large to small in area area to determine the area to be matched with it, that is, the unmatched area with the largest area matching degree (for example, area overlap area) with the current reference area is determined as a matching area pair, where the unmatched area is an area to be matched that has not been matched with any reference area. If the area matching degree of a reference area with all the remaining areas to be matched is less than a specified matching degree threshold (which can be 0 or other values), there is no matching area to be matched in the reference area. By determining the areas to be matched that match each reference area in turn, the above-mentioned set of matching area pairs can be obtained. The above-mentioned method of determining a set of matching area pairs is the first area matching scheme.

[0064] For example, for the old partition map and the new partition map as shown in Table 1, sort the room area of ​​each old room partition from large to small, and search in turn for the new room partition with the largest overlapping area with each old room partition and that has not been used as a matching room pair. The resulting matching area pairs include: old room partition 2-new room partition 1, old room partition 5-new room partition 7, old room partition 4-new room partition 6, old room partition 3-new room partition 3, old room partition 7-new room partition 5, old room partition 8-new room partition 2, among which old room partition 1, old room partition 6 and new room partition 4 are the remaining unmatched areas.

[0065] As another optional implementation, determining a set of matching area pairs according to the area matching degree between a reference area in a set of reference areas and a to-be-matched area in a set of to-be-matched areas includes:

[0066] S22, determining each region pair of a reference region and a region to be matched with the maximum region matching degree among a group of reference regions and a group of regions to be matched as a matching region pair, thereby obtaining a group of matching region pairs.

[0067] In this embodiment, the to-be-matched region with the highest regional matching degree with each reference region and the reference region with the highest regional matching degree with each to-be-matched region can be determined respectively, and the reference region and the to-be-matched region with the highest regional matching degree with each other are determined as a matching region pair, and a group of matching region pairs is obtained, that is, the reference region in a matching region pair is the reference region with the highest regional matching degree with the to-be-matched region in the same regional matching pair, and the to-be-matched region with the highest regional matching degree with the reference region is the to-be-matched region in the same regional matching pair. The above method of determining a group of matching region pairs is the second regional matching scheme.

[0068] For example, the room pairs with the largest overlapping areas can be used as matching room pairs. For the old partition map and the new partition map shown in Table 1, sort the room areas of each old room partition from large to small, and search for the new room partitions with the largest overlapping areas with each old room partition as matching room pairs in turn. The matching area pairs obtained include: old room partition 5-new room partition 1, old room partition 4-new room partition 6, old room partition 3-new room partition 3, old room partition 1-new room partition 7, old room partition 7-new room partition 5, old room partition 8-new room partition 2, where old room partition 2, old room partition 6 and new room partition 4 are the remaining unmatched areas.

[0069] Through this embodiment, a plurality of region matching methods are used to perform region matching on the reference region and the region to be matched, which can improve the flexibility of region matching. Meanwhile, the amount of calculation required for performing the region matching is small.

[0070] In an exemplary embodiment, determining a set of matching area pairs according to the area matching degree between a reference area in a set of reference areas and an area to be matched in a set of areas to be matched includes:

[0071] S31, performing the following region matching operation on a reference region in a group of reference regions as a current reference region in descending order of region area: when there is a first target region satisfying a region matching condition in a group of regions to be matched, determining the current reference region and the first target region as a matching region pair.

[0072] The first area matching scheme and the second area matching scheme have the advantage of low computational complexity and can be applied to scenes with little partition change, but both have the possibility of matching errors, that is, the determined matching area pair is a local optimal solution (matching errors may occur in some scenes, such as the scene where the dividing line between the living room and the dining room moves). For example, the following situations cannot be avoided: Figure 3As shown, Room 2 in the left image and Room 1 in the right image may have the largest overlapping area (for the first area matching solution), or may have the largest overlapping area with each other (for the second area matching solution), and thus are mistakenly identified as a matching room pair.

[0073] In order to improve the accuracy of region matching, in this embodiment, on the basis of the above-mentioned second region matching scheme, a limiting condition of the matching degree threshold can be added, that is, a first matching degree threshold is pre-specified, and each region pair in a group of reference regions and a group of regions to be matched whose region matching degrees are the maximum and whose region matching degrees reach the set first matching degree threshold is determined as a matching region pair, thereby obtaining a group of matching region pairs.

[0074] Optionally, when determining a set of matching area pairs, area matching can be performed on each reference area in order from large to small in area area to determine whether there is an area to be matched that matches it. That is, each reference area can be used as the current reference area in order from large to small in area area to perform the following area matching operation to determine whether there is an area to be matched that matches the current reference area. After performing the area matching operation on all reference areas, a set of matching area pairs can be obtained.

[0075] In this embodiment, for the current reference area, it can be determined in turn whether each to-be-matched area satisfies the area matching condition. If there is an to-be-matched area that satisfies the area matching condition, that is, the first target area, the current reference area and the first target area can be determined as a matching area pair. The matching order of each to-be-matched area can be performed in order from large to small area, and the area matching condition can include: the area matching degree with the current reference area is the highest, and the area matching degree is greater than or equal to the first matching degree threshold.

[0076] For example, for the old room partitions and the new room partitions, room pairs that meet the following two conditions can be found as matching room pairs: Condition 1, the room pairs with the largest overlapping areas; Condition 2, the overlapping areas of the two room partitions of the room pair are greater than the specified threshold, for example, 80% or 90%. Since the above two conditions have high requirements for the matching degree between the old room partitions and the new room partitions, the room pairs that can be screened out are highly likely to be accurate matching room pairs. If the two input partition maps are not much different, most matching room pairs can be screened out in the above way.

[0077] See also Figure 4 , all connected room partitions will be found. The room partitions that are not found are usually room partitions with special circumstances, such as the partition line is moved significantly, a new room is divided, an old room is lost, etc. Figure 5 , all room matching pairs will be found.

[0078] Through this embodiment, by selecting the reference region and the to-be-matched region whose region matching degrees are the greatest and whose region matching degrees both reach the set matching degree threshold as the matching region pair, the accuracy of region matching can be improved.

[0079] In an exemplary embodiment, after determining the current reference region and the first target region as a matching region pair, the method further includes:

[0080] S41, removing the first target area from a set of to-be-matched areas to obtain an updated set of to-be-matched areas.

[0081] For each area to be matched (for example, the first target area) of the reference area that has been determined to be matched, it can be removed from the set of areas to be matched, that is, it does not participate in the subsequent area matching process, thereby reducing the amount of calculation required for subsequent area matching and improving the efficiency of area matching.

[0082] Through this embodiment, by removing the to-be-matched region of the reference region that has been determined to be matched from a group of to-be-matched regions, the amount of calculation required for subsequent region matching can be reduced, thereby improving the efficiency of region matching.

[0083] In an exemplary embodiment, determining a set of matching area pairs according to the area matching degree between a reference area in a set of reference areas and an area to be matched in a set of areas to be matched includes:

[0084] S51, determining a set of second matching results for a set of reference regions and a set of regions to be matched, wherein each second matching result in the set of second matching results is used to indicate a mapping relationship between a reference region in the set of reference regions and a region to be matched in the set of regions to be matched;

[0085] S52, determining a confidence level corresponding to each second matching result according to a region matching degree between a reference region having a mapping relationship indicated by each second matching result and the region to be matched, wherein the confidence level corresponding to each second matching result is used to indicate a degree of credibility that each second matching result is a best matching result in a group of second matching results;

[0086] S53, determining the second matching result with the highest confidence in the group of second matching results as the second target matching result;

[0087] S54, determining each region pair between the reference region with a mapping relationship indicated by the second target matching result and the corresponding to-be-matched region, whose region matching degree is higher than a third matching degree threshold, as a matching region pair, to obtain a group of matching region pairs.

[0088] In this embodiment, in order to determine that a set of matching area pairs is a global optimal solution, all possible matching results of a set of reference areas and a set of areas to be matched can be first determined, that is, a set of second matching results, each second matching result is used to indicate a mapping relationship between a reference area in a set of reference areas and an area to be matched in a set of areas to be matched, in the mapping relationship indicated in a second matching result, one reference area corresponds to one area to be matched, and, when the number of reference areas is different from the number of areas to be matched, some reference areas have no matching areas to be matched or some areas to be matched have no matching reference areas.

[0089] For a second matching result, the confidence corresponding to the second matching result can be determined according to the region matching degree (for example, the region overlapping area) between the reference region and the region to be matched having a corresponding relationship indicated by the second matching result. Here, the confidence corresponding to the second matching result is used to indicate the degree of credibility of each second matching result as the best matching result in a group of second matching results. Thus, the best matching result can be selected from a group of second matching results based on the confidence corresponding to each second matching result to obtain the second target matching result.

[0090] Since there is a situation in the mapping relationship indicated by each second matching result where the regional matching degree between the reference area with the mapping relationship and the area to be matched is not high, a matching degree threshold, that is, a third matching degree threshold, can be pre-specified, and each area pair between the reference area with the mapping relationship indicated by the second target matching result and the corresponding area to be matched whose regional matching degree is higher than the third matching degree threshold is determined as a matching area pair, thereby obtaining a group of matching area pairs.

[0091] The above-mentioned area matching scheme is the third area matching scheme based on full permutation, and the optimal matching result obtained is the global optimal solution. For the old partition map and the new partition map shown in Table 1 above, the matching room pairs obtained by using the third area matching scheme include: old room partition 2-new room partition 4, old room partition 5-new room partition 1, old room partition 4-new room partition 6, old room partition 3-new room partition 3, old room partition 1-new room partition 7, old room partition 8-new room partition 2.

[0092] The number of reference areas included in a set of reference areas is P, and the number of areas to be matched included in a set of areas to be matched is Q, where P and Q are both positive integers greater than or equal to 1, and the two may be the same or different. Based on the size relationship between P and Q, a set of second matching results may be determined in different ways.

[0093] Optionally, for a scenario where P is equal to Q, determining a set of second matching results for a set of reference areas and a set of areas to be matched may include: performing a full permutation operation on the P reference areas to obtain a set of second matching results, wherein the order of the Q areas to be matched is fixed, each permutation of the P reference areas corresponds to a second matching result, and the P reference areas correspond one-to-one with the Q areas to be matched according to the corresponding permutation; or, performing a full permutation operation on the Q areas to be matched to obtain a set of second matching results, wherein the order of the P reference areas is fixed, each permutation of the Q areas to be matched corresponds to a second matching result, and the Q areas to be matched correspond one-to-one with the P reference areas according to the corresponding permutation.

[0094] For the case where P is equal to Q, a full permutation operation can be performed on a group of reference areas and a group of areas in a group of areas to be matched, while the other group of areas can be fully permuted. Taking the case where the order of a group of reference areas is fixed as an example, by fully permuting a group of areas to be matched, all possible permutations of a group of areas to be matched can be obtained, and since the order of a group of reference areas is fixed, a group of areas to be matched is matched one-to-one with a group of reference areas in the order of each permutation, and a set of second matching results can be obtained. Optionally, a group of reference areas can be sorted in order from large to small or from small to large in area area (in the entire area matching process, a group of reference areas or a group of areas to be matched can be sorted only once and the sorting results can be saved, and the saved sorting results can be used for subsequent processing in the process of performing area matching), and the order of a group of reference areas is the order obtained by performing the above sorting.

[0095] For example, the number of old room partitions is 4, and the number of new room partitions is also 4. The order of the 4 old room partitions can be fixed (for example, old room partition 1, old room partition 2, old room partition 3, old room partition 4), and a full permutation operation can be performed on the 4 new room partitions, resulting in 24 permutations (for example, new room partition 3, new room partition 2, new room partition 1, new room partition 4), thereby determining 24 optional matching results. For example, one optional matching result is: old room partition 1-new room partition 3, old room partition 2-new room partition 2, old room partition 3-new room partition 1, old room partition 4-new room partition 4.

[0096] For the case where P is less than Q, P areas to be matched can be selected from the Q areas to be matched to obtain a group of P combinations of areas to be matched; a full permutation operation is performed on each combination of P areas to be matched to obtain a group of second matching results, the order of the P reference areas is fixed, each permutation of each combination of P areas to be matched corresponds to a second matching result, and each combination of P areas to be matched corresponds one-to-one to the P reference areas according to the corresponding permutation.

[0097] Here, if P is less than Q, there are some areas to be matched that have no corresponding reference areas. In this case, P areas to be matched can be selected from the Q areas to be matched to obtain a group of P combinations of areas to be matched. The number of combinations of P areas to be matched is At this time, for any combination of P to-be-matched regions, since the number of reference regions included in a group of reference regions and the number of to-be-matched regions included in a combination of P to-be-matched regions are both P, a plurality of fourth matching results corresponding to each combination of P to-be-matched regions can be determined in a manner similar to the above, thereby obtaining a set of second matching results.

[0098] For the case where P is greater than Q, Q reference areas can be selected from the P reference areas to obtain a combination of Q reference areas; a full permutation operation is performed on each combination of Q reference areas to obtain a set of second matching results, the order of the Q areas to be matched is fixed, each permutation of each combination of the Q reference areas corresponds to a second matching result, and each combination of the Q reference areas corresponds one-to-one with the Q areas to be matched according to the corresponding permutation.

[0099] Here, if P is greater than Q, some reference areas have no corresponding to-be-matched areas. In this case, Q reference areas can be selected from P reference areas to obtain a set of Q reference area combinations, and the number of combinations of Q reference areas included is At this time, for any combination of Q reference areas, since the number of areas of a group of to-be-matched areas and the number of areas of the reference areas included in a combination of Q reference areas are both Q, a plurality of fourth matching results corresponding to each combination of Q reference areas can be determined in a manner similar to the above, thereby obtaining a set of second matching results.

[0100] For example, for the case where the number of old room partitions in the old partition map n_old ≥ the number of new room partitions in the new partition map n_new, the number of permutations and combinations = A(n_old, n_new); for the case where the number of old room partitions in the old partition map n_old < the number of new room partitions in the new partition map n_new, the number of permutations and combinations = A(n_new, n_old). Among them, randomly taking m elements from n different elements and arranging them in a row in a certain order is regarded as a permutation of taking out m elements from n different elements; the number of all permutations of taking out m (m≤n) elements from n different elements is called the number of permutations of taking out m elements from n different elements, and is represented by the symbol A(n,m).

[0101] For example, firstly, all room partitions of two partition maps are fully arranged to obtain all possible combinations of matching room pairs; then the room matching scores under each arrangement are calculated, and the combination with the highest score is taken as the final matching result (invalid room pairs need to be removed).

[0102] Here, the room matching score under one arrangement can be expressed as formula (1):

[0103]

[0104] Among them, score i is the room matching score under the i-th arrangement, overlop i,j is the overlapping area of ​​the j-th room pair in the ith arrangement, oarea i,j is the area of ​​the old room partition of the j-th room pair under the ith arrangement.

[0105] In addition to the above score calculation formula, it can also be the sum of the overlapping area of ​​all room pairs and the sum of the area of ​​the old room partitions of all room pairs, or other calculation methods.

[0106] The invalid room pairs can be removed in such a way that when the absolute value of the overlapping area or the ratio of the overlapping area to the area of ​​the old room area and / or the new room area does not meet the specified threshold, the room pair is deemed not to be a matching room pair (i.e., the room pair is invalid). At this time, the old room partition (reference area) can be considered to be a lost room partition (the room represented is the lost room), and the new room partition is a newly divided room partition (the room represented is the newly divided room).

[0107] For example, the old partition map contains 5 old room partitions, and the new partition map contains 6 new room partitions. The optimal matching results are shown in Table 2:

[0108] Table 2

[0109] New Room Partition 2 New Room Partition 3 New Room Partition 4 New Room Partition 5 New Room Partition 6 Old room partition 1 Correct Match Old room partition 2 Correct Match Old room partition 3 Correct Match Old room partition 4 Correct Match Old room partition 5 Failure Matching

[0110] Among them, the old room partition 1 and the new room partition 6 are failed matches, the old room partition 1 is the lost room partition, and the new room partition 6 is the newly divided room partition.

[0111] In addition, for the case where the number of old room partitions ≥ the number of new room partitions, the old room partitions for which no matching pair is found are considered lost room partitions. Figure 6 As shown, the old room partition 6 is identified as the lost room partition.

[0112] In the case where the number of old room partitions is less than the number of new room partitions, the new room partitions for which no matching pair is found are considered as newly divided room partitions. Figure 7 As shown, the old room partition 6 is identified as the newly divided room partition.

[0113] For the third area matching scheme based on full arrangement, when the number of partitions exceeds a certain number, the number of possible combinations will increase significantly, and the amount of calculation will also increase significantly. For example, if the number of old room partitions and new room partitions is 8, the number of possible combinations is 40320. In order to reduce the amount of calculation, the following area matching scheme (i.e., the fourth area matching scheme) can be adopted: when determining a set of second matching results for a set of reference areas and a set of areas to be matched, the matching results of area pairs containing reference areas and areas to be matched with an area matching degree of zero are skipped, that is, on the basis of the third area matching scheme, all room pairs with an overlapping area of ​​0 are skipped in the process of full arrangement (this is the fourth area matching scheme), thereby significantly reducing the number of combinations and reducing the amount of calculation.

[0114] For the aforementioned fourth area matching scheme, when there are new partitions or lost partitions, incorrect matching may occur. For example, as shown in Table 3, the overlapping area of ​​the old room partition 1 and the new room partition 6 is zero. If the matching of the old room partition 1 and the new room partition 6 is skipped during full arrangement, then no matter which old room partition the new room partition 6 is matched with, the optimal solution cannot be obtained.

[0115] Table 3

[0116]

[0117] Through this embodiment, the optimal combination of region pairs is selected from all possible combinations of region pairs, and matching region pairs are selected based on the region matching degree of each region pair in the optimal combination of region pairs, so that the accuracy of region matching can be improved.

[0118] In an exemplary embodiment, after performing a region matching operation on a reference region in a group of reference regions as a current reference region in order of area size from large to small, if there is a group of remaining reference regions in a group of reference regions and there is a group of remaining to-be-matched regions in a group of to-be-matched regions, at this time, all remaining regions may be ignored and only the determined matching region pairs may be output. In order to improve the comprehensiveness of region matching and the success rate of recalling matching region pairs, other region matching schemes may be used to perform region matching on a group of remaining reference regions and a group of remaining to-be-matched regions, thereby determining the matching region pairs therein.

[0119] As an optional implementation manner, determining a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas further includes:

[0120] S61, determining a group of first matching results for a group of remaining reference regions and a group of remaining regions to be matched, wherein each first matching result in the group of first matching results is used to indicate a mapping relationship between a remaining reference region in the group of remaining reference regions and a remaining region to be matched in the group of remaining regions to be matched;

[0121] S62, determining a confidence level corresponding to each first matching result according to the region matching degree between the remaining reference region having a mapping relationship indicated by each first matching result and the remaining to-be-matched region, wherein the confidence level corresponding to each first matching result is used to indicate the degree of credibility that each first matching result is the best matching result in a group of first matching results;

[0122] S63, determining the first matching result with the highest confidence in the group of first matching results as the first target matching result;

[0123] S64: Determine each region pair between the remaining reference regions having a mapping relationship indicated by the first target matching result and the remaining regions to be matched, whose region matching degree is higher than a second matching degree threshold, as a matching region pair.

[0124] Here, the method of determining a group of first matching results and determining the best matching result from the group of first matching results is similar to the aforementioned method of determining a group of second matching results and determining the best matching result from the group of second matching results, and will not be repeated in this embodiment.

[0125] Through this embodiment, for the remaining reference areas and the remaining areas to be matched, the optimal combination of area pairs can be selected from all possible combinations of area pairs, and matching area pairs can be selected based on the area matching degrees of each area pair in the optimal combination of area pairs, which can improve the accuracy of area matching.

[0126] In an exemplary embodiment, the number of remaining reference areas included in a group of remaining reference areas is M, and the number of remaining areas to be matched included in a group of remaining areas to be matched is N, where M may be greater than N, may be equal to N, or may be less than N. Based on the size relationship between M and N, a group of first matching results can be determined in different ways.

[0127] As an optional implementation, for a scenario where M is less than N, determining a set of first matching results of a set of remaining reference areas and a set of remaining areas to be matched includes:

[0128] S71, selecting M remaining regions to be matched from the N remaining regions to be matched, to obtain a group of M remaining regions to be matched, where M and N are both positive integers greater than or equal to 1;

[0129] S72, performing a full permutation operation on each combination of the M remaining areas to be matched to obtain a set of first matching results, wherein the order of the M remaining reference areas is fixed, each permutation of each combination of the M remaining areas to be matched corresponds to a first matching result, and each combination of the M remaining areas to be matched corresponds one-to-one to the M remaining reference areas according to the corresponding permutation.

[0130] Here, the method of selecting M remaining areas to be matched from the N remaining areas to be matched and performing a full permutation operation on each combination of the M remaining areas to be matched is similar to the method of selecting P areas to be matched from the Q areas to be matched and performing a full permutation operation on each combination of the P areas to be matched in the aforementioned embodiment, and will not be repeated here.

[0131] As another optional implementation, for a scenario where M is equal to N, determining a set of first matching results of a set of remaining reference areas and a set of remaining areas to be matched includes:

[0132] S81, performing a full permutation operation on the M remaining reference regions to obtain a set of first matching results, wherein the order of the N remaining regions to be matched is fixed, each permutation of the M remaining reference regions corresponds to a first matching result, and the M remaining reference regions correspond to the N remaining regions to be matched one by one according to the corresponding permutation; or,

[0133] S82, performing a full permutation operation on the N remaining regions to be matched to obtain a set of first matching results, wherein the order of the M remaining reference regions is fixed, each permutation of the N remaining regions to be matched corresponds to a first matching result, and the N remaining regions to be matched correspond to the M remaining reference regions one-to-one according to the corresponding permutation.

[0134] Here, the manner of performing the full permutation operation on the M remaining reference regions or performing the full permutation operation on the N remaining to-be-matched regions is similar to the aforementioned manner of performing the full permutation operation on the P reference regions, and will not be described in detail herein.

[0135] As another optional implementation, for a scenario where M is greater than N, determining a set of first matching results of a set of remaining reference areas and a set of remaining areas to be matched includes:

[0136] S91, selecting N remaining reference areas from the M remaining reference areas to obtain a combination of a group of N remaining reference areas;

[0137] S92, performing a full permutation operation on each combination of the N remaining reference areas to obtain a set of first matching results, wherein the order of the N remaining areas to be matched is fixed, each permutation of each combination of the N remaining reference areas corresponds to a first matching result, and each combination of the N remaining reference areas corresponds one-to-one with the N remaining areas to be matched according to the corresponding permutation.

[0138] Here, the method of selecting N remaining reference areas from the M remaining reference areas and performing a full permutation operation on each combination of the N remaining reference areas is similar to the method of selecting Q reference areas from the P reference areas and performing a full permutation operation on each combination of the Q reference areas in the aforementioned embodiment, and will not be repeated here.

[0139] Through this embodiment, based on the relationship between the number of remaining reference areas and the number of remaining areas to be matched, the remaining reference areas or the remaining areas to be matched are fully arranged in different ways, which can facilitate the use of different matching strategies for different scenarios, thereby improving the flexibility and accuracy of area matching.

[0140] In an exemplary embodiment, for the method of performing region matching based on a full permutation method, when the number of partitions exceeds a certain number, the number of possible combinations will increase significantly, and the amount of calculation will also increase significantly. For example, if the number of matching results allowed by a set of remaining reference areas and a set of remaining areas to be matched is greater than or equal to a preset number threshold, the amount of calculation required for region matching is large, which reduces the efficiency of region matching.

[0141] In order to at least partially solve the above problems, the amount of calculation of the full permutation can be reduced by pre-screening the matching pairs, so that the method of solving the global optimal solution by the full permutation can be better implemented.

[0142] As an optional implementation manner, before determining a set of first matching results of a set of remaining reference areas and a set of remaining to-be-matched areas, the method further includes:

[0143] S101, according to the overlapping area of ​​each remaining reference region in a group of remaining reference regions and a group of regions to be matched, removing the remaining reference regions that meet a first region removal condition from the group of remaining reference regions to obtain an updated group of remaining reference regions.

[0144] In order to reduce the amount of calculation for region matching, a first region removal condition corresponding to the reference region can be pre-set, and the first region removal condition is used to remove reference regions that are not very useful for region matching in a group of reference regions or a group of remaining reference regions, that is, to remove reference regions that are highly likely to be lost. For a group of remaining reference regions, the remaining reference regions that meet the first region removal condition can be removed from a group of remaining reference regions to obtain an updated group of remaining reference regions. Here, the first region removal condition may include at least one of the following: the area of ​​the overlapping region is less than or equal to the first area threshold, and the ratio of the area of ​​the overlapping region to the area of ​​the remaining reference region (that is, the reference region currently being judged) is less than or equal to the first ratio.

[0145] For example, it can be determined whether the number of permutations and combinations of the remaining unmatched room pairs is greater than a threshold value L. If it is greater than L, some room partitions are removed from the unmatched room partitions (such room partitions do not need to participate in subsequent matching). For example, in the unmatched room partitions, the room partitions that may have been lost in the old partition map are removed: each old room partition in the old partition map (which may be the remaining old room partitions) is traversed, and the overlapping area of ​​the i-th old room partition and the entire new partition map is calculated, and then the overlapping ratio of the old room partition is calculated, that is, the overlapping area / the area of ​​the i-th old room partition. If the overlapping area is less than a specified threshold (for example, 0.1 square meters) or the overlapping ratio is less than a specified threshold (for example, 5%), it is considered that the old room partition has been lost in the new partition map and needs to be removed.

[0146] For example, Figure 8 As shown, Figure 8 The old room partition pointed to by the middle arrow has been lost and no longer exists in the new partition map (right picture), and does not need to participate in subsequent area matching.

[0147] As another optional implementation, before determining a set of first matching results for a set of remaining reference areas and a set of remaining to-be-matched areas, the method further includes:

[0148] S111, according to the overlapping area between each remaining region to be matched in the group of remaining regions to be matched and a group of reference regions, removing the remaining regions to be matched that meet the second region removal condition from the group of remaining regions to be matched, to obtain an updated group of remaining regions to be matched.

[0149] In order to reduce the amount of calculation for region matching, a second region removal condition corresponding to the region to be matched may be pre-set, and the second region removal condition is used to remove a group of regions to be matched or a group of remaining regions to be matched that have little effect on region matching, that is, to remove newly added regions to be matched that have a high probability of being removed. For a group of remaining regions to be matched, the remaining regions to be matched that meet the second region removal condition may be removed from a group of remaining regions to be matched to obtain an updated group of remaining regions to be matched. Here, the second region removal condition may include at least one of the following: the area of ​​the overlapping region is less than or equal to the second area threshold, and the ratio of the area of ​​the overlapping region to the area of ​​the remaining regions to be matched (i.e., the currently judged regions to be matched) is less than or equal to the second ratio.

[0150] For example, if the number of permutations and combinations of the remaining unmatched room pairs is greater than L, in the unmatched room partitions, remove some room partitions (such room partitions do not need to participate in subsequent matching). For example, in the unmatched room partitions, remove the room partitions that may be newly added in the new partition map: traverse each new room partition in the new partition map (which may be the remaining new room partitions), calculate the overlapping area of ​​the i-th new room partition and the entire old partition map, and then calculate the overlapping ratio of the new room partition, that is, the overlapping area / the area of ​​the i-th new room partition. If the overlapping area is less than a specified threshold (for example, 0.1 square meters) or the overlapping ratio is less than a specified threshold (for example, 5%), the new room partition is considered to be a completely newly added room partition and needs to be removed.

[0151] For example, Fig. 9 As shown, Fig. 9 The new room partition pointed to by the middle arrow is a completely new area and does not need to participate in area matching.

[0152] Through this embodiment, by removing the reference area that may have been lost in the map to be matched and removing the area to be matched that may be newly added in the map to be matched, the calculation amount of area matching can be reduced and the efficiency of area matching can be improved.

[0153] In an exemplary embodiment, if the number of matching results allowed by a set of remaining reference areas and a set of remaining areas to be matched is greater than or equal to a preset number threshold, or the number of matching results allowed by an updated set of remaining reference areas and an updated set of remaining areas to be matched is greater than or equal to a preset number threshold, then if area matching is performed based on a full permutation approach, the amount of computation required for area matching is large. In this regard, one or more area matching schemes with small computational complexity (for example, a first area matching scheme, a second area matching scheme, a fourth area matching scheme, etc.) can be used to perform area matching, and obtain area matching results for each area matching scheme, and then select the final matching result from the obtained area matching results.

[0154] As an optional implementation manner, before determining a set of first matching results of a set of remaining reference areas and a set of remaining to-be-matched areas, the method further includes:

[0155] S121, removing the first matching results including the region pairs of the reference region and the to-be-matched region whose region matching degree is zero from a group of first matching results, to obtain an updated group of first matching results.

[0156] Optionally, the aforementioned fourth region matching scheme can be used to reduce the amount of calculation for region matching, that is, the first matching result of the region pair containing the reference region with a region matching degree of zero and the region to be matched is removed from a set of first matching results to update a set of first matching results and obtain an updated set of first matching results. The method of removing the first matching result of the region pair containing the reference region with a region matching degree of zero and the region to be matched is similar to that in the aforementioned embodiment, and is not described in detail in this embodiment. At this time, the optimal matching result obtained includes the matching region pair determined by using the aforementioned fourth region matching scheme.

[0157] Through this embodiment, by removing the first matching result of the region pair including the reference region with a region matching degree of zero and the region to be matched, the calculation amount of the region matching can be reduced, thereby improving the efficiency of the region matching.

[0158] As an optional implementation, the above method further includes:

[0159] S131, determining the remaining reference areas that have the highest area matching degree with each remaining reference area in a group of remaining reference areas and do not match any reference area in order from large to small in area area, to obtain a first reference matching result; and adding the first reference matching result as a first matching result to a group of first matching results.

[0160] Optionally, the aforementioned first region matching scheme can be used to reduce the amount of calculation for region matching, that is, the remaining reference regions with the highest region matching degree with each remaining reference region in a set of remaining reference regions and not matched with any reference region are determined in order from large to small in area, and a first reference matching result is obtained. The obtained first reference matching result can be used to update a set of first matching results, and the updating method can be to add the first reference matching result as a first matching result to a set of first matching results. At this time, the obtained optimal matching result includes the matching region pair determined by combining the aforementioned fourth region matching scheme and the first region matching scheme. That is, for a set of remaining reference regions and a set of regions to be matched, the optimal region matching result is selected from the region matching results obtained by using the fourth region matching scheme and the region matching results obtained by using the first region matching scheme.

[0161] As another optional implementation, the above method further includes:

[0162] S132, determining each pair of remaining reference regions and remaining regions to be matched with the highest region matching degree among a group of remaining reference regions and a group of remaining regions to be matched, and obtaining a second reference matching result; and adding the second reference matching result as a first matching result to a group of first matching results.

[0163] Optionally, the aforementioned second region matching scheme can be used to reduce the amount of calculation for region matching, that is, determine the region pairs of a group of remaining reference regions and a group of remaining regions to be matched with the highest region matching degree, and obtain a second reference matching result. The obtained second reference matching result can be used to update a group of first matching results. The updating method can be to add the second reference matching result as a first matching result to a group of first matching results. At this time, the optimal matching result obtained includes the matching region pairs determined by combining the aforementioned fourth region matching scheme and the second region matching scheme. That is, for a group of remaining reference regions and a group of regions to be matched, the optimal region matching result is selected from the region matching results obtained by using the fourth region matching scheme and the region matching results obtained by using the second region matching scheme.

[0164] In addition, the final matching result may be determined by combining the aforementioned multiple area matching schemes or combining the area matching results obtained by other area matching schemes to improve the accuracy of area matching.

[0165] For example, multiple area matching schemes with low computational complexity can be executed for the remaining unmatched rooms, and the matching results output by each area matching scheme can be scored. If the highest score is greater than a specified threshold, the matching result output by the area matching scheme with the highest score is obtained as the final matching result. Among them, the area matching scheme with low computational complexity can include but is not limited to the selection of the aforementioned first area matching scheme, the second area matching scheme, or the fourth area matching scheme and other schemes.

[0166] Through this embodiment, the final regional matching result is determined by using the regional matching results obtained by adopting multiple regional matching schemes with small computational complexity, and the multiple matching schemes with small computational complexity are cross-checked, which can improve the accuracy of regional matching while reducing the computational complexity.

[0167] In an exemplary embodiment, before determining the confidence corresponding to each first matching result according to the area matching degree between the remaining reference area having a mapping relationship indicated by each first matching result and the remaining to-be-matched area, the method further includes:

[0168] S141, pre-calculate and store the area matching degree between each reference area in a group of reference areas and each to-be-matched area in a group of to-be-matched areas, wherein the area matching operation is performed based on the pre-stored area matching degree between each reference area and each to-be-matched area, and the confidence corresponding to each first matching result is determined based on the pre-stored area matching degree between each reference area and each to-be-matched area.

[0169] In order to improve the efficiency of partition matching, before performing partition matching, the regional matching degree between each reference area in a group of reference areas and each area to be matched in a group of areas to be matched can be pre-calculated and stored. For example, the regional overlap degree between each reference area and each area to be matched can be calculated in a manner similar to that in the aforementioned embodiment. The calculated regional matching degree can be saved in the storage space specified by the cleaning device. When performing subsequent partition matching or executing other operations that require the use of the regional matching degree of the reference area and the area to be matched, the stored regional matching degree can be directly called to improve the efficiency of the operation execution.

[0170] Optionally, the above-mentioned stored regional matching degree can be directly called to perform the regional matching operation in the aforementioned embodiment. The regional matching operation here may include but is not limited to the aforementioned first, second, third, and fourth regional matching schemes. The above-mentioned stored regional matching degree can also be directly called to perform the operation of determining the confidence level corresponding to each first matching result. In addition, for other scenarios that require the use of regional matching degree, the above-mentioned stored regional matching degree can usually be directly called to perform the corresponding operation.

[0171] Through this embodiment, the region matching degree between each reference region and each region to be matched is pre-calculated and stored for use in performing region matching operations and calculating related confidences, thereby improving the calculation efficiency of region matching.

[0172] In an exemplary embodiment, before determining a set of matching area pairs according to the area matching degree between the reference area in the set of reference areas and the to-be-matched area in the set of to-be-matched areas, the method further includes:

[0173] S151, based on the overlapping area between each reference area in a group of reference areas and a group of areas to be matched, remove the reference areas that meet the third area removal condition from the group of reference areas to obtain an updated group of reference areas, wherein the third area removal condition includes one of the following: the overlapping area is less than or equal to the third area threshold, and the ratio of the overlapping area to the area of ​​the reference area is less than or equal to the third ratio.

[0174] Taking into account that there may be reference areas in a group of reference areas that have a high probability of being lost, and the probability of them being matched with the area to be matched is small, that is, reference areas that have little effect on area matching, in order to reduce the amount of calculation for area matching, before determining a group of matching area pairs based on the area matching degree between the reference areas in a group of reference areas and the areas to be matched in a group of areas to be matched, a third area removal condition corresponding to the reference area can be pre-set to remove part of the reference area.

[0175] Optionally, in this embodiment, based on the overlapping area of ​​each reference area in a group of reference areas and a group of areas to be matched, reference areas that meet the third area removal condition can be removed from a group of reference areas to obtain an updated group of reference areas. Here, the third area removal condition may include one of the following: the overlapping area is less than or equal to a third area threshold, and the ratio of the overlapping area to the area of ​​the reference area is less than or equal to a third ratio. Here, the third area threshold may be the same as or different from the aforementioned first area threshold. The third ratio may be the same as or different from the aforementioned first ratio, and this embodiment does not limit this.

[0176] Through this embodiment, by removing the reference area that may have been lost in the map to be matched, the calculation amount of area matching can be reduced and the efficiency of area matching can be improved.

[0177] In an exemplary embodiment, before determining a set of matching area pairs according to the area matching degree between the reference area in the set of reference areas and the to-be-matched area in the set of to-be-matched areas, the method further includes:

[0178] S161, according to the overlapping area between each area to be matched in the group of areas to be matched and a group of reference areas, remove the areas to be matched that meet the fourth area removal condition from the group of areas to be matched, to obtain an updated group of areas to be matched, wherein the fourth area removal condition includes one of the following: the area of ​​the overlapping area is less than or equal to the fourth area threshold, and the ratio of the area of ​​the overlapping area to the area of ​​the area to be matched is less than or equal to the fourth ratio.

[0179] Taking into account that there may be a group of areas to be matched that is likely to be a newly added area to be matched, and the probability of matching the reference area is small, that is, the area to be matched that has little effect on the area matching, in order to reduce the amount of calculation for area matching, before determining a group of matching area pairs based on the area matching degree between the reference area in a group of reference areas and the area to be matched in a group of areas to be matched, a fourth area removal condition corresponding to the area to be matched can be pre-set to remove part of the area to be matched.

[0180] According to the overlapping area of ​​each reference area in a group of reference areas and a group of areas to be matched, the areas to be matched that meet the fourth area removal condition can be removed from the group of areas to be matched to obtain an updated group of areas to be matched. Here, the fourth area removal condition may include one of the following: the overlapping area area is less than or equal to the fourth area threshold, and the ratio of the overlapping area area to the area of ​​the reference area is less than or equal to the fourth ratio. Here, the fourth area threshold may be the same as or different from the aforementioned second area threshold. The fourth ratio may be the same as or different from the aforementioned second ratio, and this embodiment does not limit this.

[0181] Through this embodiment, by removing the possible newly added to-be-matched area in the to-be-matched map, the calculation amount of the area matching can be reduced and the efficiency of the area matching can be improved.

[0182] The following is an explanation of the method for configuring area information in a map in an embodiment of the present application in conjunction with an optional example. In this optional example, the reference map is an old partition map, the map to be matched is a right new partition map, and the area is a room partition.

[0183] This optional example provides an algorithm for calculating the optimal matching relationship of rooms. For the input old partition map and new partition map, the process of the method for configuring area information in the map in this optional example may include the following steps:

[0184] Step 1: Find a room pair that satisfies both of the following conditions as a matching room pair.

[0185] Condition 1: the room pair has the largest overlapping area. Condition 2: the overlapping ratio of the two room partitions of the room pair is greater than the specified threshold.

[0186] Step 2, determine whether the number of permutations and combinations of the remaining unmatched room pairs is less than a threshold value N. If so, execute step 3; otherwise, jump to execute step 4.

[0187] Step 3: Execute all permutations, calculate the room matching scores for each permutation, and select the permutation with the highest score as the final matching result (invalid matching pairs need to be removed from the final matching result).

[0188] Step 4: Remove some rooms from the unmatched rooms (including lost old room partitions and newly added room partitions).

[0189] Step 5, again determine whether the number of permutations and combinations of the remaining unmatched room pairs is less than the threshold N. If so, execute step 3; otherwise, jump to execute step 6.

[0190] Step 6: Execute multiple matching schemes with low computational complexity for the remaining unmatched rooms, and score each scheme. If the highest score is greater than the specified threshold, the scheme with the highest score is obtained, and the matching result of the scheme is used as the final result.

[0191] Through this optional example, a full permutation method is adopted, so that a global optimal solution exists for the room matching result; at the same time, by pre-screening the matching pairs, the calculation amount of the full permutation can be greatly reduced; by mutual verification of multiple matching schemes with small calculation amounts, the matching accuracy can be effectively improved.

[0192] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the described order of actions, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present application.

[0193] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM (Read-Only Memory) / RAM (Random Access Memory), a disk, or an optical disk), and includes a number of instructions for a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods described in each embodiment of the present application.

[0194] According to another aspect of an embodiment of the present application, a device for configuring area information in a map for implementing the above-mentioned detection method is also provided. Fig.10 is a structural block diagram of an optional device for configuring area information in a map according to an embodiment of the present application, such as Fig.10 As shown, the device may include:

[0195] A first determining unit 1002 is used to determine a set of reference areas in a reference map and a set of to-be-matched areas in a to-be-matched map, wherein the reference map and the to-be-matched map are different maps corresponding to the target area;

[0196] A second determining unit 1004, connected to the first determining unit 1002, is used to determine a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas, wherein each matching area pair in the group of matching area pairs includes a reference area in the group of reference areas and a to-be-matched area in the group of to-be-matched areas;

[0197] The configuration unit 1006 is connected to the second determination unit 1004 and is used to configure the designated area information of the reference area in each matching area pair to the matching area to be matched.

[0198] It should be noted that the first determining unit 1002 in this embodiment can be used to execute the above step S202, the second determining unit 1004 in this embodiment can be used to execute the above step S204, and the configuring unit 1006 in this embodiment can be used to execute the above step S206.

[0199] Through the above modules, a group of reference areas in the reference map and a group of to-be-matched areas in the to-be-matched map are determined, wherein the reference map and the to-be-matched map are different maps corresponding to the target area; a group of matching area pairs are determined according to the area matching degree between the reference areas in a group of reference areas and the to-be-matched areas in a group of to-be-matched areas, wherein each matching area pair in a group of matching area pairs includes a reference area belonging to a group of reference areas and a to-be-matched area belonging to a group of to-be-matched areas; the designated area information of the reference area in each matching area pair is configured to the matching to-be-matched area, thereby solving the problem of low efficiency of area information configuration due to the need to manually reconfigure the area information of the new area in the area information configuration method in the related art, thereby improving the efficiency of area information configuration.

[0200] In an exemplary embodiment, the second determining unit includes:

[0201] An execution module is used to perform the following region matching operation on a reference region in a group of reference regions as a current reference region in descending order of region area: if there is a first target region satisfying a region matching condition in a group of regions to be matched, determine the current reference region and the first target region as a matching region pair;

[0202] The region matching condition includes: the region matching degree with the current reference region is the highest, and the region matching degree is greater than or equal to a first matching degree threshold.

[0203] In an exemplary embodiment, the above device further comprises:

[0204] The removing unit is used to remove the first target area from a group of to-be-matched areas after determining the current reference area and the first target area as a matching area pair, so as to obtain an updated group of to-be-matched areas.

[0205] In an exemplary embodiment, the second determining unit further includes:

[0206] A first determination module is used for, after performing the following region matching operation using a reference region in a group of reference regions as a current reference region in order of area size from large to small, determining a group of first matching results of a group of remaining reference regions and a group of remaining to-matching regions in a case where there is a group of remaining reference regions in a group of reference regions and there is a group of remaining to-matching regions in a group of to-matching regions, wherein each first matching result in the group of first matching results is used to indicate a mapping relationship between a remaining reference region in a group of remaining reference regions and a remaining to-matching region in a group of remaining to-matching regions;

[0207] A second determination module is used to determine the confidence level corresponding to each first matching result according to the area matching degree between the remaining reference area having a mapping relationship indicated by each first matching result and the remaining to-be-matched area, wherein the confidence level corresponding to each first matching result is used to indicate the degree of credibility that each first matching result is the best matching result in a group of first matching results;

[0208] A third determination module, used to determine the first matching result with the highest confidence level in a group of first matching results as the first target matching result;

[0209] The fourth determination module is used to determine each region pair between the remaining reference regions having a mapping relationship indicated by the first target matching result and the remaining regions to be matched, whose region matching degree is higher than a second matching degree threshold, as a matching region pair.

[0210] In an exemplary embodiment, the first determining module includes:

[0211] A first selection submodule is used for selecting M remaining to-be-matched regions from N remaining to-be-matched regions when the number M of remaining reference regions included in a group of remaining reference regions is less than the number N of remaining to-be-matched regions included in a group of remaining to-be-matched regions, so as to obtain a group of M remaining to-be-matched regions, wherein both M and N are positive integers greater than or equal to 1;

[0212] The first execution submodule is used to perform a full permutation operation on each combination of the M remaining areas to be matched to obtain a set of first matching results, wherein the order of the M remaining reference areas is fixed, each permutation of each combination of the M remaining areas to be matched corresponds to a first matching result, and each combination of the M remaining areas to be matched corresponds one-to-one with the M remaining reference areas according to the corresponding permutation.

[0213] In an exemplary embodiment, the first determining module includes:

[0214] A second execution submodule is configured to perform a full permutation operation on the M remaining reference regions to obtain a set of first matching results when the number of regions M in a set of remaining reference regions is equal to the number of regions N in a set of remaining regions to be matched, wherein the order of the N remaining regions to be matched is fixed, each permutation of the M remaining reference regions corresponds to a first matching result, and the M remaining reference regions correspond to the N remaining regions to be matched one by one according to the corresponding permutation; or

[0215] The third execution submodule is used to perform a full permutation operation on the N remaining areas to be matched to obtain a set of first matching results, wherein the order of the M remaining reference areas is fixed, each permutation of the N remaining areas to be matched corresponds to a first matching result, and the N remaining areas to be matched correspond to the M remaining reference areas one-to-one according to the corresponding permutation.

[0216] In an exemplary embodiment, the first determining module includes:

[0217] The second selection submodule is used to select N remaining reference areas from the M remaining reference areas to obtain a combination of a group of N remaining reference areas when the number of areas M in a group of remaining reference areas is greater than the number of areas N in a group of remaining areas to be matched;

[0218] The fourth execution submodule is used to perform a full permutation operation on each combination of the N remaining reference areas to obtain a set of first matching results, wherein the order of the N remaining areas to be matched is fixed, each permutation of each combination of the N remaining reference areas corresponds to a first matching result, and each combination of the N remaining reference areas corresponds one-to-one with the N remaining areas to be matched according to the corresponding permutation.

[0219] In an exemplary embodiment, the above device further comprises:

[0220] A first removal unit is used to remove the remaining reference areas that meet the first area removal condition from the group of remaining reference areas before determining a group of first matching results for a group of remaining reference areas and a group of remaining areas to be matched, when the number of matching results allowed by the group of remaining reference areas and the group of remaining areas to be matched is greater than or equal to a preset number threshold, to obtain an updated group of remaining reference areas according to the overlapping area area of ​​each remaining reference area in the group of remaining reference areas and the group of areas to be matched, wherein the first area removal condition includes one of the following: the overlapping area area is less than or equal to the first area threshold, and the ratio of the overlapping area area to the area area of ​​the remaining reference areas is less than or equal to the first ratio.

[0221] In an exemplary embodiment, the above device further comprises:

[0222] A second removal unit is used to remove the remaining areas to be matched that meet the second area removal condition from the group of remaining areas to be matched according to the overlapping area between each remaining area to be matched in the group of remaining areas to be matched and the group of reference areas before determining a group of first matching results for the group of remaining reference areas and the group of remaining areas to be matched, when the number of matching results allowed by the group of remaining reference areas and the group of remaining areas to be matched is greater than or equal to a preset number threshold, so as to obtain an updated group of remaining areas to be matched, wherein the second area removal condition includes one of the following: the area area of ​​the overlapping area is less than or equal to the second area threshold, and the ratio of the area area of ​​the overlapping area to the area area of ​​the remaining areas to be matched is less than or equal to the second ratio.

[0223] In an exemplary embodiment, the above device further comprises:

[0224] A third removal unit is used to remove the first matching results of the area pairs of the reference area and the area to be matched with a region matching degree of zero from the group of first matching results after determining a group of first matching results of the remaining reference areas and the remaining areas to be matched, if the number of matching results allowed by the group of remaining reference areas and the group of remaining areas to be matched is greater than or equal to a preset number threshold, so as to obtain an updated group of first matching results.

[0225] In an exemplary embodiment, the device further comprises at least one of the following:

[0226] A third determination unit is used to determine, in descending order of area area, a remaining reference area that has the highest area matching degree with each remaining reference area in a group of remaining reference areas and does not match any reference area, to obtain a first reference matching result; and add the first reference matching result as a first matching result to a group of first matching results;

[0227] The fourth determination unit is used to determine each pair of remaining reference areas and remaining areas to be matched with the highest area matching degree among a group of remaining reference areas and a group of remaining areas to be matched, to obtain a second reference matching result; and add the second reference matching result as a first matching result to a group of first matching results.

[0228] In an exemplary embodiment, the above device further comprises:

[0229] An execution unit is used to pre-calculate and store the area matching degree between each reference area in a group of reference areas and each to-be-matched area in a group of to-be-matched areas before determining the confidence degree corresponding to each first matching result according to the area matching degree between the remaining reference areas with a mapping relationship indicated by each first matching result and the remaining to-be-matched areas, wherein the area matching operation is performed based on the pre-stored area matching degree between each reference area and each to-be-matched area, and the confidence degree corresponding to each first matching result is determined based on the pre-stored area matching degree between each reference area and each to-be-matched area.

[0230] In an exemplary embodiment, the above device further comprises:

[0231] A fourth removal unit is used to remove reference areas that meet a third area removal condition from a group of reference areas based on an overlapping area area between each reference area in a group of reference areas and a group of areas to be matched, before determining a group of matching area pairs based on an area matching degree between the reference areas in a group of reference areas and the areas to be matched in a group of areas to be matched, so as to obtain an updated group of reference areas, wherein the third area removal condition includes one of the following: an overlapping area area is less than or equal to a third area threshold, and a ratio of an overlapping area area to an area area of ​​the reference area is less than or equal to a third ratio.

[0232] In an exemplary embodiment, the above device further comprises:

[0233] A fifth removal unit is used to remove the to-be-matched areas that meet the fourth area removal condition from the group of to-be-matched areas according to the overlapping area between each to-be-matched area in the group of to-be-matched areas and a group of reference areas before determining a group of matching area pairs according to the area matching degree between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas, so as to obtain an updated group of to-be-matched areas, wherein the fourth area removal condition includes one of the following: the area area of ​​the overlapping area is less than or equal to the fourth area threshold, and the ratio of the area area of ​​the overlapping area to the area area of ​​the to-be-matched area is less than or equal to the fourth ratio.

[0234] In an exemplary embodiment, the second determining unit includes:

[0235] a fifth determination module, configured to determine a set of second matching results for a set of reference regions and a set of regions to be matched, wherein each second matching result in the set of second matching results is used to indicate a mapping relationship between a reference region in the set of reference regions and a region to be matched in the set of regions to be matched;

[0236] a sixth determination module, configured to determine a confidence level corresponding to each second matching result according to a region matching degree between a reference region having a mapping relationship indicated by each second matching result and the region to be matched, wherein the confidence level corresponding to each second matching result is used to indicate a degree of credibility that each second matching result is a best matching result in a group of second matching results;

[0237] A seventh determination module, configured to determine the second matching result with the highest confidence level in a group of second matching results as the second target matching result;

[0238] The eighth determination module is used to determine each region pair between the reference region with a mapping relationship indicated by the second target matching result and the corresponding to-be-matched region whose region matching degree is higher than a third matching degree threshold as a matching region pair, so as to obtain a group of matching region pairs.

[0239] In an exemplary embodiment, the second determining unit includes:

[0240] A ninth determination module is used to determine, in descending order of area area, each reference area in a group of reference areas and an unmatched area with the highest area matching degree with each reference area as a matching area pair, thereby obtaining a group of matching area pairs, wherein the unmatched area is an area to be matched that has not been matched with any reference area; or

[0241] The tenth determination module is used to determine each area pair of a reference area and an area to be matched with the maximum area matching degree among a group of reference areas and a group of areas to be matched as a matching area pair, so as to obtain a group of matching area pairs.

[0242] In an exemplary embodiment, the second determining unit includes:

[0243] The eleventh determining module is used to determine a group of matching area pairs according to the overlapping areas between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas.

[0244] It should be noted that the examples and application scenarios implemented by the above modules and corresponding steps are the same, but are not limited to the contents disclosed in the above embodiments. It should be noted that the above modules as part of the device can be run in Figure 1In the hardware environment shown, it can be implemented by software or by hardware, wherein the hardware environment includes a network environment.

[0245] According to another aspect of the embodiments of the present application, a storage medium is also provided. Optionally, in this embodiment, the storage medium can be used to execute the program code of any of the above-mentioned methods for matching regions in a map in the embodiments of the present application.

[0246] Optionally, in this embodiment, the storage medium may be located on at least one network device among a plurality of network devices in the network shown in the above embodiment.

[0247] Optionally, in this embodiment, the storage medium is configured to store program codes for executing the following steps:

[0248] S1, determining a group of reference areas in a reference map and a group of to-be-matched areas in a to-be-matched map, wherein the reference map and the to-be-matched map are different maps corresponding to the target area;

[0249] S2, determining a group of matching area pairs according to the area matching degrees between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas, wherein each matching area pair in the group of matching area pairs includes a reference area belonging to the group of reference areas and a to-be-matched area belonging to the group of to-be-matched areas;

[0250] S3: configuring the designated area information of the reference area in each matching area pair to the matching area to be matched.

[0251] Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, which will not be described in detail in this embodiment.

[0252] Optionally, in this embodiment, the storage medium may include, but is not limited to, various media that can store program codes, such as a USB flash drive, a ROM, a RAM, a mobile hard disk, a magnetic disk, or an optical disk.

[0253] According to another aspect of an embodiment of the present application, an electronic device for implementing the above-mentioned area matching method in a map is also provided. The electronic device may be a server, a terminal, or a combination thereof.

[0254] Fig.11 is a structural block diagram of an optional electronic device according to an embodiment of the present application, such as Fig.11 As shown, it includes a processor 1102, a communication interface 1104, a memory 1106 and a communication bus 1108, wherein the processor 1102, the communication interface 1104 and the memory 1106 communicate with each other through the communication bus 1108, wherein,

[0255] Memory 1106, used for storing computer programs;

[0256] The processor 1102 is used to execute the computer program stored in the memory 1106 to implement the following steps:

[0257] S1, determining a group of reference areas in a reference map and a group of to-be-matched areas in a to-be-matched map, wherein the reference map and the to-be-matched map are different maps corresponding to the target area;

[0258] S2, determining a group of matching area pairs according to the area matching degrees between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas, wherein each matching area pair in the group of matching area pairs includes a reference area belonging to the group of reference areas and a to-be-matched area belonging to the group of to-be-matched areas;

[0259] S3: configuring the designated area information of the reference area in each matching area pair to the matching area to be matched.

[0260] Optionally, in this embodiment, the communication bus may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.11 The communication interface is used for communication between the electronic device and other devices.

[0261] The above-mentioned memory may include RAM, or may include non-volatile memory (non-volatile memory), for example, at least one disk memory. Optionally, the memory may also be at least one storage device located far away from the above-mentioned processor.

[0262] As an example, the memory 1106 may include, but is not limited to, the first determination unit 1002 and the second determination unit 1004 and the configuration unit 1006 in the area matching device in the map. In addition, it may also include, but is not limited to, other module units in the area matching device in the map, which will not be repeated in this example.

[0263] The above-mentioned processor can be a general-purpose processor, which can include but not be limited to: CPU (Central Processing Unit), NP (Network Processor), etc.; it can also be DSP (Digital Signal Processing), ASIC (Application Specific Integrated Circuit), FPGA (Field-Programmable Gate Array) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

[0264] Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment will not be described in detail here.

[0265] It can be understood by those skilled in the art that Fig.11 The structure shown is for illustration only. The device for implementing the area matching method in the above map may be a terminal device, which may be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a PDA, a mobile Internet device (Mobile Internet Devices, MID), a PAD, and other terminal devices. Fig.11 The structure of the electronic device is not limited. Fig.11 More or fewer components (such as network interfaces, display devices, etc.) shown in, or having Fig.11 Different configurations shown.

[0266] A person of ordinary skill in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by instructing the hardware related to the terminal device through a program, and the program can be stored in a computer-readable storage medium, which can include: a flash drive, ROM, RAM, a magnetic disk or an optical disk, etc.

[0267] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0268] If the integrated units in the above embodiments are implemented in the form of software functional units and sold or used as independent products, they can be stored in the above computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling one or more computer devices (which may be personal computers, servers, or network devices, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application.

[0269] In the above embodiments of the present application, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, please refer to the relevant description of other embodiments.

[0270] In the several embodiments provided in the present application, it should be understood that the disclosed client can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

[0271] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution provided in this embodiment.

[0272] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0273] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A method for matching regions in a map, characterized in that: include: Determine a set of reference areas in a reference map and a set of to-be-matched areas in a to-be-matched map, wherein the reference map and the to-be-matched map are different maps corresponding to the target area; Determine a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas, wherein each matching area pair in the group of matching area pairs includes a reference area belonging to the group of reference areas and a to-be-matched area belonging to the group of to-be-matched areas; The designated area information of the reference area in each matching area pair is configured to the matching area to be matched.

2. The method according to claim 1, characterized in that The determining a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas comprises: Performing the following region matching operation on the reference regions in the group of reference regions as current reference regions in descending order of region area: if there is a first target region satisfying the region matching condition in the group of regions to be matched, determining the current reference region and the first target region as a matching region pair; The region matching condition includes: the region matching degree with the current reference region is the highest, and the region matching degree is greater than or equal to a first matching degree threshold.

3. The method according to claim 2, characterized in that After determining the current reference area and the first target area as a matching area pair, the method further includes: The first target area is removed from the set of areas to be matched to obtain an updated set of areas to be matched.

4. The method according to claim 2, characterized in that: The determining a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas further includes: After performing the following region matching operation using the reference regions in the group of reference regions as the current reference regions in the order of area size from large to small, in the case where there is a group of remaining reference regions in the group of reference regions and there is a group of remaining to-be-matched regions in the group of to-be-matched regions, determining a group of first matching results for the group of remaining reference regions and the group of remaining to-be-matched regions, wherein each first matching result in the group of first matching results is used to indicate a mapping relationship between the remaining reference regions in the group of remaining reference regions and the remaining to-be-matched regions in the group of remaining to-be-matched regions; Determine, according to the area matching degree between the remaining reference area having a mapping relationship indicated by each first matching result and the remaining to-be-matched area, the confidence degree corresponding to each first matching result, wherein the confidence degree corresponding to each first matching result is used to indicate the degree of credibility that each first matching result is the best matching result in the set of first matching results; Determine the first matching result with the highest confidence in the group of first matching results as the first target matching result; Each region pair between the remaining reference regions having a mapping relationship indicated by the first target matching result and the remaining regions to be matched, for which the region matching degree is higher than a second matching degree threshold, is determined as a matching region pair.

5. The method according to claim 4, characterized in that The determining of a set of first matching results between the set of remaining reference areas and the set of remaining areas to be matched includes: When the number M of remaining reference areas included in the group of remaining reference areas is less than the number N of remaining areas to be matched included in the group of remaining areas to be matched, M remaining areas to be matched are selected from the N remaining areas to be matched to obtain a group of combinations of the M remaining areas to be matched, wherein M and N are both positive integers greater than or equal to 1; Perform a full permutation operation on each combination of the M remaining areas to be matched to obtain the set of first matching results, wherein the order of the M remaining reference areas is fixed, each permutation of each combination of the M remaining areas to be matched corresponds to a first matching result, and each combination of the M remaining areas to be matched corresponds one-to-one to the M remaining reference areas according to the corresponding permutation.

6. The method according to claim 4, characterized in that The determining of a set of first matching results between the set of remaining reference areas and the set of remaining areas to be matched includes: When the number M of regions in the group of remaining reference regions is equal to the number N of regions in the group of remaining regions to be matched, a full permutation operation is performed on the M remaining reference regions to obtain the group of first matching results, wherein the order of the N remaining regions to be matched is fixed, each permutation of the M remaining reference regions corresponds to a first matching result, and the M remaining reference regions correspond to the N remaining regions to be matched one by one according to the corresponding permutation; or A full permutation operation is performed on the N remaining regions to be matched to obtain the set of first matching results, wherein the order of the M remaining reference regions is fixed, each permutation of the N remaining regions to be matched corresponds to a first matching result, and the N remaining regions to be matched correspond to the M remaining reference regions one-to-one according to the corresponding permutation.

7. The method according to claim 4, characterized in that The determining of a set of first matching results between the set of remaining reference areas and the set of remaining areas to be matched includes: When the number M of regions in the group of remaining reference regions is greater than the number N of regions in the group of remaining to-be-matched regions, N remaining reference regions are selected from the M remaining reference regions to obtain a group of combinations of the N remaining reference regions; A full permutation operation is performed on each combination of the N remaining reference areas to obtain the set of first matching results, wherein the order of the N remaining areas to be matched is fixed, each permutation of each combination of the N remaining reference areas corresponds to a first matching result, and each combination of the N remaining reference areas corresponds one-to-one with the N remaining areas to be matched according to the corresponding permutation.

8. The method according to claim 4, characterized in that Before determining a set of first matching results between the set of remaining reference areas and the set of remaining to-be-matched areas, the method further includes: In a case where the number of matching results allowed by the group of remaining reference areas and the group of remaining areas to be matched is greater than or equal to a preset number threshold, the remaining reference areas that meet the first area removal condition are removed from the group of remaining reference areas based on the overlapping area of ​​each remaining reference area in the group of remaining reference areas and the group of areas to be matched, to obtain an updated group of remaining reference areas, wherein the first area removal condition includes one of the following: the overlapping area area is less than or equal to the first area threshold, and the ratio of the overlapping area area to the area of ​​the remaining reference areas is less than or equal to the first ratio.

9. The method according to claim 4, characterized in that Before determining a set of first matching results between the set of remaining reference areas and the set of remaining to-be-matched areas, the method further includes: In a case where the number of matching results allowed by the group of remaining reference areas and the group of remaining areas to be matched is greater than or equal to a preset number threshold, the remaining areas to be matched that meet the second area removal condition are removed from the group of remaining areas to be matched based on the overlapping area between each remaining area to be matched in the group of remaining areas to be matched and the group of reference areas, to obtain an updated group of remaining areas to be matched, wherein the second area removal condition includes one of the following: an area area of ​​the overlapping area is less than or equal to a second area threshold, and a ratio of an area area of ​​the overlapping area to an area area of ​​the remaining areas to be matched is less than or equal to a second ratio.

10. The method according to claim 4, characterized in that After determining a set of first matching results between the set of remaining reference areas and the set of remaining to-be-matched areas, the method further includes: When the number of matching results allowed by the group of remaining reference areas and the group of remaining areas to be matched is greater than or equal to a preset number threshold, the first matching results of the area pairs of the reference areas and the areas to be matched that include an area matching degree of zero in the group of first matching results are removed to obtain an updated group of first matching results.

11. The method according to claim 10, characterized in that The method further comprises at least one of the following: Determine, in descending order of area, the remaining reference regions that have the highest area matching degree with each remaining reference region in the group of remaining reference regions and that do not match any reference region, to obtain a first reference matching result; adding the first reference matching result as a first matching result to the set of first matching results; Determine each region pair of the remaining reference regions and the remaining regions to be matched, which have the highest region matching degree between the group of remaining reference regions and the group of remaining regions to be matched, to obtain a second reference matching result; The second reference matching result is added as a first matching result to the set of first matching results.

12. The method according to claim 4, characterized in that Before determining the confidence corresponding to each first matching result according to the area matching degree between the remaining reference area having a mapping relationship indicated by each first matching result and the remaining to-be-matched area, the method further includes: Pre-calculate and store the area matching degree between each reference area in the group of reference areas and each to-be-matched area in the group of to-be-matched areas, wherein the area matching operation is performed based on the pre-stored area matching degree between each reference area and each to-be-matched area, and the confidence level corresponding to each first matching result is determined based on the pre-stored area matching degree between each reference area and each to-be-matched area.

13. The method according to claim 1, characterized in that Before determining a group of matching area pairs according to the area matching degrees between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas, the method further includes: According to the overlapping area of ​​each reference area in the group of reference areas and the group of areas to be matched, the reference areas that meet the third area removal condition are removed from the group of reference areas to obtain an updated group of reference areas, wherein the third area removal condition includes one of the following: the overlapping area is less than or equal to a third area threshold, and the ratio of the overlapping area to the area of ​​the reference area is less than or equal to a third ratio.

14. The method according to claim 1, characterized in that Before determining a group of matching area pairs according to the area matching degrees between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas, the method further includes: According to the overlapping area between each to-be-matched area in the group of to-be-matched areas and the group of reference areas, the to-be-matched areas that meet the fourth area removal condition are removed from the group of to-be-matched areas to obtain an updated group of to-be-matched areas, wherein the fourth area removal condition includes one of the following: an area of ​​the overlapping area is less than or equal to a fourth area threshold, and a ratio of the area area of ​​the overlapping area to the area area of ​​the to-be-matched area is less than or equal to a fourth ratio.

15. The method according to claim 1, characterized in that The determining a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas comprises: Determine a set of second matching results of the set of reference regions and the set of regions to be matched, wherein each second matching result in the set of second matching results is used to indicate a mapping relationship between a reference region in the set of reference regions and a region to be matched in the set of regions to be matched; Determining the confidence level corresponding to each second matching result according to the area matching degree between the reference area with a mapping relationship indicated by each second matching result and the area to be matched, wherein the confidence level corresponding to each second matching result is used to indicate the degree of credibility that each second matching result is the best matching result in the set of second matching results; Determine the second matching result with the highest confidence in the group of second matching results as the second target matching result; Each region pair between the reference region having a mapping relationship indicated by the second target matching result and the corresponding to-be-matched region, whose region matching degree is higher than a third matching degree threshold, is determined as a matching region pair to obtain the set of matching region pairs.

16. The method according to claim 1, characterized in that The determining a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas comprises: Determine each reference region in the set of reference regions and an unmatched region with the highest region matching degree with each reference region as a matching region pair in descending order of region area, to obtain the set of matching region pairs, wherein the unmatched region is a region to be matched that has not been matched with any reference region; or Each region pair of a reference region and a region to be matched having the maximum region matching degree among the group of reference regions and the group of regions to be matched is determined as a matching region pair to obtain the group of matching region pairs.

17. The method according to any one of claims 1 to 16, characterized in that The determining a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas comprises: A group of matching area pairs is determined according to the overlapping areas between the reference areas in the group of reference areas and the to-be-matched areas in the group of to-be-matched areas.

18. A device for configuring area information in a map, characterized in that: include: A first determining unit is used to determine a group of reference areas in a reference map and a group of to-be-matched areas in a to-be-matched map, wherein the reference map and the to-be-matched map are different maps corresponding to the target area; A second determining unit is used to determine a group of matching area pairs according to the area matching degree between the reference area in the group of reference areas and the to-be-matched area in the group of to-be-matched areas, wherein each matching area pair in the group of matching area pairs includes a reference area belonging to the group of reference areas and a to-be-matched area belonging to the group of to-be-matched areas; A configuration unit is used to configure the designated area information of the reference area in each matching area pair to the matching area to be matched.

19. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored program, wherein the program executes the method according to any one of claims 1 to 17 when executed.

20. An electronic device comprising a memory and a processor, characterized in that: A computer program is stored in the memory, and the processor is configured to execute the method according to any one of claims 1 to 17 through the computer program.