Robot control method and main control chip

By using map data and time area mapping tables for pet positioning in the DouPeng robot, the problem of UWB sensor increasing hardware costs is solved, and an efficient and low-cost solution for pet monitoring is realized.

CN118897553AActive Publication Date: 2024-11-05AMICRO SEMICONDUCTOR CO LTD

Patent Information

Application Number
CN202410964649.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-18
Publication Date
2024-11-05
Estimated Expiration
2044-07-18

AI Technical Summary

Technical Problem

The existing Doupeng robots need to install UWB positioning sensors on robots and pets, resulting in an increase in hardware costs, which is not conducive to product promotion and popularization.

Method used

The robot obtains map data, performs nine-grid virtual partitions, tracks pet locations, forms a time area mapping table, analyzes data to locate the area where the pet is located, realizes fast positioning and monitoring of pets, and avoids the use of UWB and other sensors.

Benefits of technology

It reduces hardware costs, improves the efficiency of robots monitoring pets, and promotes product marketing and application.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118897553A_ABST
    Figure CN118897553A_ABST
Patent Text Reader

Abstract

The invention discloses a control method of a robot and a main control chip, the robot tracks and shoots a pet, records the position area of the pet at a certain time point, analyzes the recorded data to form a time area mapping table, and sends the time area mapping table to the robot when the robot needs to find the pet and the pet is not in the sight range of the robot. The robot determines the region where the pet is located through the time region mapping table, and can directly search the pet in the region. Compared with the prior art, sensors such as UWB do not need to be specially used for positioning the pet, the pet can be quickly found only by building a time region mapping table and through a data analysis and processing mode, the effect of effectively monitoring the pet by the robot at lower hardware cost is achieved, and market popularization and application of robot products are facilitated.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of intelligent robots, and in particular to a control method and a main control chip of a robot. Background Art

[0002] The pet-playing robot is an intelligent robot product that can interact and play with pets and monitor pets. The Chinese invention patent application number CN202111561906.7 discloses a technology that can realize interaction and monitoring between multiple robots and pets. However, this technology requires the installation of UWB (Ultra Wide Band) positioning sensors on the robot and the pet, which will undoubtedly increase the hardware cost of the pet-playing robot and is not conducive to the promotion and popularization of the pet-playing robot. Summary of the invention

[0003] This application provides a robot control method and a main control chip, and the specific technical solution is as follows: A robot control method comprises the following steps: step S1, the robot obtains map data, determines the regional distribution in the map, and then enters step S2; step S2, the robot tracks and photographs a pet, records the location area of ​​the pet at a certain time point, and then enters step S3; step S3, the robot analyzes the recorded data, forms a time area mapping table, and then enters step S4; step S4, when the robot needs to find a pet and the pet is not within the robot's line of sight, the robot determines the area where the pet is located through the time area mapping table, and directly goes to the area to find the pet.

[0004] Furthermore, the step S1 specifically includes the following steps: step S11, the robot receives map data sent by an external device and proceeds to step S12; step S12, the robot partitions the map into nine-square grid virtual areas and proceeds to step S13; step S13, the robot numbers the partitioned virtual areas.

[0005] Furthermore, the robot described in step S12 performs a nine-square grid virtual partition on the map, which specifically includes the following steps: step S121, the robot determines the maximum value of the map along the horizontal direction and the maximum value along the vertical direction, and enters step S122; step S122, the robot divides the maximum value along the horizontal direction into three sections at two horizontal equal points, and then sets two vertical equal lines through the two horizontal equal points to divide the map into three areas arranged along the horizontal direction, and enters step S123; step S123, the robot divides the maximum value along the vertical direction into three sections at two vertical equal points, and then sets two horizontal equal lines through the two vertical equal points to divide the map into nine areas together with the vertical equal lines to form a nine-square grid virtual area.

[0006] Furthermore, the step S2 specifically includes the following steps: step S21, the robot determines the current virtual area through the binocular camera, gyroscope sensor and odometer equipped on itself, and enters step S22; step S22, the robot photographs the pet through the binocular camera and determines the current location of the pet, and enters step S23; step S23, the robot determines the virtual area where the pet is currently located based on the current location of the pet, and records it in its own memory.

