Game control method of robot, chip and robot

By dividing the difficulty level of hide-and-seek games in the home intelligent robot and dynamically adjusting it, the problem of lack of hide-and-seek game functions in the existing technology has been solved, and a rich game experience and physical and mental health promotion effect has been achieved.

CN118892649APending Publication Date: 2024-11-05AMICRO SEMICONDUCTOR CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410959231.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-17
Publication Date
2024-11-05

AI Technical Summary

Technical Problem

There is a lack of robots that can play peek-seek games among existing home intelligent robots, which fail to meet the entertainment and physical and mental health needs of players, especially children.

Method used

By implementing game control methods in the robot, the difficulty level of the hide-and-seek game is divided according to the number of partition intervals and navigation distances of the obstacles, and the appropriate obstacles are selected as the hiding point. The robot hides until the end of the game, and dynamically adjusts the game difficulty to adapt to the player's Performance.

Benefits of technology

It improves the gaming experience, enriches the players' lives, promotes the players' physical and mental health, and provides a unique way of entertainment and interaction.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118892649A_ABST
    Figure CN118892649A_ABST
Patent Text Reader

Abstract

The invention provides a game control method of a robot, a chip and the robot, and the game control method of the robot comprises the following steps: step S1, based on the partition interval number and the navigation distance of an obstacle, the robot carries out the level classification of the difficulty of a catch game on the obstacle, the robot stores a global map marking the obstacle information, and the global map has partition information; and S2, based on the difficulty level of the catching and hiding game, the robot selects one of obstacles corresponding to the difficulty level of the catching and hiding game as a catching and hiding point, and then navigates to the catching and hiding point for hiding until the game is finished. Before the robot hides, the difficulty level of the hide-and-hide game is divided for the obstacle according to the partition interval number of the obstacle and the navigation distance, so that the difficulty of the game is adjusted according to the level of players, different players have the sense of participation, and the game experience is improved.
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 game control method, a chip and a robot. Background Art

[0002] Home intelligent robots refer to service robots used in home environments or similar environments to meet the user's living needs, and are mainly robots engaged in home services. At present, there are more and more types of home intelligent robots, which can be divided into household robots, educational robots, entertainment robots, elderly care and disability assistance robots, home safety and monitoring robots, and handling robots. The operation and use of such robots usually do not require professional knowledge or skills, and do not require special training or qualifications. Among them, entertainment robots are sought after by young people for their unique and interesting functions. Entertainment robots can realize the interaction between people and robots, strengthen communication between people, and play a unique role in promoting the physical and mental health of users (especially children). However, among the many home intelligent robots, there are no robots on the market that can play hide-and-seek games. There are no robots specifically used to play hide-and-seek games, nor are there existing robots designed with hide-and-seek game functions (such as designing hide-and-seek game functions on sweeping robots). Summary of the invention

[0003] The present application provides a robot game control method, chip and robot, and the specific technical solutions are as follows: A game control method for a robot, the control method comprising the following steps: step S1, based on the number of partition intervals and navigation distance of obstacles, the robot divides the obstacles into difficulty levels for a hide-and-seek game, wherein the robot stores a global map with information of the obstacles marked, and the global map has partition information; step S2, based on the difficulty level of the hide-and-seek game, the robot selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point, and then navigates to the hide-and-seek hiding point to hide until the game ends.

[0004] Furthermore, in the step S1, based on the number of partition intervals and navigation distances of the obstacles, the method for the robot to divide the difficulty levels of the hide-and-seek game for the obstacles includes: step S11, based on the global map, the robot takes its location as the starting point and calculates the number of partition intervals and the navigation distance of the obstacles respectively; step S12, based on the number of partition intervals and the navigation distance, the robot calculates the game difficulty score of the obstacle according to a preset formula; step S13, based on the game difficulty score, the robot sorts the obstacles, and then divides the obstacles into different hide-and-seek game difficulty levels according to a preset ratio.

