liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Adaptive Complex Method for Efficient Design Optimization
Linköping University, Department of Management and Engineering, Machine Design. Linköping University, The Institute of Technology.
Linköping University, Department of Management and Engineering, Machine Design. Linköping University, The Institute of Technology.
2007 (English)In: Proceedings of ASME 33rd Design Automation Conference, September 4-7, Las Vegas, USA, 2007, 265-272 p.Conference paper (Other academic)
Abstract [en]

Box’s Complex method for direct search has shown promise when applied to simulation based optimization. In direct search methods, like Box’s Complex method, the search starts with a set of points, where each point is a solution to the optimization problem. In the Complex method the number of points must be at least one plus the number of variables. However, in order to avoid premature termination and increase the likelihood of finding the global optimum more points are often used at the expense of the required number of evaluations. The idea in this paper is to gradually remove points during the optimization in order to achieve an adaptive Complex method for more efficient design optimization. The proposed method shows encouraging results when compared to the Complex method with fix number of points and a quasi-Newton method.

Place, publisher, year, edition, pages
2007. 265-272 p.
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-13233DOI: 10.1115/DETC2007-34773ISBN: 0-7918-3806-4 (online)ISBN: 0-7918-4807-8 (print)OAI: diva2:18088
ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference
Available from: 2008-04-28 Created: 2008-04-28 Last updated: 2014-08-21
In thesis
1. Design Optimization in Industrial Robotics: Methods and Algorithms for Drive Train Design
Open this publication in new window or tab >>Design Optimization in Industrial Robotics: Methods and Algorithms for Drive Train Design
2008 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Robot manufacturers, like many other manufacturers, are experiencing increasing competition in a global market where one way to confront the challenge is by making the development process more efficient. One way to speed up the time to market for new products is to take advantage of design optimization based on simulation models. By optimizing performance with the help of dynamic simulation, an immense amount of both time and money may be saved.

In this thesis, design optimization strategies for industrial robot design are studied. Often, the trade-offs between performance, cost and quality are essential for design decisions. These tradeoffs can be investigated with the help of simulation models. Generating the trade-offs can be both cumbersome and time-consuming, but the process may be partly automated with the help of optimization algorithms. How the optimization problem needs to be formulated to generate the trade-off is discussed in this thesis.

Robot design problems usually consist of a mixture of deciding continuous parameters as well as selecting components from catalogs and databases. Hence, there is a need for optimization algorithms which can handle variables of both a discrete and a continuous nature. A new method has been developed to address this problem. The method has also been improved by adding adaptive characteristics for further efficient design optimization.

The ideas in this thesis have been applied to both simulation models of conceptual degrees of elaboration as well as simulation models of complete robot systems. An optimization procedure which shows how optimization can be used in the early phases of a development process is developed. The objective of the optimization is to determine optimal gearboxes and arm lengths from an acceleration capability perspective. An optimization based design method for robot drive trains is also presented. For further efficient use of already installed robots the concept of application adapted performance optimization is introduced. This means that the robot control is optimized with respect to thermal and fatigue load for the specific program that the robot performs. The motion program itself, i.e. the path planning, can be optimized at the same time in order to get the most out of the robot.

Place, publisher, year, edition, pages
Institutionen för ekonomisk och industriell utveckling, 2008. 81 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1170
Robot manufacturers, industrial robot, robot design
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
urn:nbn:se:liu:diva-11664 (URN)978-91-7393-945-4 (ISBN)
Public defence
2008-04-25, C3, Hus C, Campus Valla, Linköpings universitet, Linköping, 10:15 (English)
Available from: 2008-04-28 Created: 2008-04-28 Last updated: 2009-05-12

Open Access in DiVA

No full text

Other links

Publisher's full textLink to Ph.D. Thesis

Search in DiVA

By author/editor
Pettersson, MarcusÖlvander Andersson, Johan
By organisation
Machine DesignThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 75 hits
ReferencesLink to record
Permanent link

Direct link