• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.418-418
• /
• 2000

This paper proposes a path planning algorithm for mobile robot. To generate an optimal path and minimum time path for a mobile robot, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance between start and goal point, the path is revised to find the minimum time path by path-smoothing algorithm. Simulation results show that the proposed algorithms are more effective.

• 한국멀티미디어학회논문지
• /
• 제20권4호
• /
• pp.649-659
• /
• 2017

Typically, a smart car is equipped with access to the Internet and a wireless local area network. Moreover, a smart car is equipped with a global positioning system (GPS) based navigation system that presents a map to a user for recommending the shortest path to a desired destination. This paper presents the design and implementation of a real-time shortest path search system for directed and dynamic roads. Herein, we attempt to simulate real-world road environments, while considering changes in the ratio of directed roads and in road conditions, such as traffic accidents and congestions. Further, we analyze the effect of the ratio of directed roads and road conditions on the communication cost between the server and vehicles and the arrival times of vehicles. In this study, we compare and analyze distance-based shortest path algorithms and driving time-based shortest path algorithms while varying the number of vehicles to search for the shortest path, road conditions, and ratio of directed roads.

• 로봇학회논문지
• /
• 제8권1호
• /
• pp.43-50
• /
• 2013

$A^*$ algorithm is a global path generation algorithm, and typically create a path using only the distance information. Therefore along the path, a moving vehicle is usually not be considered by driving characteristics. Deceleration at the corner is one of the driving characteristics of the vehicle. In this paper, considering this characteristic, a new evaluation function based path algorithm is proposed to decrease the number of driving path corner, in order to reduce the driving cost, such as driving time, fuel consumption and so on. Also the potential field method is applied for driving of UGV, which is robust against static and dynamic obstacle environment during following the generated path of the mobile robot under. The driving time and path following test was occurred by experiments based on a pseudo UGV, mobile robot in downscaled UGV's maximum and driving speed in corner. The experiment results were confirmed that the driving time by the proposed algorithm was decreased comparing with the results from $A^*$ algorithm.

• Journal of Communications and Networks
• /
• 제8권2호
• /
• pp.228-233
• /
• 2006

Survivability is a very important requirement for the deployment of broadband networks because out of service links can affect volumes of traffic even if it is a very short time. And the data paths of broadband networks, which are critical for traffic engineering, are always necessary to be well protected. The procedure of protection or restoration for a path is initiated when failure is detected within the working path. In order to minimize the influence on transmission quality caused by the failure of links and to provide a definite time for the recovery from the failure, the protection switching time (PST) should be carefully considered in the path arrangement. Several researches have been devoted to construct the protection and restoration schemes of data paths over dense wavelength division multiplexing (DWDM) networks, however, there was rare research on the design of data paths with guaranteed protection switching time. In this paper, the PST-guaranteed scheme, which is based on the concept of short leap shared protection (SLSP), for the arrangement of data paths in DWDM networks is proposed. The proposed scheme provides an efficient procedure to determine a just-enough PST-guaranteed backup paths for a working path. In addition to selecting the PST-guaranteed path, the network cost is also considered in a heuristic manner. The experimental results demonstrate that the paths arranged by the proposed scheme can fully meet the desired PST and the required cost of the selected path is competitive with which of the shared path scheme.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

• 대한산업공학회지
• /
• 제27권1호
• /
• pp.69-88
• /
• 2001

In the zigzag milling operation, an important issue is to design a machining strategy which minimizes the cutting time. An important variable for minimization of cutting time is the tool path length. The tool path is divided into cutting path and non-cutting path. Cutting path can be subdivided into tool path segment and step-over, and non-cutting path can be regarded as the tool retraction. We propose a new method to determine the cutting direction which minimizes the length of tool path in a convex or concave polygonal shape including islands. For the minimization of tool path length, we consider two factors such as step-over and tool retraction. Step-over is defined as the tool path length which is parallel to the boundary edges for machining area and the tool retraction is a non-cutting path for machining any remaining regions. In the determination of cutting direction, we propose a mathematical model and an algorithm which minimizes tool retraction length in complex shapes. With the proposed methods, we can generate a tool path for the minimization of cutting time in a convex or concave polygonal shapes including islands.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.2052-2067
• /
• 2011

Complementary trees are two spanning trees rooted at the sink node satisfying that any source node's two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstra's algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.

• 제어로봇시스템학회논문지
• /
• 제17권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.

• Current Optics and Photonics
• /
• 제3권3호
• /
• pp.210-214
• /
• 2019

The allowable path-deviation time of aircraft in a free-space optical communication system has been estimated from various trajectories, using different values of aircraft speeds and turn rates. We assumed the existence of a link between the aircraft and a ground base station. First, the transmitter beam's divergence angle was calculated through two different approaches, one based on a simple optical-link equation, and the other based on an attenuation coefficient. From the calculations, the discrepancy between the two approaches was negligible when the link distance was approximately 110 km, and was under 5% when the link distance ranged from 80 to 140 km. Subsequently, the allowable path-deviation time of the aircraft within the tracking-error tolerance of the system was estimated, using different aircraft speeds, turn rates, and link distances. The results indicated that the allowable path-deviation time was primarily determined by the aircraft's speed and turn rate. For example, the allowable path-deviation time was estimated to be ~3.5 s for an aircraft speed of 166.68 km/h, a turn rate of $90^{\circ}/min$, and a link distance of 100 km. Furthermore, for a constant aircraft speed and turn rate, the path-deviation time was observed to be almost unchanged when the link distance ranged from 80 to 140 km.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2311-2318
• /
• 2005

Progress in the LCD industries has been very rapid. Therefore, their manufacturing lines require larger LCD glass-handling robots and more precise path control of the robots. In this paper, we present two practical advanced algorithms for high-precision path generation of an LCD glass-handling robot. One is high-precision path interpolation for continuous motion, which connects several single motions and is a reliable solution for a short robot cycle time. We demonstrate that the proposed algorithm can reduce path error by approximately 91% compared with existing algorithms without increasing cycle time. The second is real-time static deflection compensation, which can optimally compensate the static deflection of the handling robot without any additional sensors, measurement instruments or mechanical axes. This reduces vertical path error to approximately 60% of the existing system error. All of these algorithms have been commercialized and applied to a seventh-generation LCD glass-handling robot.