• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.36.6-36
• /
• 2001

The problem of robot navigation and control is a complex task. Its complexity and characteristics depends on the characteristics of the environment robot inhabits, robot construction (mechanical abilities to move, sense) and the job the robot is supposed to do. In this paper we propose a hybrid programming approach to mobile robot navigation and control in an indoor environment. In our approach we used declarative, procedural, and object oriented programming paradigms and we utilized some advantages of our distributed computing architecture. The programming languages corresponding to the paradigms we used were C, C++ and Prolog. In the paper we present some details of our mobile robot hardware and software structure, focusing on the software design and implementation.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.37.2-37
• /
• 2001

This paper addresses the robust adaptive output feedback tracking for nonlinear systems under disturbances whose bounds are unknown. A new algorithm is proposed for estimation of unknown bounds and adaptive control of the uncertain nonlinear systems. The State estimation is solved using K-filters, together with the construction of a bound of an error in the state estimation due to the perturbation of the disturbance. Tuning functions are used to estimate unknown system parameters without overparametrization. The proposed control algorithm ensures that the out put tracking error converges to a residual set which can be arbitrarily small, while maintaining the boundedness of all other variables. A simulation shows the effectiveness of the proposed approach

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.882-885
• /
• 1987

The path of an industrial manipulator in a crowded workspace generally consists of 8 set of Cartesian straight line path connecting a set of two adjacent points. To achieve the Cartesian straight line path is, however, a nontrivial task and an alternative approach is to place enough intermediate points along a desired path and linearly interpolate between these points in the joint space. A method is developed that determines the subtravelling- and the transition-time such that the total travelling time for this path is minimized subject to the maximum joint velocities and accelerations constraint. The method is based on the application of nonlinear programming technique, i.e., FTM (Flexible Tolerance Method). These results are simulated on a digital computer using a six-joint revolute manipulator to show their applications.

• 제어로봇시스템학회논문지
• /
• 제16권9호
• /
• pp.827-832
• /
• 2010

Many researchers have tried to detect the falling and to reduce the injury associated with falling. Normally the method of detection of a loss of balance is more efficient than that of a compensatory motion in order to predict the falling. The detection algorithm of the loss of balance was composed of three main parts: parts of processing of measured data, construction of an internal model and detection of the loss of balance. The internal model represented a simple dynamic motion balancing with two rear legs of a four-legged chair and was a simplified model of a central nervous system of a person. The internal model was defined by the experimental data obtained within a fixed time interval, and was applied to the detecting algorithm to the end of the experiment without being changed. The balancing motion controlled by the human brain was improved in process of time because of the experience accruing to the brain from controlling sensory organs. In this study a reconstruction method of the internal model was used in order to improve the success rate and the detecting time of the algorithm and was changed with time the same as the brain did. When using the reconstruction method, the success rate and the detecting time were 95 % and 0.729 sec, respectively and those results were improved by about 7.6 % and 0.25 sec in comparison to the results of the paper of Ahmed and Ashton-Miller. The results showed that the proposed reconstruction method of the internal model was efficient to improve the detecting performance of the algorithm.

• 한국농업기계학회:학술대회논문집
• /
• 한국농업기계학회 2000년도 THE THIRD INTERNATIONAL CONFERENCE ON AGRICULTURAL MACHINERY ENGINEERING. V.II
• /
• pp.318-324
• /
• 2000

Ultrasonic and magnetic resonance imaging systems are used to visualize the interior states of biological objects. These nondestructive methods have many advantages but too much expensive. And they do not give exact color information and may miss some details. If it is allowed to destruct some biological objects to get the interior and exterior information, constructing 3D image from the series of the sliced sectional images gives more useful information with relatively low cost. In this paper, PC based automatic 3D model generator was developed. The system was composed of three modules. One is the object handling and image acquisition module, which feeds and slices objects sequentially and maintains the paraffin cool to be in solid state and captures the sectional image consecutively. The second is the system control and interface module, which controls actuators for feeding, slicing, and image capturing. And the last is the image processing and visualization module, which processes a series of acquired sectional images and generates 3D graphic model. The handling module was composed of the gripper, which grasps and feeds the object and the cutting device, which cuts the object by moving cutting edge forward and backward. Sliced sectional images were acquired and saved in the form of bitmap file. The 3D model was generated to obtain the volumetric information using these 2D sectional image files after being segmented from the background paraffin. Once 3-D model was constructed on the computer, user could manipulate it with various transformation methods such as translation, rotation, scaling including arbitrary sectional view.

• 제어로봇시스템학회논문지
• /
• 제11권10호
• /
• pp.851-856
• /
• 2005

