针对迷宫这类特殊的环境模型, 提出了基于笛卡儿坐标系的新的路径规划算法。该算法通过找出机器人行驶方向和位

置变化的关系, 方便快捷地实现了对路径的记忆, 并且在到达终点后能够通过一种简单的路径优化算法算出最短路径, 最

终实现以最短路径返回。此算法的可行性已通过轮式机器人实例得到证实。-For the maze of such a unique environment model, a Cartesian coordinate system based on a new path planning algorithm. The algorithm by identifying the location of robot moving direction and changes in the relationship quickly and easily realize the path memory, and upon arrival at the finishing point to the path through a simple optimization algorithm calculates the shortest path, and ultimately to realize the shortest path to return. The feasibility of this algorithm has passed wheeled robot instance to be confirmed.