• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.896-899
• /
• 1996

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.

• Structural Engineering and Mechanics
• /
• v.83 no.2
• /
• pp.135-151
• /
• 2022

The generalized displacement method is a nonlinear solution scheme that follows the equilibrium path of the structure based on the development of the generalized displacement. This method traces the path uniformly with a constant amount of generalized displacement. In this article, we first develop higher-order generalized displacement methods based on multi-point techniques. According to the concept of generalized stiffness, a relation is proposed to adjust the generalized displacement during the path-following. This formulation provides the possibility to change the amount of generalized displacement along the path due to changes in generalized stiffness. We, then, introduce higher-order algorithms of variable generalized displacement method using multi-point methods. Finally, we demonstrate with numerical examples that the presented algorithms, including multi-point generalized displacement methods and multi-point variable generalized displacement methods, are capable of following the equilibrium path. A comparison with the arc length method, generalized displacement method, and multi-point arc-length methods illustrates that the adjustment of generalized displacement significantly reduces the number of steps during the path-following. We also demonstrate that the application of multi-point methods reduces the number of iterations.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.24 no.1
• /
• pp.9-17
• /
• 2020

The stochastic point-source model has been widely used in generating artificial ground motions, which can be used to develop a ground motion prediction equation and to evaluate the seismic risk of structures. This model mainly consists of three different functions representing source, path, and site effects. The path effect is used to emulate decay in ground motion in accordance with distance from the source. In the stochastic point-source model, the path attenuation effect is taken into account by using the geometrical attenuation effect and the inelastic attenuation effect. The aim of this study is to develop accurate equations of ground motion attenuation in the Korean peninsula. In this study, attenuation was estimated and validated by using a stochastic point source model and observed ground motion recordings for the Korean peninsula.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1128-1131
• /
• 1996

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2002.11a
• /
• pp.127-131
• /
• 2002

This paper presents the a measured path-loss characteristics in urban line-of-sight(LOS) and non line-of-sight(NLOS) environments for 3.4, 5.3, and 6.4 ㎓ band signals. A two-ray model is applied to analyse the path-loss characteristics in LOS areas. In LOS areas, an empirical break point, whose distance is shorter than a theorical break point, is founded. Further, a sudden power level drop occurs at a transition point from LOS region to NLOS area and different path-loss exponents are occured various cases. The power level drop due to comer loss and path-loss exponents both increase as the distance between the transmitter and the corner increases.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1994.04a
• /
• pp.95-102
• /
• 1994

A path-switching strategy by combining the use of generalized inverse and line search is proposed. A reliable predictor for the tangent vector to bifurcation path is first computed by using the generalized inverse approach. A line search in the direction of maximum gradient of total potential at the point of intersection between the above predictor and a constant loading plane introduced in the vicinity of the detected bifurcation point is then carried out for the purpose of obtaining an improved approximation for a point on bifurcation path. With this approximation obtained, an actual point on bifurcation path is then computed through iteration on the constant loading plane.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.765-778
• /
• 2017

Finding an initial feasible solution on the central path is the main difficulty of feasible interior-point methods. Although, some algorithms have been suggested to remedy this difficulty, many practical implementations often do not use perfectly centered starting points. Therefore, it is worth to analyze the case that the starting point is not exactly on the central path. In this paper, we propose a weighted-path following interior-point algorithm for solving the Cartesian $P_{\ast}({\kappa})$-linear complementarity problems (LCPs) over symmetric cones. The convergence analysis of the algorithm is shown and it is proved that the algorithm terminates after at most $O\((1+4{\kappa}){\sqrt{r}}{\log}{\frac{x^0{\diamond}s^0}{\varepsilon}}\)$ iterations.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.45-53
• /
• 2009

As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.4
• /
• pp.363-368
• /
• 2005

This paper proposes an LOS(line-of-sight) guidance system of a ship for path following. From the viewpoint of a control configuration, guidance is a special type of compensation algorithm that is placed in front of the controller to accomplish navigational objects. A guidance system generates a reference trajectory for trajectory tracking or path control and decides the desired velocity, position and heading angle. A control system executes commands based on a reliable guidance law during navigation. An LOS vector from the vessel to a point on the path between two way-points in straight-line navigation or a point among turning circle in turning navigation is selected, and then a heading angle is calculated to converge the desired path based on the LOS vector. The LOS guidance law is defined for the straight-line and the turning circle, respectively. The effectiveness of the suggested LOS guidance system is assured through computer simulation.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.866-870
• /
• 1995

To make a mobile robot to get to a goal point, path which connects the mobile robot and the goal point is needed and a path planning is necessary. There are various kinds of a path planning. Well known methods are skeleton method, cell decomposition method and potential field method. But each method has both fortes and defects. In this paper, we propose a new method of path planning to find a path for mobile robot. It is obtained by modifying a Voronoi diagram. An original Voronoi diagram can make a safe path but its result is not satisfied. First defect of path, finded by the original Voronoi diagram, is sulplus of safty which make a path longer. Second defect is that the original Voronoi diagram method has a problem of connecting the Voronoi daigram with start/goal point of mobile robot. These defects are removed in proposed algorithm in this paper. We define a function to show the quality of paths. And by computer simulation, paths are compared and its result are shown.