The DNA and protein data of diverse species have been daily discovered and deposited in the public archives according to each established format. Database systems in the public archives provide not only an easy-to-use, flexible interface to the public, but also in silico analysis tools of unidentified sequence data. Of such in silico analysis tools, multiple sequence alignment [1] methods relying on pairwise alignment and Smith-Waterman algorithm [2] enable us to identify unknown DNA, protein sequences or phylogenetic relation among several species. However, in the existing multiple alignment method as the number of sequences increases, the runtime increases exponentially. In order to remedy this problem, we adopted a parallel processing suffix tree algorithm that is able to search for common subsequences at one time without pairwise alignment. Also, the cross-matching subsequences triggering inexact-matching among the searched common subsequences might be produced. So, the cross-matching masking process was suggested in this paper. To identify the function of the clusters generated by suffix tree clustering, BLAST was combined with a clustering tool. Our clustering and annotating tool is summarized as the following steps: (1) construction of suffix tree; (2) masking of cross-matching pairs; (3) clustering of gene sequences and (4) annotating gene clusters by BLAST search. The system was successfully evaluated with 22 gene sequences in the pyrubate pathway of bacteria, clustering 7 clusters and finding out representative common subsequences of each cluster

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제10권1호
• /
• pp.95-102
• /
• 2018

This paper proposes a dual lifting and its cooperative control system with two different kinds of floating cranes. The Mega-erection and Giga-erection in the ship building are used to handle heavier and wider blocks and modules as ships and off-shore platforms are enlarged. However, there is no equipment to handle such Tera-blocks. In order to overcome the limit on performance of existing floating cranes, the dual lifting is proposed in this research. In the dual lifting, two floating cranes are well-coordinated to add up the lift capabilities of both cranes without any loss such that virtually a single crane is lifting, maneuvering and unloading. Two main constraints for the dual lifting are as follows: First, two barges of floating cranes should be constrained as a rigid body not to cause a relative motion between two barges and main hooks of the two cranes should be controlled as main hooks of a single crane. In order words, it is necessary to develop the cooperative control of two floating cranes in order to sustain a center of gravity of the module and minimize the tilting angle during the lifting and unloading by the two floating cranes. Two floating cranes are handled as a master-slave system. The master crane is able to gather information about all working conditions and make a decision to control the individual hook speed, which communicates the slave crane by TCP/IP. The developed control system has been embedded in the real floating crane systems and the dual lifting has been demonstrated five times at SHI shipyard in 2015. The moving angles of the lifting module are analyzed and verified to be suitable for hoisting control. It is verified that the dual lifting can be applied for many heavier and wider blocks and modules to shorten the construction time of ships and off-shore platforms.

• 한국건축시공학회지
• /
• 제22권6호
• /
• pp.689-700
• /
• 2022

건축물 골조공사에서 먹매김 작업은 건축물 구조부재 요소를 정확한 위치에 시공하기 위해 높은 정밀도가 요구되나, 현재 인력에 의해서 진행되어 작업자의 숙련도에 따라 먹 위치 정확도 및 정밀도가 저하되고, 정보손실 및 오류 발생에 따른 생산성 저하 문제점을 갖는다. 이를 해결하기 위해 전반적인 먹매김 공정의 자동화 및 정보화 기술 도입이 요구되며, 건설로봇을 활용한 먹매김 자동화는 효과적인 수단이 될 수 있다. 이에 본 연구에서는 건축물 골조공사의 먹매김 시공자동화 로봇의 프로토타입을 개발하고 기초성능을 평가하였다. 개발된 로봇은 크게 주행부, 마킹부, 센싱부, 제어부로 구성되었으며, 골조공사 환경을 고려하여 다양한 주행방식과 마킹부 이동 및 회전이 가능하도록 설계되었다. 주행 및 마킹 성능 실험 결과, 주행거리 오차 및 마킹 품질측면에서는 만족할 만한 성능을 보였으나, 일부 주행방식과 마킹 정밀도 측면에서의 개선 필요성이 확인되었다. 본 연구결과를 토대로 개발 장비의 지속적인 개선 및 성능 보완, 전체 먹매김 공정의 자동화 시스템 구축을 진행하고자 한다.

• International Journal of Control, Automation, and Systems
• /
• 제3권2호
• /
• pp.183-194
• /
• 2005

In this study, we introduce an advanced architecture of genetically optimized Hybrid Fuzzy Neural Networks (gHFNN) and develop a comprehensive design methodology supporting their construction. A series of numeric experiments is included to illustrate the performance of the networks. The construction of gHFNN exploits fundamental technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms (GAs). The architecture of the gHFNNs results from a synergistic usage of the genetic optimization-driven hybrid system generated by combining Fuzzy Neural Networks (FNN) with Polynomial Neural Networks (PNN). In this tandem, a FNN supports the formation of the premise part of the rule-based structure of the gHFNN. The consequence part of the gHFNN is designed using PNNs. We distinguish between two types of the linear fuzzy inference rule-based FNN structures showing how this taxonomy depends upon the type of a fuzzy partition of input variables. As to the consequence part of the gHFNN, the development of the PNN dwells on two general optimization mechanisms: the structural optimization is realized via GAs whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the gHFNN, the models are experimented with a representative numerical example. A comparative analysis demonstrates that the proposed gHFNN come with higher accuracy as well as superb predictive capabilities when comparing with other neurofuzzy models.

• International Journal of Control, Automation, and Systems
• /
• 제6권6호
• /
• pp.809-817
• /
• 2008

Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.