[0005] Further, in step S11, based on the global map, the robot takes its current point as the starting point, and the method for calculating the number of partition intervals of the obstacle includes: the robot takes its current point as the starting point, and calculates the number of partitions that need to be crossed to navigate from the starting point to the obstacle; if the obstacle and the starting point are in the same partition, indicating that the robot does not need to cross the partition, the number of partition intervals of the obstacle is 0; if the obstacle and the starting point are in adjacent partitions, indicating that the robot needs to cross 1 partition, the number of partition intervals of the obstacle is 1; and so on. The number of partitions that the robot needs to cross to navigate from the starting point to the obstacle is the number of partition intervals of the obstacle.

[0006] Furthermore, in step S12, based on the partition interval number and the navigation distance, the method by which the robot calculates the game difficulty score of the obstacle according to a preset formula includes: the robot multiplies the partition interval number by a preset coefficient, and then sums the product with the navigation distance, and the sum obtained is the game difficulty score of the obstacle.

[0007] Further, in step S13, based on the game difficulty score, the robot sorts the obstacles, and then divides the obstacles into different hide-and-seek game difficulty levels according to a preset ratio. The method includes: based on the game difficulty score, the robot sorts the obstacles in descending order, and then divides the obstacles into a high hide-and-seek game difficulty level, a medium hide-and-seek game difficulty level and a low hide-and-seek game difficulty level according to a first preset ratio, a second preset ratio and a third preset ratio, respectively, wherein the hide-and-seek game difficulty level includes a high hide-and-seek game difficulty level, a medium hide-and-seek game difficulty level and a low hide-and-seek game difficulty level.

[0008] Furthermore, in step S2, the method in which the robot navigates to the hide-and-seek hiding point to hide includes: based on the global map, after the robot navigates to the hide-and-seek hiding point, it starts to move along the edge and around the obstacle serving as the hide-and-seek hiding point until it moves 180 degrees and then stops moving to achieve hiding.

[0009] Furthermore, the step S2 also includes: after the robot navigates to the hide-and-seek hiding point and hides, it starts recording the game time, and then calculates the game score based on the game time. If the game time is less than or equal to a first preset time, the game score is counted as full marks. If the game time is greater than the first preset time, the corresponding game score is deducted every time a certain time is exceeded until it reaches zero.

[0010] Furthermore, when the game score is deducted to zero, the robot sends a prompt message every second preset time, wherein the prompt message includes displaying the partition where the robot is located on the mobile phone APP, or displaying the coordinates of the robot on the mobile phone APP, or any one of the voice messages sent by the robot.

[0011] Further, in step S2, based on the difficulty level of the hide-and-seek game, the method in which the robot selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point includes: based on the game scores recorded in the historical records, the robot dynamically adjusts the difficulty level of the hide-and-seek game; if the game score is less than or equal to a first preset score for N consecutive times, the robot lowers the difficulty level of the hide-and-seek game by one level, and then randomly selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point; if the game score is greater than or equal to a second preset score for N consecutive times, the robot increases the difficulty level of the hide-and-seek game by one level, and then randomly selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point, wherein N is a positive integer, and when the number of game scores in the historical records is less than N, zero scores are used to make up to N.

[0012] A chip stores computer program codes, which implement the game control method of the robot when executed.

[0013] A robot equipped with the chip.

[0014] The robot game control method described in the present application divides the difficulty level of the hide-and-seek game into different levels according to the number of partition intervals and navigation distance of the obstacles before the robot hides, so as to adjust the game difficulty according to the level of the players, so that different players can have a sense of participation and improve the game experience. The robot can enrich the life of the players, bring fun to the players, and promote the physical and mental health of the players. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 A flowchart of a game control method for a robot according to an embodiment of the present application.

[0016] Figure 2 A schematic diagram of a global map according to an embodiment of the present application. DETAILED DESCRIPTION

[0017] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.

[0018] It should be understood that when used in this application, the term "comprising" indicates the presence of the described features, integral bodies, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integral bodies, steps, operations, elements, components and / or their collections. It should also be understood that the term "and / or" used in this application refers to any combination of one or more of the associated listed items and all possible combinations, and includes these combinations.

[0019] As used in this application, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [described condition or event] is detected" or "in response to detecting [described condition or event]", depending on the context.

[0020] In addition, in the description of the present application, the terms "first", "second", "third", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance. The reference to "one embodiment" or "some embodiments" described in the specification of the present application means that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in the differences in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways.

