• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.541-544
• /
• 2006

In a tree with each edge associated with a length and a weight (positive, negative, or zero are possible) we develop an O(nlognloglogn) time algorithm for finding a path such that its sum of weights is maximized and its sum of lengths does not exceed a given value. The previously best-known result is O($nlog^2n$), where n is the number of nodes in the tree.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.4
• /
• pp.105-114
• /
• 1993

In this article, a planar geodesic (2-dimensional minimum length curve between two points) on which the maximum curvature is constrained and with prescribed initial and terminal directions is studied. A generic problem is formulated by the minimum-time optimal control problem in free terminal time. It is shown that the optimal path ($G^2$) may contain a singular arc or not and that the general types of $G^2$ can he classified into the 3 classes of control sequences. Finally, the explicit form of $G^2$ is derived geometrically as well as algebraically form the main theorem of this article.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.284-290
• /
• 1993

In order to improve the adaptability of rice transplanter to seeding with different length when transplanting multicropping rice in south China. The seedling separating planting mechanism is resynthesized in the paper. According to the agronomy requirements of seedling's transplanting, optimum motional path of the tip point of planting needle is obtained. by applying the established kinematic model of the separating planting mechanism, the relevant software is compiled. On the basis of the features of the problem, the constrained optimization method is utilized to solve the problem with 24 restrictions. Thus, the optimum structure parameters are obtained to satisfy the path points accurately.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.3 s.309
• /
• pp.31-40
• /
• 2006

Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Informations from various sensors can find obstacles and make path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. RAS method using obstacle information from variable sensors is useful to get minimum path length to goal.