[0007] Furthermore, the step S3 specifically includes the following steps: step S31, the robot counts the data recorded in the memory, and determines whether the time when the pet appears in one virtual area overlaps with the time when the pet appears in another virtual area. If so, proceed to step S32, otherwise go to step 35; step S32, the robot takes the overlapping time as the reference time, and then determines whether the number of days the pet appears in any virtual area during the reference time is the largest and unique, if so, proceed to step S33, otherwise go to step S34; step S33, the robot takes the virtual area corresponding to the largest and unique number of days as the positioning area where the pet will appear within the reference time, and records it in the time area mapping table; step S34, the robot takes the virtual areas with the largest and identical number of days as the positioning areas where the pet will appear within the reference time, and records them in the time area mapping table; step S35, the robot takes the virtual areas where the pet is located during the non-overlapping time as the positioning area where the pet will appear during the non-overlapping time, and records it in the time area mapping table.

[0008] Furthermore, step S34 also includes the following steps: when the positioning area corresponds to multiple virtual areas, the robot preferentially navigates to the virtual area closest to the robot according to the distance; if the distances are the same, the robot randomly navigates to any virtual area.

[0009] Furthermore, the robot described in step S4 determines the area where the pet is located through the time area mapping table, and directly goes to the area to look for the pet, which specifically includes the following steps: step S41, the robot obtains the current time and enters step S42; step S42, the robot searches the time area mapping table for the positioning area corresponding to the current time and enters step S43; step S43, the robot uses the center position of the positioning area as the navigation end point, moves to the center position of the positioning area, and enters step S44; step S44, the robot rotates 360 degrees and determines whether the pet is photographed. If so, it enters step S2, otherwise it enters step S45; step S45, the robot determines the next reference time in the time area mapping table that is closest to the current time, and the positioning area corresponding to the reference time is not the positioning area where the current robot is located, then the robot uses the positioning area corresponding to the reference time as the new positioning area, and enters step S43.

[0010] Furthermore, the robot described in step S43 uses the center position of the positioning area as the navigation end point, and the process of moving to the center position of the positioning area also includes the following steps: step S431, the robot determines in real time whether the pet is photographed during the movement. If so, it directly enters step S2 and no longer moves to the navigation end point. If not, it enters step S432; step S432, the robot continues to move, and when the robot detects an obstacle at the center position, it moves along the channel between the middle obstacle and the obstacles around the positioning area, and determines whether the pet is photographed during the movement. If so, it enters step S2, otherwise it enters step S45; when the robot does not detect an obstacle at the center position, it moves to the center position of the positioning area and enters step S44.

[0011] Furthermore, the robot described in step S432 moves one circle along the channel between the middle obstacle and the obstacles around the positioning area, which specifically includes the following steps: step S4321, the robot takes the position point where the middle obstacle is detected as the starting point, and enters step S4322; step S4322, the robot turns to one side, moves along the channel between the middle obstacle and the obstacles around the positioning area, and determines whether it has reached the end of the channel. If so, it enters step S4323, otherwise it continues to move until the robot returns to the starting point and completes one circle; step S4323, the robot turns around and returns to the starting point, and then moves to the other side, along the channel between the middle obstacle and the obstacles around the positioning area, until the robot reaches the end of the channel, thereby completing one circle.

[0012] A main control chip is assembled in the electric control system of a mobile robot, and the main control chip is used to control the robot to execute the control method of the robot.

[0013] The robot control method described in the present application does not require the use of UWB or other sensors to locate the pet. It only needs to build a time zone mapping table. Through data analysis and processing, the pet can be found quickly, so that the robot can effectively monitor the pet at a lower hardware cost, which is beneficial to the market promotion and application of robot products. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] Figure 1 A schematic flow chart of a robot control method according to an embodiment of the present application.

[0015] Figure 2 This is a schematic diagram of a robot performing virtual nine-square partitioning of a map according to an embodiment of the present application. DETAILED DESCRIPTION

[0016] The following will describe the embodiments of the present application in detail in conjunction with the accompanying drawings. It should be understood that the specific embodiments described below are only used to explain the present application and are not used to limit the present application.