[0021] Home intelligent robots refer to service robots used in home environments or similar environments to meet the user's living needs, and are mainly robots engaged in home services. At present, there are more and more types of home intelligent robots, which can be divided into household robots, educational robots, entertainment robots, elderly care and disability assistance robots, home safety and monitoring robots, and handling robots. The operation and use of such robots usually do not require professional knowledge or skills, and do not require special training or qualifications. Among them, entertainment robots are sought after by young people for their unique and interesting functions. Entertainment robots can realize the interaction between people and robots, strengthen communication between people, and play a unique role in promoting the physical and mental health of users (especially children). However, among the many home intelligent robots, there are no robots on the market that can play hide-and-seek games. There are no robots specifically used to play hide-and-seek games, nor are there existing robots designed with hide-and-seek game functions (such as designing hide-and-seek game functions on sweeping robots).

[0022] In order to solve the above technical problems, the embodiment of the present application provides a game control method for a robot. Before the robot hides, the obstacle is first divided into the difficulty level of the hide-and-seek game according to the partition interval number and navigation distance of the obstacle, so as to adjust the game difficulty according to the level of the player, so that different players have a sense of participation and improve the game experience. The robot can enrich the life of the player, bring fun to the player, and promote the physical and mental health of the player.

[0023] like Figure 1 As shown, the game control method of the robot includes the following steps: step S1, based on the partition interval number and navigation distance of the obstacle, the robot divides the obstacle into difficulty levels of a hide-and-seek game, wherein the robot stores a global map marking the obstacle information, and the global map has partition information; step S2, based on the difficulty level of the hide-and-seek game, the robot selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point, and then navigates to the hide-and-seek hiding point to hide until the end of the game.

[0024] It should be noted that the global map is constructed by the robot in advance through SLAM technology and saved in the robot's memory. Before the game starts, the robot first determines whether there is a home map saved. If not, the robot first broadcasts a prompt like "I am not familiar with the environment yet, I will go to get familiar with it first", and then uses ranging sensors (such as lidar) to build maps and identify obstacles, and moves and explores various areas of the user's home. After traversing all areas of the home, the robot returns to the original starting position. At this time, the robot has completed the mapping of the home environment. The global map is a grid map. The grid map constructed in real time is marked with environmental information around the current position of the robot. The grids in the map area constructed by the robot include three states marked as free, occupied and unknown. These grids are represented by grid points in the motion trajectory segments of this embodiment, that is, the center points of the grids. The grid points in the free state refer to the grids that are not occupied by obstacles, which are the grid position points that the robot can reach, and are free grid points, which can constitute unoccupied areas. The grid points in the occupied state refer to the grids occupied by obstacles, which are obstacle grid points, and can constitute occupied areas. Unknown grid points refer to the position points where the specific situation is unclear during the robot's map construction process, which are often blocked by obstacles and can constitute unknown areas.

[0025] It is understandable that in order to achieve the purpose of hide-and-seek, the robot will look for grid points in an occupied state, that is, look for obstacles and use them to hide. In the embodiment of the present application, when the robot looks for obstacles to hide, it excludes walls to achieve a good hiding effect. In addition, the robot also partitions the global map, and divides the home environment into several sub-areas based on information such as walls and doors.

[0026] like Figure 2 As shown, Figure 2 The global map of a home environment is shown. The black dots in the figure represent the robot, and the lightning symbol represents the charging station. At this time, the robot is located in sub-area A. Sub-areas B, D, E, F, and G are adjacent to sub-area A. Sub-area C is not adjacent to sub-area A, but is adjacent to sub-area B. Among them, sub-area adjacency means that you can move directly from one sub-area to another without passing through a third sub-area. For example, from sub-area A to sub-area C, you need to pass through sub-area B, so sub-area C is not adjacent to sub-area A.

[0027] As one of the implementation modes, in step S1, based on the partition interval number and navigation distance of the obstacle, the method for the robot to classify the difficulty level of the hide-and-seek game for the obstacle includes: step S11, based on the global map, the robot takes its location as the starting point and respectively calculates the partition interval number and navigation distance of the obstacle; step S12, based on the partition interval number and the navigation distance, the robot calculates the game difficulty score of the obstacle according to a preset formula; step S13, based on the game difficulty score, the robot sorts the obstacles and then classifies the obstacles into different hide-and-seek game difficulty levels according to a preset ratio. Distinguishing different hide-and-seek game difficulty levels according to the partition interval number and navigation distance of the obstacle is more reasonable and improves the richness and fun of the game.

