• The Journal of Korea Robotics Society
• /
• v.18 no.4
• /
• pp.487-495
• /
• 2023

This paper presents a method for autonomous exploration of indoor environments using a 2-dimensional Light Detection And Ranging (LiDAR) scanner. The proposed frontier-based exploration method considers navigability from the current robot position to extracted frontier targets. An approach to constructing the point cloud grid map that accurately reflects the occupancy probability of glass obstacles is proposed, enabling identification of safe frontier grids on the safety grid map calculated from the point cloud grid map. Navigability, indicating whether the robot can successfully navigate to each frontier target, is calculated by applying the skeletonization-informed rapidly exploring random tree algorithm to the safety grid map. While conventional exploration approaches have focused on frontier detection and target position/direction decision, the proposed method discusses a safe navigation approach for the overall exploration process until the completion of mapping. Real-world experiments have been conducted to verify that the proposed method leads the robot to avoid glass obstacles and safely navigate the entire environment, constructing the point cloud map and calculating the navigability with low computing time deviation.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.653-662
• /
• 2016

This paper describes a test case generation algorithm for Simulink/Stateflow models based on the Rapidly exploring Random Tree (RRT) algorithm that has been successfully applied to path finding. An important factor influencing the performance of the RRT algorithm is the metric used for calculating the distance between the nodes in the RRT space. Since a test case for a Simulink/Stateflow (SL/SF) model is an input sequence to check a specific condition (called a test target in this paper) at a specific status of the model, it is necessary to drive the model to the status before checking the condition. A status maps to a node of the RRT. It is usually necessary to check various conditions at a specific status. For example, when the specific status represents an SL/SF model state from which multiple transitions are made, we must check multiple conditions to measure the transition coverage. We propose a unique distance calculation metric, based on the observation that the test targets are gathered around some specific status such as an SL/SF state, named key nodes in this paper. The proposed metric increases the probability that an RRT is extended from key nodes by imposing penalties to non-key nodes. A test case generation algorithm utilizing the proposed metric is proposed. Three models of Electrical Control Units (ECUs) embedded in a commercial vehicle are used for the performance evaluation. The performances are evaluated in terms of penalties and compared with those of the algorithm using a typical RRT algorithm.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.27 no.2
• /
• pp.1-8
• /
• 2019

Optimal path planning refers to find the safe route to the destination at a low cost, is a major problem with regard to autonomous navigation. Sampling Based Planning(SBP) approaches, such as Rapidly-exploring Random Tree Star($RRT^*$), are the most influential algorithm in path planning due to their relatively small calculations and scalability to high-dimensional problems. $RRT^*$-Smart introduced path optimization and biased sampling techniques into $RRT^*$ to increase convergent rate. This paper presents an improvement plan that has changed the biased sampling method to increase the initial convergent rate of the $RRT^*$-Smart, which is specified as m$RRT^*$-Smart. With comparison among $RRT^*$, $RRT^*$-Smart and m$RRT^*$-Smart in 2 & 3-D environments, m$RRT^*$-Smart showed similar or increased initial convergent rate than $RRT^*$ and $RRT^*$-Smart.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.471-478
• /
• 2013

This paper proposes a black-box based test case generation method for Simulink/Stateflow model utilizing the RRT algorithm which is a method to efficiently solve the path planning for complicated systems. The proposed method in the paper tries to solve the reachability problem with the RRT algorithm, which has to be solved for black-box based test case generations. A major problem of the RRT based test case generation algorithms is that the cost such as running time and required memory size is too much for complicated Stateflow model. The typical RRT algorithm expands rapidly-exploring random tree (RRT) in a single state space. But the proposed method expands it in dynamic state space based on the state of Simulink model, consequently reducing the cost. In the paper, a new definition of RRT state space, a distance measure and a test case generation algorithm are proposed. The performance of proposed method is verified through the experiment against Stateflow model.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.2
• /
• pp.138-142
• /
• 2007

