MATH-PHSep 22, 2011
Discrete second-order Euler-Poincaré equations. Applications to optimal controlLeonardo Colombo, Fernando Jimenez, David Martin de Diego
In this paper we will discuss some new developments in the design of numerical methods for optimal control problems of Lagrangian systems on Lie groups. We will construct these geometric integrators using discrete variational calculus on Lie groups, deriving a discrete version of the second-order Euler-Lagrange equations. Interesting applications as, for instance, a discrete derivation of the Euler-Poincaré equations for second-order Lagrangians and its application to optimal control of a rigid body, and of a Cosserat rod are shown at the end of the paper.
NAJun 15, 2016
Feedback IntegratorsDong Eui Chang, Fernando Jimenez, Matthew Perlmutter
A new method is proposed to numerically integrate a dynamical system on a manifold such that the trajectory stably remains on the manifold and preserves first integrals of the system. The idea is that given an initial point in the manifold we extend the dynamics from the manifold to its ambient Euclidean space and then modify the dynamics outside the intersection of the manifold and the level sets of the first integrals containing the initial point such that the intersection becomes a unique local attractor of the resultant dynamics. While the modified dynamics theoretically produces the same trajectory as the original dynamics, it yields a numerical trajectory that stably remains on the manifold and preserves the first integrals. The big merit of our method is that the modified dynamics can be integrated with any ordinary numerical integrator such as Euler or Runge-Kutta. We illustrate this method by applying it to three famous problems: the free rigid body, the Kepler problem and a perturbed Kepler problem with rotational symmetry. We also carry out simulation studies to demonstrate the excellence of our method and make comparisons with the standard projection method, a splitting method and Störmer-Verlet schemes.
MATH-PHJan 1, 2012
Hamiltonian dynamics and constrained variational calculus: continuous and discrete settingsManuel de Leon, Fernando Jimenez, David Martin de Diego
The aim of this paper is to study the relationship between Hamiltonian dynamics and constrained variational calculus. We describe both using the notion of Lagrangian submanifolds of convenient symplectic manifolds and using the so-called Tulczyjew's triples. The results are also extended to the case of discrete dynamics and nonholonomic mechanics. Interesting applications to geometrical integration of Hamiltonian systems are obtained.
NAMar 10, 2017
The geometric discretisation of the Suslov problem: a case study of consistency for nonholonomic integratorsLuis C. Garcia-Naranjo, Fernando Jimenez
Geometric integrators for nonholonomic systems were introduced by Cortés and Martínez in [Nonholonomic integrators, Nonlinearity, 14, 2001] by proposing a discrete Lagrange-D'Alembert principle. Their approach is based on the definition of a discrete Lagrangian $L_d$ and a discrete constraint space $D_d$. There is no recipe to construct these objects and the performance of the integrator is sensitive to their choice. Cortés and Martínez claim that choosing $L_d$ and $D_d$ in a consistent manner with respect to a finite difference map is necessary to guarantee an approximation of the continuous flow within a desired order of accuracy. Although this statement is given without proof, similar versions of it have appeared recently in the literature. We evaluate the importance of the consistency condition by comparing the performance of two different geometric integrators for the nonholonomic Suslov problem, only one of which corresponds to a consistent choice of $L_d$ and $D_d$. We prove that both integrators produce approximations of the same order, and, moreover, that the non-consistent discretisation outperforms the other in numerical experiments and in terms of energy preservation. Our results indicate that the consistency of a discretisation might not be the most relevant feature to consider in the construction of nonholonomic geometric integrators.
NAJan 3, 2018
On some aspects of the discretization of the Suslov problemFernando Jimenez, Juergen Scheurle
In this paper we explore the discretization of Euler-Poincaré-Suslov equations on $SO(3)$, i.e. of the Suslov problem. We show that the consistency order corresponding to the unreduced and reduced setups, when the discrete reconstruction equation is given by a Cayley retraction map, are related to each other in a nontrivial way. We give precise conditions under which general and variational integrators generate a discrete flow preserving the constraint distribution. We establish general consistency bounds and illustrate the performance of several discretizations by some plots. Moreover, along the lines of [14] we show that any constraints-preserving discretization may be understood as being generated by the exact evolution map of a time-periodic non-autonomous perturbation of the original continuous-time nonholonomic system.
CVMar 15, 2024
Control and Automation for Industrial Production Storage Zone: Generation of Optimal Route Using Image ProcessingBejamin A. Huerfano, Fernando Jimenez
Digital image processing (DIP) is of great importance in validating and guaranteeing parameters that ensure the quality of mass-produced products. Therefore, this article focused on developing an industrial automation method for a zone of a production line model using the DIP. The neo-cascade methodology employed allowed for defining each of the stages in an adequate way, ensuring the inclusion of the relevant methods for its development, which finally incurred in the modeling, design, implementation, and testing of an optimal route generation system for a warehouse area, using DIP with optimization guidelines, in conjunction with an embedded platform and the connection to programmable logic controllers (PLCs) for its execution. The system was based on the OpenCV library; tool focused on artificial vision, which was implemented on an object-oriented programming (OOP) platform based on Java language. It generated the optimal route for the automation of processes in a scale warehouse area, using the segmentation of objects and the optimization of flow in networks as pillars, ending with the connection to PLCs as a method of action, which in case of implementation would eliminate constraints such as process inefficiency, the use of manpower to perform these tasks, inadequate use of resources, among others