Optimum Synthesis of Mechanisms For Path Generation Using a New Curvature Based Deflection Based Objective Function

Similar documents
NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

An Optimization Approach for Path Synthesis of Four-bar Grashof Mechanisms

Step-3 New Harmony vector, improvised based on the following three mechanisms: (1) random selection, (2) memory consideration, and (3)

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Cluster Analysis of Electrical Behavior

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Optimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

An Optimal Algorithm for Prufer Codes *

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm

S1 Note. Basis functions.

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Hermite Splines in Lie Groups as Products of Geodesics

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Mathematics 256 a course in differential equations for engineering students

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

Inverse kinematic Modeling of 3RRR Parallel Robot

The Codesign Challenge

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Kinematics of pantograph masts

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Design for Reliability: Case Studies in Manufacturing Process Synthesis

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

WORKSPACE OPTIMIZATION OF ORIENTATIONAL 3-LEGGED UPS PARALLEL PLATFORMS

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Structural Optimization Using OPTIMIZER Program

Active Contours/Snakes

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

3D vector computer graphics

Image Alignment CSC 767

Intra-Parametric Analysis of a Fuzzy MOLP

Solving two-person zero-sum game by Matlab

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

High-Boost Mesh Filtering for 3-D Shape Enhancement

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

Virtual Machine Migration based on Trust Measurement of Computer Node

Meta-heuristics for Multidimensional Knapsack Problems

The Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

Calibration of an Articulated Camera System

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Invariant Shape Object Recognition Using B-Spline, Cardinal Spline, and Genetic Algorithm

Design and Implementation of Trainable Robotic Arm

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

XV International PhD Workshop OWD 2013, October Machine Learning for the Efficient Control of a Multi-Wheeled Mobile Robot

Classification / Regression Support Vector Machines

Smoothing Spline ANOVA for variable screening

A Facet Generation Procedure. for solving 0/1 integer programs

Calibration of an Articulated Camera System

Multi-objective Design Optimization of MCM Placement

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A Binarization Algorithm specialized on Document Images and Photos

ON THE DESIGN OF LARGE SCALE REDUNDANT PARALLEL MANIPULATOR. Wu huapeng, Heikki handroos and Juha kilkki

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Tuning of Fuzzy Inference Systems Through Unconstrained Optimization Techniques

INVERSE DYNAMICS ANALYSIS AND SIMULATION OF A CLASS OF UNDER- CONSTRAINED CABLE-DRIVEN PARALLEL SYSTEM

DESIGN OF A HAPTIC DEVICE FOR EXCAVATOR EQUIPPED WITH CRUSHER

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study

A new paradigm of fuzzy control point in space curve

Multiobjective fuzzy optimization method

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Polyhedral Compilation Foundations

Development of a CNC interpolation scheme for CNC controller based on Runge-Kutta method. Abdullahil Azeem*, Syed Mithun Ali and Sanjoy Kumar Paul

Support Vector Machines

Boundary Condition Simulation for Structural Local Refined Modeling Using Genetic Algorithm

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

Cooperative UAV Trajectory Planning with Multiple Dynamic Targets

An efficient method to build panoramic image mosaics

Intelligent Dynamic Simulation of Mechanisms

Adaptive Virtual Support Vector Machine for the Reliability Analysis of High-Dimensional Problems

The Research of Support Vector Machine in Agricultural Data Classification

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

Parallel manipulator robots design and simulation

Sensory Redundant Parallel Mobile Mechanism

Computational Issues in the Planning and Kinematics of Binary Robots Abstract 1. Introduction 2. Workspace Analysis and Optimization

Fitting: Deformable contours April 26 th, 2018

Multiobjective Design Optimization of 3-PRR Planar Parallel Manipulators

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Transcription:

