Abstract: The disclosure relates to a method for controlling a robot to return to a base. The method includes the robot receives a return-to-base control signal; the robot walks along different preset paths according to different receiving conditions of guidance signals; and when detecting an intermediate signal during walking along a preset path, the robot returns to the base directly under piloting of the intermediate signal instead of walking along the preset path. The guidance signals are signals sent by a charging base, for piloting the robot to return to the base, and include the intermediate signal.

Abstract: The invention discloses a method for robots to improve the accuracy of an obstacle labeling, which comprises: making two positionings according to set moments, and then acquiring positioning poses of the two positionings on a grid map respectively at a first moment and a second moment; defining coverage areas of the first and the second moments according to positions of the two positionings, acquiring confidence coefficients of the two positionings, and processing the coverage areas through the confidence coefficients; interpolating the positioning poses, and constructing a closed graph according to the positioning poses, the pose interpolation, and the processed coverage areas; and obtaining a grid occupied by the closed graph on the grid map and modifying the obstacle labeling according to the grid occupied by the closed graph on the grid map and the area of the closed graph.

Abstract: The present invention relates to grid and voxel positioning methods based on a laser observation direction, a robot, and a chip. The grid positioning method comprises: selecting two preset intersection points that are in a same preset grid in which a laser point is located; then, in the two preset intersection points, setting the preset intersection point farthest from an observation point as a first preset intersection point, and setting the preset intersection point closest to the same observation point as a second preset intersection point; and according to a magnitude relationship between a ratio of a second preset distance to a first preset distance and a preset proportion coefficient, determining a target grid hit by the laser point in the direction of an observation ray, so as to form a latest hit grid position of the laser point within the two-dimensional grid map.

Abstract: The present disclosure provides a method for expanding a working area based on a laser map, a chip and a robot, and the method for expanding the working area includes using map pixel point information obtained by laser scanning to position pending boundary lines, deciding a next expansion of a rectangular working area according to an increment of a diagonal length of the rectangular working area framed by the pending boundary lines in a current expansion process, stopping expanding the rectangular working area of the robot when the increment of the diagonal length before expanding and after expanding reaches an overlap condition.

Abstract: An automatic generation method for a robot return-to-base code includes the following steps that: on the basis of a preset signal collection mode, a robot collects a guide signal which is sent by a charging base and distributed within a preset range (S1); the robot transmits signal information and position information of the robot recorded when the guide signal is collected to a data processing device (S2); and the data processing device generates a robot return-to-base code corresponding to the charging base according to the received signal information and position information (S3). By means of the information collected by the robot in different modes, the data processing device automatically generates, according to the information, the robot return-to-base code corresponding to the charging base, so that research and development personnel do not need to delve into a robot return-to-base algorithm or write a specific return-to-base code.

Abstract: The disclosure relates to a system for locating a charging base of a self-moving robot and method for locating a charging base of a self-moving robot. A position of the charging base can estimated according to a charging base locating area constructed when the self-moving robot receives infrared signals of the charging base, meanwhile, the position of the charging base which is estimated can be continuously adjusted according to a relationship between the charging base locating area and infrared signal receivers when the infrared signals are received in the subsequent motion process of the self-moving robot.

Abstract: Disclosed are an area cleaning planning method for robot walking along the boundary, a chip and a robot. The area cleaning planning method includes: on a laser map which is scanned and constructed by a robot in real time, the robot is controlled to walk along the boundary in a predefined cleaning area framed at the current planning starting point position, so that the robot does not cross out the predefined cleaning area in the process of walking along the boundary; meanwhile, according to the division condition of the room cleaning subareas that conform to the preset wall environment condition in the predefined cleaning area, the robot is controlled to walk along the boundary in a matched area, when the robot walks along the boundary in the matched area and returns to the planning starting point position, the robot is controlled to perform planned cleaning in the matched area.

