• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.5
• /
• pp.327-333
• /
• 2011

Intelligent robots are widely needed in various areas of industry from extremely dangerous environments to service tasks. For autonomous mobile robots, it is significant to move itself safely to a destination point, recognizing its surroundings. Advances in sensor technology and its applications are achieved in order to develop an intelligent robot. In this paper, a mobile robot with a path-finding algorithm is presented. The path-finding algorithm is the one that does not only find a path to designated destination and also recognizes obstacles on the way, calculating its distance. 10 ultrasonic sensor are mounted on the front and rear of the mobile robot to figure out its position. Specular reflection and wide viewing angle, which are inherent characteristics of ultrasonic waves, cause errors in measuring distance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.206-209
• /
• 2016

High end commercial communication system, such as contemporary mobile technology (CDMA, LTE, Wi-FI, etc.) and extension of frequency band, may affect the performance of the shipborne electronic support measurement system in modern battle field. In this paper, we suggest a way to improve the performance of electronic warfare system based on direction finding algorithm simulation after discussing the limits of traditional system.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1333-1341
• /
• 2009

Tactical path-finding in computer games is path-finding where a path is selected by considering not only basic elements such as the shortest distance or the minimum time spend but also tactical information of surroundings when deciding character's moving trajectory. One way to include tactical information in path-finding is to represent a heuristic function as a sum of tactical quality multiplied by a weighting factor which is.. determined based on the degree of its importance. The choice of weighting factors for tactics is very important because it controls search performance and the characteristic of paths found. In this paper. we propose a method for improving a heuristic function by adjusting weights based on the difference between paths on examples given by a level designer and paths found during the search process based on the CUITent weighting factors. The proposed method includes the search algorithm modified to detect search errors and learn heuristics and the perceptron-like weight updating formular. Through simulations it is demonstrated how different paths found by tactical path-finding are from those by traditional path-finding. We analyze the factors that affect the performance of learning and show the example applied to the real game environments.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.51-67
• /
• 1996

The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2005.05a
• /
• pp.112-113
• /
• 2005

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.2
• /
• pp.92-101
• /
• 2002

The Job Shop Scheduling Problem(JSSP) is concerned with schedule of m different machines and n jobs where each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the large scale job shop scheduling. The proposed heuristic method is based on a Tabu Search(TS) and on a Constraint Satisfaction Technique(CST). In this paper, ILOG libraries is used to embody the job shop model, and a CST is developed for this model to generate the increased solution. Then, TS is employed to overcome the increased search time of CST on the increased problem size md to refine the next-current solution. Also, this paper presents the new way of finding neighbourhood solution using TS. On applying TS, a new way of finding neighbourhood solution is presented. Computational experiments on well known sets of MT and LA problem instances show that, in several cases, our approach yields better results than the other heuristic procedures discussed In literature.

• Journal of Korean Academy of Nursing
• /
• v.27 no.4
• /
• pp.727-739
• /
• 1997

The purpose of this study was to present an effective nursing intervention for helping the patients of mental illness by determining the effect of nursing-logotherapy on purpose in life and finding meaning, and hope of the patients of mental illness by developing and applicating program of nursing-logotherapy The data was collected from March to September in 1995, and its subjects were the patients of mental illness who was appropriate to the standard of this study among the patients of mental illness who hospitalized into Neuro-Psychiatric ward of M. and B. hospital located in Pusan area. They were all 60 subjects, thirty of them for an experimental group and the rest for a control group. The research design was an equivalent control group pre-test and post-test design as an quasi-experimental research and the conceptual frame- work was an interpersonal model. The data analysis was computerized by using SP-SS/PC$^{+}$ and hypothesis testing was done with 2-way ANCOVA and simple correlation. Results were summarized as follows : 1. There were significant changes of purpose in life and finding meaning in an experimental group be-fore and after treatment and a control group be-fore and after. 2. There were significant changes of hope in an experimental group before and after treatment and a control group before and after. 3. The positive correlation between purpose in life and finding meaning and hope of the patients of mental illness were observed. Consequently, nursing-logotherapy could significantly increase the purpose in life and finding mean-ing, and of hope, so it could be said an effective nursing intervention for helping the healing of the patients of mental illness.s.

• Journal of the Korean School Mathematics Society
• /
• v.15 no.1
• /
• pp.155-169
• /
• 2012

In this paper, we explored the possibility that JiSuYongYukDo and JiSuGuiMunDo which were posed by Suk-Jung Choi can be used for storytelling. Firstly, from the solutions of JiSuYongYukDo and JiSuGuiMunDo which were offered by Suk-Jung Choi, students can inquire out finding four characteristics such as: He chose expected values as magic numbers, used pairs of two complementary numbers, there are independent four pairs of numbers which do not affect other pairs, and the array which exchange every two complementary numbers in certain solution is also solution. Secondly, in case of JiSuYongYukDo students can inquire out finding six numbers that satisfy certain condition instead of finding solutions, and in case of JiSuGuiMunDo students can inquire out finding eleven numbers that satisfy certain conditions instead of finding solutions. And through this strategy, they know that Suk-Jung Choi style solutions can be obtained variously in one's own way without undergoing many trials and errors.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.91-98
• /
• 2010

Conventional path-finding has focused on finding short collision-free paths. However, as computer games become more sophisticated, it is required to take tactical information like ambush points or lines of enemy sight into account. One way to make this information have an effect on path-finding is to represent a heuristic function of a search algorithm as a weighted sum of tactics. In this paper we consider the problem of learning heuristic to optimize path-finding based on given tactical information. What is meant by learning is to produce a good weight vector for a heuristic function. Training examples for learning are given by a game level-designer and will be compared with search results in every search level to update weights. This paper proposes a learning algorithm integrated with search for tactical path-finding. The perceptron-like method for updating weights is described and a simulation tool for implementing these is presented. A level-designer can mark desired paths according to characters' properties in the heuristic learning tool and then it uses them as training examples to learn weights and shows traces of paths changing along with weight learning.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.17 no.3
• /
• pp.43-51
• /
• 2011

The mobility and accessibility enhancement is gradually becoming a global interest due to the growth in the aging population and concerns about people with disabilities. The main purpose of this study is to know the current situation in barrier-free level in railroad facilities in order to allow the mobility handicapped to travel in a safe and convenient manner. The research has started with investigating current situation for the mobility handicapped people and explores the needs of barrier-free facilities. 84 domestic railroad facilities were evaluated based on assessment tool developed from the mobility handicapped act. As a result, the fact that the mobility handicapped experienced limited accessibility due to various types of obstacles in the facilities was discovered. Based on the evaluation, obstacles in the facilities were analyzed and categorized by specific dimensions, users' accessibility, mobility, usability, and clarity (way-finding). This study suggests barrier-free design for passenger facilities focused on train station. Because mobility and accessibility are emphasized in current society, improvement of the mobility handicapped' movement should be considered. Barrier-free design for passenger facilities should be realized throughout comprehending the reasons why these obstacles occur in the facilities not using installation convenience facilities. This study has meaning in finding out the obstacles in each cause of occurrence(accessibility, mobility, usability, and clarity (way-finding)).