Proceedngs of the 6th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Lsbon, Portugal, September -4, 6 67 Optmum Synthess of Mechansms For Path Generaton Usng a ew Curvature Based Deflecton Based Obectve Functon SOHEIL DAMAGI School of Mechancal Engneerng Sharf Unversty of Technology, Tehran IA daamangr@mech.sharf.edu http://mech.sharf.edu/~daamangr GHAZALEH JAFAIJASHEMI TAYLO'S COLLEGE (subang aya) Taylor s College, Kuala Lumpur MALAYSIA ghazaleh.afar@gmal.com www.adp.taylors.edu MOHAMMADHOSSEI MAMDUHI School of Mechancal Engneerng Sharf Unversty of technology, Tehran IA mamduh_m@mech.sharf.r HASSA ZOHOO Fellow, the Academy of Scences of I.. Iran. Member, Center of Excellence n Desgn, obotcs, and Automaton Sharf Unversty of Technology, Tehran IA zohoor@sharf.edu Abstract: - Ths paper proposed a new curvature based path-descrpton method for path-generaton of planar mechansm, n whch the poston vector of a pont on coupler, whch follows most closely a predefned path, s drectly calculated as a functon of coupler moton propertes. In addton ths curvature based method makes t possble to defne an obectve functon ndependent of rotaton and translaton transformatons. Therefore, n ths method, ntal poston, orentaton, and coupler pont vector parameters are not the optmzaton varable. These fve parameters could be calculated as a functon of other desgn parameters and they are found when these optmal values are obtaned. educng fve parameters of the optmal varables leads to a smaller desgn space and so less computaton tme to fnd the optmal result. Applcaton of the method s also shown and ts computaton tme and accuracy are compared wth the result reported n the lterature. It s found that ths method s superor as t converges faster wthout loosng any accuracy. Key-Words: - Mechansm synthess; Optmzaton; Path Generaton; Curvature based obectve functon; Deflecton based obectve functon; Introducton Path generaton s one of the mportant functonal requrements n mechancal engneerng desgn. The use of optmum synthess s nevtable whenever the mechansm needs to follows a number of postons exceedng a certan number, 6 ponts for path generaton of a planar four-bar lnkage. An obectve functon s generally defned as a functon of desgn parameters, whch t s then optmzed to fnd the optmal values of these parameters. For any optmzaton method, the calculaton tme depends on the number of desgn parameters. The lower the number of parameter, the faster s the calculaton.

Proceedngs of the 6th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Lsbon, Portugal, September -4, 6 67 To reduce the calculaton tme, researchers try to reduce the number of the desgn parameters. To do so, they use dfferent mathematcal method to obtan the path characterstcs to measure the goodness of matchng between the desred and generated path. Ther nterest was manly n removng the rotaton, translaton and scale desgn parameters. Ullah et al[7]. used Fourer Descrptors and compare the ampltude of characterstc spectrum of generated and requred path as a measure of ther matchng goodness. In ths method the ponts on the curve need to be sampled n the constant tme ntervals. Yong Lu et al.[] resolved ths pont by employng efned umercal epresentaton. Other researchers have tred dfferent optmzaton methods n the synthess of rgd body mechansms. olle et al.[4] used gradent and least square method; Kunur et al[]. used genetc algorthm; Lu et al[] appled artfcal mmune system; and Smal et al.[] employed tabu-gradent-search to fnd optmum soluton to the mechansm synthess. Ths paper presents a curvature based path descrpton method to defne a new obectve functon whch s ndependent of the vector poston of coupler pont, translaton and rotaton translatons parameters. To the best of the authors knowledge ths s the frst attempt at usng such error functon to be ndependent of vector poston of the coupler pont. Here the basc dea of the method s ntroduced. Two llustratve examples are provded. In the frst example the result s compared wth what s reported by Smal et al.[]. In the second example the valdty of the assumpton s dscussed. Formulaton The man dea of ths artcle s to employ the curvature to defne the path, whch enable us to ntroduce a new error functon wth fewer number of desgn parameters. The curvature of a path s defned as: r r p& && p κ = p& () n p&,&& p are the velocty and acceleraton of the movng pont p tracng the path. When p s a pont on a rgd body ts poston vector, wth respect to the base, s obtaned as a functon of the poston of another pont f on the body, ts poston respect to f and the orentaton of the body (fg.): ( ) p= f t + e () eplacng f as a functon of ρ andα, the velocty and acceleraton vector of p are obtaned as follows: α p= ρe + e α p& = ( & ρ+ & αρ) e + & e ( ) α && p= && ρ+ && αρ+ && αρ & α ρ e + && e & e () ow we defne r = e θ, where θ = α (fg.), and ntroduce p& and p&& nto eq. we have: Fg. Parameters to defne a pont X κ = Y (4) X = r ρ( ρ+ ρ ) + r ( ρ ρ ρ ) snθ ( ρ + ρ+ ( ρ ρ )) + " cosθ Y = r r ( ρ snθ ρ cosθ) + ρ + ρ α&& was also assumed to be zero wthout loosng any generalty. Ths equaton could be wrtten as follows: 6 5 κ B κ B B κ κ 4 ( B B + B B) A ( B + 9BB B) A A ( ) ( ) κ B B B B A A A + + κ B B A A r+ κ B A = (5) A = ρ ρ+ ρ ( ) ( ρ ρ ρ ) snθ ( ρ ρ ( ρ ρ )) A = A + + + = " cosθ B = ρ + ρ B = ( ρ snθ ρ cosθ) B = Supposng that p s the pont on coupler that follows the desred path wth curvature equal toκ at that pont, the above equaton could be employed to obtan r, when the knematcs characterstcs of the

