Abstract：This paper presents a novel tangent based path planning method. The planner makes use of the obstacle contours to model the environment in a discrete 2D configuration space. Locally shortest paths are constructed by convex hulls and tangents. Complex terrain is effectively decomposed by the Trunk Structure. It makes a major improvement over the tangent graph approach by expanding only necessary parts of the tangent graph and using the Bouncing Scan technique. It is capable of large space, can take full advantage of sparse environments and deal with unknown and dynamic environments, which make it an ideal planner for long range navigation. Simulation results show that it generates global optimal path in most situations, and is very time and space efficient thus suitable for real time applications.
[1] Liu Y H, Arimoto S. Proposal of tangent graph and extended tangent graph for path planning of mobile robots[A]. Proceedings of the 1991IEEE International Conference on Robotics and Automation[C]. Sacramento, California: IEEE Computer Society Press,1991.312-317. [2] Liu Y H, Arimoto S. Computation of the tangent graph of polygonal obstacles by moving-line processing[J]. IEEE Transactions on Robotics and Automstion,1994,10(6):823-830. [3] Doyle A B, Jones D I. A tangent based method for robot path planning[A]. Proceedings of the 1994 IEEE International Conference on Robotics and Automation[C]. San Diego: IEEE Computer Society Press,1994.1561-1566.