[0017] like Figure 1 A control method of a robot is shown, the robot is an intelligent robot capable of autonomous movement, including but not limited to a sweeping robot, a pet-entertaining robot, a disinfecting robot, a lawnmowing robot, etc. These robots are equipped with devices such as a gyroscope, an odometer, an infrared sensor, a visual sensor, and / or a laser sensor that can help the robot achieve intelligent operations such as positioning, navigation, and mapping. The control method of the robot includes the following steps S1 to S4: In step S1, the robot obtains map data, determines the regional distribution in the map, and then enters step S2. The map data is a grid map, including the coordinates and status (obstacle, passable, unknown) of the grid cells, and other map information that can represent the indoor environment. By reading the map information and combining it with the data obtained by its own sensors, the robot can know the map size, the distribution of obstacles, and its current location, and can also process the map data to determine the regional distribution in the map.

[0018] In step S2, the robot tracks and photographs the pet, records the location of the pet at a certain point in time, and then proceeds to step S3. The robot can photograph the pet through a camera, and when the pet moves, the robot will move and turn accordingly according to the size change and movement direction of the pet in the image, thereby tracking and photographing the pet, and recording the location of the pet at a certain point in time.

[0019] In step S3, the robot analyzes the recorded data to form a time-area mapping table, and then proceeds to step S4. The data recorded by the robot mainly includes two types: one is time, and the other is the location area of ​​the pet, that is, the area corresponding to the grid coordinate position of the pet, which is the area in the map determined by the robot in step S1. The robot associates the area where the pet is at a certain time to form a time-area mapping table.

[0020] In step S4, when the robot needs to find a pet and the pet is not within the robot's line of sight, the robot determines the area where the pet is located through the time area mapping table, and directly goes to the area to find the pet. Among them, the situation where the robot needs to find a pet is generally when the robot has finished charging or receives a control signal for finding a pet sent by the user through the smart terminal. Since pets such as cats and dogs are sensitive and move quickly, the robot often cannot keep up when photographing the pet, resulting in the pet often being out of the robot's line of sight. Therefore, in order to maintain real-time tracking and photographing of the pet, the robot will quickly determine the current area of ​​the pet through the time area mapping table, and directly navigate to the area to find the pet.

[0021] The robot control method described in this embodiment does not need to use UWB or other sensors to locate the pet. It only needs to build a time zone mapping table. Through data analysis and processing, the pet can be quickly found, so that the robot can effectively monitor the pet at a lower hardware cost, which is beneficial to the market promotion and application of robot products.

[0022] As one implementation manner, the step S1 specifically includes the following steps S11 to S13: In step S11, the robot receives the map data sent by the external device and enters step S12. The external device may be a user's mobile phone, iPad, computer or other intelligent terminal device. Specifically, the user selects the map data corresponding to the robot's current environment through the intelligent terminal, and sends the map data to the robot through wireless communication such as wifi or Bluetooth. The map data may be drawn by the user through the intelligent terminal, or constructed by other intelligent products during their working process.

[0023] In step S12, the robot performs a nine-square grid virtual partitioning on the map, and then proceeds to step S13. The nine-square grid virtual partitioning refers to dividing the map into nine virtual areas, and the nine virtual areas are arranged in the form of a nine-square grid.

[0024] In step S13, the robot numbers the partitioned virtual areas. Figure 2 As shown, the nine areas formed after the nine-square grid virtual partitioning are areas marked from Q1 to Q9.

[0025] The control method described in this embodiment can enable the robot to quickly obtain a map and process the map into a form suitable for its own work needs, thereby greatly improving the practicality and efficiency of the robot.

[0026] As one implementation manner, the robot in step S12 performs virtual nine-square partitioning on the map, which specifically includes the following steps S121 to S123: In step S121, the robot determines the maximum value of the map in the horizontal direction and the maximum value in the vertical direction, and then proceeds to step S122. Figure 2 As shown in the figure, the rectangular frame marked by the four points ABCD is the boundary of the map. Some solid lines extending inside the rectangular frame represent walls. Line segment AB or CD is the maximum value of the map along the horizontal direction, and line segment AD or BC is the maximum value of the map along the vertical direction.

[0027] In step S122, the robot divides the maximum value along the horizontal direction into three segments at two horizontal dividing points, and then sets two vertical dividing lines through the two horizontal dividing points to divide the map into three areas arranged in the horizontal direction, and then enters step S123. The two vertical dividing lines are respectively Figure 2 The dotted lines L1 and L2 are shown in FIG.

