基于凸区划分的移动机器人路径规划算法

Algorithm for mobile robot path planning based on convex area partition

在研究传统的路径规划的基础上提出了一种用于移动式机器人的凸区法路径规划的简单而新颖的凸区划分算法。此算法能自动将环境中的自由空间切分成许多个凸区。此算法已在计算机上得以实现，并取得了另人满意的结果。

A simple and innovative algorithms of convex area divides for a mobile robot for global path planning is put forward in this paper, which is based on studying conventional path planning. This method could divide the free area into several convex areas and the algorithm was carried out on computer.