• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.607-613
• /
• 2011

This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.10
• /
• pp.993-998
• /
• 2007

To verify the 2D or 3D positioning accuracy of a multi-axes stage is not easy, particularly, in the case the moving path of the stage is not linear. This paper is a study on a measuring method for the curved path accurately. A machine vision technique is used to trace the moving path of two-axes stage. To improve the accuracy of machine vision, a zoom lens is used for the 2D micro moving path. The accuracy of this method depends of the CCD resolution and array align accuracy with the zoom lens system. Also, a further study for software algorithm is required to increase the tracing speed. This technique will be useful to trace a small object in the 2D micro path in real-time accurately.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.11-14
• /
• 2003

In this paper, we use Fuzzy Logic and Potential field method for optimal path planning of an autonomous mobile robot and apply to navigation for real-time mobile robot in 2D dynamic environment. For safe navigation of the robot, we use both Global and Local path planning. Global path planning is computed off-line using sell-decomposition and Dijkstra algorithm and Local path planning is computed on-line with sensor information using potential field method and Fuzzy Logic. We can get gravitation between two feature points and repulsive force between obstacle and robot through potential field. It is described as a summation of the result of repulsive force between obstacle and robot which is considered as an input through Fuzzy Logic and gravitation to a feature point. With this force, the robot fan get to desired target point safely and fast avoiding obstacles. We Implemented the proposed algorithm with Pioneer-DXE robot in this paper.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.627-629
• /
• 1999

The research fields of mobile robot consist of three parts. The first is path planning, the second is the application of new sensors, and the last is a combination of the communication technology and mobile robot. In this paper we treat the path-planning. We use a Bayesian probability map, Distance Transform and Fuzzy logic for a path-planning. DT and Fuzzy logic algorithms search for path in entire, continuous free space and unifies global path planning and local path planning. It is efficient and effective method when compared with navigators using traditional approaches.

• Journal of Power System Engineering
• /
• v.5 no.2
• /
• pp.79-86
• /
• 2001

A method is presented for generating the path which significantly reduces residual vibration of the redundant, flexible robot manipulator in the presence of obstacles. The desired path is optimally designed so that the system completes the required move with minimum residual vibration, avoiding obstacles. The dynamic model and optimal path are effectively formulated and computed by using special moving coordinate, called VLCS, to represent the link flexibility. The path to be designed is developed by a combined Fourier series and polynomial function to satisfy both the convergence and boundary condition matching problems. The concept of correlation coefficients is used to select the minimum number of design variables. A planar three-link manipualtor is used to evaluate this method. Results show that residual vibration can be drastically reduced by selecting an appropriate path, in the presence of obstacles.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.715-718
• /
• 1998

There are a lot of paths which connect between the mobile robot and the goat point. To make a mobile robot arrive at the goal point fastly, The optimal path is needed and a path palnning is necessary. In this paper, we propose a new method of path planning to find a path for mobile robot. It is based on Ginetic Algorithm for serching the optimal grobal path planning. Simulations show the efficiency for the grobal path planning.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.2
• /
• pp.389-397
• /
• 2011

The global dynamic window approach (DWA) is widely used to generate the shortest path of mobile robots considering obstacles and kinematic constraints. However, the dynamic constraints of robots should be considered to generate the minimum-time path. We propose a modified global DWA considering the dynamic constraints of robots. The reference path is generated using A* algorithm and smoothed by cardinal spline function. The trajectory is then generated to follows the reference path in the minimum time considering the robot dynamics. Finally, the local path is generated using the dynamic window which includes additional terms of speed and orientation. Simulation and experimental results are presented to verify the performance of the proposed method.

• The Journal of Korea Robotics Society
• /
• v.15 no.2
• /
• pp.147-159
• /
• 2020

Over the last years, a number of different path following methods for the autonomous parking system have been proposed for tracking planned paths. However, it is difficult to find a study comparing path following methods for a short path length with large curvature such as a parking path. In this paper, we conduct a comparative study of the path following methods for perpendicular parking. By using Monte-Carlo simulation, we determine the optimal parameters of each controller and analyze the performance of the path following. In addition, we consider the path following error occurred at the switching point where forward and reverse paths are switched. To address this error, we conduct the comparative study of the path following methods with the one thousand switching points generated by the Monte-Carlo method. The performance of each controller is analyzed using the V-rep simulator. With the simulation results, this paper provides a deep discussion about the effectiveness and limitations of each algorithm.

• The Journal of Korea Robotics Society
• /
• v.13 no.2
• /
• pp.142-149
• /
• 2018

$RRT^*$ (Rapidly exploring Random $Tree^*$) based algorithms are widely used for path planning. Informed $RRT^*$ uses $RRT^*$ for generating an initial path and optimizes the path by limiting sampling regions to the area around the initial path. $RRT^*$ algorithms have several limitations such as slow convergence speed, large memory requirements, and difficulties in finding paths when narrow aisles or doors exist. In this paper, we propose an algorithm to deal with these problems. The proposed algorithm applies the image skeletonization to the gridmap image for generating an initial path. Because this initial path is close to the optimal cost path even in the complex environments, the cost can converge to the optimum more quickly in the proposed algorithm than in the conventional Informed $RRT^*$. Also, we can reduce the number of nodes and memory requirement. The performance of the proposed algorithm is verified by comparison with the conventional Informed $RRT^*$ and Informed $RRT^*$ using initial path generated by $A^*$.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.4
• /
• pp.362-367
• /
• 2011

The collision-free path of a manipulator should be regenerated in the real time to achieve collision safety when obstacles or humans come into the workspace of the manipulator. A probabilistic roadmap (PRM) method, one of the popular path planning schemes for a manipulator, can find a collision-free path by connecting the start and goal poses through the roadmap constructed by drawing random nodes in the free configuration space. The path planning method based on the configuration space shows robust performance for static environments which can be converted into the off-line processing. However, since this method spends considerable time on converting dynamic obstacles into the configuration space, it is not appropriate for real-time generation of a collision-free path. On the other hand, the method based on the workspace can provide fast response even for dynamic environments because it does not need the conversion into the configuration space. In this paper, we propose an efficient real-time path planning by combining the PRM and the potential field methods to cope with static and dynamic environments. The PRM can generate a collision-free path and the potential field method can determine the configuration of the manipulator. A series of experiments show that the proposed path planning method can provide robust performance for various obstacles.