[0028] In step S123, the robot divides the maximum value along the vertical direction into three segments by two vertical and horizontal dividing points, and then sets two horizontal dividing lines through the two vertical dividing points, which divide the map into nine areas together with the vertical dividing lines, forming a nine-square grid virtual area. Figure 2 The dotted lines L3 and L4 shown in FIG. The virtual area of ​​the nine-square grid is Figure 2 There are nine small rectangular areas marked by Q1, Q2, Q3, Q4, Q5, Q6, Q7, Q8 and Q9.

[0029] The control method described in this embodiment can realize the virtual partitioning of the nine-square grid through simple equally divided lines, so that the robot can quickly build a partition map without the need for complex image processing techniques such as expansion and corrosion, which is conducive to improving the work efficiency of the robot.

[0030] As one implementation manner, the step S2 specifically includes the following steps S21 to S23: In step S21, the robot uses the binocular camera, gyroscope sensor and odometer installed on it, the road signs captured by the binocular camera, the direction angle detected by the gyroscope sensor and the walking distance detected by the odometer. The robot can accurately know its current location, and then the coordinates of the location point can be used to determine the robot's current virtual area, and then enter step S22.

[0031] In step S22, the robot shoots the pet through a binocular camera, determines the current position of the pet, and enters step S23. Among them, the binocular camera consists of two cameras, which are placed within a certain distance, and this distance is called the baseline distance. The two cameras shoot the pet at the same time, and two 2D images can be formed. When the pet appears in the left and right images at the same time, due to the baseline distance between the cameras, the position of the pet in the two images will be offset, and this offset is called parallax. Parallax can be obtained by calculating the distance difference between the corresponding pixels in the two images. Through parallax, the distance difference between the corresponding pixels of the same object in the two images can be obtained. At the same time, the parameters such as the baseline distance and the viewing angle of the two cameras are known, and the three-dimensional coordinates of the pet can be calculated by the triangulation principle. After the three-dimensional coordinates are known, the size of the pet's distance can be calculated. The following formula is usually used for calculation: distance = (baseline distance * focal length) / parallax. Among them, the baseline distance and focal length are fixed parameters of the camera, and the parallax is calculated by the image pixels.

[0032] In step S23, the robot can determine the virtual area where the pet is currently located based on the coordinates of the pet's current location and record it in its own memory.

[0033] The control method described in this embodiment forms a large amount of data that can reflect the pet's behavioral habits by photographing and recording the location areas where the pet is located at different times. This can provide a reliable reference basis for the subsequent robot to quickly find the pet, thereby improving the robot's intelligence level.

[0034] As one implementation manner, the step S3 specifically includes the following steps S31 to S35: In step S31, the robot counts the data recorded in the memory to determine whether the time when the pet appears in one virtual area overlaps with the time when the pet appears in another virtual area. If so, it proceeds to step S32, otherwise it proceeds to step 35. Specifically, Figure 2As shown, when the recorded data shows that the pet appears in the Q1 area from 18:30 to 19:20 on May 1, and appears in the Q2 area from 19:00 to 20:45 on May 2, it can be known that the overlapping time of the pet appearing in these two areas is from 19:00 to 19:20, and the robot enters step S32 for the next step of processing. When the recorded data shows that the pet is in the Q3 area from 22:10 to 6:30 on all the recorded dates, it means that the time when the pet appears in one virtual area does not overlap with the time when the pet appears in another virtual area, and the robot enters step S35 for the next step of processing.

