• Title/Summary/Keyword: Objective distance

Search Result 1,047, Processing Time 0.028 seconds

Obstacle-Free Optimal Motions of a Manipulator Arm Using Penetration Growth Distance (침투성장거리를 이용한 로봇팔의 장애물회피 최적운동)

  • Park, Jong-Keun
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.18 no.10
    • /
    • pp.116-126
    • /
    • 2001
  • This paper suggests a numerical method to find optimal geometric path and minimum-time motion for a spatial 6-link manipulator arm (PUMA 560 type). To find a minimum-time motion, the optimal geometric paths minimizing 2 different dynamic performance indices are searched first, and the minimum-time motions are searched on these optimal paths. In the algorithm to find optimal geometric paths, the objective functions (performance indices) are selected to minimize joint velocities, actuator forces or the combinations of them as well as to avoid one static obstacle. In the minimum-time algorithm the traveling time is expressed by the power series including 21 terms. The coefficients of the series are obtained using nonlinear programming to minimize the total traveling time subject to the constraints of velocity-dependent actuator forces.

  • PDF

Computer Vision System for Automatic Grading of Ginseng - Development of Image Processing Algorithms - (인삼선별의 자동화를 위한 컴퓨터 시각장치 - 등급 자동판정을 위한 영상처리 알고리즘 개발 -)

  • 김철수;이중용
    • Journal of Biosystems Engineering
    • /
    • v.22 no.2
    • /
    • pp.227-236
    • /
    • 1997
  • Manual grading and sorting of red-ginsengs are inherently unreliable due to its subjective nature. A computerized technique based on optical and geometrical characteristics was studied for the objective quality evalution. Spectral reflectance of three categories of red-ginsengs - "Chunsam", "Chisam", "Yangsam" - were measured and analyzed. Variation of reflectance among parts of a single ginseng was more significant than variation among the quality categories of ginsengs. A PC-based image processing algorithm was developed to extract geometrical features such as length and thickness of body, length and number of roots, position of head and branch point, etc. The algorithm consisted of image segmentation, calculation of Euclidean distance, skeletonization and feature extraction. Performance of the algorithm was evaluated using sample ginseng images and found to be mostly sussessful.

  • PDF

An Improved Clustering Method with Cluster Density Independence

  • Yoo, Byeong-Hyeon;Kim, Wan-Woo;Heo, Gyeongyong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.15-20
    • /
    • 2015
  • In this paper, we propose a modified fuzzy clustering algorithm which can overcome the center deviation due to the Euclidean distance commonly used in fuzzy clustering. Among fuzzy clustering methods, Fuzzy C-Means (FCM) is the most well-known clustering algorithm and has been widely applied to various problems successfully. In FCM, however, cluster centers tend leaning to high density clusters because the Euclidean distance measure forces high density cluster to make more contribution to clustering result. Proposed is an enhanced algorithm which modifies the objective function of FCM by adding a center-scattering term to make centers not to be close due to the cluster density. The proposed method converges more to real centers with small number of iterations compared to FCM. All the strengths can be verified with experimental results.

The Storage Method of a Leaf Tobacco Warehouse in Leaf Tobacco Factory (원료공장 잎담배 창고의 저장방법)

  • Han-Joo Chung;Byong-Kwon Jeh;Yong-Ok Kim
    • Journal of the Korean Society of Tobacco Science
    • /
    • v.25 no.1
    • /
    • pp.53-58
    • /
    • 2003
  • This study deals with the leaf tobacco assignment problem of a leaf tobacco warehouse with multiple input points and single output point. Also, the number of storage frequences is not necessary the same as that of retrieval for each leaf tobacco. A mathematical model is developed with the objective of minimizing the total travel distance associated with storage and retrieval operations. We also develop several heuristics based on the retrieval order frequency, retrieval/storage frequency ratio of leaf tobacco, and ABC curve. It is observed that the ABC curve based heuristic gives the best solution which is near optimal. Based on the test results from real world data, the ABC curve based heuristic is found to give a best performance. Comparing to current assignment method, the ABC curve based heuristic reduced total travel distance about 17.2%.

A Study on Hand Speed Constant to Calculate Safe Distance of Press Protective Device (프레스 방호장치 안전거리 산정을 위한 손속도상수)

  • Lee, Keun-Oh;Kim, Jong-Hyun
    • Journal of the Korean Society of Safety
    • /
    • v.25 no.6
    • /
    • pp.40-46
    • /
    • 2010
  • To protect press operator from the after-reach hazard, current Ministry of Labor Notification(MOLN) requires the use of a formula for calculating the safe distance away from the point of operation for locating press protective devices, Two Hand Control Devices(THCD) and Active Opto-Electronic Protective Devices(AOPD), on a power press. This formula is based on a same hand speed constant of 160cm/s. While EN standards use different hand speed constant for THCD and AOPD respectively. The objective of this study is to compare two guidelines on the hand speed constant published by MOLN and EN 692, also to propose a proper hand speed constant and validate it experimentally. As a experimental result, it could be known that hand speed constant of Ministry of Labor Notification should be improved as that of EN standards.

