Eric Santiago-Valentin

Eric Santiago-Valentin

Auto-generated profile, based on publicly available information

Eric Santiago-Valentin

Instituto Politecnico Nacional, Centro de Investigacion y Desarollo Tecnologico en Computo, Juan de Dios Bátiz

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 April 2017 in IEEE Access
Verified
Journal Article
Open access
MCMaria Barbara Calva-Yanez
Maria Barbara Calva-Yanez
PNPaola Andrea Nino-Suarez
Paola Andrea Nino-Suarez
EPEdgar Alfredo Portilla-Flores
Edgar Alfredo Portilla-Flores
JAJorge Alexander Aponte-Rodriguez
Jorge Alexander Aponte-Rodriguez
ESEric Santiago-Valentn
Eric Santiago-Valentn
This paper presents a procedure for designing a mechanical training and rehabilitation gait system centered on ankle trajectories for children with cerebral palsy or any other psycho-motor limitation. With the aim of developing a reconfigurable device adjustable to the anthropometric characteristics of the user, an analytic model for the generation of ankle trajectories was elaborated, taking as a base the experimental data reported in literature. A dimensional synthesis for a mechanism to follow the drop type trajectories was carried out as a constrained numerical optimization problem that was solved with both the mathematical programming method and an evolutive algorithm, sequential quadratic programming (SQP) and differential evolution (DE), respectively. The comparative analysis of the results from both methods for this case study shows that DE outperforms SQP because of the limited feasibility space derived from the problem constrains and boundaries. The best result from DE was simulated with a computer-aided design package using a real size model for manufacturing.

7 December 2018 in IEEE Access
Verified
Journal Article
Open access
ESEric Santiago-Valenten
Eric Santiago-Valenten
EPEdgar Alfredo Portilla-Flores
Edgar Alfredo Portilla-Flores
Efrén Mezura-MontesEfrén Mezura-Montes
Efrén Mezura-Montes
Eduardo Vega-AlvaradoEduardo Vega-Alvarado
Eduardo Vega-Alvarado
MCMaria Bárbara Calva-Yáñez
Maria Bárbara Calva-Yáñez
MPMartin Pedroza-Villalba
Martin Pedroza-Villalba
In this paper, a graph-theory-based approach for representing planar mechanisms is presented, the Santiago Portilla method (SPM). From the corresponding adjacency matrix, SPM generates an extended matrix containing the complete characterization of a planar mechanism, including all the information about both topology and geometry. This matrix representation can be used for the optimal design of mechanisms, allowing simultaneously the topological and dimensional synthesis by means of computational tools such as the metaheuristic algorithms. A case study corresponding to the design of a fixed-linear-trajectory tracker mechanism is included in order to test the efficiency of the proposed approach. It was carried out by addressing the design as an optimization problem and solving it with the differential evolution algorithm, representing the individuals in its population by the matrix form generated by the SPM. The results of the case study show that the SPM and its matrix representation constitute a useful and flexible tool for the solution of the real engineering problems involving the design of planar mechanisms.

12 August 2020 in IEEE Access
Verified
Journal Article
Open access
Leticia Flores-PulidoLeticia Flores-Pulido
Leticia Flores-Pulido
EPEdgar Alfredo Portilla-Flores
Edgar Alfredo Portilla-Flores
ESEric Santiago-Valentin
Eric Santiago-Valentin
Eduardo Vega-AlvaradoEduardo Vega-Alvarado
Eduardo Vega-Alvarado
MCMaria Bárbara Calva-Yáñez
Maria Bárbara Calva-Yáñez
PSPaola Andrea Niño Suarez
Paola Andrea Niño Suarez
There are problems that are difficult to solve through mathematical programming or by classical methods. These problems are called hard problems due to their high complexity or high dimension. On the other hand, mataheuristics intends to seek a better solution to a problem. The Improvement Harmony Search algorithm is proposed under modification of the bandwidth parameter increasing the quality of the exploitation of the solutions. That is why within the state of the art, are mentioned several versions of harmonic search. The state of the art is supports the fact that the algorithm belongs to the category of those who make modifications to its parameters. This research demonstrates the ability of ImHS to solve a problem of high complexity focused on solving four-bar mechanism designs, whose solutions imply high dimension and which are also classified as hard problems. The two problems that are solved in this investigation, are problems very attacked within the state of the art by various metaheuristics. A comparison is then made against previous solutions with traditional metaheuristics and other versions of harmony search algorithm. Finally, the effectiveness of performance is demonstrated, where proposed algorithm it exceeded five metaheuristic algorithms and five harmony search versions. An optimum is provided in an easy and useful way, the parametric statistics are improved and the number of feasible solutions is exceeded in NP-hard problems as in the case of problems with four-bar mechanisms.