Proceedngs of the 6th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Lsbon, Portugal, September -4, 6 674 Set n=n+ o? Select the dmensons of mechansm Calculate knematcs propertes of coupler Calculate (umercally) F Problem defnton and ts constrans Calculate the curvature of the path Set n= Evaluate n n the neghborhood of n- Select a value for Is n=? Yes? ( ) Imag + = = Aabs( ) resultng r s found as a functon of and α, and therefore s calculated from = re θ. Thus for any value of, a set of values are obtaned. A semanalytcal procedure s used to fnd from the above relatons. At the frst step s found numercally from eq.5 and analytcal method s used to fnd the subsequent values of. For all mechansms that generate path around to the desred one, s weakly vared wthα. If n s the answer α for n, n + s obtaned analytcally as a functon of α n + n the neghborhood of n. For ponts on the desred path, values for are calculated by the above procedure, but must be real and remans constant as the coupler s a rgd body wthout any deformaton. Therefore we defne the error functon as: F = = ( ) ( ) = Imag + Aabs and = = I and A are weghtng factors here. Ths error functon s an ndcaton of the angular and longtudnal deformatons of the coupler and ts mnmum correspond to the best mechansm that generates a path most close to the desred one. Any optmzaton technque could be use to fnd the optmum answer. The calculaton procedure to obtan the desgn varables ncludng s shown n fg.. Meanwhle, numercal experment of ths procedure shows that the mnmum value of error corresponds approxmately to the pont wth maxmum value Fnal soluton Calculate obectve functon o? Stoppng crtera met? Yes? Fg. Flowchart for Curvature base obectve functon solve algorthm = dα+ coupler are known. Lettng, the Fg. Desgn parameter needed to defne a four bar mechansm