[0035] In step S32, the robot uses the overlapping time as the reference time, and then determines whether the number of days that the pet appears in any virtual area during the reference time is the largest and unique. If so, it proceeds to step S33, otherwise it proceeds to step S34. Specifically, when the overlapping time of the pet in areas Q1 and Q2 is from 19:00 to 19:20, the robot uses this period as the reference time, and then analyzes the number of days that the pet appears in the nine areas Q1 to Q9 during this period. The number of days can be understood as the number of times, because there are repeated 24 hours every day, and the same time period only has one period a day, so it can be counted as one time. Take the data recorded from May 1 to May 16 as an example of all the data for explanation. If the number of days that the pet appears in the Q1 area during the reference time from 19:00 to 19:20 is 11 days, namely May 1, May 3, May 5 to May 12, and May 16; the number of days that the pet appears in the Q2 area is 3, namely May 2, May 4, and May 13, and the number of days that the pet appears in the Q4 area is 2, namely May 14 and May 15. Therefore, the number of days that the pet appears in the Q1 area is 11, which is greater than the number of days that the pet appears in the Q2 area 3 and the number of days that the pet appears in the Q4 area 2. Therefore, the number of days that the pet appears in the Q1 area during the reference time is the largest and unique, and the robot enters step S33 for the next step of processing. If the number of days that the pet appears in the Q1 area during the reference time from 19:00 to 19:20 is 7 days, namely May 1, May 3, May 5 to May 9; the number of days that the pet appears in the Q2 area is 7 days, namely May 2, May 4, May 10 to May 14, and the number of days that the pet appears in the Q4 area is 2 days, namely May 15 and May 16. Therefore, the number of days that the pet appears in the Q1 area is 7, which is equal to the number of days that the pet appears in the Q2 area, and is greater than the number of days that the pet appears in the Q4 area, which is 2. Therefore, the number of days that the pet appears in the Q1 area during the reference time is the largest but not unique, and is the same as the number of days that the pet appears in the Q2 area. Therefore, the robot enters step S34 for the next step of processing.

[0036] In step S33, the robot uses the virtual area corresponding to the largest and unique number of days as the location area where the pet will appear during the reference time, and records it in the time area mapping table. Based on the example described in the above step S32, the number of days that the pet appears in the Q1 area during the reference time is the largest and unique, so the robot uses the virtual area marked by Q1 as the location area and records it in the time area mapping table. When the robot wants to find the pet during the reference time from 19:00 to 19:20, by querying the time area mapping table, it can be known that the location area corresponding to this period is Q1, so the robot can directly navigate to the Q1 area to find the pet, and the probability of the robot finding the pet in the location area is higher than the probability of finding the pet in other areas.

[0037] In step S34, the robot takes the virtual areas with the largest and the same number of days as the positioning areas where the pet will appear in the reference time, and records them in the time area mapping table. Based on the example described in the above step S32, the number of days that the pet appears in the Q1 area is 7, which is equal to the number of days that the pet appears in the Q2 area, and is greater than the number of days that the pet appears in the Q4 area, which is 2, indicating that the probability of the pet appearing in the Q1 area and the Q2 area is the same, so the robot takes the Q1 area and the Q2 area as positioning areas and records them in the time area mapping table. When the robot wants to find the pet during the reference time from 19:00 to 19:20, by querying the time area mapping table, it can be known that the positioning areas corresponding to this period are Q1 and Q2, then the robot can directly navigate to the Q1 and Q2 areas to find the pet, and the probability of the robot finding the pet in the positioning area is higher than the probability of finding the pet in other areas. Preferably, if there are multiple virtual areas corresponding to the positioning area, the robot will preferentially navigate to the virtual area closest to the robot according to the distance, if it can further improve the efficiency of the robot in finding the pet. That is, when both Q1 and Q2 are used as positioning areas, the robot will analyze Q1 and Q2 to see which one is closer to itself. If Q1 is closer, it will navigate to Q1 first, and then navigate to Q2 if the pet cannot be found. If Q2 is closer, it will navigate to Q2 first, and then navigate to Q1 if the pet cannot be found. If the distances are the same, the robot will randomly navigate to any of Q1 and Q2.

[0038] In step S35, the robot uses the virtual area where the pet is located during the non-overlapping time as the location area where the pet will appear during the non-overlapping time, and records it in the time area mapping table. Assuming that during the period from 22:10 to 6:30, on all recorded dates, the pet only appears in the Q3 area and has never appeared in other areas, the robot uses the virtual area marked by Q3 as the location area and records it in the time area mapping table. When the robot wants to find the pet during the reference time from 22:10 to 6:30, by querying the time area mapping table, it can be known that the location area corresponding to this period is Q3, and the robot can directly navigate to the Q3 area to find the pet, and the probability of the robot finding the pet in the Q3 area is higher than the probability of finding the pet in other areas.

[0039] The control method described in this embodiment enables the robot to quickly find the area where the pet is most likely to appear simply by querying the time area mapping table, without the need for complex data processing and calculations. The entire process is simple and efficient, further improving the robot's work efficiency and intelligence level.

