Trends on the Pareto-optimal fronts of a portable generator drive system

Author(s):  
Michelle L. Bash ◽  
Steven D. Pekarek
2015 ◽  
Vol 10 (1) ◽  
Author(s):  
Geert De Kerf ◽  
Dirk Van Gestel ◽  
Lobke Mommaerts ◽  
Danielle Van den Weyngaert ◽  
Dirk Verellen

Author(s):  
Hermes Giberti ◽  
Davide Ferrari

In this work, it is considered a 6-DoF robotic device intended to be applied for hardware-in-the-loop (HIL) motion simulation with wind tunnel models. The requirements have led to a 6-PUS parallel robot whose linkages consist of six closed-loop kinematic chains, connecting the fixed base to the mobile platform with the same sequence of joints: actuated Prism (P), Universal (U), and Spherical (S). As is common for parallel kinematic manipulators (PKMs), the actual performances of the robot depend greatly on its dimensions. Therefore, a kinematic synthesis has been performed and several Pareto-optimal solutions have been obtained through a multi-objective optimization of the machine geometric parameters, using a genetic algorithm. In this paper, the inverse dynamic analysis of the robot is presented. Then, the results are used for the mechanical sizing of the drive system, comparing belt- to screw-driven units and selecting the motor-reducer groups. Finally, the best compromise Pareto-optimal solution is definitely chosen.


Author(s):  
Mahmood Mohagheghi ◽  
Jayanta Kapat ◽  
Narasimha Nagaiah

In this paper, two configurations of the S-CO2 Brayton cycles (i.e., the single-recuperated and recompression cycles) are thermodynamically modeled and optimized through a multi-objective approach. Two semi-conflicting objectives, i.e., cycle efficiency (ηc) and cycle specific power (Φsp) are maximized simultaneously to achieve Pareto optimal fronts. The objective of maximum cycle efficiency is to have a smaller and less expensive solar field, and a lower fuel cost in case of a hybrid scheme. On the other hand, the objective of maximum specific power provides a smaller power block, and a lower capital cost associated with recuperators and coolers. The multi-objective optimization is carried out by means of a genetic algorithm which is a robust method for multidimensional, nonlinear system optimization. The optimization process is comprehensive, i.e., all the decision variables including the inlet temperatures and pressures of turbines and compressors, the pinch point temperature differences, and the mass flow fraction of the main compressor are optimized simultaneously. The presented Pareto optimal fronts provide two optimum trade-off curves enabling decision makers to choose their desired compromise between the objectives, and to avoid naive solution points obtained from a single-objective optimization approach. Moreover, the comparison of the Pareto optimal fronts associated with the studied configurations reveals the optimum operational region of the recompression configuration where it presents superior performance over the single-recuperated cycle.


Author(s):  
Reinier Gonzalez-Echevarria ◽  
Elisenda Roca ◽  
Rafael Castro-Lopez ◽  
Francisco V. Fernandez ◽  
Javier Sieiro ◽  
...  

Robotica ◽  
2008 ◽  
Vol 26 (6) ◽  
pp. 753-765 ◽  
Author(s):  
R. Saravanan ◽  
S. Ramabalan ◽  
C. Balamurugan

SUMMARYA general new methodology using evolutionary algorithms viz., Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi-objective Differential Evolution (MODE), for obtaining optimal trajectory planning of an industrial robot manipulator (PUMA 560 robot) in the presence of fixed and moving obstacles with payload constraint is presented. The problem has a multi-criterion character in which six objective functions, 32 constraints and 288 variables are considered. A cubic NURBS curve is used to define the trajectory. The average fuzzy membership function method is used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find computational effort of the NSGA-II and MODE algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analysed. Both NSGA-II and MODE are best for this problem.


Sign in / Sign up

Export Citation Format

Share Document