Topological and parametric optimization of gear trains

A method for automating the design of gear trains comprised of simple, compound, bevel and worm is described. The search process combines topological changes, discrete variable choices and continuous variable optimization. By combing best-first search, implicit enumeration, automated optimization invocation and gradient-based optimization, a near guarantee of the optimal solution can be made. While the combination of methods is specific to gear trains, there are aspects of the work that make it amenable to other engineering design problems. In addition, the topological and discrete modifications to the candidate solutions are specific to gear trains, but the graph grammar methodology that is adopted has been tailored to other problems. This article presents details on the rules that generate feasible gear trains, the evaluation routines used in determining the objective functions and constraints, and the interaction among the three search methods. Resulting gear trains are presented for a variety of gear problems.

[1]  Melik Dölen,et al.  Discrete parameter-nonlinear constrained optimisation of a gear train using genetic algorithms , 2005, Int. J. Comput. Appl. Technol..

[2]  Sun-Ok Gwon University of Texas at Austin의 연구 현황 , 2002 .

[3]  J. Keith Nisbett,et al.  Shigley's Mechanical Engineering Design , 1983 .

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Chinyere Okechi Onwubiko,et al.  Introduction to engineering design optimization , 1999 .

[6]  Kristina Shea,et al.  A Clock Grammar: The Use of a Parallel Grammar in Performance-Based Mechanical Synthesis , 2002 .

[7]  Francis L. Merat,et al.  Introduction to robotics: Mechanics and control , 1987, IEEE J. Robotics Autom..

[8]  C. M. Reeves,et al.  Function minimization by conjugate gradients , 1964, Comput. J..

[9]  Xin Li,et al.  Transformation of an EGT Grammar: New Grammar, New Designs , 2004 .

[10]  Panos Y. Papalambros,et al.  Discrete Optimal Design Formulations With Application to Gear Train Design , 1992, DAC 1992.

[11]  D. Walton,et al.  Practical approach to optimum gear train design , 1988 .

[12]  Laveen N. Kanal Book review: Search in Artificial Intelligence Ed. by Laveen Kanal and Vipin Kumar (Springer-Verlag, New York, 1988) , 1991, SGAR.

[13]  Matthew I. Campbell,et al.  PipeSynth: An Algorithm for Automated Topological and Parametric Design and Optimization of Pipe Networks , 2011, DAC 2011.

[14]  Craig T. Lawrence,et al.  A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm , 2000, SIAM J. Optim..

[15]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[16]  Scott Curland Chase,et al.  A Graph Grammar Approach for Structure Synthesis of Mechanisms , 2000 .

[17]  Ching-Huan Tseng,et al.  Kinematic Optimization of a Modified Helical Gear Train , 1997 .

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[19]  Thomas F. Coleman,et al.  Optimization Toolbox User's Guide , 1998 .

[20]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[21]  Pradeep Radhakrishnan,et al.  A Graph Grammar Based Scheme for Generating and Evaluating Planar Mechanisms , 2010, DCC.

[22]  Matthew I. Campbell,et al.  A Graph Grammar Approach to Generate Neural Network Topologies , 2007, DAC 2007.

[23]  Matthew I. Campbell,et al.  Automated Synthesis of MEMS Fabrication Sequences Using Graph Grammars , 2007, DAC 2007.

[24]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[25]  Jay Patel,et al.  An Approach to Automate and Optimize Concept Generation of Sheet Metal Parts by Topological and Parametric Decoupling , 2010 .

[26]  Matthew I. Campbell,et al.  Automated Synthesis and Optimization of Gear Train Topologies , 2009, DAC 2009.

[27]  Jonathan Cagan,et al.  Formal Engineering Design Synthesis , 2005 .