arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1410.4145cs.RO
收藏

直线跟踪机器人的迷宫求解算法及由非线性路径求直线路径距离

Maze solving Algorithm for line following robot and derivation of linear path distance from nonlinear path

Bangladesh University of Engineering & Technology(孟加拉国工程技术大学)

Shadman Sakib, Anik Chowdhury, Shekh Tanvir Ahamed, Syed Imam Hasan

摘要:

本文讨论了探索和求解任何类型的线迷宫的一种独特的通用算法,并给出了一种简单的算法,适用于无环或有两个最高分支的环,其中两个分支都不是向内的。对于一般的算法,我们需要一个方法来映射整个迷宫,这是需要如果迷宫是复杂的。提出的迷宫映射系统是基于坐标系和映射后,整个迷宫作为一个图形在标准的“邻接表表示”的方法,最短路径和最短时间路径提取使用Dijkstra的算法。为了找到转弯点和交叉点的坐标,需要点之间的线性距离,为此使用了车轮编码器。然而,由于机器人的非线性运动,从编码器直接测量的距离具有一些误差,并且为了消除这种误差,建立了一种想法,该想法通过推导方程来结束,该方程从在非线性路径中移动的机器人的轮编码器的读数中给出两点之间几乎精确的线性距离。

英文摘要:

In this paper we have discussed a unique general algorithm for exploring and solving any kind of line maze with another simple one for simple mazes without loops or loops having highest two branches none of which are inward. For the general algorithm, we need a method to map the whole maze, which is required if the maze is complex. The proposed maze mapping system is based on coordinate system and after mapping the whole maze as a graph in standard 'Adjacency-list representation' method, shortest path and shortest time path was extracted using Dijkstra's algorithm. In order to find the coordinates of the turning points and junctions, linear distance between the points are needed, for which wheel encoder was used. However, due to non-linear movement of robot, the directly measured distance from the encoder has some error and to remove this error an idea is built up which ended by deriving equations that gives us almost exact linear distance between two points from the reading of wheel encoder of the robot moving in a non-linear path.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