[0040] The time zone mapping table is a data form that can reflect the positioning area corresponding to each time point or time period within 24 hours of any recorded day. The table is stored in the robot's memory, and the robot's main control chip can directly query and call the data in the table.

[0041] As one implementation mode, the robot in step S4 determines the area where the pet is located through the time area mapping table, and directly searches for the pet in the area, which specifically includes the following steps S41 to S45: In step S41, the robot obtains the current time and enters step S42. The robot can obtain the current time through a clock circuit configured by itself, or through a GPS module or a GPRS module. The obtained time includes the date and a specific time point.

[0042] In step S42, the robot searches the time zone mapping table for the positioning area corresponding to the current time and proceeds to step S43.

[0043] In step S43, the robot takes the center position of the positioning area as the navigation end point, moves to the center position of the positioning area, and enters step S44. The center position of the positioning area is the center of the virtual area corresponding to the positioning area, that is, Figure 2 The center point of any rectangular area indicated by Q1 to Q9 shown in the figure can be determined by the intersection of the diagonals of the rectangles.

[0044] In step S44, the robot rotates 360 degrees and determines whether the pet is photographed. If so, it proceeds to step S2, otherwise it proceeds to step S45. Among them, by rotating 360 degrees at the center point, the robot can take a comprehensive picture of the scene in the area at one time, so that it can quickly determine whether the pet is in the area, further improving the efficiency of the robot in finding the pet. The robot determines whether the pet is photographed, mainly by performing existing image processing technologies such as image preprocessing, feature extraction, matching and recognition on the captured image to determine whether the captured image contains a pet. If so, it means that the pet is photographed, otherwise it means that the pet is not photographed.

[0045] In step S45, the robot determines the next reference time in the time zone mapping table that is closest to the current time, and if the positioning area corresponding to the reference time is not the positioning area where the current robot is located, the robot uses the positioning area corresponding to the reference time as the new positioning area and proceeds to step S43. Figure 2 Taking the Q5 area, Q6 area and Q7 area shown as an example, in the time area mapping table, the positioning area corresponding to the reference time from 13:00 to 13:20 is the Q5 area, the positioning area corresponding to the reference time from 13:25 to 14:08 is the Q7 area, and the positioning area corresponding to the reference time from 14:22 to 15:10 is the Q6 area. When the robot does not capture the pet in the Q5 area, the robot determines that the next time point closest to the current time in the time area mapping table is the reference time from 13:25 to 14:08, and the positioning area corresponding to this time is Q7, not the current positioning area Q5 of the robot, so the robot takes the Q7 area as the new positioning area and navigates to the Q7 area to find the pet. Similarly, if the robot does not find the pet in the Q7 area, it navigates to the Q6 area to search, and so on, until the robot finds the pet.

[0046] The control method described in this embodiment is in chronological order. By searching for the positioning area corresponding to the next reference time closest to the current time, the robot can gradually search from areas with a high probability of pets appearing to areas with a low probability of pets appearing, which is conducive to maximizing the efficiency of the robot in finding pets.

[0047] As one implementation manner, the robot described in step S43 takes the center position of the positioning area as the navigation end point, and the process of moving to the center position of the positioning area also includes the following steps: Step S431: The robot determines in real time whether it has photographed the pet during the movement. If so, it indicates that the robot has found the pet, and then directly proceeds to step S2 to track and photograph the pet without moving to the navigation end point. If not, it indicates that the pet is not in the path that the robot passes through, and then proceeds to step S432. Step S432, the robot continues to move. When the robot detects an obstacle at the center position, it moves along the channel between the middle obstacle and the obstacles around the positioning area, and determines whether the pet is photographed during the movement. If so, it goes to step S2, otherwise it goes to step S45; when the robot does not detect an obstacle at the center position, it moves to the center position of the positioning area and goes to step S44.

[0048] The control method described in this embodiment enables the robot to flexibly handle different situations, greatly improving the intelligence level of the robot.

[0049] As one implementation mode, the robot described in step S432 moves a circle along the channel between the middle obstacle and the obstacles around the positioning area, which specifically includes the following steps S4321 to S4323.

[0050] In step S4321, the robot takes the position point where the intermediate obstacle is detected as the starting point and enters step S4322.