Proceedngs of the 6th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Lsbon, Portugal, September -4, 6 675 4 5 6 7 8 9 xd.5.5.5 4.5.5.5 yd.5.5 α 5 87.5 5 4 75 9.5 6.5 8 5 Table Desred traectory ponts of. Thus the value of s calculated such that the mnmum value of error occurs when the value of s maxmum. To smplfy the calculaton, s obtaned by mnmzng the magnary part of at the pont wth maxmum value of, as ths part s domnant at ths condton. Ths value s desgnated. as Examples Method s coded n MATLAB and appled to the optmum synthess of path generatng planar four bar mechansms. Ten desgn parameters generally nvolve descrbng these mechansms as shown n fg.. In the abovementoned procedure only fve parameters, namely L, L, L, L4 and are needed to fnd the soluton. Two examples are ntroduced. In the frst example the result of ths method s compared wth the result of Smal et al[]. In the second one an approxmaton procedure to estmate s studed. In these two examples the weghtng factors I and A put equal to and the Genetc Algorthm appled to fnd the optmum soluton. Example. The planar four bar mechansm that follows prescrbe path n coordnate wth crank rotaton s desgned. The desred ponts are gven n table. The result of ths method s shown n table and fg. 4and compared wth the result of Smal et al[]. 499 teratons are needed to fnd the optmum result that took s run tme on a Pentum IV PC. Smal et al. ntroduce ths example to compare tabu-search and the tabu-gradent algorthms. It was reported that 8 teratons wth 7 s run tme on Pentum IV are needed. Ths ndcates that the method proposed here s faster, ever thought, as reported n [], the tabu-gradent-search clamed to be the fastest optmzaton method n mechansm synthess, and converges much faster than genetc algorthm. Example. In ths example we compare the result of the Table Classc obectve functon TS soluton and curvatre based obectve functon GA soluton Classc O.F. TS C.B. GA L.7.4987 L 4.478 6. L.5976 4.5 L4.76 7.4895 8.547.5876-64.6-5.4 Fg. 4 Desred coupler ponts and coupler curve generated wth and wthout assumng = Fg. 5 Coupler curve generated by Classc obectve functon, TS and Curvature based obectve functon, GA solutons optmal mechansm optmzaton, wth and wthout lettng = dscussed n the prevous secton. Heren the 4-pont path s provded. Consderng as one of the optmzaton parameters the calculaton tme was 5s wth 55 teratons. Meanwhle, the optmzaton needs about 89 teratons and takes s of run tme, by lettng =. Fg.5 compares the results of these optmzatons. Ths example ndcates that assumng = the method could be made much faster but accuracy s slghtly lower. 4 Concluson Ths paper presents an error functon whch could measure the goodness of matchng between the predefned curve and generated curve, as a functon of coupler moton propertes but ndependent of vector poston of coupler pont. Ths error functon defned on the bass of curvature of the desred and generated curve. As a result, the mechansm, and so the desgn parameters, wll be ndependent of rotaton and translaton. The method s appled to four bar planar mechansm and showed that t needs lesser calculaton tme. Ths s acheved due to lower number of desgn

Proceedngs of the 6th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Lsbon, Portugal, September -4, 6 676 parameters needed to defne the obectve functon. Although the llustratve examples were four bar planar mechansm, the obectve functon s constructed so that the algorthm can be easly appled to other path generaton mechansms. 5 eference Ahmad A. Smal, adm A. Dab, and a A. Atallah, 5, Optmum Synthess of Mechansms Usng Tabu-Gradent Search Algorthm, ASME J. Mech. Des. 7, pp 97-9 Irfan, Ullah, and Srdhar, Kota, 997, Optmal Synthess of Mechansms for Path Generaton Usng Fourer Descrptors and Global Search mthods, ASME J. Mech. Des., 9, pp. 54 5. Kunur, A., and Krshnamurty, S., 997, Genetc Algorthms n Mechancal Synthess, J. Appl. Mech., 4, pp. 8 4. olle, H., and Hunt, K., 97, Optmum Synthess of Planar Lnkages to Generate Coupler curves, J. Mech., 6, pp. 67 87. Yao, J., and Angeles, J.,, Computaton of All Optmum Dyads n the Approxmate Synthess of Planar Lnkages for gd-body Gudance, Mech. Mach. Theory, 5_8_, pp. 65 78. Sancbran,., Vadero, F., Garcoa, P., and Fernandez, A., 4, Gradentbased optmzaton of path synthess problems n planar mechansms, Mech. Mach. Theory, 9 _to be publshed_. Ulah, I., and Kota, S., 997, Optmal Synthess of Mechansms for Path Generaton Usng Fourer Descrptors and Global Search Methods, ASME J. Mech. Des., 9, pp. 54 5. Martnez-Alfaro, H., Valdez, H., and Ortega, J., 998, Lnkage Synthess of a Four-Bar Mechansm for n-precson Ponts Usng Smulated Annealng, DETC98/ MECH 594, Proc. of the 998 ASME Desgn Engneerng Techncal Conferences, Atlanta, Georga, USA. Kunur, S., and Krshnamurty, S., 997, Genetc Algorthms n Mechansm Synthess, Journal of Appled Mechansms and obotcs, 4, pp. 8 4. Camuto, M., and Knzel, G., 998, Path Generaton Usng a andom Walk Algorthm, DETC98/MECH 599, Proc. Of the 998 ASME Desgn Engneerng Techncal conferences, Atlanta, Georga, USA. Lu, Y., and Xao,., 5, Optmal Synthess of Mechansms for Path Generaton Usng efned umercal epresentaton Based Model and AIS Based Searchng Method, ASME J. Mech. Des.