| Summary: | The optimal methods for the synthesis of mechanisms in rehabilitation usually require solving constrained optimization problems. Metaheuristic algorithms are frequently used to solve these problems with the inclusion of Constraint-Handling Techniques (CHTs). Nevertheless, the most used CHTs in the synthesis of mechanisms, such as penalty function and feasibility rules, generally prioritize the search for feasible regions over the minimization of the objective function, and it notably influences the exploration and exploitation of the algorithm such that it could induce in the premature convergence to the local minimum and thus the solution quality could deteriorate. In this work, a Neuronal Constraint-Handling (NCH) technique is proposed and its performance is studied in the solution of mechanism synthesis for rehabilitation. The NCH technique uses a neural network to search for the fittest solutions into the feasible and the infeasible region to pass them to the next generation of the evolutionary process of the Differential Evolution (DE) algorithm and consequently improve the obtained solution quality. Two synthesis problems with four–bar and cam–linkage mechanisms are the study cases for developing lower-limb rehabilitation routines. The NCH is compared with four state-of-the-art constraint-handling techniques (penalty function, feasibility rules, stochastic ranking, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ϵ</mi></semantics></math></inline-formula>-constrained method) included into four representative metaheuristic algorithms. The irace package is used for both the algorithm settings and neuronal network training to fairly and meaningfully compare through statistics to confirm the overall performance. The statistical results confirm that, despite changes in the rehabilitation trajectories, the proposal presents the best overall performance among selected algorithms in the studied synthesis problems for rehabilitation, followed by penalty function and feasibility rule.
|
|---|