Path planning with obstacle avoidance based on visibility binary tree algorithm
A new algorithm for robot navigation, referred to as visibility binary tree algorithm is introduced. The construction of this algorithm is based on the visible tangents between robot and obstacles. The shortest path is run on top of the visibility binary tree. The performance is compared with three different algorithms for path planning.
path planning obstacle avoidance visibility graph bresenham algorithm