Abstract: Disclosed are an area cleaning planning method for robot walking along the boundary, a chip and a robot. The area cleaning planning method includes: on a laser map which is scanned and constructed by a robot in real time, the robot is controlled to walk along the boundary in a predefined cleaning area framed at the current planning starting point position, so that the robot does not cross out the predefined cleaning area in the process of walking along the boundary; meanwhile, according to the division condition of the room cleaning subareas that conform to the preset wall environment condition in the predefined cleaning area, the robot is controlled to walk along the boundary in a matched area, when the robot walks along the boundary in the matched area and returns to the planning starting point position, the robot is controlled to perform planned cleaning in the matched area.

Abstract: The invention discloses a cleaning partition planning method for robot walking along the boundary, a chip and a robot. According to the cleaning partition planning method, a complete global map does not needed to be prestored in advance, but an initial room cleaning partition of the robot is divided in real time in a predefined cleaning area according to map image pixel information obtained by laser scanning in the process of walking along the boundary, meanwhile, the initial room cleaning partition of the robot is expanded by repeated iterative processing of the wall boundary of an uncleaned area in the same predefined cleaning area.

Abstract: Disclosed are a cleaning path planning method based on a pathfinding cost, a chip, and a cleaning robot. The method includes step 1, configuring cleaning lines in a map matching a cleaning area according to map boundaries and obstacle boundaries in different directions in the cleaning area of a mobile robot; step 2, setting a candidate entrance/exit satisfying a preset pathfinding cost condition and found in a current non-cleaned sub-block by the mobile robot at a current position as a cleaning entrance position of the current non-cleaned sub-block; step 3, controlling the mobile robot to move to the cleaning entrance position of the current non-cleaned sub-block; step 4, searching for and planning a cleaning entrance position and a cleaning termination position of a next non-cleaned sub-block by repeating steps 2-3 described above in a case of the mobile robot moves to the cleaning termination position of the current non-cleaned sub-block.

Abstract: The present disclosure provides a method for expanding a working area based on a laser map, a chip and a robot, and the method for expanding the working area includes using map pixel point information obtained by laser scanning to position pending boundary lines, deciding a next expansion of a rectangular working area according to an increment of a diagonal length of the rectangular working area framed by the pending boundary lines in a current expansion process, stopping expanding the rectangular working area of the robot when the increment of the diagonal length before expanding and after expanding reaches an overlap condition.

Abstract: The disclosure relates to a system for locating a charging base of a self-moving robot and method for locating a charging base of a self-moving robot. A position of the charging base can estimated according to a charging base locating area constructed when the self-moving robot receives infrared signals of the charging base, meanwhile, the position of the charging base which is estimated can be continuously adjusted according to a relationship between the charging base locating area and infrared signal receivers when the infrared signals are received in the subsequent motion process of the self-moving robot.

Abstract: The invention discloses a cleaning partition planning method for robot walking along the boundary, a chip and a robot. According to the cleaning partition planning method, a complete global map does not needed to be prestored in advance, but an initial room cleaning partition of the robot is divided in real time in a predefined cleaning area according to map image pixel information obtained by laser scanning in the process of walking along the boundary, meanwhile, the initial room cleaning partition of the robot is expanded by repeated iterative processing of the wall boundary of an uncleaned area in the same predefined cleaning area.

Abstract: The disclosure relates to a method for controlling a robot to return to a base. The method includes the robot receives a return-to-base control signal; the robot walks along different preset paths according to different receiving conditions of guidance signals; and when detecting an intermediate signal during walking along a preset path, the robot returns to the base directly under piloting of the intermediate signal instead of walking along the preset path. The guidance signals are signals sent by a charging base, for piloting the robot to return to the base, and include the intermediate signal.

Abstract: An automatic generation method for a robot return-to-base code includes the following steps that: on the basis of a preset signal collection mode, a robot collects a guide signal which is sent by a charging base and distributed within a preset range (S1); the robot transmits signal information and position information of the robot recorded when the guide signal is collected to a data processing device (S2); and the data processing device generates a robot return-to-base code corresponding to the charging base according to the received signal information and position information (S3). By means of the information collected by the robot in different modes, the data processing device automatically generates, according to the information, the robot return-to-base code corresponding to the charging base, so that research and development personnel do not need to delve into a robot return-to-base algorithm or write a specific return-to-base code.