This paper presents an algorithm which extends the rapidly-exploring random tree (RRT) framework to deal with change of the task environments. This algorithm called the Retrieval RRT Strategy (RRS) combines a support vector machine (SVM) and RRT and plans the robot motion in the presence of the change of the surrounding environment. This algorithm consists of two levels. At the first level, the SVM is built and selects a proper path from the bank of RRTs for a given environment. At the second level, a real path is planned by the RRT planners for the: given environment. The suggested method is applied to the control of $KUKA^{TM}$, a commercial 6 DOF robot manipulator, and its feasibility and efficiency are demonstrated via the cosimulatation of $MatLab^{TM}\;and\;RecurDyn^{TM}$.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.3
• /
• pp.217-225
• /
• 2016

In this paper, we propose an improved path planning method and obstacle avoidance algorithm for two-wheel mobile robots, which can be effectively applied in an environment where obstacles can be represented by circles. Firstly, we briefly introduce the rapidly exploring random tree (RRT) and single polar polynomial (SPP) algorithm. Secondly, we present additional two methods for applying our proposed method. Thirdly, we propose a global path planning, smoothing and obstacle avoidance method that combines the RRT and SPP algorithms. Finally, we present a simulation using our proposed method and check the feasibility. This shows that proposed method is better than existing methods in terms of the optimality of the trajectory and the satisfaction of the kinematic constraints.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.6
• /
• pp.803-812
• /
• 2017

This paper proposes a local path planning method for stable autonomous driving in rough terrain. There are various path planning techniques such as candidate paths, star algorithm, and Rapidly-exploring Random Tree algorithms. However, such existing path planning has limitations to reflecting the stability of unmanned ground vehicles. This paper suggest a path planning algorithm that considering the stability of unmanned ground vehicles. The algorithm is based on the genetic algorithm and assumes to have probability based obstacle map and elevation map. The simulation result show that the proposed algorithm can be used for real-time local path planning in rough terrain.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.76-78
• /
• 2019

Sampling-based algorithms are one of the most commonly approaches which give good results in robot path planning with many degree of freedom. So that many proposed methods as well as their improvement based on these approaches have been proposed. The purpose of this paper is to survey some current algorithms using for path planning, the original proposed methods as well as their improvement. Some advantages and disadvantages of these algorithms will be also mentioned, how the improved version of the proposed methods overcome the original proposed methods' drawback.

• ETRI Journal
• /
• v.45 no.5
• /
• pp.746-757
• /
• 2023

This study presents a novel safe landing algorithm for urban drone deliveries. The rapid advancement of drone technology has given rise to various delivery services for everyday necessities and emergency relief efforts. However, the reliability of drone delivery technology is still insufficient for application in urban environments. The proposed approach uses the "landing angle control" method to allow the drone to land vertically and a rapidly exploring random tree-based collision avoidance algorithm to generate safe and efficient vertical landing paths for drones while avoiding common urban obstacles like trees, street lights, utility poles, and wires; these methods allow for precise and reliable urban drone delivery. We verified the approach within a Gazebo simulation operated through ROS using a six-degree-of-freedom drone model and sensors with similar specifications to actual models. The performance of the algorithms was tested in various scenarios by comparing it with that of stateof-the-art 3D path planning algorithms.

• The Journal of Korea Robotics Society
• /
• v.16 no.3
• /
• pp.250-259
• /
• 2021

Path planning is one of the important technologies for automated parking. It requires to plan a collision-free path considering the vehicle's kinematic constraints such as minimum turning radius or steering velocity. In a complex parking lot, Rapidly-exploring Random Tree^* (RRT^*) can be used for planning a parking path, and Reeds-Shepp or Hybrid Curvature can be applied as a tree-extension method to consider the vehicle's constraints. In this case, each of these methods may affect the computation time of planning the parking path, path-tracking error, and parking success rate. Therefore, in this study, we conduct comparative analysis of two tree-extension functions: Reeds-Shepp (RS) and Hybrid Curvature (HC), and show that HC is a more appropriate tree-extension function for parking path planning. The differences between the two functions are introduced, and their performances are compared by applying them with RRT^*. They are tested at various parking scenarios in simulation, and their advantages and disadvantages are discussed by computation time, cross-track error while tracking the path, parking success rate, and alignment error at the target parking spot. These results show that HC generates the parking path that an autonomous vehicle can track without collisions and HC allows the vehicle to park with lower alignment error than those of RS.