Variable Priority in Maze-Solving Algorithms for Robot's Movement (Specially Useful for Low Quality Mechanic Robots)

摘要

Variable Priority in Maze-Solving Algorithms for Robot's Movement (Specially Useful for Low Quality Mechanic Robots) Babak Hosseini Kazerouni, Mona Behnam Moradi and Pooya Hosseini Kazerouni Pages 147-152 (2003 Proceedings of the 20th ISARC, Eindhoven, Holland, ISBN 978-90-6814-574-8, ISSN 2413-5844) Abstract: Most existing Maze-Solving algorithms assume a constant priority for the robot's movement. Thus, each moment, the robot will determine next movement only by the assumed constant priority. As turning would take a lot of time the fastest path and the easiest to go through is the one that has less turns. Because of the fastest path and in some projects the easiest one is preferred, and the constant priority might not lead the robot to the one with less turns, a movement priority that considers non-turning paths engenders less solving-time. In many projects the mechanic of the robot is not high quality so it should move through paths with less turns. In this paper a "variable priority for robot's movement", is introduced. This variable priority besides causing less solving-time is useful in projects that a robot with low quality mechanic is used, as it cause less turning. So, it would increase the solving efficiency a lot. One more advantage is that this manner is general and not just for a specific maze. It is important because in today's projects, most of the time, the environment around the robot is not known. Keywords: Maze-Solving Algorithms, Open Path's Length, Less Turns, Variable Movement Priority DOI: https://doi.org/10.22260/ISARC2003/0021 Download fulltext Download BibTex Download Endnote (RIS) TeX Import to Mendeley