• Journal of Korea Game Society
• /
• v.19 no.6
• /
• pp.83-90
• /
• 2019

Heuristic based Genetic Algorithm Pathfinding(H-GAP), a method without the need for node and edge information, can compensate the disadvantages of existing pathfinding algorithm, and perform the path search at high speed. However, because the pathfinding by H-GAP is non-node-based, it may not be an optimal path when it includes unnecessary path information. In this paper, we propose an algorithm to optimize the search path using H-GAP. The proposed algorithm optimizes the path by removing unnecessary path information through ray-tracing algorithm after the H-GAP path search is completed.

• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.31-34
• /
• 2000

In this paper, we design an optimal path for multiple mobile robots. For this purpose, we propose a new method of path planning for multiple mobile robots in dynamic environment. First, every mobile robot searches a global path using a distance transform algorithm. Then we put subgoals at crooked path points and optimize them. And finally to obtain an optimal on-line local path, ever)r mobile robot searches a new path with static and dynamic obstacle avoidance.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.9
• /
• pp.85-93
• /
• 1992

In this paper, the new timing optimization algorithm for combinational networks is proposed. First, we introduce the concept of P-path redundancy which is the extension of redundancy concept used in the testing of combinational networks. In this approach, the critical delay is minimized by removing the P-path redundant side inputs of the critical path, and more accurate timing optimization is possible by systematically considering the statically unsensitizable paths as well as the statically sensitizable paths. It's possible with all previous longest path based approaches that the critical delay of resulting network after timing optimization may be even increased. However, the proposed method guarantees to exclude such a possibility, and can be applied to optimize the timing of combinational networks in technology independent, and dependent phase.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.1
• /
• pp.149-157
• /
• 2013

This paper describes a global path planning method and path optimization algorithm for autonomous mobile robot based on the virtual elastic force in a grid map environment. A goal of a path planning is information for a robot to go its goal point from start point by a effective way. The AStar algorithm is a well-known method for a grid based path planning. This paper suggest a path optimization method by a virtual elastic force and compare the algorithm with a orignal AStar method. The virtual elastic force makes a shorter and smoother path. It is a profitable algorithm to optimize a path in a grid environment.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.51-56
• /
• 2011

The train travels on the track and, thus, the rear wheels precisely follow the paths of the front wheels. On the contrary, in the vehicles running on the road like automobiles, buses and trucks, the front wheels try to drag the rear ones toward them and across the inside of the curve. Off-tracking is defined as the radial offset between the path of the centerline of the front axle and the path of the centerline of the following axle. In the case of the bimodal tram with AWS(all wheel steering), the off-tracking decrease but the rear swing-out values increase because of the rear steering at the reverse phase angle. Thus, in order to determine the swept path width, maximum road width at the minimum turning radius, off-tracking and swing-out should be considered for the bimodal tram. In this paper, trajectory simulations were carried out for the various condition such as front steering, front and rear steering and suppression of swing-out to optimize the swept path width.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2022.04a
• /
• pp.144-145
• /
• 2022

Since the marking robot draws lines by point-to-point operation, the robot's shifting path greatly affects the working time and productivity. Therefore, it is required to analyze the movement method based on the robot's motion and plan to minimize the movement time. Therefore, this study proposes a method that can optimize the robot's shifting path to minimize the working time of the marking robot. Through the results of this study, it is expected that the non-working time of the marking robot will be reduced and the efficient operation will be possible.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.759-762
• /
• 2005

Recently, Intelligent Transportation System(ITS) has been applied to satisfy increasing traffic demand every year and to solve many traffic problems. Especially, Advanced Traveller Information System(ATIS) is a transportation system to optimize the trip of each other vehicle. It is important to provide the driver with quick and comfortable path from source to destination. However, it is difficult to provide a shortest path in a road network with dynamic cost. Because the existing research has a static cost. Therefore, in this paper we propose an operator for searching traffic dependent shortest path. The proposed operator finds the shortest path from source to destination using a current time cost and a difference cost of past time cost. Such a method can be applied to the road status with time. Also, we can expect a predicted arrival time as well as the shortest path from source to destination. It can be applied to efficiently application service as ITS and have the advantages of using the road efficiently, reducing the distribution cost, preparing an emergency quickly, reducing the trip time, and reducing an environmental pollution owing to the saving the fuel.

• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3505-3516
• /
• 2021

During nuclear facility decommissioning, workers are continuously exposed to high-level radiation. Hence, adequate path planning is critical to protect workers from unnecessary radiation exposure. This work discusses recent development in radioactive path planning and the algorithms recommended for the task. Specifically, we review the conventional methods for nuclear decommissioning path planning, analyze the techniques utilized in developing algorithms, and enumerate the decision factors that should be considered to optimize path planning algorithms. As a major contribution, we present the quantitative performance comparison of different algorithms utilized in solving path planning problems in nuclear decommissioning and highlight their merits and drawbacks. Also, we discuss techniques and critical consideration necessary for efficient application of robots and robotic path planning algorithms in nuclear facility decommissioning. Moreover, we analyze the influence of obstacles and the environmental/radioactive source dynamics on algorithms' efficiency. Finally, we recommend future research focus and highlight critical improvements required for the existing approaches towards a safer and cost-effective nuclear-decommissioning project.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.60 no.3
• /
• pp.126-132
• /
• 2011

A conventional LDO(Low Dropout Regulator) uses one OPAMP and one signal path. This means that OPAMP's DC Gain and Bandwidth can't optimize simultaneously within usable power. This also appears that regulation property and settling time of LDO can't improve at the same time. Based on this idea, a proposed LDO uses two OPAMP and has two signal path. To improve regulation property, OPAMP where is used in the path which qualities DC gain on a large scale, bandwidth designed narrowly. To improve settling time, OPAMP where is used in the path which qualities DC gain small, bandwidth designed widely. A designed LDO used 0.5um 1P2M process and provided 200mA of output current. A line regulation and load regulation is 12.6mV/V, 0.25mV/mA, respectively. And measured settling time is 1.5us in 5V supply voltage.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.793-798
• /
• 1991

Implementation of AGVS (Automated Guided Vehicle System) in CIMS (Computer Integrated Manufacturing System) generally requires substantial study to optimize design and performance of the guide path. Traditional mathematical approaches have been used with limited success to analyze AGVS. These approaches, however, do not provide a practical opportunity to use by path designers. This paper presents a new approach based on Jules in designing and assessing AGV path to have better design of the closed-loop layout. A framework for the approach is proposed and a case study is reported to demonstrate the framework. Deletion of seldom used paths and addition of bypasses to solve the congestion problem are conducted automatically through simulation expefiments. To visualize die results a graphic control program is developed and integrated with AutoMod/AutoGram simulation package.