• Journal of the Korean Institute of Landscape Architecture International Edition
• /
• no.2
• /
• pp.114-119
• /
• 2004

By Article two of a Japanese urban park low, it prescribes park facilities strictly, and one of the classifications includes 'path and plaza'. In addition, it is assumed that we divide several kinds different paths of width by size of the park in a path design of a park with a textbook of park design in a trunk line path, the main path, a vice-path or a branch path and design it. From such a thing, in the path of an urban park, a line consists straight of fixed width, and it is most that one pattern is considered to be. Therefore, in modem urban park, a path and division of a plaza are lucid explanation. It is rare that the historical parks which generally former daimyo gardens are shown later, and is used as a kind of an urban park width of the path where was particularly posted in a strolling garden in that is fixed, and width waits straight for even a line and waits, and, for this, there is. As a result, it is a path and the situation that are hard to be distinguished of a plaza. Although there are a difference of design and a difference of pavement materials in modem landscape space when We watch road surface constitution of the path that We did that will let you wait, in gross We are uniform, and it is it with a result to be poor in change nature. From such an observation, this consideration compared traditional landscape space and modem landscape space with path width about two points of road surface constitution through the trial that a graph analyzed the actual place data which measured into and lectured on an ideal method of a park path from this.

• Communications of the Korean Mathematical Society
• /
• v.12 no.3
• /
• pp.513-519
• /
• 1997

We show that each orthomodular lattice containing only atomic nonpath-connected blocks is a full subalgebra of an irreducible path-connected orthomodular lattice and there is a path-connected orthomodualr lattice L containing a weakly path-connected full subalgebra C(x) for some element x in L.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.99-105
• /
• 2010

Because in the amusement park, a number of people use various vehicles facilities complicated arraigned, it needs an effective way to search optimal path to reduce errors in touring a park. Particularly, when choosing a facility, searching a waiting time-based path as well as shortest path is important. This paper presents a path recommendation system which minimizes total park tour time based on tour distance and waiting time through GPS and wireless internet. This system can also recommend customized tour path based on the characteristics of user members as well as a simple shortest path.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.10a
• /
• pp.221-222
• /
• 2009

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.782-791
• /
• 2005

In this paper, path planning and tracking problems are mentioned to guarantee efficient and safe navigation of autonomous mobile robots. We focus on the path planning and also deal with the path tracking and obstacle avoidance. We improved the conventional distance transform (DT) algorithm for the path planning. Using the improved DT algorithm, we obtain paths with shorter distances compared to the conventional DT algorithm. In the stage of the Path tracking, we employ the fuzzy logic controller to conduct the path tracking behavior and obstacle avoidance behavior. Through computer simulation studies, we show the effectiveness of the Nosed navigational algorithm for autonomous mobile robots.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.295-299
• /
• 2005

In this paper, path planning and tracking problems are mentioned to guarantee efficient and safe navigation of autonomous mobile robots. We focus on the path planning and also deal with the path tracking and obstacle avoidance. We improved the conventional distance transform (DT) algorithm for the path planning. Using the improved DT algorithm, we obtain paths with shorter distances compared to the conventional DT algorithm. In the stage of the path tracking, we employ the fuzzy logic controller to conduct the path tracking behavior and obstacle avoidance behavior. Through computer simulation studies, we show the effectiveness of the proposed navigational algorithm for autonomous mobile robots.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.120.3-120
• /
• 2001

We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.128-133
• /
• 2001

For the Z-level machining, a tool-path linking procedure is presented. The linking problem is approached from the technological requirements, such as considering the machining constraints among the tool-path-elements, minimizing the tool-path length and reflecting the oneway/zigzag linking option. To simplify the linking problem, we develop a data structure, called a TPE-net, providing information on the machining constraints among the tool-path-elements. By making use of the TPE-net, the tool-path linking problem becomes a touring problem so that every node has been traversed.

• Communications of the Korean Mathematical Society
• /
• v.14 no.1
• /
• pp.31-37
• /
• 1999

We prove the following: every chain-finite OML is path-connected; every finite block of an OML L is path-connected with at least one other block in L; every OML with unifromly finite sites is path-connected.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2342-2344
• /
• 1998

In this paper, the path planner is presented for a robot to achieve an efficient path forward the given goal position in two dimensional environment which is involved with partially unknown obstacles. The path planner consists of three major components: off-line path planning, on-line path planning, and modification of planned path. Off-line path planning is based on known environment and creates the shortest path. On-line path planning is for finding unknown obstacles. The modification can be accomplished, by genetic algorithm, to be smooth path for preventing slippage and excessive centrifugal force.