13 resultados para inverse problem
em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco
Resumo:
[ES]En el presente trabajo de fin de grado se expondrá el análisis cinemático de un robot IRB120 de ABB y el desarrollo de una herramienta grafica para su visualización. Comenzando por un estudio del estado del arte de la robótica industrial. El análisis cinemático es plantear las ecuaciones del robot y la resolución del problema directo e inverso mediante el software Matlab. Por último, la herramienta grafica muestra el movimiento del robot y los sistemas de referencia en la trayectoria introducida por el usuario.
Resumo:
The lack of stability in some matching problems suggests that alternative solution concepts to the core might be applied to find predictable matchings. We propose the absorbing sets as a solution for the class of roommate problems with strict preferences. This solution, which always exists, either gives the matchings in the core or predicts some other matchings when the core is empty. Furthermore, it satisfies an interesting property of outer stability. We also characterize the absorbing sets, determine their number and, in case of multiplicity, we find that they all share a similar structure.
Resumo:
Issue in Honor of Prof. Paweł Kafarski
Resumo:
The problem discussed is the stability of two input-output feedforward and feedback relations, under an integral-type constraint defining an admissible class of feedback controllers. Sufficiency-type conditions are given for the positive, bounded and of closed range feed-forward operator to be strictly positive and then boundedly invertible, with its existing inverse being also a strictly positive operator. The general formalism is first established and the linked to properties of some typical contractive and pseudocontractive mappings while some real-world applications and links of the above formalism to asymptotic hyperstability of dynamic systems are discussed later on.
Resumo:
The Linear Ordering Problem is a popular combinatorial optimisation problem which has been extensively addressed in the literature. However, in spite of its popularity, little is known about the characteristics of this problem. This paper studies a procedure to extract static information from an instance of the problem, and proposes a method to incorporate the obtained knowledge in order to improve the performance of local search-based algorithms. The procedure introduced identifies the positions where the indexes cannot generate local optima for the insert neighbourhood, and thus global optima solutions. This information is then used to propose a restricted insert neighbourhood that discards the insert operations which move indexes to positions where optimal solutions are not generated. In order to measure the efficiency of the proposed restricted insert neighbourhood system, two state-of-the-art algorithms for the LOP that include local search procedures have been modified. Conducted experiments confirm that the restricted versions of the algorithms outperform the classical designs systematically. The statistical test included in the experimentation reports significant differences in all the cases, which validates the efficiency of our proposal.
Resumo:
157 p.
Resumo:
The aim of this paper is to propose a new solution for the roommate problem with strict preferences. We introduce the solution of maximum irreversibility and consider almost stable matchings (Abraham et al. [2])and maximum stable matchings (Ta [30] [32]). We find that almost stable matchings are incompatible with the other two solutions. Hence, to solve the roommate problem we propose matchings that lie at the intersection of the maximum irreversible matchings and maximum stable matchings, which are called Q-stable matchings. These matchings are core consistent and we offer an effi cient algorithm for computing one of them. The outcome of the algorithm belongs to an absorbing set.
Resumo:
[ES]Este proyecto investigador tiene como objetivo el ayudar con la calibración del mecanismo de cinco pares de rotación montado en el taller de Ingeniería Mecánica de la ETSI de Bilbao. En primer lugar se estudiarán los algoritmos de optimización prestando especial atención a la comparativa entre Levenberg-Marquart y Gauss-Newton. Se realizarán estudios en Matlab para concluir cuál de los dos es más eficaz tanto en rapidez como en precisión. El que sea más adecuado se implementará en un programa para la calibración del mecanismo 5R. En segundo lugar se estudiarán los índices de observabilidad. Los estudios que se han realizado sobre ellos hasta ahora son poco concluyentes asique se intentará aclarar su utilidad y determinar cuál es el que conviene utilizar en este caso. Para ello se deberá programar la resolución del problema cinemático inverso. Por último se presentarán los resultados y las conclusiones correspondientes. Se propondrá también un plan de desarrollo de una línea de investigación futura que partirá con este trabajo como base.
Resumo:
[ES]En el siguiente Trabajo Fin de Grado se va a exponer el análisis cinemático y desarrollo de un modelo virtual para la implementación de las ecuaciones cinemáticas del robot IRB120 de ABB llevados a cabo durante el curso 2013/2014. Comenzando por un estudio del Estado del Arte de la robótica industrial, se plantean seguidamente las ecuaciones de localización del robot en función de las variables de entrada mediante el método matricial. Estas ecuaciones son implementadas en un modelo de MatLab para usarlas en la resolución del problema de posición directo e inverso, y son también usadas en herramientas de creación de trayectorias. Además, sus derivadas se utilizan en el cálculo de velocidades del elemento terminal. Por último, se muestra la creación del prototipo 3D del robot, así como un interfaz gráfico de control del robot para el usuario, y los trabajos de validación llevados a cabo de los mencionados modelos virtuales sobre el robot real.
Resumo:
In traditional teaching, the fundamental concepts of electromagnetic induction are usually quickly analyzed, spending most of the time solving problems in a more or less rote manner. However, physics education research has shown that the fundamental concepts of the electromagnetic induction theory are barely understood by students. This article proposes an interactive teaching sequence introducing the topic of electromagnetic induction. The sequence has been designed based on contributions from physics education research. Particular attention is paid to the relationship between experimental findings (macroscopic level) and theoretical interpretation (microscopic level). An example of the activities that have been designed will also be presented, describing the implementation context and the corresponding findings. Since implementing the sequence, a considerable number of students have a more satisfactory grasp of the electromagnetic induction explicative model. However, difficulties are manifested in aspects that require a multilevel explanation, referring to deep structures where the system description is better defined.
Resumo:
[EN]This research had as primary objective to model different types of problems using linear programming and apply different methods so as to find an adequate solution to them. To achieve this objective, a linear programming problem and its dual were studied and compared. For that, linear programming techniques were provided and an introduction of the duality theory was given, analyzing the dual problem and the duality theorems. Then, a general economic interpretation was given and different optimal dual variables like shadow prices were studied through the next practical case: An aesthetic surgery hospital wanted to organize its monthly waiting list of four types of surgeries to maximize its daily income. To solve this practical case, we modelled the linear programming problem following the relationships between the primal problem and its dual. Additionally, we solved the dual problem graphically, and then we found the optimal solution of the practical case posed through its dual, following the different theorems of the duality theory. Moreover, how Complementary Slackness can help to solve linear programming problems was studied. To facilitate the solution Solver application of Excel and Win QSB programme were used.
Resumo:
194 p.
Resumo:
xlix, 121 p.