• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.965-968
• /
• 2004

This paper describes the development of the test path for Eclipse-II, a parallel mechanism motion simulator. Eclipse-II which can be used as a base for general motion simulators, enables unlimited continuous 360-degree spinning in any rotational axes plus finite X, Y, and Z translation motions. The advantage of enabling continuous 360-degree spinning allows various motions for virtual reality. In this paper, the development of the test path to verify the robustness of the Eclipse-II motion simulator is described. The test motions, which satisfy the requirements of test path, are suggested and washout filter enables these motions reproduced in the limited workspace. The trial run is conducted to verify the robustness of the Eclipse-II motion simulator. Additionally the standard data format of virtual reality for Eclipse-II One Man Ride is suggested.

• Management Science and Financial Engineering
• /
• 제11권2호
• /
• pp.85-103
• /
• 2005

In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

• 한국농공학회논문집
• /
• 제49권6호
• /
• pp.37-46
• /
• 2007

In designing the structure, the stress path is the basic data. But the stress path is not standardized to analysis the structure. So the one-dimensional frame element structure model with the triangle irregular network is used to solve the problem. And the refined evolutionary structural optimization(RESO) used in structural topology optimization is applied to this study. Through this process, the search method of the stress path is advanced and the burden of the calculation. is reduced.

• 한국통신학회논문지
• /
• 제24권9A호
• /
• pp.1306-1313
• /
• 1999

본 논문은 CDMA PCS 이동통신 시스템의 망 설계를 위하여 거리에 따른 신호 감쇄 현상 분석 모델(변형된 Hata path loss model) 및 통계적 신호 강도 분포 모델(Log-Normal 분포)을 제시한다. 제시된 모델에 대구 산적동 및 수성동 지역의 측정 데이터를 적용하여 이들 지역에서 신호 강도의 세기가 임계치를 초과하는 지역의 백분율을 산출하여 망 설계의 기본 자료로 활용할 수 있도록 하였다.

• 제어로봇시스템학회논문지
• /
• 제18권5호
• /
• pp.413-418
• /
• 2012

This paper presents a multi-robot path planner for environment exploration and monitoring. Robotics systems are being widely used as data measurement tools, especially in dangerous environment. For large scale environment monitoring, multiple robots are required in order to save time. The path planner should not only consider the collision avoidance but efficient coordination of robots for optimal measurements. Nonlinear spring force based planning algorithm is integrated with the spatial gradient following path planner. Perturbation/Correlation based estimation of spatial gradient is applied. An algorithm of tuning the stiffness for robot coordination is presented. The performance of the proposed algorithm is discussed with simulation results.

• Journal of Mechanical Science and Technology
• /
• 제15권2호
• /
• pp.210-216
• /
• 2001

This paper presents an analytical study that can predict the path-dependent forming limit of anisotropic sheet materials that experience various combinations of strain paths. To predict the forming limit diagrams(FLD), the proposed analytical procedure is performed within the framework of the Marciniak and Kuczynski(M-K) approach by using the Barlat and Lians non-quadratic anisotropic yield criterion and introducing the effect of the existence of a strain gradient over a stretching punch. The predicted path-dependent forming limit of an anisotropic sheet has been compared with the published experimental results. It has been found that the predicted path-dependent forming limits are in good agreement with the experimental data.

• 한국컴퓨터정보학회논문지
• /
• 제22권12호
• /
• pp.95-100
• /
• 2017

In this paper, we propose a zone based ad hoc network construction scheme which support ad hoc path between nodes in local IoT networks consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Recently, the various routing protocols have been studied to support ad hoc networking of local IoT environments. This is, because basis RPL protocol is deigned to be used for the connecting service with Internet through gateway, ad hoc path between nodes in local IoT networks is not supported in basis RPL protocol. Thus, in this paper, the proposed routing scheme provides both ad hoc path and Infra path through gateway, supporting basis RPL protocol simultaneously. Through simulation, we show that the proposed routing scheme with zone based path selection scheme improves the performance of the success rate of end-to-end data transmission and the end-to-end delay, compared to basis RPL protocol.

• 한국IT서비스학회지
• /
• 제7권3호
• /
• pp.145-157
• /
• 2008

The existing XML storage methods which use relational data model, usually store path information for every node type including literal contents in order to keep the structural information of XML documents. Such path information is usually maintained by an inverted index to efficiently process XPath queries for large XML documents. In this study, We propose an improved approach that retrieve information from the large volume of XML documents stored in a relational database, while using a segment-based inverted index for path searches. Our new approach can reduce the number of searching an inverted index for getting target path information. We show the effectiveness of this approach through several experiments that compare XPath query performance with the existing methods.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2007년도 정기 학술대회 논문집
• /
• pp.78-83
• /
• 2007

The paper focuses on the establishment of optimized bucket path planning and trajectory control designated for force-reflecting backhoe reacting to excavation environment, such as potential obstacles and ground characteristics. The developed path planning method can be used for precise bucket control, and more importantly for obstacle avoidance which is directly related to safety issues. The platform of this research was based on conventional papers regarding the kinematic model of excavator. Jacobian matrix was constructed to find optimal joint angles and rotation angles of bucket from position and orientation data of excavator. By applying Newton-Raphson method optimal joint angles and bucket orientation were derived simultaneously in the way of minimizing positional errors of excavator. The model presented in this paper was intended to function as a cornerstone to build complete and advanced path planning of excavator by implementing soil mechanics and further study of excavator dynamics together.

• 디지털산업정보학회논문지
• /
• 제7권4호
• /
• pp.31-37
• /
• 2011

Recently, MANET(Mobile Ad-hoc Network) is developing increasingly in the wireless network. MANET has weakness because phases change frequently and MANET doesn't have middle management system. Every node which consists of MANET has to perform data forwarding, but traceback is not reliable if these nodes do malicious action owing to attack. It also is not easy to find location of attacker when it is attacked as moving of nodes. In this paper, we propose a hierarchical-based traceback method that reduce waste of memory and can manage path information efficiently. In order to manage trace path information and reduce using resource in the cluster head after network is formed to cluster, method which recomposes the path efficiently is proposed. Proposed method in this paper can reduce path trace failure rate remarkably due to moving of nodes. It can also reduce the cost for traceback and time it takes to collect information.