Urban mobile robot routing using fast search random tree method (RRT) in obstacle environments

Author:

jalalnezhad mostafa1ORCID,Hsieh Hsin-Yin2,Chen Kuan-Hung3,Shieh Chich-Jen4,Askar Shavan5

Affiliation:

1. Kharazmi University

2. National Cheng Kung University

3. Shaoguan University

4. Hubei University of Automotive Technology

5. Erbil Polytechnic University

Abstract

Abstract In this thesis, the objective of path planning and control systems for robot is multifactorial. The method used for navigation algorithms based on is closed-loop random trees with quick search or CL-RRT. In this algorithm, each robot will grow a tree from its current location to the target or zone target is developed. The main advantage of this method is the ability to function in complex environments. For use this method, it is necessary that the CL-RRT algorithm for robot navigation online, be extended. In online mode, the robot does not have any information about the environment and through its sensors, which detect the environment and the ability to function in environments with obstacles dynamic and could face a new obstacle or the possibility of an obstacle's dynamic (the other a robot) to change its direction during motion. Performance of the design path used with design the controller for robot in an environment with various obstacles are evaluated and then this design is for a group of robots used. To coordinate among agents and to ensure that there is no conflict between them there is strategy based on, priority assignment and LOS method. The strategy used in a way that ensures that the collision between agents does not happen and benefits of the design methods path used to keep. As a result of this strategy can be divided into two parts, the first part of the prioritization robots and the second part of the strategy, no conflict robot is in motion. In this thesis the problem of forming a group of robots has been investigated. In other words, the agents move in the number of agents must be a specific form. The agents according to a number try to set form (originally defined) to its motion to follow, also when faced with obstacles or other agents of its priorities is no conflict with obstacles or other factors and this moment it is possible to change the shape of their,if this will happen again the situation changes be considered form to make its motion.

Publisher

Research Square Platform LLC

Reference26 articles.

1. Hoy M, Matveev AS (2015) and Andrey V. Savkin. "Algorithms for collision-free navigation of mobile robots in complex cluttered environments: a survey." Robotica 33.3 : 463–497

2. Past, present and future of path-planning algorithms for mobile robot navigation in dynamic environments;Hewawasam HS;IEEE Open Journal of the Industrial Electronics Society,2022

3. Object-Based Reliable Visual Navigation for Mobile Robot;Wang F;Sensors,2022

4. A genetic algorithm with exact dynamic programming for the green vehicle routing & scheduling problem;Xiao Y;J Clean Prod,2017

5. Chabini I (2002) and Shan Lan. "Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks." IEEE Transactions on intelligent transportation systems 3.1 : 60–74

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3