[0028] As one of the implementation modes, in step S11, based on the global map, the robot takes its current location as the starting point, and the method for calculating the partition interval number of the obstacle includes: the robot takes its current location as the starting point, and calculates the number of partitions required to navigate from the starting point to the obstacle. If the obstacle and the starting point are in the same partition, indicating that the robot does not need to cross the partition, the partition interval number of the obstacle is 0; if the obstacle and the starting point are in adjacent partitions, indicating that the robot needs to cross 1 partition, the partition interval number of the obstacle is 1, and so on. The number of partitions that the robot needs to cross to navigate from the starting point to the obstacle is the partition interval number of the obstacle. Figure 2 , when the robot is in sub-area A and selects an obstacle in sub-area A, the robot does not need to cross the partition when moving from the starting point to the obstacle, so the partition interval number of the obstacle is 0; when the robot is in sub-area A and selects an obstacle in sub-area B, the robot needs to cross from sub-area A to sub-area B when moving from the starting point to the obstacle, so the partition interval number of the obstacle is 1; when the robot is in sub-area A and selects an obstacle in sub-area C, the robot needs to cross from sub-area A to sub-area B and then from sub-area B to sub-area C when moving from the starting point to the obstacle, so the partition interval number of the obstacle is 2. By analogy, the partition interval number of the obstacle can be determined according to the position of the robot's starting point and the obstacle.

[0029] As one implementation mode, in step S12, based on the partition interval number and the navigation distance, the method in which the robot calculates the game difficulty score of the obstacle according to a preset formula includes: the robot multiplies the partition interval number by a preset coefficient, and then sums the product with the navigation distance, and the sum is the game difficulty score of the obstacle. Preferably, the preset coefficient is 20, and the preset formula can be expressed as partition interval number*20+navigation distance. Preferably, the navigation distance is obtained by an A* navigation algorithm.

[0030] As one of the implementation modes, in step S13, the robot sorts the obstacles based on the game difficulty score, and then divides the obstacles into different hide-and-seek game difficulty levels according to a preset ratio, including: based on the game difficulty score, the robot sorts the obstacles in descending order, and then divides the obstacles into a high hide-and-seek game difficulty level, a medium hide-and-seek game difficulty level, and a low hide-and-seek game difficulty level according to a first preset ratio, a second preset ratio, and a third preset ratio, respectively, wherein the hide-and-seek game difficulty level includes a high hide-and-seek game difficulty level, a medium hide-and-seek game difficulty level, and a low hide-and-seek game difficulty level. Preferably, the first preset ratio, the second preset ratio, and the third preset ratio are 30%, 40%, and 30%, or 20%, 60%, and 20%.

[0031] As one implementation mode, in step S2, the method for the robot to navigate to the hide-and-seek hiding point to hide includes: based on the global map, after the robot navigates to the hide-and-seek hiding point, it starts to move along the edge and around the obstacle serving as the hide-and-seek hiding point until it stops moving after circling 180 degrees to achieve hiding. Hiding behind an obstacle has a better effect.

[0032] As one embodiment, the step S2 further includes: after the robot navigates to the hide-and-seek hiding point and hides, it starts recording the game time, and then calculates the game score according to the game time. If the game time is less than or equal to the first preset time, the game score is counted as full score. If the game time is greater than the first preset time, the corresponding game score is deducted every time it exceeds a certain time until it is zero. Among them, the robot and the player will agree on a hiding time. For example, after the player presses the game start button, the player needs to wait for 1 minute before starting to search. The robot will complete the hiding within the agreed time and start timing after the agreed time ends, so as to truly record the player's search time. In another embodiment, the robot and the player will also agree on a hiding time, but after the player presses the game start button, the robot starts timing, and the game can also be played normally, but the time to find the robot includes the hiding time. Which method is specifically adopted is not limited here. The full score of the game score is recorded as 100 points. If the player can find the robot within a certain time, such as within 10 seconds, he will get full marks. If this time is exceeded, the game score will be reduced by 1 for each second exceeded, and the challenge will fail when the game score is 0.