[0051] In step S4322, the robot turns to one side, which can be the left or the right, and then moves along the passage between the middle obstacle and the obstacles around the positioning area. The passage is determined by the robot based on the path composed of passable grid units marked in the map and the spatial position between the obstacles on both sides captured by the camera. During the movement of the robot, the obstacle situation in front of the passage captured by the camera is used to determine whether it has reached the end of the passage. If there are obstacles in front of the passage and there is no passable path, it means that the robot has reached the end of the passage and needs to enter step S4323 for the next step. Otherwise, the robot continues to move until the robot returns to the starting point and completes one circle along the passage between the middle obstacle and the obstacles around the positioning area.

[0052] In step S4323, the robot turns around and returns to the starting point, then moves toward the other side along the channel between the middle obstacle and the obstacles around the positioning area until the robot reaches the end of the channel, thereby completing one circle of movement along the channel between the middle obstacle and the obstacles around the positioning area.

[0053] As one implementation, the present application further provides a main control chip, which is assembled in the electric control system of the mobile robot. The main control chip is used to control the robot to execute the robot control method described in the above embodiment.

[0054] The robot will encounter different obstacles during its walking process. In order to effectively simplify the description of the indoor environment and facilitate the proposal of reasonable corresponding strategies in path planning, the indoor obstacles can be handled as follows: as long as the distance between the obstacle and the wall does not meet the minimum distance for the robot to pass, the robot cannot pass smoothly, and the obstacle is treated as a wall; when the distance between two obstacles is very close and the robot cannot pass smoothly, the two can be treated as one obstacle.

[0055] Obviously, the above-mentioned embodiments are only some embodiments of the present invention, rather than all embodiments. The various embodiments can be combined in any suitable manner without contradiction. In order to avoid unnecessary repetition, the embodiments of the present invention will not be described separately for other possible combinations. It can be understood by a person of ordinary skill in the art that all or part of the steps of implementing the above-mentioned method can be completed by hardware related to program instructions. These programs can be stored in a computer-readable storage medium (such as ROM, RAM, a disk or an optical disk, etc., various media that can store program codes). When the program is executed, the steps of the above-mentioned method embodiments are executed.

[0056] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein with equivalents, and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the protection scope of the technical solutions of the embodiments of the present invention.

Claims

1. A robot control method, characterized in that: The following steps are involved: Step S1, the robot obtains map data, determines the regional distribution in the map, and then proceeds to step S2; Step S2, the robot tracks and photographs the pet, records the location of the pet at a certain point in time, and then proceeds to step S3; Step S3, the robot analyzes the recorded data to form a time zone mapping table, and then proceeds to step S4; Step S4, when the robot needs to find a pet and the pet is not within the robot's sight range, the robot determines the area where the pet is located through the time area mapping table and directly goes to the area to find the pet.

2. The robot control method according to claim 1, characterized in that: The step S1 specifically includes the following steps: Step S11, the robot receives map data sent by an external device and proceeds to step S12; Step S12, the robot performs virtual partitioning of the map into nine-square grids, and then proceeds to step S13; Step S13: the robot numbers the partitioned virtual areas.

3. The robot control method according to claim 2, characterized in that: The robot in step S12 performs virtual nine-square partitioning on the map, which specifically includes the following steps: Step S121, the robot determines the maximum value of the map along the horizontal direction and the maximum value along the vertical direction, and proceeds to step S122; Step S122, the robot divides the maximum value along the horizontal direction into three segments at two horizontal dividing points, and then sets two vertical dividing lines through the two horizontal dividing points respectively, so as to divide the map into three areas arranged along the horizontal direction, and then proceeds to step S123; In step S123, the robot divides the maximum value along the vertical direction into three segments at two vertical and horizontal dividing points, and then sets two horizontal dividing lines through the two vertical dividing points respectively, and divides the map into nine areas together with the vertical dividing lines to form a nine-square virtual area.

4. The robot control method according to claim 3, characterized in that: The step S2 specifically includes the following steps: Step S21, the robot determines the current virtual area through the binocular camera, gyroscope sensor and odometer installed on itself, and enters step S22; Step S22, the robot photographs the pet through a binocular camera and determines the current location of the pet, and then proceeds to step S23; Step S23, the robot determines the virtual area where the pet is currently located according to the pet's current location, and records it in its own memory.