Game-Scheduling by Mathematical Programming and Expert System (수리계획법과 전문가 시스템을 이용한 경기 일정 작성)

  • Jo, Hyeon-Bo;Park, Sun-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.2
    • /
    • pp.53-61
    • /
    • 1988
  • Games such as baseball, soccer are scheduled by a given game type such as tournament, league or their mixed form. The objective of this paper is to find an efficient game-scheduling method with respect to traveling distance, break-time and other conditions. In this paper we first present two models which minimize traveling distance. The first model that a match is played once each other is solved by a heuristic method. In the second model that a match is played more than once, teams are paired by a modified 0 - 1 programming, and the pairs are rearranged in order to generate a number of workable schedules. Then Expert Systems is applied to solve breake-time and other conditions. In order to represent expertise's knowledge effectively, we present a new design of knowledge-base and data-base, inference engine including many rules and meta-rules which controls the global system. In knowledge-base, binary relation among various attributes is used to ease not only knowledge acquisition but also system execution.

  • PDF

A Robust and Computationally Efficient Optimal Design Algorithm of Electromagnetic Devices Using Adaptive Response Surface Method

  • Zhang, Yanli;Yoon, Hee-Sung;Shin, Pan-Seok;Koh, Chang-Seop
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.2
    • /
    • pp.207-212
    • /
    • 2008
  • This paper presents a robust and computationally efficient optimal design algorithm for electromagnetic devices by combining an adaptive response surface approximation of the objective function and($1+{\lambda}$) evolution strategy. In the adaptive response surface approximation, the design space is successively reduced with the iteration, and Pareto-optimal sampling points are generated by using Latin hypercube design with the Max Distance and Min Distance criteria. The proposed algorithm is applied to an analytic example and TEAM problem 22, and its robustness and computational efficiency are investigated.

Safety Performance Models of Improvement Projects of Frequent Traffic Accident Locations (사고잦은곳 개선사업의 안전성과 모형)

  • Park, Byung-Ho;Park, Gil-Su;Kim, Tae-Young
    • Journal of the Korean Society of Safety
    • /
    • v.25 no.2
    • /
    • pp.89-94
    • /
    • 2010
  • This study deals with the traffic accident according to the improvement projects of frequent accident locations. The objective is to analyze the impact of improvements on the accident reduction. In pursuing the above, the study gives the particular attentions to developing the models based on the data of 70 intersections improved. The main results analyzed are as follows. First, 4 multiple linear regression accident models(total, side right-angle, rear end and side stripe accident) which were statistically significant were developed. Second, total accidents reduction by sight-distance and turning traffic flow improvements, side right-angle by sight-distance, over-speed and lane operation, rear end by turning traffic flow, signal and lane operation, and side stripe by traffic impedance improvements were analyzed. Finally, the above 4 models were evaluated to be statically significant through the correlation analysis and pair-sample t-test.

A Heterogeneous VRP to Minimize the Transportation Costs Using Genetic Algorithm (유전자 알고리듬을 이용한 운행비용 최소화 다용량 차량경로문제)

  • Ym, Mu-Kyun;Jeon, Geon-Wook
    • IE interfaces
    • /
    • v.20 no.2
    • /
    • pp.103-111
    • /
    • 2007
  • A heterogeneous VRP which considers various capacities, fixed and variable costs was suggested in this study. The transportation cost for vehicle is composed of its fixed and variable costs incurred proportionately to the travel distance. The main objective is to minimize the total sum of transportation costs. A mathematical programming model was suggested for this purpose and it gives an optimal solution by using OPL-STUDIO (ILOG CPLEX). A genetic algorithm which considers improvement of an initial solution, new fitness function with weighted cost and distance rates, and flexible mutation rate for escaping local solution was also suggested. The suggested algorithm was compared with the results of a tabu search and sweeping method by Taillard and Lee, respectively. The suggested algorithm gives better solutions rather than existing algorithms.

A Case Report of Ptosis After Midbrain Infarction (중뇌 경색으로 인한 안검하수 치험 1례)

  • Kim Min-ji;Hong Seung-ug
    • The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
    • /
    • v.17 no.2
    • /
    • pp.165-169
    • /
    • 2004
  • Objective: The purpose of this case study is to show a case of severe neurogenic ptosis due to midbrain infarction improved by acupuncture and Herb-med. Method: This case study has been carried out for a case of ptosis due to midbrain infarction which had been hospitalized at the Bundang CHA Oriental Medical Hospital. We evaluate through Levator function test and measurement of MRD and the distance between upper and lower eyelid. Results: Levator function increase 3.5mm and distance between upper and lower eyelid increase 4mm more than before. The degree of ptosis turned 'fair' state from 'poor' state. Conclusions: We suggest to treat ptosis due to midbrain infarction with acupuncture and Herb-med meaning conservative therapy and would like to research oriental medical treatment plan for the further treatment.

  • PDF