6 April 2017 in IEEE Access
Verified
Journal Article
Open access
Eduardo Vega-AlvaradoEduardo Vega-Alvarado
Eduardo Vega-Alvarado
EPEdgar Alfredo Portilla-Flores
Edgar Alfredo Portilla-Flores
MCMaria Barbara Calva-Yanez
Maria Barbara Calva-Yanez
GCGabriel Sepulveda Cervantes
Gabriel Sepulveda Cervantes
JAJorge Alexander Aponte-Rodriguez
Jorge Alexander Aponte-Rodriguez
JRJose Marco Antonio Rueda-Melendez
Jose Marco Antonio Rueda-Melendez
Hybrid metaheuristics, explored in recent literature, are optimization methods that combine a global search metaheuristic with algorithms for refinement that in turn can be stochastic or deterministic. Although initially they were applied to combinatorial optimization, nowadays there are hybrid algorithms for a wide range of numerical problems: static or dynamic, mono or multi-objective, unconstrained or constrained, among others. In this paper a novel application of a hybrid method, MemMABC, is applied as a tool in a case study for the synthesis of an end effector presented as a constrained optimization problem, using a model for a two-finger gripper. The objective is to show the ability of hybrid metaheuristics as an alternative method for solving hard problems, specifically of numerical optimization. MemMABC is a memetic algorithm, that uses the modified artificial bee colony algorithm(MABC) for global searching and a version of random walk as local searcher, adapted to handle design constraints with an ε-constraint scheme. Grippers are end effectors used in a wide variety of robots, and are a good example of hard optimization problems. The simulation of results shows an accurate control of the gripping force along the opening range of the calculated mechanisms, suggesting that MemMABC can produce quality solutions for real-world engineering cases.

15 November 2018 in IEEE Access
Verified
Journal Article
Open access
MPMartin Pedroza-Villalba
Martin Pedroza-Villalba
EPEdgar Alfredo Portilla-Flores
Edgar Alfredo Portilla-Flores
Eduardo Vega-AlvaradoEduardo Vega-Alvarado
Eduardo Vega-Alvarado
MCMaria Bárbara Calva-Yáñez
Maria Bárbara Calva-Yáñez
ESEric Santiago-Valentin
Eric Santiago-Valentin
EAEnrique Alcala-Fazio
Enrique Alcala-Fazio
In this paper, an alternative approach for topology optimization of truss-type structures is presented. The structural design is translated to a constrained discrete optimization problem based on weight reduction, with performance considerations included in its objective function. The constraints are related to the maximum global stress and to the individual strain energy density. Each member has a standard profile and its absence/presence in the structural representation is implemented with a binary coding; in order to avoid singularities while in the structural analysis, a scheme for simulating the effects of missing members by means of the birth/death element technique is applied. An energy-based approach is employed to detect those elements that not contribute to the overall stiffness. The optimization problem is solved by applying a Modified Binary Differential Evolution algorithm, and the graph theory is applied in parallel with the optimization process to discard unfeasible structures and reduce execution time. The structural performance is evaluated by an execution-time static analysis based on the finite-element method, considering the behavior in a 3-D environment and using commercial software to reduce the uncertainty in this step. The presented proposal is implemented in ANSYS APDL, using as case studies two different structures with a specific load case. The obtained results show a volume reduction of more than 40% off the initial structures, indicating that the proposed approach can be a high-quality tool for structural design in real engineering problems.

21 June 2026
Verified
Book Chapter
Closed access
NNNicolay Andres Niño-Suarez
Nicolay Andres Niño-Suarez
LFLuis Armando Flores-Herrera
Luis Armando Flores-Herrera
MCMaria Bárbara Calva-Yáñez
Maria Bárbara Calva-Yáñez
EPEdgar Alfredo Portilla-Flores
Edgar Alfredo Portilla-Flores
ESEric Santiago-Valentin
Eric Santiago-Valentin
JGJordan Dallan Guillot-Fula
Jordan Dallan Guillot-Fula