基于笛卡儿坐标系的迷宫路径规划算法  

Maze Path_planning Algorithm Based on Cartesian Co-ordinates

作　　者：袁洁[1] 龚晓峰[1] 

机构地区：[1]四川大学电气信息学院,四川成都硕士610065

出　　处：《微计算机信息》2007年第05X期185-187,共3页Control & Automation

摘　　要：针对迷宫这类特殊的环境模型,提出了基于笛卡儿坐标系的新的路径规划算法。该算法通过找出机器人行驶方向和位置变化的关系,方便快捷地实现了对路径的记忆,并且在到达终点后能够通过一种简单的路径优化算法算出最短路径,最终实现以最短路径返回。此算法的可行性已通过轮式机器人实例得到证实。　Aiming at the especial circumstance model of maze, maze path_planning algorithm based on cartesian co-ordinates is raised. It can conveniencely and efficeintly record the route by finding the relationship between the steer direction and the station change of a robot.And after reaching the end piont ,it can compute the shortest way and go back in it by a simple path-planning algorithm.The feasibility of the algorithm has been proved by a simulative wheeled robot.

关 键 词：路径搜索 路径规划 笛卡儿坐标 机器人 迷宫 

分 类 号：TP242[自动化与计算机技术—检测技术与自动化装置]