[0033] As one of the implementation modes, when the game score is deducted to zero, the robot sends a prompt message every second preset time, wherein the prompt message includes any one of displaying the partition where the robot is located on the mobile phone APP, displaying the coordinates of the robot on the mobile phone APP, or the voice message sent by the robot. After the game challenge fails, in order to prevent the player from not being able to find the robot, the robot will prompt the player every 10 seconds. It should be noted that the robot has a matching mobile phone APP, and the player can view the robot status, control the robot, set the game play and view the game score through the mobile phone APP. The robot can also send prompt messages to the player through the mobile phone APP. The prompt message can be executed in the order of displaying the partition where the robot is located on the mobile phone APP, displaying the coordinates of the robot on the mobile phone APP, and the robot automatically sending a voice message, so that the player still has a chance to find the robot and improve the sense of participation in the game.

[0034] As one implementation mode, in step S2, based on the difficulty level of the hide-and-seek game, the method in which the robot selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point includes: based on the game score recorded in the historical records, the robot dynamically adjusts the difficulty level of the hide-and-seek game, if the game score is less than or equal to the first preset score for N consecutive times, the robot reduces the difficulty level of the hide-and-seek game by one level, and then randomly selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point, if the game score is greater than or equal to the second preset score for N consecutive times, the robot increases the difficulty level of the hide-and-seek game by one level, and then randomly selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point, wherein N is a positive integer, and when the number of game scores in the historical records is less than N, zero points are used to make up to N. Dynamically adjusting the game difficulty allows players of different levels to have a good gaming experience and improves the fun of the game. Among them, if the current game is played for the second time, and the score of the first game is 20 points, assuming that N is 3 and the first preset score is 20, the default scores for three consecutive times are 0, 0, and 20. Since the three scores are all less than or equal to 20, the robot reduces the difficulty level of the hide-and-seek game by one level. If it is already at the lowest level of the hide-and-seek game difficulty level at this time, it will no longer be reduced. Assuming that N is 3, the second preset score is 50, and the three consecutive scores are 60, 70, and 80, since the three consecutive scores are greater than 50, the robot increases the difficulty level of the hide-and-seek game by one level. If it is already at the highest level of the hide-and-seek game difficulty level at this time, it will no longer be increased. If the game score is not less than or equal to the first preset score for N consecutive times or greater than or equal to the second preset score for N consecutive times, the current hide-and-seek game difficulty level is maintained unchanged. The method described in the embodiment of the present application can maintain the player's interest in the game and avoid making the player feel that the game is too difficult or too easy and lose enthusiasm for the game.

[0035] The embodiment of the present application provides a chip, wherein the chip stores a computer program code, and when the computer program code is executed, the game control method of the robot is implemented. The chip first divides the difficulty level of the hide-and-seek game according to the number of partition intervals and navigation distance of the obstacles, so as to adjust the game difficulty according to the level of the players, so that different players have a sense of participation and improve the game experience.

[0036] The embodiment of the present application also provides a robot equipped with the chip. The robot can enrich the life of the player, bring fun to the player, and promote the physical and mental health of the player.

[0037] It will be understood by those skilled in the art that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, the references to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory ROM, programmable memory PROM, electrically programmable memory DPROM, electrically erasable programmable memory DDPROM or flash memory. Volatile memory may include random access memory RAM or external cache memory.

[0038] The technical features of the above embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0039] The above embodiments only express several embodiments of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the patent application. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application.

Claims

1. A game control method for a robot, characterized in that: The control method comprises the following steps: Step S1, based on the number of partition intervals and navigation distance of the obstacle, the robot divides the obstacle into difficulty levels of a hide-and-seek game, wherein the robot stores a global map with information of the obstacle marked, and the global map has partition information; Step S2, based on the difficulty level of the hide-and-seek game, the robot selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point, and then navigates to the hide-and-seek hiding point to hide until the game ends.

