A robot map management method and mobile robot
Through the method of map traversal mark value count and matching priority adjustment, the robot's map management problem in a multi-floor environment is solved, the rational management and rapid positioning of multi-frame maps are realized, and the relocation efficiency and accuracy are improved.
Patent Information
- Application Number
- CN202211277471.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-10-19
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2042-10-19
AI Technical Summary
The prior art is difficult to effectively manage and schedule multi-frame maps built by robots, resulting in the need to repeatedly build maps when relocating in a multi-floor environment, affecting positioning accuracy and efficiency.
The current map is constructed in real time through map traversal and counting mark values, identify and save the map identification value of each floor area, adjust the matching priority to call the matching map first, create a multi-floor map list, and realize map information for different floor areas Reasonable management and scheduling.
It improves the utilization rate and environmental applicability of the map, reduces the time for repetitive map construction, meets the relocation needs of robots in multi-floor environments, and ensures positioning accuracy and efficiency.
Smart Images

Figure CN115655277B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of map management, and in particular to a robot map management method and a mobile robot. Background Art
[0002] The full name of the SLAM algorithm is Simultaneous Localization and Mapping, which means simultaneous positioning and instant mapping. When the robot is performing traversal tasks in the same working area or different working areas, it often re-establishes the map. Since the existing technology often sets the memory of the chassis of the mobile robot to store at most the map of one floor, the map of the previously traversed floor area will not be saved after the map of the new floor area is established, resulting in the invalidation of the location information recorded in the original map. When the robot is re-positioned, it can only hit the same environmental area at most, and can only display one frame of the map in the mobile phone application at most. When the robot returns to the traversed floor area, it needs to rebuild the map again.
[0003] Chinese patent CN109974722B discloses a map update control method and a map update control system for a visual robot, which can determine the preset matching degree between the current map and the pre-stored historical map according to the map attribute measurement data to decide whether to save the current map or retain the pre-stored historical map; however, Chinese patent CN109974722B cannot perform reasonable and orderly management and scheduling for the multi-frame maps constructed by the robot, but only selectively retains the current map and the historical map, either retaining the historical map or directly deleting the historical map to construct a new map. Each frame of the continuously input new map is not marked and saved, nor is the matching order of the multi-frame maps adaptively configured at one time. Instead, more map construction time is required in some traversed environmental areas instead of direct scheduling. Summary of the invention
[0004] The present application provides a robot map management method and a mobile robot, and the specific technical solutions are as follows:
[0005] A robot map management method, the robot map management method comprises: step S1, whenever the robot detects a new floor area, the current map constructed by the robot in real time is marked by a map traversal mark value, wherein the current map constructed by the robot in real time is a frame map used to represent the new floor area currently detected by the robot; the new floor area is a floor area outside the area corresponding to the area represented by the map pre-stored in the map memory; step S2, according to the capacity of the current map identified in step S1, the current map identified in step S1 is stored in the map memory, and the matching priority of the current map identified in step S1 is adjusted to the highest, so that the robot subsequently gives priority to calling the current map for map matching, which is convenient for robot positioning.
[0006] Furthermore, each time the robot traverses a floor area, it collects the position attribute identification information of the floor area it is currently in, and determines whether the position attribute identification information currently collected by the robot matches the pre-stored position attribute identification information. If so, it is determined that the robot has not detected a new floor area; otherwise, when the robot receives the command signal transmitted from the outside and parses the floor information, the floor information is added to the currently collected position attribute identification information, and the position attribute identification information with the added floor information is saved in the map memory, and it is determined that the robot has detected a new floor area; if the robot has not detected a new floor area, the robot extracts the floor information from the currently collected position attribute identification information to determine the floor where the robot is currently located; if it is determined that the position attribute identification information currently collected by the robot does not match the pre-stored position attribute identification information, the robot first sends a request signal to the outside for obtaining the floor information to obtain the response of the communication device of the floor area where the robot is currently located; wherein the position attribute identification information includes the environmental characteristic parameters of the robot in the corresponding floor area; in the map memory, the position attribute identification information is saved as a part of the map information of a frame map used to represent the floor area where the robot is currently located.
[0007] Further, in step S1, the method for identifying the current map constructed by the robot in real time by using the map traversal mark value specifically includes: when the robot detects the new floor area, the robot first sets the map identification value of the current map constructed by it in real time to the value 0, so as to identify the current map as a frame map that is not stored in the map memory; under the premise that the robot triggers a map saving operation, after the robot determines that the map identification value of the current map is the value 0 and before storing the current map in the map memory, the map traversal mark value is controlled to be added with a fixed increment, and then the added sum is updated to the map traversal mark value, and then the updated map traversal mark value is set as the map identification value of the current map, and it is determined that the current map is the current map identified in step S1; then the robot executes step S2 to store the map identification value of the current map and the map information of the current map in the map memory; wherein, the robot performs environmental area detection with one frame of map as the detection unit, and the robot uses at least one frame of map to record the environmental information of one floor area, and each frame of map stored in the map memory corresponds to a map identification value.
[0008] Furthermore, the robot map management method also includes: on the premise that the robot has not detected the new floor area, if the floor area currently located by the robot has not changed, then the map identification value of the one-frame map used to represent the floor currently located by the robot is maintained as the map identification value of the current map, and the matching priority of the one-frame map used to represent the floor currently located by the robot is not adjusted; on the premise that the robot has not detected the new floor area, if the robot traverses between floor areas corresponding to at least two pre-stored frame maps, then after the robot triggers the map save operation, the map identification value of the one-frame map used to represent the floor area currently located by the robot is updated to the map identification value of the current map, and the map information of the one-frame map used to represent the floor area currently located by the robot is updated to the map information of the current map, and the matching priority of the one-frame map used to represent the floor area currently located by the robot is adjusted to the highest.
[0009] Furthermore, step S2 specifically includes: when the capacity of the current map identified by step S1 is greater than the capacity of the reference map storage unit provided in the linear storage space, firstly, the map identification value and the corresponding map information of at least one frame of map pre-stored in the linear storage space are deleted, and then, starting from the reference map storage unit, each frame of map in the linear storage space with a matching priority higher than the frame of map with the lowest matching priority being deleted is controlled to be offset by a corresponding address offset, so as to free up idle memory space for the current map, and then, starting from the first address of the freed idle memory space, the map identification value and the corresponding map information of the current map identified by step S1 are stored in the linear storage space; then, while maintaining the current map identified by step S1, On the premise that the order of matching priorities of each frame map existing before the previous map remains unchanged, the matching priority of the current map identified in step S1 is adjusted to the highest, and it is determined that a map saving operation is completed; wherein the linear storage space is configured as a memory space in the map memory for storing the map identification value and map information of each frame map; the corresponding address offset is less than or equal to the address interval size occupied by all deleted frame maps; wherein the reference map storage unit set in the linear storage space is the first storage unit set starting from the first address of the linear storage space; the order of matching priorities of the maps is configured as follows: the higher the matching priority of a frame map, the closer the storage position of the frame map in the linear storage space is.
[0010] Furthermore, the step S2 also includes: on the premise that the capacity of the current map identified in the step S1 is less than or equal to the capacity of the reference map storage unit provided in the linear storage space, if the linear storage space is full, deleting the map identification value of a frame of map stored earliest in the linear storage space and its corresponding map information; if the linear storage space is not full, not deleting the map identification value of any frame of map and its corresponding map information; then, starting from the reference map storage unit, controlling the map identification value of each frame of map currently existing in the linear storage space and its corresponding map information to be moved to an adjacent storage unit, so that there are idle map storage units in the reference map storage unit. memory space; then the map identification value of the current map identified by the step S1 and the corresponding map information are stored in the reference map storage unit, and at the same time, under the premise of maintaining the order of the matching priorities of each frame of the map existing before the current map identified by the step S1 is stored, the matching priority of the current map identified by the step S1 is adjusted to the highest, and it is determined that a map saving operation is completed; wherein, the linear storage space is divided into a plurality of storage units; each storage unit is used to store a frame of map corresponding to at least one matching priority, or a frame of map corresponding to at least one map identification value; the linear storage space is the physical storage structure of the linear table for data.
[0011] Furthermore, the map identification value corresponding to the map information of each frame of the map pre-stored in the linear storage space is less than the map identification value of the current map set in step S1; before starting to increase the fixed increment to the map traversal mark value, the initial value of the map traversal mark value is the value 1, wherein the fixed increment is the value 1, so that the map identification value is set in an orderly manner starting from the value 1 by adding one to the count.
[0012] Furthermore, before executing the step S1 or after executing the step S2, it also includes: step S01, according to the order of matching priorities corresponding to the maps stored in the linear storage space, control the map information of the current map constructed by the robot in real time to match with the map information of the corresponding frame of map stored in the linear storage space, so that the current map constructed by the robot in real time is preferentially matched with the frame of map with the highest matching priority; then determine whether the match is successful, if so, execute step S02, otherwise execute step S03; wherein, the map information of the current map constructed by the robot in real time in step S01 is not stored in the linear storage space; step S02, first retrieve the corresponding frame of map described in step S01 from the linear storage space; then move the map identification value of each frame of map with a higher matching priority than the corresponding frame of map described in step S01 and its corresponding map information to adjacent storage units in sequence, So that the reference map storage unit becomes an idle memory space and fills up the storage unit occupied by the corresponding frame map described in step S01; then the matching priority of each frame map with a higher matching priority than the corresponding frame map described in step S01 is reduced by one level, and the map identification value of the corresponding frame map described in step S01 and its corresponding map information are stored in the reference map storage unit, and at the same time the matching priority of the corresponding frame map described in step S01 is adjusted to the highest; step S03, update a frame map with a matching priority one level lower than the corresponding frame map described in step S01 to the corresponding frame map described in step S01, and then return to execute step S01 to enable the robot to start matching a frame map with a relatively low matching priority, until the map information of the current map fails to match the map information of all frame maps stored in the linear storage space, and then determine that the robot repositioning fails, and then start executing step S1.
[0013] Furthermore, the step S1 also includes: whenever the robot fails to relocalize, marking the current map constructed by the robot in real time through the map traversal mark value, so as to set the map mark value of the current map constructed by the robot in real time to a value of 0.
[0014] Furthermore, if a frame of map pre-stored in the map memory is reused as the current map, the following method exists: first, the frame of map to be reused is retrieved from the map memory; then, starting from the reference map storage unit, each frame of map whose storage order is before the frame of map to be reused is moved to an adjacent storage unit, and then the frame of map to be reused is stored in the reference map storage unit; and the matching priority of the frame of map to be reused is adjusted to the highest, and at the same time, the matching priority of each frame of map with a higher matching priority than the frame of map to be reused is reduced by one level, so that the matching priority order of each frame of map except the frame of map to be reused remains unchanged; then the map identification value most recently stored in the reference map storage unit is updated to the map identification value of the current map, and ... The map information of the storage unit is updated to the map information of the current map, and it is determined to reuse a frame of map stored in advance as the current map; wherein the frame of map to be reused is determined by a map identification value specified by a remote control signal outside the robot, or by a map identification value specified in the map memory when the robot is forced to stop moving, or by a map identification value specified in the map memory when the robot fails to reposition; wherein the map memory is arranged inside the robot; the map memory is divided into a plurality of storage units; wherein the reference map storage unit is the first storage unit set starting from the first address of the map memory, and is used to store the current map; the order of the matching priorities of the maps is configured as follows: the higher the matching priority of a frame of map, the closer the storage position of the frame of map in the map memory is.
[0015] A mobile robot comprises a storage device and a processor, wherein the storage device is used to store a computer program, and the processor runs the computer program to enable the mobile robot to execute the robot map management method, wherein the storage device comprises a map memory.
[0016] A robot map management method described in the present application marks the map identification value of the current map constructed by the robot in real time by counting the map traversal mark value, so as to record the map identification value of the current map used to represent the new environment area and determine that the robot obtains a frame of map used to represent the new environment area. Under the action of continuous marking of each floor area, the unique identification value of the map of each floor area can be obtained and a multi-floor map list (linear storage space) can be established, which is convenient for distinguishing and scheduling the map information of different floor areas. Then, the robot can directly call the corresponding matching map for positioning in the environment of different floors. The robot map management method can save the historical map (a frame of map pre-stored in the map memory) that successfully matches the current map constructed in real time at the address position with a forward storage order, and become the frame of map with the highest priority matching in the robot relocation or positioning process. In particular, when repeatedly traversing a specific floor area, it can effectively and quickly call the map that best matches the floor area currently traversed for matching and positioning according to the priority configured in advance, and can also be used as a map for real-time navigation and positioning. Improve the utilization rate and environmental applicability of the pre-stored map, and meet the map diversity requirements of the robot relocation in a multi-floor environment (i.e., multiple frames of maps arranged in order).
[0017] In addition, when the user remotely controls the robot or the robot stops moving due to an abnormality, a frame of map that can represent the floor area where the robot is located can be selected from the pre-stored multi-frame maps and reused as the current map for the robot's real-time navigation and positioning. The robot's navigation and positioning function can be maintained without the need for the robot to actually walk to build the current map. On the basis of identifying and saving the map identification values and map information of multiple frames of different environmental areas configured as reused resources, a frame of historical map is reused into the current map. This not only realizes the fast and flexible reuse of reused resources (map resources) for the map required for the robot's real-time navigation, but also eliminates the need to reconfigure map resources in the current map and store and configure new map resources in the map memory, thereby reducing the robot's map building time. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] Figure 1 The present invention is a flowchart of a robot map management method disclosed in an embodiment of the present invention. DETAILED DESCRIPTION
[0019] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0020] If the robot enters a new floor from a floor that has been traversed, in order to record the map of the new floor and update the map of the traversed floor easily, the robot's memory will be configured to store at most one floor map, resulting in the loss of information in the map of the previously traversed floor. During the positioning process, the robot can only hit the environment area of the same floor at most. The robot will continue to use the current map to update the historical map. If the historical map is not retained, the map of the traversed floor area will not be retained. Only the map of the currently traversed floor area will be refreshed. Moreover, at most only one frame of the map can be displayed to the external mobile terminal to obtain the map resources of a single environment area. When the robot performs positioning matching operations in the new environment, it does not store enough map samples to match the current map, affecting the accuracy of the robot's positioning. Moreover, when the robot walks repeatedly on different floors of the same building, it needs to repeatedly build maps.
[0021] In a scenario where a robot navigates in a multi-floor environment, after traversing the environment area of the second floor, the robot continues to traverse the third floor (at this time, the current map is a map of the environment area of the third floor, and the historical map is a map of the environment area of the second floor) and the fourth floor (at this time, the current map is a map of the environment area of the fourth floor, and the historical map is a map of the environment area of the third floor), and then the robot returns to traverse the environment area of the second floor (at this time, the current map is a map of the environment area of the second floor, and the historical map is a map of the environment area of the fourth floor). Without the pre-established map of the environment area of the second floor, it is impossible to form a map that can represent multiple floors. Map list, that is, the current map and historical map alone cannot establish a storage collection of maps that exist simultaneously in the areas from the second floor to the fourth floor, let alone the management of maps of different floor environments and map scheduling during the robot's traversal; for example, when the robot returns to traverse the environmental area of the second floor, it needs to rebuild the map and repeatedly configure map resources, including recalculating position information and marking positions occupied by obstacles; if the robot locates itself by matching in the environmental area of the second floor that has been traversed, that is, the robot performs repositioning, the matching operation cannot be carried out due to the lack of a pre-established map of the environmental area of the second floor.
[0022] As an embodiment, in order to control the robot to manage the multi-frame map established in the multi-floor environment, a robot map management method is disclosed, such as Figure 1As shown, it includes: step S1, whenever the robot detects a new floor area, the current map constructed by the robot in real time is marked by the map traversal mark value, and then step S2 is executed. Among them, the current map constructed by the robot in real time is a frame map used to represent the new floor area currently detected by the robot; the new floor area is a floor area outside the area corresponding to the map pre-stored in the map memory, and the new floor area is the floor area currently traversed by the robot (the corresponding frame map may have been completely constructed but not stored in the map memory); the floor area currently traversed by the robot is used to represent the robot's historical walking path and the floor area that has not been walked, relative to the floor area corresponding to each frame map pre-stored in the map memory, belongs to the new floor area; the new floor area can be the global area of a single floor domain, or it can be a local floor area of a floor (such as a single room area) so that the robot needs to use at least two frames of maps to represent the global floor area of a single floor; the map information of the new floor area is not currently stored in the map memory, and the map information of the new floor area is the result of converting the environmental information belonging to the new floor area into the map coordinate system; in addition, the maps pre-stored in the map memory are all maps constructed by the robot in the traversed floor area, and each frame of map pre-stored in the map memory is an environmental map corresponding to the floor area of the corresponding layer that the robot has walked, including at least one room area on the same floor or the global area of the entire floor. In this embodiment, when the robot starts to build a map in a new floor area, the robot detects the new floor area, and the robot starts to traverse (or walk in) the new floor area; each time the robot starts to build a map in a new floor area, the current map built by the robot in real time is identified by the map traversal mark value, and a frame of map built by the robot in each floor area can be identified by applying a change to the map traversal mark value. Preferably, each time the robot traverses a new floor area and builds a corresponding frame of map, the map traversal mark value is controlled to increase by one, and the counting result of the map traversal mark value is used to identify a frame of map built in each floor area. The map corresponding to each floor area has unique identification information (such as an identification value), which is convenient for the robot to distinguish map information of different floor areas in the same storage space, and also convenient for scheduling and using pre-stored map information of traversed floor areas.
[0023] Step S2, the robot stores the map information of the current map identified in step S1 into the map memory according to the capacity of the current map constructed in real time, and also stores the identification information of the current map in the map memory to establish a data index relationship with the map information of the current map, so that the size of the storage space for the map information of the current map identified in step S1 can be configured according to the size relationship between the capacity of the current map constructed in real time and the capacity of the corresponding storage unit in the map memory, and the storage position relationship between the current map identified in step S1 and the remaining existing frames of the map is also allocated, so that the maps stored in the same map memory correspond to different floor areas, forming a multi-floor map library, so that there are enough matching map samples for the robot to reposition, and the maps of the floor areas for the robot to reuse as the current map are also rich enough; wherein the capacity of the current map includes the storage capacity occupied by the map identification information of the current map and the storage capacity occupied by the map information of the current map. The sum of the storage capacity of the robot; after constructing the map, the robot obtains map information including the area and location information of the actual wall, virtual wall, work restricted area, room partition, etc., and organizes it into the environmental characteristic parameters such as accessibility, area attributes, obstacle location, etc. that need to be configured for the currently constructed map; at the same time, the robot adjusts the matching priority of the current map identified in step S1 to the highest, and the current map becomes the frame map with the highest matching priority among all existing maps after being stored in the map memory. Among all existing maps, there may be multiple similar rooms to be operated on the same floor or map information of multiple similar floors; the storage address of the current map is located in the first operable address interval set in the map memory, so that the robot subsequently preferentially calls the current map for map matching, so that the robot preferentially uses the map with a higher matching priority to locate the current environment, and improves the accuracy of the robot's positioning and the speed of matching the map information during the relocation process. Compared with the frame-by-frame map traversal and matching method of the prior art, the present application can speed up the acquisition of map information corresponding to new environmental data by setting the matching priority of the map in advance, and speed up the screening effect of map information in multi-floor areas.
[0024] As an embodiment, especially before executing step S1 or when starting to execute step S1, each time the robot traverses a floor area (that is, when the robot starts walking in a floor area of a floor of a building), the robot collects the position attribute identification information of the floor area in which it is currently located, and determines whether the position attribute identification information currently collected by the robot successfully matches the position attribute identification information saved in advance. If so, it is determined that the robot has not detected a new floor area, and the robot extracts the floor information from the currently collected position attribute identification information to determine the floor in which the robot is currently located, and further can determine the room number of the floor in which it is located; otherwise, when the robot receives the command signal transmitted from the outside and parses the floor information, the currently parsed floor information is added to the currently collected position attribute identification information, and the position attribute identification information with the added floor information is saved in the map memory, and it is determined that the robot has detected a new floor area, and further can determine the room number of the floor in which it is located. Accordingly, a floor index identification can be set for each floor, and the robot can search for the map information configured for the corresponding floor according to the floor index identification; at the same time, the robot starts to build a new frame of map in the new floor area based on the currently collected position attribute identification information. The location attribute identification information includes environmental characteristic parameters of the robot in the corresponding floor area; in the map memory, the location attribute identification information is saved as a part of map information of a frame of map representing the floor area where the robot is currently located.
[0025] In this embodiment, if it is determined that the position attribute identification information currently collected by the robot does not match the position attribute identification information saved in advance, the robot first sends a request signal to an external communication device for obtaining floor information. After responding to the request signal, the communication device sends a command signal associated with the floor information to the robot, allowing the robot to parse the command signal into floor information to obtain a response from the communication device in the floor area where the robot is currently located; wherein the communication device fixedly set in the floor area currently traversed by the robot sends a command signal associated with the floor information in response to detecting the request command issued by the robot. The command signal associated with the floor information is specifically the packaged floor information sent to the requesting robot, which may be a coded signal carrying the floor information.
[0026] Alternatively, if it is determined that the position attribute identification information currently collected by the robot does not match the pre-saved position attribute identification information, the robot first sends a request signal to the outside for obtaining floor information, prompting the user to manually apply contact control actions to the robot, such as transmitting floor information through a data cable or triggering the generation of floor information by a button, so that the robot converts the contact control action into a command signal, and then parses the command signal into floor information.
[0027] Preferably, maps constructed at different floor areas can be set with different colors for distinction and prompting. The currently collected location attribute identification information is saved as map information of a frame of map for indicating the floor area where the robot is currently located, so that the map information of a new frame of map is saved in the map memory.
[0028] In some embodiments, each time the robot traverses a floor area, whether it is a new floor or a floor that has been traversed, it can receive floor information transmitted by an external command signal or floor information generated by an external contact control action, and can obtain the number of the room in the corresponding floor; especially in the embodiment where a new floor area is detected, the user remotely controls the mobile terminal to generate coded information of the floor information where the robot is currently located and sends it to the robot so that the robot can parse the floor information; or the user loads the packaged information of the floor information to the firmware upgrade interface of the robot through a data cable in the floor area where the robot is currently located, or generates coded information of the floor information by pressing relevant function buttons, and the robot then parses the floor information and adds location attribute identification information, and then saves it as part of the map information of the current floor, so that the robot can recognize whether its current floor area is located on the first floor, the second floor or other floors. Among them, the location attribute identification information includes the environmental characteristic parameters of the robot in the corresponding floor area, and the environmental characteristic parameters in the corresponding floor area include floor information (which can be regarded as external customized information) used to distinguish different floors and / or at least one room area on the same floor; the pre-stored location attribute identification information is map information derived from the map pre-stored in the map memory, and the location attribute identification information saved in the map memory along with a newly constructed frame of map after the robot detects a new floor area becomes the map information of the historical map (updated to the pre-stored map) later. The new floor area described in this embodiment can be a global area of a floor, or a partial room area or all room areas on the same floor, and of course, it can also be a corridor area other than the room area on the same floor.
[0029] In this embodiment, the position attribute identification information currently collected by the robot is matched with the position attribute identification information stored in advance. The position attribute identification information currently collected by the robot can be divided into various types of sub-position attribute identification information, and the position attribute identification information stored in advance is also correspondingly divided into various types of sub-position attribute identification information, including floor information; the matching method can be understood as comparing each sub-position attribute identification information collected in real time with all pre-stored sub-position attribute identification information of the same type in turn (including a simple comparison of the floor numbers in the floor information); when the difference between each sub-position attribute identification information collected in real time and the corresponding sub-position attribute identification information of the same type stored in advance is greater than a preset reference matching threshold, it is determined that the currently collected position attribute identification information matches the pre-stored position attribute identification information successfully, otherwise it is determined that the currently collected position attribute identification information matches the pre-stored position attribute identification information unsuccessfully, wherein the preset reference matching threshold needs to take into account errors caused by possible similar floors, similar room areas or similar position attribute identification information.
[0030] In some embodiments, the location attribute identification information may include a signal of image statistical processing of the road signs collected by the robot during the traversal of the floor area, ensuring that sufficient road sign feature information is set on the current map, and may also include representative apartment parameters, floor information (defined by the floor number applied externally by the robot, and / or the room number in the corresponding floor), geometric features of the entire floor, and wall parameters. The operation area can be accurately marked to reduce errors. The location attribute identification information can be used to perform feature identification on the map information to prevent erroneous judgments caused by similar environments between different map information. Furthermore, the location attribute identification information is converted to obtain the actual area of the area corresponding to the map, the number of road landmarks corresponding to the map and the storage time of the map, and the difference includes the difference in the actual area of the area corresponding to the map, the difference in the number of road landmarks corresponding to the map and the difference in the storage time of the map, and is obtained by subtracting the currently collected location attribute identification information from the pre-saved location attribute identification information. Then, if the difference between the currently collected location attribute identification information and the pre-saved location attribute identification information is greater than the preset difference, it can be determined that the matching rate between the two is less than the first preset matching threshold, or the currently collected location attribute identification information with a matching rate less than the first preset matching threshold is obtained, then the matching between the two fails, and new environmental feature parameters or a new floor area are detected. On the other hand, if the difference between a sub-position attribute identification information currently collected and one of the sub-position attribute identification information of the same type stored in advance is less than the preset difference, it is determined that the matching rate of the two sub-position attribute identification information is greater than the second preset matching threshold, and a sub-position attribute identification information currently collected with a matching rate greater than the second preset matching threshold can also be obtained, and the two sub-position attribute identification information are matched successfully; specifically, when wall feature parameters are used for comparison, the geometric features between the wall segments in the position attribute identification information currently collected are analyzed, and the geometric features are controlled to perform geometric parameter matching with the pre-stored position attribute identification information, so as to obtain the currently collected wall feature parameters with a matching rate greater than the second preset matching threshold.
[0031] As an embodiment, in the aforementioned step S1, the method of identifying the current map constructed by the robot in real time by using the map traversal mark value specifically includes:
[0032] When the robot detects the new floor area, the robot first sets the map identification value of the current map constructed in real time to the value 0, so as to identify the current map as a frame of map that is not stored in the map memory, indicating that the robot has constructed a new frame of map in the floor area currently traversed, but has not been identified and stored in the map memory. Relative to the map pre-stored in the map memory, the current map constructed in real time is a frame of map that is used to represent an environmental area that the robot has not traversed before; at this time, when the robot starts to construct a map in the new floor area, the robot detects the new floor area, and the robot begins to traverse (or walk in) the new floor area and constructs the corresponding map. The robot needs to save the current map later.
[0033] In step S1, in order to construct a multi-floor map in the map memory, when a new floor area is detected and a map corresponding to the new floor area is constructed, the robot will trigger a map saving operation, that is, the robot needs to save the current map constructed in real time or a frame of map directly called from the map memory to update the current map; specifically, if the robot starts to traverse (or walk in) a floor area and obtains the current map (the acquisition here can be a map corresponding to the current floor that has been completely constructed or a frame of map directly called from the map memory), before saving the current map currently obtained into the map memory, it will first determine whether the map identification value of the current map is 0. If so, it is determined that the robot is currently walking in a new environment, otherwise it is determined that the robot is walking in a traversed environment (a floor area corresponding to a frame of map pre-stored in the map memory). Therefore, before the robot needs to save the map, the floor area that has been traversed and the floor area that has not been traversed are identified by detecting the map identification value of the currently obtained map, so as to facilitate the saving of the map corresponding to the new floor area.
[0034] It should be noted that the robot uses one frame of map as a detection unit to perform environmental area detection; the robot uses at least one frame of map to record the environmental information of the first floor area, and each frame of map stored in the map memory corresponds to a map identification value, or each frame of map constructed corresponds to a map identification value. Preferably, when multiple similar rooms to be worked on the same floor are recorded using one frame of map respectively, each map of the room to be worked on corresponds to a map identification value, and the robot uses at least one frame of map to record the environmental information of the first floor area. Alternatively, the size of the one-frame map currently obtained by the robot is configured to represent the size of the first floor area where the robot is currently located. The one-frame map currently obtained here can be the latest constructed map corresponding to the new floor area currently located or a matching one-frame map directly called from the map memory in the floor area that the robot has traversed.
[0035] On the premise that the robot determines that it has triggered a map saving operation, when the robot determines that the map identification value of the current map is 0, and before saving the current map into the map memory, the robot controls the map traversal mark value to be added with a fixed increment, and then updates the added value to the map traversal mark value, and then sets the updated map traversal mark value as the map identification value of the current map, thereby setting the map identification value by self-incrementing the map traversal mark value to identify the map of each new floor area; in some embodiments, the initial value of the map traversal mark value is configured as a value of 1 to distinguish it from the map identification value, especially when the map identification value is set to 0 or it is recognized that the map identification value is 0, the map traversal mark value is It is configured to start from the value 1 and increment to update the map identification value; further, if the fixed increment is also set to the value 1, the number of floors traversed by the robot is represented by adding a count to the map traversal mark value, and only one floor area is traversed each time and a corresponding frame of map is constructed, and then the frame of map is identified using the map identification value, and then the robot executes step S2 to save the map identification value and the map information of the corresponding frame of map into the map memory, specifically, the matching priority of the frame map set determined in step S2 is saved in the corresponding storage unit of the map memory in sequence, so that each frame of map is stored separately, an index relationship between the map identification value and the map information is established, and a mapping relationship between the matching priority and the storage address of the map is established.
[0036] In summary, a robot map management method disclosed in this embodiment marks the map identification value of the current map constructed by the robot in real time by counting the map traversal mark value, so as to record the map identification value of the current map used to represent the new environmental area and determine that the robot obtains a frame of map used to represent the new environmental area. Under the effect of continuous marking of each floor area, a unique identification value of the map of each floor area can be obtained and a multi-floor map list can be established, which is convenient for distinguishing and scheduling the use of map information of different floor areas. The robot can directly call the corresponding matching map for positioning in the environment of different floors, thereby meeting the map diversity requirements of the robot's repositioning in a multi-floor environment (i.e., multi-frame maps arranged in order).
[0037] As an embodiment, it can be an embodiment formed on the basis of the embodiment in which the robot detects a new floor area, and the robot map management method further includes:
[0038] On the premise that the robot has not detected the new floor area, if the floor area currently located by the robot has not changed, the map identification value of the one-frame map used to indicate the floor currently located by the robot is maintained as the map identification value of the current map, wherein the one-frame map used to indicate the floor currently located by the robot is set as the current map; and the robot does not adjust the matching priority of the one-frame map used to indicate the floor currently located by the robot. At this time, the robot starts to walk in the traversed floor area to repeatedly traverse the relevant local area, but the robot has not detected the new floor area. The robot does not need to build a new map in the traversed floor area, but calls out the one-frame map used to indicate the floor currently located by the robot from the pre-stored map memory as the current map. There is no need to identify the map through the aforementioned map traversal mark value, but the map identification value of the one-frame map used to indicate the floor currently located by the robot is maintained as the map identification value of the current map. Since the floor area currently located by the robot has not changed, the robot has not built a new map nor changed the current map, so the robot does not need to trigger the map saving operation, and step S2 is not executed.
[0039] On the premise that the robot does not detect the new floor area, if the robot traverses between the floor areas corresponding to at least two pre-stored frames of maps, it is determined that the floor area where the robot is currently located changes between the floor areas corresponding to the pre-stored maps. It can be determined that the robot has cross-floor movement but does not repeatedly navigate and walk in the same floor area during this traversal stage, forming a traversal stage. After the robot triggers the map saving operation, the robot updates the map identification value of a frame map used to represent the floor area where the robot is currently located to the map identification value of the current map, so that the frame map used to represent the floor area where the robot is most recently located is updated to the current map. During this traversal stage, the floor area where the robot is currently located is changed, which can be a change between multiple floors to be operated in a building; the robot adjusts the matching priority of the frame map used to represent the floor area where the robot is currently located to the highest. In this embodiment, the order of the storage address of the frame map used to represent the floor area where the robot is currently located in the map memory is set to the first address order among all existing frame maps. Compared with the method of the prior art that does not pre-store multiple frames of historical maps, this embodiment does not need to repeatedly construct the map each time the floor area corresponding to the pre-stored frame map is traversed. Figure 1 Instead, it directly calls a pre-stored frame of map. It can call a corresponding matching frame of map according to the pre-marked information, which reduces the time for the robot to build maps and use map navigation, and also ensures the accuracy of the robot's positioning.
[0040] Since the change of the floor area where the robot is currently located between the floor areas corresponding to the pre-stored map can trigger the update of the matching priority and the current map, the data in the storage space specifically used to store the current map in the same map memory also needs to be updated accordingly. It can be that a frame map of the floor area where the robot is currently located is first moved out of the map memory to a temporary storage space, and then the existing map in the map memory is shifted accordingly. Specifically, each frame map before the storage position of the map to be moved out is shifted and stored, and the storage position of the map to be moved out is filled. Free space is freed up in the storage space specifically used to store the current map, and then a frame map of the floor area where the robot is currently located is stored in the storage space specifically used to store the current map. The storage space specifically used to store the current map here can be the first-ranked storage unit of the map memory, and it is determined that a map save operation is implemented and completed.
[0041] It should be noted that the robot uses a frame of map to mark the environmental area of one floor, and each frame of map corresponds to a map identification value. When the robot navigates in a new floor environment or repeatedly navigates in the same floor environment, it can use laser radar or camera shooting to obtain the local environmental data. Specifically, the mobile robot is equipped with a laser scanning radar or camera, which can obtain the environmental information of the floor by controlling the laser radar or camera, and draw an environmental map of the floor area of one floor by obtaining the environmental information based on the floor. In an embodiment of the present invention, each frame of map established by the robot can be stored in units of one floor area. For example, when the robot operates on the floor area of the first floor, it obtains the map information corresponding to the floor area of the first floor. The map information can be adjusted in real time according to the changes in the environment of the floor area of the first floor, but the number of times the map information of the floor area of the first floor is updated by the map information of other floor areas is reduced.
[0042] As an embodiment, it can be implemented on the basis of the embodiment described in step S1, specifically, the map saving operation is implemented under the premise of triggering a map saving operation; the step S2 specifically includes: before the robot stores the map identification value of the current map and the map information of the current map into the map memory, after executing step S1, the robot first determines the relationship between the capacity of the current map identified by step S1 and the capacity of the reference map storage unit set in the linear storage space, so that the robot opens up a memory space in the map memory that can completely store the map identification value of the current map and its map information; the capacity of the current map identified by step S1 includes the sum of the storage capacity occupied by the map identification value of the current map and the storage capacity occupied by the map information of the current map, preferably, the capacity of the current map is equal to the sum of the storage capacity occupied by the map identification value of the current map and the storage capacity occupied by the map information of the current map; in some embodiments, the current map identified by step S1 can be the current map constructed by the robot in real time. When it is determined that the capacity of the current map identified in step S1 is greater than the capacity of the reference map storage unit in the linear storage space, the robot first deletes the map identification value and corresponding map information of at least one frame of map pre-stored in the linear storage space, generally the map identification value and corresponding map information of one frame of map, and the earliest frame of map stored in the linear storage space, so as to delete invalid map information, retain maps with relatively close construction time, and save valid map information to improve the accuracy of relocation. In some embodiments, any frame of map pre-stored in the linear storage space can also be deleted, or a frame of map (including the map identification value and corresponding map information of the frame of map) that exceeds the capacity of a single storage unit can be deleted.
[0043] Then starting from the reference map storage unit, generally starting from the first address of the reference map storage unit, the map identification value and the corresponding map information of each frame of the map located before the last map in the order to be deleted in the linear storage space are controlled to be offset by the corresponding address offset. Specifically, each frame of the map existing in the linear storage space with a higher matching priority than the deleted map with the lowest matching priority is offset by the corresponding address offset to the corresponding sorted storage unit, and each storage unit can be allowed to store the map identification value of a frame of the map and the corresponding map information, thereby freeing up idle memory space (storage space not occupied by data) for the current map identified in step S1. The capacity of the idle memory space is larger than the capacity of the reference map storage unit, but the first addresses of the two are the same, so that the reference map storage unit and at least one adjacent storage unit can become idle memory space, so that the map identification value and the corresponding map information of the current map identified in step S1 can be stored in the idle memory space later. Then, starting from the first address of the freed-up memory space, the map identification value of the current map identified in step S1 and its corresponding map information are stored in the linear storage space; then, under the premise of maintaining the order of matching priorities of each frame of maps existing before the current map identified in step S1 is stored (note that the order of storing the maps is also the order of matching priorities), the matching priority of the current map identified in step S1 is adjusted to the highest. After the current map identified in step S1 is stored in the linear storage space, it becomes the highest existing map in the linear storage space. The map frame with the highest matching priority among all the maps is also the map frame with the first storage position sorting, but the map identification value of each map frame is not changed, including each map frame that is offset and the stored current map; at this time, the current map identified in step S1 is updated to the current map, so that after the robot is moved to a new floor area or moved to a specific working position in the same floor area, after the robot is restarted, the current map and the maps constructed earlier by the remaining frames (maps with slightly lower matching priority) can be directly retrieved from the linear storage space to facilitate positioning or repositioning and reduce the possibility of map information loss.
[0044] Among them, the capacity of the linear storage space is set to be fixed; before the map identification value of the current map identified by the step S1 and its corresponding map information are stored, the order of matching priorities of each remaining frame of the map is not affected after the map is deleted. The order of matching priorities of each remaining frame of the map is the order of arrangement between each other, not the order of matching priorities of a single map, but the order of matching priorities between two frames of the map, which can be understood as the order in which each frame of the map is stored in the linear storage space. The storage order of one frame of the remaining maps relative to any other frame of the map remains unchanged. For example, the linear storage space stores map M, map N, map O, map P and map Q in sequence. After deleting map N and map O, map M among the remaining maps is still located before map P, and map P is still located before map Q. Even if map S is subsequently added before map P, map M is still located before map P, and map P is still located before map Q; then deleting at least one frame of the map pre-stored in the linear storage space After the map identification value of the frame map and its corresponding map information are obtained, the robot controls each frame map with a higher matching priority than the deleted map with the lowest matching priority to be offset by the corresponding address offset, and adjusts the matching priority of each frame map with a higher matching priority than the deleted map with the lowest matching priority (that is, each frame map with address offset) to one level lower than the original one. At this time, the storage order of each frame map except the deleted map in the linear storage space is not changed (due to the overall offset, the storage order between any two offset frame maps has not been changed, and the order of matching priorities has not changed). Before storing each new map, if the capacity of the idle memory space vacated after the deletion is large enough, the storage space of all existing historical maps before the deleted map with the lowest matching priority will be adjusted backwards from the back to the front to the first storage position. The offsets of historical maps at different positions may not be the same, but the matching priority is only related to the order of storage in the linear storage space. After the current map identified in step S1 is stored, the matching priority of the current map identified in step S1 is set to the highest matching priority in the linear storage space, and the current map identified in step S1 is stored before all frame maps originally stored in the linear storage space, while the matching priorities of the remaining frame maps are adjusted to be one level lower than those before the current map identified in step S1 is stored, thereby realizing dynamic adjustment of the matching priorities of all frame maps in the linear storage space.
[0045] It should be noted that the corresponding address offset is less than or equal to the cumulative address interval size occupied by all deleted frame maps, and the cumulative address interval size occupied by all deleted frame maps includes the sum of the address interval cumulatively occupied by the map identification values of all deleted frame maps and the address interval cumulatively occupied by the map information of all deleted frame maps; if the deleted maps are two frame maps with discontinuous storage locations, then among the two frame maps with discontinuous storage locations, the address offset of each frame map before the frame map with a relatively forward ranking in the storage location (with a relatively high matching priority) is greater than the address offset of each frame map between the two frame maps with discontinuous storage locations, wherein the address offset of each frame map before the frame map with a relatively forward ranking in the storage location (with a relatively high matching priority) is equal to the cumulative address interval size occupied by all deleted frame maps; if the deleted maps are at least two frame maps with continuous storage locations, the address offset of each deleted frame map is equal to the cumulative address interval size occupied by all deleted frame maps.
[0046] It should be noted that the linear storage space is configured as a memory space in the map memory for storing the map identification value and map information of each frame of the map; preferably, the linear storage space is pre-divided into multiple storage units; each frame of the map is configured to be cached in at least one storage unit in the linear storage space, and each storage unit stores at least one frame of the map with one matching priority or one frame of the map with one map identification value, which means that the map identification value of a frame of the map and its corresponding map information are stored in two storage units with consecutive addresses, which do not necessarily occupy the two consecutive storage units, so some storage units may store two maps with two matching priorities or two frames of the map; preferably, the capacity of the reference map storage unit is set to be larger than the capacity of any other storage unit. Among them, the reference map storage unit set in the linear storage space is the first storage unit set starting from the first address of the linear storage space; the order of map matching priority is configured as follows: the higher the matching priority of a frame map, the closer the storage position of the frame map in the linear storage space is, that is, the closer to the first address; on the contrary, the lower the matching priority of a frame map, the later the storage position of the frame map in the linear storage space is, that is, the farther away from the first address.
[0047] As an embodiment, it can be implemented on the basis of the embodiment described in step S1, specifically, the map saving operation is implemented under the premise of triggering a map saving operation; the step S2 also includes: before the robot stores the map identification value of the current map and the map information of the current map into the map memory, after executing step S1, the robot first determines the relationship between the capacity of the current map identified by step S1 and the capacity of the reference map storage unit set in the linear storage space, so that the robot opens up a memory space in the map memory that can completely store the map identification value of the current map and its map information; the capacity of the current map identified by step S1 includes the sum of the storage capacity occupied by the map identification value of the current map and the storage capacity occupied by the map information of the current map. In this embodiment, the linear storage space is divided into a plurality of storage units; each storage unit is used to store a map that matches at least one matching priority, or a map frame that matches a map identification value, which means that a map identification value of a map frame and its corresponding map information are stored in two storage units with consecutive addresses, which may not occupy all of the two consecutive addresses. Therefore, some storage units may store two maps with two matching priorities or two frames of maps; preferably, the capacity of the reference map storage unit is set to be greater than the capacity of any other storage unit. The reference map storage unit set in the linear storage space is the first storage unit set starting from the first address of the linear storage space. Preferably, the capacity of the current map is equal to the sum of the storage capacity occupied by the map identification value of the current map and the storage capacity occupied by the map information of the current map.
[0048] On the premise that the robot determines that the capacity of the current map identified in step S1 is less than or equal to the capacity of the reference map storage unit in the linear storage space, if the linear storage space is full, the map identification value of the earliest frame of the map stored in the linear storage space and its corresponding map information are deleted. On the one hand, after the current map identified in step S1 is stored in the linear storage space, data overflow of the linear storage space can be prevented, and on the other hand, a reasonable empty space is freed up for the current map identified in step S1; the linear storage space is pre-divided into a plurality of storage units; each storage unit is used to store a frame of the map corresponding to at least one matching priority, or a frame of map that matches at least one map identification value; the capacity of each storage unit is pre-configured, and preferably, the capacity of a storage unit is equal to the standard storage capacity occupied by the map identification value of a frame of map representing a floor area and its corresponding map information, so that the storage capacity occupied by the map identification value of a frame of map and its corresponding map information stored earliest in the linear storage space can be equal to the capacity of the current map identified in step S1 (the capacity of the current map identified in step S1 is less than or equal to the capacity of the reference map storage unit set in the linear storage space), or can be equal to the capacity of the reference map storage unit set in the linear storage space.
[0049] On the premise that the robot determines that the capacity of the current map identified in step S1 is less than or equal to the capacity of the reference map storage unit provided in the linear storage space, if the linear storage space is not full, the map identification value of any frame map and its corresponding map information are not deleted. The reason is that there is still a sufficiently large idle memory space in the linear storage space, and the linear storage space is the mapping form of the sequence table in the data structure in the memory, that is, the physical storage structure of the sequence table to the data. The linear table storage structure can be subdivided into a sequential storage structure and a chain storage structure. The sequence table is a storage structure form of the linear table. When the sequence table stores the map, a whole block of physical space of sufficient size will be applied in advance, and then each frame map will be stored in sequence. When storing, no idle memory space is left between the map information of each frame map. The situation that the linear storage space is not full is that there is an idle memory space at the tail address of the linear storage space, and it is sufficient to store the map identification value of a frame map and its corresponding map information. Moreover, the capacity of the current map identified in step S1 is less than or equal to the capacity of the reference map storage unit provided in the linear storage space. Therefore, there is no need to delete any frame map from the linear storage space.
[0050] After determining the comparison result between the capacity of the current map identified in step S1 and the capacity of the reference map storage unit in the linear storage space and deleting the earliest stored map identification value and its corresponding map information accordingly, starting from the reference map storage unit, generally starting from the first address of the reference map storage unit, the map identification value of each frame map existing in the linear storage space and its corresponding map information are controlled to be moved to adjacent storage units, specifically, each frame map existing in the linear storage space or each frame map with a matching priority higher than the deleted frame map is offset to adjacent storage units in sequence to form an overall offset of all frame maps existing in the linear storage space, fill up the idle memory space at the tail address of the linear storage space, and free up idle memory space (storage space not occupied by data) in the reference map storage unit, the capacity of which may be less than or equal to the capacity of the reference map storage unit; then the map identification value of the current map identified in step S1 and its corresponding map information are stored in the reference map storage unit, specifically starting from the first address of the reference map storage unit. Starting from the first address of the idle memory space vacated, the map identification value of the current map identified by the step S1 and the corresponding map information are stored in the reference map storage unit in sequence; at the same time, under the premise of maintaining the matching priority order of each frame map existing before the current map identified by the step S1 is stored, the matching priority of the current map identified by the step S1 is adjusted to the highest, becoming the frame map with the highest matching priority among all the maps currently existing in the linear storage space, and also the frame map with the first storage position sorting, but the map identification value of each frame map is not changed, and it is determined that a map saving operation is completed, a map list of multi-layer floor maps is established, and the current map identified by the step S1 is updated to the current map, so that after the robot is moved to a new floor area or moved to a specific working position in the same floor area, after the robot is restarted, the current map and the maps constructed earlier by the remaining frames (maps with slightly lower matching priorities) can be directly retrieved from the linear storage space to facilitate positioning or repositioning and reduce the possibility of map information loss.
[0051] It should be added that, in the present embodiment, the capacity of the linear storage space is set to be fixed; before storing the map identification value of the current map identified in step S1 and its corresponding map information, the order of matching priority of each frame of the map currently existing in the linear storage space can be understood as the order in which each frame of the map is stored in the linear storage space. Regardless of whether the map has been deleted from the linear storage space, the storage order of one of the existing frames of the map relative to any other existing frame of the map remains unchanged. When the map identification value and the corresponding map information of each frame map existing in the linear storage space are moved to the adjacent storage unit, the matching priority of each frame map existing in the linear storage space is adjusted to be one level lower than the original one. Before or at the same time as the current map identified in step S1 is stored, the storage space of all existing frame maps is adjusted backward from back to front to the first storage position (i.e., the reference map storage unit) to free up idle memory space (storage space not occupied by data) in the reference map storage unit; then the current map identified in step S1 is stored in the reference map storage unit, and the matching priority of the current map identified in step S1 is set to the highest matching priority in the linear storage space, so that the current map identified in step S1 is stored before all the frame maps originally stored in the linear storage space, and the matching priorities of the remaining frame maps are adjusted to be one level lower than those before the current map identified in step S1 is stored, so as to realize dynamic adjustment of the matching priorities of all frame maps in the linear storage space.
[0052] Specifically, a sequential table is a linear table stored in the form of an array in the memory of a map storage device. The sequential storage of a linear table refers to using a group of storage units with consecutive addresses to sequentially store each element in the linear table, so that the logically adjacent data elements in the linear table (corresponding to each frame of the map in this application) are stored in adjacent physical storage units, that is, the logical adjacent relationship between data elements is reflected by the adjacent relationship of the physical storage of data elements. A linear table with a sequential storage structure is usually called a sequential table. A sequential table stores the nodes in the table in sequence in a group of storage units with consecutive addresses in the memory. Therefore, the sequential table stores the map identification value of each frame of the map and its corresponding map information sequentially in a continuous storage area. The sequential relationship between the elements is naturally represented by their storage order, and the matching priority of each frame of the map is naturally represented by the storage order of the map.
[0053] It should be noted that the linear storage space can be the physical storage structure of the linear table for data, and it is a memory mapping form of the linear table in the map memory; the linear storage space is a sequential storage structure with three properties: the starting position of the storage space, the maximum storage capacity of the linear table, and the current length of the linear table (the storage capacity occupied by the stored data). The maximum storage capacity of the linear table can be the length of the storage space for storing the linear table, and this amount is generally unchanged after the storage allocation. The length of the linear table is the number of data elements in the linear table, and this amount changes as the insertion and deletion operations of the linear table proceed. Address calculation method: Since the data starts with the first subscript from 0, the i-th element of the linear table is to be stored at the position where the data subscript is i-1. Each storage unit in the linear storage space has its own number, which is called an address. In this embodiment, it can be converted into a matching priority representation, indicating the order of storage in the linear storage space; the linear table is a finite sequence of n (n≥0) data elements of the same data type; the first element in the linear table is called the header element; the last element is called the tail element. First, we need to "find a piece of land" in the linear storage space, and it must be continuous, so this storage space must have a first address and size; finally, we need to put each element in the table into its seat, so we need to know how many elements there are, that is, the length of the table. If the i-th element and all subsequent elements of the linear list are shifted right by one position, an empty position is freed up to insert the new element e, the length of the linear list increases by 1, and the insertion is successful. In order to ensure that the maximum storage capacity of the linear list remains unchanged, this embodiment needs to delete an element at the end first, and then shift the i-th element and all subsequent elements of the linear list right by one position, and the length of the linear list does not change.
[0054] On the basis of the above embodiment, the map identification value corresponding to the map information of each frame of the map pre-stored in the linear storage space is less than the map identification value of the current map set in step S1. The reason is that each time the robot starts to build a map in a new floor area, the map frame constructed by the robot in each floor area can be identified by applying a change to the map traversal mark value. Preferably, each time the robot traverses a new floor area and constructs a corresponding map frame, the map traversal mark value is controlled to be counted by one, and then the counting result of the map traversal mark value is used to identify a map frame constructed in each floor area. The map corresponding to each floor area has unique identification information (such as an identification value). The later the floor area is traversed, the later the corresponding map frame is constructed, and the larger the corresponding map identification value is set.
[0055] Preferably, before the fixed increment is added to the map traversal mark value, the initial value of the map traversal mark value is 1, wherein the fixed increment is 1, so that the map identification value is updated in an orderly manner by adding one to the count, and each map identification value updated in sequence is consistent with each frame of the map constructed by the robot in succession. Figure 1 a match; then each time the robot detects the new floor area, it constructs a new frame of map and controls the map traversal mark value to automatically increase by one, and then updates it to the map identification value corresponding to the new frame of map, and then saves the map identification value corresponding to the new frame of map and its corresponding map information into the linear storage space by executing step S2. The map identification value of the map stored in the map memory cannot be equal to the value 0. Therefore, the map identification value of the current map (a frame of map stored in the reference map storage unit) retrieved from the map memory under the premise that the robot has not detected the new floor area is not the value 0.
[0056] As an embodiment, before executing step S1 or after executing step S2, a map matching operation can also be performed, which can be used for the robot to reposition in an old floor area (a floor area that has been traversed and its corresponding constructed map has been stored in a map memory). At this time, the robot still needs to construct a map in real time during the traversal of the old floor area; it can also be used for the robot to position in a new floor area.
[0057] Map matching operations specifically include:
[0058] Step S01, the robot controls the map information of the current map constructed by the robot in real time to match the map information of the corresponding frame of map stored in the linear storage space according to the matching priority corresponding to the map identification value, so that the current map constructed by the robot in real time is preferentially matched with the frame of map with the highest matching priority. Therefore, the map information corresponding to a frame of map disclosed in this embodiment is initially the map information of the frame of map with the highest matching priority stored in the linear storage space; then the robot determines whether the match is successful; wherein, the map information of the current map constructed by the robot in real time in step S01 is not stored in the linear storage space.
[0059] In this embodiment, the map information of the current map constructed by the robot in real time is matched with the map information of the corresponding frame of the map stored in the linear storage space. It can be understood that by matching the environmental data of the area to be operated with the pre-stored map data, map data with a matching rate greater than a preset threshold is obtained, that is, the map information corresponding to a frame of the map stored in the linear storage space that is successfully matched can be repositioned in the floor area where the robot is currently located. Among them, the preset threshold and the data involved in the matching need to take into account the errors caused by possible similar floors, similar room areas or similar maps, which can improve the accuracy of repositioning.
[0060] In some embodiments, the map information may include signals of image statistical processing of road signs collected by the robot during the traversal of the floor area, ensuring that sufficient road sign feature information is set on the current map, including image parameters and wall parameters, so that the map saved later can save complete road sign information on the floor area. The map information is converted to obtain the actual area corresponding to the map, the number of road signs corresponding to the map, and the preservation time of the map. The measurement standard of the matching rate includes the difference in the actual area corresponding to the map, the difference in the number of road signs corresponding to the map, and the difference in the preservation time of the map, and is converted from the map information. A series of thresholds are used to perform multi-level comparative evaluation on the matching degree or similarity of the map information of the current map constructed by the robot in real time and the map information of a corresponding frame of the map stored in the linear storage space, thereby improving the accuracy of map matching judgment.
[0061] In step S01, when the map information of the current map constructed by the robot in real time successfully matches the map information of a corresponding frame of the map stored in the linear storage space, step S02 is executed, so that the relocation method is implemented according to the map frame corresponding to the map information with a matching rate greater than a preset threshold, thereby reducing the number of relocation matches. When the map information of the current map constructed by the robot in real time fails to match the map information of a corresponding frame of the map stored in the linear storage space, step S03 is executed.
[0062] Step S02, first retrieve the corresponding one-frame map described in step S01 from the linear storage space, and cache it in a cache space outside the linear storage space, then vacate a storage unit in the linear storage space to provide idle memory space for the data shift cache before the address of the storage unit; then move the map identification value of each frame of map with a higher matching priority than the corresponding one-frame map described in step S01 and its corresponding map information to adjacent storage units in sequence, specifically starting from the reference map storage unit, move the map identification value of each frame of map existing in the linear storage space and its corresponding map information to adjacent storage units to fill the storage unit of the corresponding one-frame map described in step S01 in the linear storage space, and then move the map identification value of each frame of map existing in the linear storage space and its corresponding map information to adjacent storage units in the linear storage space. Under the premise that the capacity of the linear storage space is fixed, the reference map storage unit becomes an idle memory space and fills up the storage unit occupied by the corresponding frame map described in step S01; then the matching priority of each frame map with a higher matching priority than the corresponding frame map described in step S01 is reduced by one level, so as to maintain the matching priority of each frame map existing before the corresponding frame map described in step S01 is stored in the same order; and the map identification value of the corresponding frame map described in step S01 and its corresponding map information are stored in the reference map storage unit, and the matching priority of the corresponding frame map described in step S01 is adjusted to the highest, so as to become the first frame map to be compared with the corresponding frame map described in step S01 in the next round of matching. Since a frame map that best matches the map information of the current map constructed by the robot in real time has been obtained from the linear storage space, the robot can choose not to execute steps S1 and S2, and does not need to identify the current map constructed by the robot in real time, nor does it need to be saved in the reference map storage unit.
[0063] In this embodiment, the capacity of the linear storage space is set to a fixed capacity; before the map identification value corresponding to a frame of map in step S01 and its corresponding map information are stored in the reference map storage unit, the order of the matching priority of each frame of map in the linear storage space can be understood as the order in which each frame of map is stored in the linear storage space. Regardless of whether the map has been extracted from the linear storage space, the storage order of one of the existing frames of map relative to any other existing frame of map remains unchanged. When the map identification value and its corresponding map information of each frame of map in the linear storage space are moved to an adjacent storage unit, the matching priority of each frame of map in the linear storage space is adjusted to be one level lower than the original one. Before the corresponding frame of map in step S01 is stored in the reference map storage unit, starting from each frame of map with a higher matching priority than the corresponding frame of map in step S01, from the back to the front to the first storage position (i.e., the reference map storage unit), all the existing frame maps (each frame of map with a higher matching priority than the corresponding frame of map in step S01, i.e., the storage position located at the position of step S01) are stored in the reference map storage unit. The storage space of each frame of map before the corresponding frame of map described in step S01 is adjusted backward to free up idle memory space (storage space not occupied by data) in the reference map storage unit; then the corresponding frame of map described in step S01 is stored in the reference map storage unit, and the matching priority of the corresponding frame of map described in step S01 is set to the highest matching priority in the linear storage space. For example, the linear storage space sequentially stores map M (stored in the reference map storage unit, which is previously configured as the current map), map N, map O, map P, and map Q. When it is determined that the map information of map O matches that of the robot, the linear storage space is sequentially stored. When the map information of the current map constructed in real time is matched successfully, the corresponding one-frame map described in step S01 is map O here. The robot first retrieves map O from the linear storage space, and then the storage order of the remaining maps can be determined: map M is still located before map N, map N is still located before map P, and map P is still located before map Q; then map M (originally stored in the reference map storage unit, which is previously configured as the current map) and map N are sequentially shifted to the corresponding storage space, freeing up idle memory space for the reference map storage unit and filling up the original memory space of map O in the linear storage space. The storage unit is configured to move map O closer to the storage position between map N and map P; the map identification value of map O and its corresponding map information are then stored in the reference map storage unit, and map O is adjusted to be located before map M in the linear storage space, while map M is still located before map N, map N is still located before map P, and map P is still located before map Q; at the same time, the matching priority level of map O is adjusted to the highest, and the matching priorities of map M, map N, map P and map Q are all adjusted to be one level lower than the original ones. At this time, the storage order of each frame of maps except map O in the linear storage space is not changed.Thereby, the corresponding frame map described in step S01 is stored before all frame maps originally stored in the linear storage space, and the matching priorities of the remaining frame maps are adjusted to be one level lower than those before the corresponding frame map stored in step S01, thereby completing the dynamic adjustment of the matching priorities of all frame maps in the linear storage space.
[0064] Step S03, updating a frame map whose matching priority is one level lower than the corresponding frame map in step S01 to the corresponding frame map in step S01, and then returning to execute step S01 to make the robot start matching the frame map with a relatively low matching priority, that is, controlling the map information of the current map constructed by the robot in real time to match the map information of a frame map at an adjacent storage position (sorted relatively late) of the corresponding frame map in step S01; until it is determined that the map information of the current map fails to match the map information of all frame maps stored in the linear storage space, at this time, the robot has traversed all frame maps stored in the linear storage space at the current floor area to complete a round of matching of the map in the entire linear storage space, it can be determined that the robot repositioning has failed, and then start executing step S1 to search for a frame map that is more matched with the current map constructed by the robot in real time, and then update it to the current map. At this time, the map matching operation can be suspended, and the execution of steps S01 to S03 can be suspended accordingly. Therefore, by executing steps S1 and S2, the current map constructed by the robot in real time is identified and saved in the reference map storage unit, and in the process of traversing maps of various matching priorities, maps with low repositioning accuracy are excluded, thereby improving the accuracy of the map used for repositioning.
[0065] It should be noted that a round of matching refers to the process of matching the map information of the current map constructed by the robot in real time with the map information of each frame of the map stored in the linear storage space in turn. When the floor area traversed by the robot changes (across floors or across rooms on the same floor), the current map constructed by the robot in real time also changes, and the corresponding frame of the map described in step S01 may also change, and even the map stored in the same storage unit is not the map stored in the previous round of matching. If the map information of the current map constructed by the robot in real time successfully matches the map information of a frame of the map stored in the linear storage space, or the map information of the current map constructed by the robot in real time fails to match the map information of all maps stored in the linear storage space, then it is determined that the current round of matching is over, and the current round of matching can enter the next round of matching.
[0066] Preferably, the step S1 also includes: whenever the robot fails to relocate, corresponding to when the relocation failure is determined in the aforementioned step S03, the current map constructed by the robot in real time is identified by the map traversal mark value, so that the map identification value of the current map constructed by the robot in real time is set to a value of 0, then it can be determined that the current map constructed by the robot in real time is a new map, indicating a floor area outside the area corresponding to the map pre-stored in the map memory, that is, a frame of map not stored in the linear storage space, and also a frame of map constructed by the robot in the current floor area.
[0067] In summary, the robot map management method can complete the matching of all maps in the entire linear storage space in sequence according to the configuration order in which the map with the earlier storage position corresponds to the higher matching priority, so that the historical map (a frame of map pre-stored in the map memory) that successfully matches the current map constructed in real time is stored at an address position at the front of the storage order, and becomes the frame of map with the highest priority matching during the robot relocalization or positioning process. In particular, when repeatedly traversing a specific floor area, the map that best matches the currently traversed floor area can be effectively and quickly called according to the previously configured priority for matching and positioning, and can also be used as a map for real-time navigation and positioning, thereby improving the utilization rate and environmental applicability of the pre-stored maps and optimizing the relocalization. The map matching operation also prevents the low accuracy caused by matching the data of a single floor environment area, thereby improving the accuracy of map repositioning. It can therefore manage and schedule the multi-frame maps constructed by the robot in a reasonable and orderly manner, not only selectively retaining the current map and the historical map, but also marking and saving each new frame of the continuously input map to form a storage structure of a multi-floor map. It can also adaptively configure the matching order of the multi-frame maps at one time to form a corresponding matching priority. In some traversed floor areas, the map construction time can be saved by directly scheduling the use of maps, thereby meeting the map diversity requirements of the robot's repositioning in a multi-floor environment (i.e., multi-frame maps arranged in an orderly manner).
[0068] As an embodiment, the map reuse operation is triggered when a remote control signal from the outside of the robot is triggered (for example, a user uses a mobile phone application to remotely control the robot), or the robot is forced to stop moving (for example, it is picked up to be moved to a new floor area, or stops autonomous movement due to a malfunction, or stops autonomous movement due to being trapped), or the robot fails to reposition (see the embodiments described in steps 01 to 03 for the specific judgment method), and a frame of map pre-stored in the map memory is reused as the current map without the robot rebuilding the map in the current environment; wherein the frame of map to be reused is determined by the map identification value specified in the map memory by the remote control signal from the outside of the robot, or the map identification value specified in the map memory when the robot is forced to stop moving, or the map identification value specified in the map memory when the robot fails to reposition, and is not necessarily the latest constructed frame of map, but can be a standard map pre-loaded into the map memory.
[0069] The map reuse operation includes: firstly, calling out a frame of map to be reused from the map memory; then, starting from the reference map storage unit, moving each frame of map whose storage order is before the frame of map to be reused to an adjacent storage unit, and then storing the frame of map to be reused into the reference map storage unit; and adjusting the matching priority of the frame of map to be reused to the highest, and at the same time, reducing the matching priority of each frame of map with a higher matching priority than the frame of map to be reused by one level, so that the matching priority order of each frame of map except the frame of map to be reused remains unchanged; then, updating the map identification value most recently stored in the reference map storage unit to the map identification value of the current map, and updating the map information most recently stored in the reference map storage unit to the map information of the current map, and determining to reuse the pre-stored frame of map as the current map.
[0070] Specifically, the robot first retrieves a frame of map to be reused from the map memory, wherein the frame of map to be reused is a frame of map pre-stored in the map memory, which supports free retrieval by the robot, and in the map memory, the map information of each frame of map corresponds to a map identification value, and the map identification value and map information of each frame of map are encapsulated into a file in the form of a linear table, so that one map identification value indexes one frame of map; wherein, in the map memory, the memory space for storing the map information of each frame of map is configured as the linear storage space, and the linear storage The header of the space is generally used to store the latest constructed map, representing the new floor area; the map identification value is preferably a global unsigned 32-bit identification value; preferably, in the linear storage space, each storage unit stores a map identification value and a 96-bit reserved field pair, and is stored in the corresponding storage unit in sequence starting from the first address; the 96-bit reserved field pair can represent the map information indexed by the map identification value; when the map information of a frame of map can be encapsulated into a feature file in the form of a linear table, the map identification value corresponding to the frame of map is the identification information of the content of the encapsulated feature file. The map memory is set inside the robot, so the robot can directly retrieve the feature file from the local memory and send it to a remote mobile terminal or share it to a cloud server, so that the external control system can reuse the saved maps representing each floor area. This embodiment calls out a feature file encapsulating map information. After calling out the feature file, the feature file needs to be parsed to obtain a map identification value of a frame of map to be reused and its corresponding map information, and the parsed information can be cached in a cache space outside the map memory. At the same time, the feature file vacates a corresponding address position in the storage unit in the map memory.
[0071] Then, starting from the reference map storage unit, the map identification value and the corresponding map information of each frame of the map whose storage order is before the frame of the map to be reused are moved to the adjacent storage unit to fill the storage unit of the frame of the map to be reused in the map storage space, which can be regarded as moving the map identification value of each frame of the map and the feature file encapsulated by the corresponding map information to the respective adjacent storage units; since the order of the matching priority of the map is configured that the higher the matching priority of a frame of the map, the closer the storage position of the frame of the map in the map memory is, so the shift of the aforementioned map or feature file is equivalent to moving the map identification value of each frame of the map with a higher matching priority than the frame of the map to be reused and the corresponding map information (corresponding feature file) to the adjacent storage unit in sequence. Then, under the premise that the capacity of the map memory is fixed, the idle memory space can be freed up for the reference map storage unit, or the entire reference map storage unit can be made into an idle memory space, and the storage unit occupied by the frame of the map to be reused (corresponding encapsulated feature file) can be filled at the same time.
[0072] Then the robot stores the map identification value of the frame map to be reused and its corresponding map information into the reference map storage unit, and is able to encapsulate the map identification value of the frame map to be reused and its corresponding map information into a feature file again to store it in the reference map storage unit; and adjusts the matching priority of the frame map to be reused to the highest, and at the same time reduces the matching priority of each frame map with a higher matching priority than the frame map to be reused by one level, so that the matching priority order of each frame map except the frame map to be reused remains unchanged; then the map identification value most recently stored in the reference map storage unit is updated to the map identification value of the current map, and the map information most recently stored in the reference map storage unit is updated to the map information of the current map, and it is determined to reuse the pre-stored frame map as the current map, so that the robot uses the reused current map to perform positioning or map matching operations.
[0073] Therefore, when the user remotely controls the robot or the robot stops moving due to an abnormality, a frame of map that can represent the floor area where the robot is located can be selected from the pre-stored multi-frame maps and reused as the current map for the robot's real-time navigation and positioning. The robot does not need to actually walk to build the current map to maintain the operation of the robot's navigation and positioning function. On the basis of identifying and saving the map identification values and map information of multiple frames of different environmental areas configured as reused resources, the pre-stored one-frame map is reused into the current map to embed the reused map information into the externally specified one-frame map to be reused; not only does it realize the fast and flexible reuse of reused resources (map resources) for the map required for the robot's real-time navigation, but it also does not need to reconfigure the map resources in the current map and store and configure new map resources in the map memory, thereby reducing the robot's map building time.
[0074] It should be noted that the frame map to be reused is determined by the map identification value specified by the remote control signal outside the robot, or the map identification value specified in the map memory when the robot is forced to stop moving, or the map identification value specified in the map memory when the robot fails to reposition; wherein, the map memory is set inside the robot; the map memory is divided into multiple storage units; wherein, the reference map storage unit is the first storage unit set starting from the first address of the map memory, used to store the current map, and supports refreshing the current map to adapt to changes in environmental information of the floor area currently traversed by the robot; the order of map matching priority is configured as follows: the higher the matching priority of a frame map, the closer the storage position of the frame map in the map memory is, that is, the closer to the first address; conversely, the lower the matching priority of a frame map, the later the storage position of the frame map in the linear storage space is, that is, the farther away from the first address.
[0075] In this embodiment, the capacity of the map memory is set to a fixed capacity; before a feature file encapsulating the map identification value of a frame of map to be reused and its corresponding map information is stored in the reference map storage unit, the order of matching priority of each frame of map currently stored in the map memory can be understood as the order in which each frame of map is stored in the map memory. Regardless of whether the map has been extracted from the map memory, the storage order of one of the existing frames of map relative to any other existing frame of map remains unchanged.
[0076] When the feature files corresponding to each frame of map currently stored in the map memory are moved to adjacent storage units, the matching priority of each frame of map currently stored in the map memory can be adjusted to one level lower than the original one; then the frame of map to be reused is stored in the reference map storage unit, and the matching priority of the frame of map to be reused is set to the highest matching priority in the map memory. Specifically, the map identification value of the frame of map to be reused and its corresponding map information are stored in the reference map storage unit and encapsulated in the form of feature files for storage, and the matching priority of the feature files stored in the reference map storage unit is configured to be the highest. Alternatively, after the feature files corresponding to each frame of map currently stored in the map memory are moved to adjacent storage units, the frame of map to be reused is stored in the reference map storage unit, and the matching priority of each frame of map currently stored in the map memory is adjusted to one level lower than the original one, and the matching priority of the frame of map to be reused is set to the highest matching priority in the map memory.
[0077] For example, the map memory sequentially stores map M (stored in the reference map storage unit and previously configured as the current map), map N, map O, map P and map Q. When it is determined that map O is a frame of the reused map, the robot first retrieves map O from the map memory, and then the storage order of the remaining maps can be determined (the storage order of the corresponding feature files): map M is still before map N, map N is still before map P, and map P is still before map Q; then map M (originally stored in the reference map storage unit and previously configured as the current map) and map N are sequentially shifted to the corresponding storage space to make room for the reference map storage unit. The memory space is set to fill up the original storage units of map O in the linear storage space, thus shortening the storage position between map N and map P; then the map identification value of map O and its corresponding map information are stored in the reference map storage unit, then map O is adjusted to be located before map M in the map memory, while map M is still located before map N, map N is still located before map P, and map P is still located before map Q; at the same time, the matching priority level of map O is adjusted to the highest, and the matching priorities of map M, map N, map P and map Q are all adjusted to be one level lower than the original ones. At this time, the storage order of each frame of map except map O in the map memory is not changed.
[0078] Based on the aforementioned embodiments, a mobile robot is also disclosed. The mobile robot includes a storage device and a processor. The storage device is used to store a computer program. The processor runs the computer program to enable the mobile robot to execute the robot map management method disclosed in any of the aforementioned embodiments, or execute a combination of the robot map management methods disclosed in any of the aforementioned embodiments. The mobile robot can reasonably and orderly manage and schedule multiple frames of maps constructed by the robot. It not only selectively retains the current map and the historical map, but also can mark and save each frame of new map that is continuously input to form a storage structure of a multi-floor map. It can also adaptively configure the matching order of multiple frames of maps at one time to form a corresponding matching priority, and save map construction time by directly scheduling the use of maps in some traversed floor areas.
[0079] Wherein, the storage device includes a map memory, which is a map pre-established by the robot, and each frame of the pre-stored map represents the environmental information of a floor area that the robot has traversed. It should be noted that when the mobile robot receives a cross-floor operation task, it can save the latest constructed map in the new floor area by executing the robot map management method to form a multi-floor map list, or reposition in the traversed floor area to improve the accuracy of map matching, or reuse the map corresponding to the pre-traversed floor area as the current map for real-time navigation and positioning to avoid repeated mapping operations; wherein, the mobile robot can identify the floor area corresponding to the map according to the map identification value (determine the floor information), and determine the location information of different floor areas according to the map identification value and the map information.
[0080] It should also be noted that the various specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction. To avoid unnecessary repetition, the embodiments of the present invention will not further describe various possible combinations.
[0081] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner, such as the embodiment disclosed in the present application for identifying and associating the current map constructed by the robot in real time.
[0082] Although the embodiments of the present invention have been shown and described, it is understood by those skilled in the art that various changes, modifications, substitutions and variations may be made to these embodiments without departing from the principles and spirit of the present invention, and the scope of the present invention is limited by the appended claims and their equivalents. The above description is only the preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various changes and variations. Any modification, equivalent substitution, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.
[0083] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing device to work in a specific way, so that the instructions stored in the computer-readable memory produce a product including an instruction device, which implements the functions specified in the process. Figure 1 A process or multiple processes and / or boxes Figure 1 These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of operation steps are executed on the computer or other programmable device to produce a computer-implemented process, so that the instructions executed on the computer or other programmable device provide for implementing the process in the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0084] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, ordinary technicians in the field should understand that the specific implementation methods of the present invention can still be modified or some technical features can be replaced by equivalents without departing from the spirit of the technical solution of the present invention, which should be included in the scope of the technical solution for protection of the present invention.
Claims
1. A robot map management method, It is characterized in that Robot map management methods include: Step S1, whenever the robot detects a new floor area, the current map constructed by the robot in real time is identified by the map traversal mark value, wherein the current map constructed by the robot in real time is a frame map used to represent the new floor area currently detected by the robot; the new floor area is a floor area outside the area corresponding to the map pre-stored in the map memory; In step S1, the method of identifying the current map constructed by the robot in real time by using the map traversal mark value specifically includes: When the robot detects the new floor area, the robot first sets the map identification value of the current map constructed in real time to a value of 0, so as to identify the current map as a frame of map that is not stored in the map memory; On the premise that the robot triggers a map saving operation, after the robot determines that the map identification value of the current map is 0 and before storing the current map in the map memory, the robot controls the map traversal mark value to be added with a fixed increment, and then updates the added value to the map traversal mark value, and then sets the updated map traversal mark value as the map identification value of the current map, and determines that the current map is the current map identified in step S1; then the robot executes step S2 to store the map identification value of the current map and the map information of the current map in the map memory; The robot uses one frame of map as a detection unit to detect the environment area. The robot uses at least one frame of map to record the environmental information of one floor area. Each frame of map stored in the map memory corresponds to a map identification value. Step S2: based on the capacity of the current map identified in step S1, store the current map identified in step S1 into the map memory, and adjust the matching priority of the current map identified in step S1 to the highest, so that the robot will subsequently give priority to calling the current map for map matching, which is convenient for robot positioning.
2. The robot map management method according to claim 1, It is characterized in that Each time the robot traverses a floor area, it collects the location attribute identification information of the floor area it is currently in, and determines whether the location attribute identification information currently collected by the robot successfully matches the pre-saved location attribute identification information. If yes, it is determined that the robot has not detected a new floor area; Otherwise, when the robot receives the command signal transmitted from the outside and parses the floor information, the floor information is added to the currently collected location attribute identification information, and the location attribute identification information added with the floor information is saved in the map memory, and it is determined that the robot detects a new floor area; If the robot does not detect a new floor area, the robot extracts floor information from the currently collected location attribute identification information to determine the floor the robot is currently on; If it is determined that the location attribute identification information currently collected by the robot does not match the location attribute identification information stored in advance, the robot first sends a request signal for obtaining floor information to the outside to obtain a response from the communication device of the floor area where the robot is currently located; The location attribute identification information includes environmental characteristic parameters of the robot in the corresponding floor area; in the map memory, the location attribute identification information is saved as a part of map information of a frame of map representing the floor area where the robot is currently located.
3. According to the robot map management method of claim 2, It is characterized in that The robot map management method further includes: On the premise that the robot does not detect the new floor area, if the floor area currently located by the robot does not change, the map identification value of the one-frame map used to indicate the floor currently located by the robot is maintained as the map identification value of the current map, and the matching priority of the one-frame map used to indicate the floor currently located by the robot is not adjusted; On the premise that the robot has not detected the new floor area, if the robot traverses between the floor areas corresponding to at least two pre-stored frame maps, then after the robot triggers the map save operation, the map identification value of the frame map used to represent the floor area where the robot is currently located is updated to the map identification value of the current map, and the map information of the frame map used to represent the floor area where the robot is currently located is updated to the map information of the current map, and the matching priority of the frame map used to represent the floor area where the robot is currently located is adjusted to the highest.
4. The robot map management method according to claim 2, It is characterized in that Step S2 specifically includes: When the capacity of the current map identified in step S1 is greater than the capacity of the reference map storage unit provided in the linear storage space, firstly delete the map identification value and the corresponding map information of at least one frame of the map pre-stored in the linear storage space, and then, starting from the reference map storage unit, control each frame of the map in the linear storage space with a matching priority higher than the frame of the map with the lowest matching priority that has been deleted to offset the corresponding address offset, so as to free up idle memory space for the current map, and then, starting from the first address of the freed-up idle memory space, store the map identification value and the corresponding map information of the current map identified in step S1 in the linear storage space; then, on the premise of maintaining the matching priority order of each frame of the map existing before the current map identified in step S1 is stored, adjust the matching priority of the current map identified in step S1 to the highest, and determine that a map saving operation is completed; The linear storage space is configured as a memory space in the map memory for storing the map identification value and map information of each frame of the map; the corresponding address offset is less than or equal to the cumulative address interval size occupied by all the deleted frame maps; Among them, the reference map storage unit set in the linear storage space is the first storage unit set starting from the first address of the linear storage space; the order of map matching priority is configured as follows: the higher the matching priority of a frame map, the closer the storage position of the frame map in the linear storage space.
5. The robot map management method according to claim 4, It is characterized in that The step S2 further comprises: On the premise that the capacity of the current map identified in step S1 is less than or equal to the capacity of the reference map storage unit provided in the linear storage space, if the linear storage space is full, the map identification value of a frame of map stored earliest in the linear storage space and its corresponding map information are deleted; if the linear storage space is not full, the map identification value of any frame of map and its corresponding map information are not deleted; Then, starting from the reference map storage unit, the map identification value of each frame of the map and its corresponding map information existing in the linear storage space are controlled to be moved to adjacent storage units, so that there is idle memory space in the reference map storage unit; Then, the map identification value of the current map identified in step S1 and its corresponding map information are stored in the reference map storage unit. Meanwhile, under the premise of maintaining the matching priority order of each frame map existing before the current map identified in step S1 is stored, the matching priority of the current map identified in step S1 is adjusted to the highest, and a map saving operation is determined to be completed; Among them, the linear storage space is divided into multiple storage units; each storage unit is used to store a frame of map corresponding to at least one matching priority, or a frame of map corresponding to at least one map identification value; the linear storage space is the physical storage structure of the linear table for data.
6. The robot map management method according to claim 4, It is characterized in that The map identification value corresponding to the map information of each frame of the map pre-stored in the linear storage space is smaller than the map identification value of the current map set in step S1; Before starting to increase the fixed increment to the map traversal mark value, the initial value of the map traversal mark value is the value 1, wherein the fixed increment is the value 1, so that the map identification value is set in order starting from the value 1 by adding one to the count.
7. The robot map management method according to claim 5, It is characterized in that Before executing step S1 or after executing step S2, the method further includes: Step S01, according to the order of the matching priorities corresponding to the maps stored in the linear storage space, control the map information of the current map constructed by the robot in real time to match with the map information of a corresponding frame of the map stored in the linear storage space, so that the current map constructed by the robot in real time is preferentially matched with the frame of the map with the highest matching priority; then determine whether the match is successful, if yes, execute step S02, otherwise execute step S03; wherein the map information of the current map constructed by the robot in real time in step S01 is not stored in the linear storage space; Step S02, first retrieve the corresponding one-frame map described in step S01 from the linear storage space; then move the map identification value of each frame map with a higher matching priority than the corresponding one-frame map described in step S01 and its corresponding map information to adjacent storage units in sequence, so that the reference map storage unit becomes an idle memory space, and fills up the storage unit occupied by the corresponding one-frame map described in step S01; then reduce the matching priority of each frame map with a higher matching priority than the corresponding one-frame map described in step S01 by one level, and store the map identification value of the corresponding one-frame map described in step S01 and its corresponding map information in the reference map storage unit, and at the same time adjust the matching priority of the corresponding one-frame map described in step S01 to the highest; Step S03, updating a frame map whose matching priority is one level lower than the corresponding frame map in step S01 to the corresponding frame map in step S01, and then returning to execute step S01 to enable the robot to start matching a frame map with a relatively low matching priority, until the map information of the current map fails to match the map information of all frame maps stored in the linear storage space, and then determining that the robot repositioning has failed, and then starting to execute step S1.
8. The robot map management method according to claim 7, It is characterized in that The step S1 further includes: whenever the robot fails to relocate, marking the current map constructed by the robot in real time through the map traversal mark value, so as to set the map mark value of the current map constructed by the robot in real time to a value of 0.
9. The robot map management method according to claim 2, It is characterized in that If a frame of map pre-stored in the map memory is reused as the current map, the following methods exist: First, a frame of map to be multiplexed is retrieved from the map memory; then, starting from the reference map storage unit, each frame of map that is located before the frame of map to be multiplexed in a storage order is moved to an adjacent storage unit, and then the frame of map to be multiplexed is stored in the reference map storage unit; The matching priority of the one frame map to be multiplexed is adjusted to be the highest, and the matching priority of each frame map having a higher matching priority than the one frame map to be multiplexed is reduced by one level, so that the matching priority order of each frame map except the one frame map to be multiplexed remains unchanged; Then, the map identification value most recently stored in the reference map storage unit is updated as the map identification value of the current map, and the map information most recently stored in the reference map storage unit is updated as the map information of the current map, and a frame of the pre-stored map is determined to be reused as the current map; The one frame of map to be reused is determined by a map identification value specified by a remote control signal outside the robot, or a map identification value specified in the map memory when the robot is forced to stop moving, or a map identification value specified in the map memory when the robot fails to relocate; Wherein, the map memory is arranged inside the robot; the map memory is divided into a plurality of storage units; Among them, the reference map storage unit is the first storage unit set starting from the first address of the map memory, which is used to store the current map; the order of map matching priority is configured as follows: the higher the matching priority of a frame map, the closer the storage position of the frame map in the map memory is.
10. A mobile robot, It is characterized in that It comprises a storage device and a processor, wherein the storage device is used to store a computer program, and the processor runs the computer program to enable the mobile robot to execute the robot map management method according to any one of claims 1 to 9, wherein the storage device comprises a map memory.
Citation Information
Patent Citations
A map update control method and map update control system for a visual robot
CN109974722B
Multi-layer map creating method and device and robot
CN115026833A
Cited By
Map management method based on belt string matching
CN122387964A