5. The robot control method according to claim 3, characterized in that: The step S3 specifically comprises the following steps: Step S31, the robot counts the data recorded in the memory to determine whether the time when the pet appears in one virtual area overlaps with the time when the pet appears in another virtual area, if so, proceed to step S32, otherwise proceed to step 35; Step S32, the robot takes the overlapping time as the reference time, and then determines whether the number of days that the pet appears in any virtual area during the reference time is the largest and unique. If so, the robot proceeds to step S33, otherwise, the robot proceeds to step S34; Step S33, the robot takes the virtual area corresponding to the largest and unique number of days as the location area where the pet will appear during the reference time, and records it in the time area mapping table; Step S34, the robot takes the virtual areas with the largest number of days and the same number of days as the location areas where the pet will appear during the reference time, and records them in the time area mapping table; Step S35, the robot takes the virtual area where the pet is located during the non-overlapping time as the location area where the pet will appear during the non-overlapping time, and records it in the time area mapping table.

6. The robot control method according to claim 5, characterized in that: The step S34 further comprises the following steps: When the positioning area corresponds to multiple virtual areas, the robot will prioritize navigating to the virtual area closest to the robot according to the distance; if the distances are the same, the robot will randomly navigate to any of the virtual areas.

7. The robot control method according to any one of claims 1 to 6, characterized in that: The robot in step S4 determines the area where the pet is located through the time area mapping table, and directly searches for the pet in the area, which specifically includes the following steps: Step S41, the robot obtains the current time and proceeds to step S42; Step S42, the robot searches the time zone mapping table for the location zone corresponding to the current time, and proceeds to step S43; Step S43, the robot takes the center position of the positioning area as the navigation end point, moves to the center position of the positioning area, and enters step S44; Step S44, the robot rotates 360 degrees and determines whether the pet is photographed. If yes, it goes to step S2, otherwise it goes to step S45; Step S45, the robot determines the next reference time closest to the current time in the time zone mapping table, and if the positioning area corresponding to the reference time is not the positioning area where the current robot is located, the robot takes the positioning area corresponding to the reference time as the new positioning area and enters step S43.

8. The robot control method according to claim 7, characterized in that: The process in which the robot in step S43 takes the center position of the positioning area as the navigation end point and moves to the center position of the positioning area also includes the following steps: Step S431, the robot determines in real time whether a pet is photographed during movement. If yes, it directly proceeds to step S2 without moving to the navigation end point. If no, it proceeds to step S432; Step S432, the robot continues to move. When the robot detects an obstacle at the center position, it moves along the channel between the middle obstacle and the obstacles around the positioning area, and determines whether the pet is photographed during the movement. If so, it goes to step S2, otherwise it goes to step S45; when the robot does not detect an obstacle at the center position, it moves to the center position of the positioning area and goes to step S44.

9. The robot control method according to claim 8, characterized in that: The robot in step S432 moves along the passage between the middle obstacle and the obstacles around the positioning area, which specifically includes the following steps: Step S4321, the robot takes the position point where the middle obstacle is detected as the starting point and proceeds to step S4322; Step S4322: the robot turns to one side and moves along the passage between the middle obstacle and the obstacles around the positioning area, and determines whether it has reached the end of the passage. If so, it proceeds to step S4323; otherwise, it continues to move until the robot returns to the starting point and completes one circle. In step S4323, the robot turns around and returns to the starting point, and then moves to the other side along the passage between the middle obstacle and the obstacles around the positioning area until the robot reaches the end of the passage, thus completing one circle of movement.

10. A main control chip, assembled in the electric control system of a mobile robot, characterized in that: The main control chip is used to control the robot to execute the robot control method according to any one of claims 1 to 9.

Citation Information

Patent Citations

  • Method for monitoring pet through robot based on raster map and chip

    CN108012326A

  • Method for intelligently monitoring pet by robot

    CN108366343A

  • System and method for quickly searching articles

    CN111401325A

  • Sweeper capable of searching objects

    CN116138662A

  • Mobile robot

    JP1997319432A

Cited By

  • Cleaning robot control method, storage medium and related equipment

    CN120419830A

  • Method for controlling cleaning robot, storage medium, and related device

    WO2026166478A1