Modelling and simulating obstacle avoidance for a legged robot via an A*-based algorithm with distance threshold

Humanoid robot has great potential in industry, service industry, education and other industries because of its similar body shape and operation ability, so the development of humanoid robot has been widely concerned by people in recent years. However, compared with other types of robots, humanoid r...

Full description

Bibliographic Details
Main Author: Zhu, Xinyang
Other Authors: Hu Guoqiang
Format: Thesis-Master by Coursework
Language:English
Published: Nanyang Technological University 2024
Subjects:
Online Access:https://hdl.handle.net/10356/179894
Description
Summary:Humanoid robot has great potential in industry, service industry, education and other industries because of its similar body shape and operation ability, so the development of humanoid robot has been widely concerned by people in recent years. However, compared with other types of robots, humanoid robots are usually more complex in structure and have higher degrees of freedom, and their body shape will be affected by joint movement during walking. As a result, existing path planning algorithms are not good for obstacle avoidance of humanoid robots. The humanoid robot may collide with the surrounding obstacles in the process of traveling along the planned path. In order to reduce the occurrence of such a situation, this dissertation proposes an A*-based algorithm with distance threshold that considers the surrounding obstacle information, and adds a distance term to the heuristic function to judge whether there are obstacles in a certain range around nodes in the planned path, so as to consider the surrounding obstacle information in the path planning process. Then, the corresponding simulation environment is built in MATLAB and Gazebo respectively. In the simulation environment, the A* algorithm and the A*-based algorithm with distance threshold are used respectively to plan the path of the robot, and the path planning results of the two algorithms are compared and analyzed.