Motion Planning of Mobile Robots for Autonomous Navigation on Uneven Ground Surfaces

被引:26
作者
Jeong, Inbae [1 ]
Jang, Youjin [2 ]
Park, Jisoo [3 ]
Cho, Yong K. [3 ]
机构
[1] North Dakota State Univ, Dept Mech Engn, Fargo, ND 58108 USA
[2] North Dakota State Univ, Dept Construct Management & Engn, Fargo, ND 58108 USA
[3] Georgia Inst Technol, Sch Civil & Environm Engn, Atlanta, GA 30332 USA
关键词
Autonomous navigation; Mobile robot; Motion planning; Quick-rapidly exploring random tree* (Q-RRT*); Uneven construction site; PATH; REGISTRATION; ASTERISK;
D O I
10.1061/(ASCE)CP.1943-5487.0000963
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
With the increasing interest in mobile robots for construction applications, autonomous navigation in unstructured and uneven construction sites has become a critical challenge. To ensure the safe and robust navigation of a robot in such environments, this study develops an optimal obstacle-avoiding path planner for stable posture (OOPS) that minimizes the distance to the goal area and stabilizes the posture of the robot. In this study, a new algorithm was developed by significantly improving the quick-rapidly exploring random tree* (Q-RRT*) algorithm to find a feasible path and converge to the optimal path more quickly. A cost function was defined to stabilize the posture of the robot. A simulation experiment was conducted to examine the feasibility of the OOPS algorithm, and its performance was compared with those of other algorithms. The OOPS algorithm was also validated in an experiment in a real-world outdoor environment with sloped hills and several obstacles. The results demonstrate that the OOPS algorithm outperforms other algorithms in terms of the time needed to find the initial solution, time to convergence on the optimal solution, and rate of success in reaching the goal. A mobile robot with the OOPS algorithm is able to start navigating sooner, and the algorithm takes less time than other algorithms to produce paths that are closer to the optimal path. The robot's posture is more stable when it follows the path obtained from the OOPS algorithm in both simulation and real-world tests. Therefore, the OOPS algorithm can be effectively used for applications in uneven, highly sloped, and unstructured outdoor environments.
引用
收藏
页数:15
相关论文
共 23 条
[1]   A comparative study of different approaches for finding the shortest path on construction sites [J].
Andayesh, Mohsen ;
Sadeghpour, Farnaz .
CREATIVE CONSTRUCTION CONFERENCE 2014, 2014, 85 :33-41
[2]   Terrain Traversability and Optimal Path Planning in 3D Uneven Environment for an Autonomous Mobile Robot [J].
Belaidi, Hadjira ;
Bentarzi, Hamid ;
Belaidi, Abderrahmane ;
Hentout, Abdelfetah .
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2014, 39 (11) :8371-8381
[3]  
Bone G.M., 2013, P INT S AUT ROB CONS, P753
[4]  
Brown C, 2012, ENG MIN J, V213, P30
[5]   Robotics and automated systems in construction: Understanding industry-specific challenges for adoption [J].
Delgado, Juan Manuel Davila ;
Oyedele, Lukumon ;
Ajayi, Anuoluwapo ;
Akanbi, Lukman ;
Akinade, Olugbenga ;
Bilal, Muhammad ;
Owolabi, Hakeem .
JOURNAL OF BUILDING ENGINEERING, 2019, 26
[6]   Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rate [J].
Jeong, In-Bae ;
Lee, Seung-Jae ;
Kim, Jong-Hwan .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 123 :82-90
[7]   Task Intelligence of Robots: Neural Model-Based Mechanism of Thought and Online Motion Planning [J].
Jeong, In-Bae ;
Ko, Woo-Ri ;
Park, Gyeong-Moon ;
Kim, Deok-Hwa ;
Yoo, Yong-Ho ;
Kim, Jong-Hwan .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2017, 1 (01) :41-50
[8]   Pose estimation-based path planning for a tracked mobile robot traversing uneven terrains [J].
Jun, Jae-Yun ;
Saut, Jean-Philippe ;
Benamar, Faiz .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2016, 75 :325-339
[9]   Sampling-based algorithms for optimal motion planning [J].
Karaman, Sertac ;
Frazzoli, Emilio .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2011, 30 (07) :846-894
[10]  
Kayhani N, 2018, ISARC 2018, V35, P1, DOI DOI 10.22260/ISARC2018/0169