论文标题
实时a*自适应动作设置脚步计划,以人类运动能量近似为启发式函数的角度差异
Real time A* Adaptive Action Set Footstep Planning with Human Locomotion Energy Approximations Considering Angle Difference for Heuristic Function
论文作者
论文摘要
在各种环境中,将两足机器人导航到所需目的地的问题非常重要。但是,很难实时解决导航问题,因为计算时间很长,这是由于具有高度自由度的双头机器人的性质。为了克服这一点,许多科学家建议通过脚步计划导航。通常,脚步规划使用最短的距离或角度作为基于A *算法的目标函数。最近,人们提出了由多项式功能近似的人类行走所需的能量,该能量被认为是一种更好的成本函数,解释了双足机器人的运动。此外,对于实时导航,使用A *算法的操作集未固定,而是根据情况而变化的数字,以使计算时间不会增加太多,并且建议考虑与外部环境发生碰撞的方法。在本论文中,近似于人类行走所需能量的多项式函数被用作成本函数,并且考虑到机器人与先前研究中未显示的目的地之间的角度差的启发式函数是新提出的和证明的。此外,提出了一种整合与人步行相关的自适应行为集和能量的新方法。此外,在此框架中提出了有效的避免碰撞方法和减少局部最小问题的方法。最后,通过模拟和真实的机器人验证了所有这些功能的脚步规划算法,并在映射算法中使用了所有这些功能,以及解决导航问题的步行算法。
The problem of navigating a bipedal robot to a desired destination in various environments is very important. However, it is very difficult to solve the navigation problem in real time because the computation time is very long due to the nature of the biped robot having a high degree of freedom. In order to overcome this, many scientists suggested navigation through the footstep planning. Usually footstep planning use the shortest distance or angles as the objective function based on the A * algorithm. Recently, the energy required for human walking, which is widely used in human dynamics, approximated by a polynomial function is proposed as a better cost function that explains the movement of the bipedal robot. In addition, for the real time navigation, using the action set of the A * algorithm not fixed, but the number changing according to the situation, so that the computation time does not increase much and the methods of considering the collision with the external environment are suggested as a practical method. In this thesis, polynomial function approximating the energy required for human walking is adopted as a cost function, and heuristic function considering the angular difference between the robot and the destination which is not shown in the previous studies is newly proposed and proved. In addition, a new method to integrate the adaptive behavior set and energy related to human walking is proposed. Furthermore, efficient collision avoidance method and a method to reduce the local minimum problem is proposed in this framework. Finally, footstep planning algorithm with all of these features into the mapping algorithm and the walking algorithm to solve the navigation problem is validated with simulation and real robot.