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.