2. A robot game control method according to claim 1, characterized in that: In step S1, based on the number of partition intervals and navigation distance of the obstacle, the method for the robot to divide the difficulty level of the hide-and-seek game for the obstacle includes: Step S11, based on the global map, the robot takes its location as a starting point and calculates the partition interval number and navigation distance of the obstacle respectively; Step S12, based on the partition interval number and the navigation distance, the robot calculates the game difficulty score of the obstacle according to a preset formula; Step S13, based on the game difficulty score, the robot sorts the obstacles, and then divides the obstacles into different hide-and-seek game difficulty levels according to a preset ratio.

3. A robot game control method according to claim 2, characterized in that: In step S11, based on the global map, the robot takes its location as a starting point, and the method for calculating the number of partition intervals of obstacles includes: The robot takes its current location as the starting point and calculates the number of partitions that need to be crossed to navigate from the starting point to the obstacle. If the obstacle and the starting point are in the same partition, indicating that the robot does not need to cross the partition, the partition interval number of the obstacle is 0. If the obstacle and the starting point are in adjacent partitions, indicating that the robot needs to cross 1 partition, the partition interval number of the obstacle is 1. Similarly, the number of partitions that the robot needs to cross to navigate from the starting point to the obstacle is the partition interval number of the obstacle.

4. A robot game control method according to claim 2, characterized in that: In step S12, based on the partition interval number and the navigation distance, the method in which the robot calculates the game difficulty score of the obstacle according to a preset formula includes: The robot multiplies the partition interval number by a preset coefficient, and then sums the product with the navigation distance, and the obtained sum is the game difficulty score of the obstacle.

5. A robot game control method according to claim 2, characterized in that: In step S13, based on the game difficulty score, the robot sorts the obstacles, and then divides the obstacles into different levels of hide-and-seek game difficulty according to a preset ratio, including: Based on the game difficulty scores, the robot sorts the obstacles in descending order, and then divides the obstacles into a high hide-and-seek game difficulty level, a medium hide-and-seek game difficulty level, and a low hide-and-seek game difficulty level according to a first preset ratio, a second preset ratio, and a third preset ratio, respectively, wherein the hide-and-seek game difficulty level includes a high hide-and-seek game difficulty level, a medium hide-and-seek game difficulty level, and a low hide-and-seek game difficulty level.

6. A robot game control method according to claim 1, characterized in that: In step S2, the method in which the robot navigates to the hide-and-seek hiding point to hide includes: Based on the global map, after the robot navigates to the hide-and-seek hiding point, it starts to move along the edge and around the obstacle serving as the hide-and-seek hiding point until it stops moving after circling 180 degrees to achieve hiding.

7. A robot game control method according to claim 1, characterized in that: The step S2 further comprises: After the robot navigates to the hide-and-seek hiding spot and hides, it starts recording the game time, and then calculates the game score based on the game time. If the game time is less than or equal to a first preset time, the game score is counted as full marks. If the game time is greater than the first preset time, the corresponding game score is deducted every time a certain time is exceeded until it reaches zero.

8. A robot game control method according to claim 7, characterized in that: When the game score is deducted to zero, the robot sends out a prompt message every second preset time, wherein the prompt message includes displaying the partition where the robot is located on the mobile phone APP, displaying the coordinates of the robot on the mobile phone APP, or any one of the voice messages sent by the robot.

9. A robot game control method according to claim 7, characterized in that: In step S2, based on the difficulty level of the hide-and-seek game, the method in which the robot selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hiding point for the hide-and-seek game includes: Based on the game scores in the historical records, the robot dynamically adjusts the difficulty level of the hide-and-seek game. If the game score is less than or equal to a first preset score for N consecutive times, the robot reduces the difficulty level of the hide-and-seek game by one level, and then randomly selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point. If the game score is greater than or equal to a second preset score for N consecutive times, the robot increases the difficulty level of the hide-and-seek game by one level, and then randomly selects one of the obstacles corresponding to the difficulty level of the hide-and-seek game as a hide-and-seek hiding point, wherein N is a positive integer, and when the number of game scores in the historical records is less than N, zero points are used to make up to N.

10. A chip storing computer program code, characterized in that: When the computer program code is executed, the game control method of the robot according to any one of claims 1 to 9 is implemented.

11. A robot, characterized in that: The robot is equipped with the chip according to claim 10.