2. Universidad Cardenal Herrera-CEU

Solutions of partial differential equations can exhibit multiple time scales. Standard discretization techniques are constrained to capture the finest scale to accurately predict the response of the system. In this paper, we provide an alternative route to circumvent prohibitive meshes arising from the necessity of capturing fine-scale behaviors. The proposed methodology is based on a time-separated representation within the standard Proper Generalized Decomposition, where the time coordinate is transformed into a multi-dimensional time through new separated coordinates, each representing one scale, while continuity is ensured in the scale coupling. For instance, when considering two different time scales, the governing Partial Differential Equation is commuted into a nonlinear system that iterates between the so-called microtime and macrotime, so that the time coordinate can be viewed as a 2D time. The macroscale effects are taken into account by means of a finite element-based macro-discretization, whereas the microscale effects are handled with unidimensional parent spaces that are replicated throughout the time domain. The resulting separated representation allows us a very fine time discretization without impacting the computational efficiency. The proposed formulation is explored and numerically verified on thermal and elastodynamic problems.

The present paper aims at analyzing the topological content of the complex trajectories that weeder-autonomous robots follow in operation. We will prove that the topological descriptors of these trajectories are affected by the robot environment as well as by the robot state, with respect to maintenance operations. Most of existing methodologies enabling efficient diagnosis are based on the data analysis, and in particular on some statistical quantities derived from the data. The present work explores the use of an original approach that instead of analyzing quantities derived from the data, analyzes the “shape” of the data, that is, the time series topology based on the homology persistence. We will prove that this procedure is able to extract valuable patterns able to discriminate the trajectories that the robot follows depending on the particular patch in which it operates, as well as to differentiate the robot behavior before and after undergoing a maintenance operation. Even if it is a preliminary work, and it does not pretend to compare its performances with respect to other existing technologies, this work opens new perspectives in considering quite natural and simple descriptors based on the intrinsic information that data contains, with the aim of performing efficient diagnosis and prognosis.

This paper presents a real-time global path planning method for mobile robots using harmonic functions, such as the Poisson equation, based on the Proper Generalized Decomposition (PGD) of these functions. The main property of the proposed technique is that the computational cost is negligible in real-time, even if the robot is disturbed or the goal is changed. The main idea of the method is the off-line generation, for a given environment, of the whole set of paths from any start and goal configurations of a mobile robot, namely the computational vademecum, derived from a harmonic potential field in order to use it on-line for decision-making purposes. Up until now, the resolution of the Laplace or Poisson equations has been based on traditional numerical techniques unfeasible for real-time calculation. This drawback has prevented the extensive use of harmonic functions in autonomous navigation, despite their powerful properties. The numerical technique that reverses this situation is the Proper Generalized Decomposition. To demonstrate and validate the properties of the PGD-vademecum in a potential-guided path planning framework, both real and simulated implementations have been developed. Simulated scenarios, such as an L-Shaped corridor and a benchmark bug trap, are used, and a real navigation of a LEGO®MINDSTORMS robot running in static environments with variable start and goal configurations is shown. This device has been selected due to its computational and memory-restricted capabilities, and it is a good example of how its properties could help the development of social robots.

Modal analysis is widely used for addressing NVH—Noise, Vibration, and Hardness—in automotive engineering. The so-called principal modes constitute an orthogonal basis, obtained from the eigenvectors related to the dynamical problem. When this basis is used for expressing the displacement field of a dynamical problem, the model equations become uncoupled. Moreover, a reduced basis can be defined according to the eigenvalues magnitude, leading to an uncoupled reduced model, especially appealing when solving large dynamical systems. However, engineering looks for optimal designs and therefore it focuses on parametric designs needing the efficient solution of parametric dynamical models. Solving parametrized eigenproblems remains a tricky issue, and, therefore, nonintrusive approaches are privileged. In that framework, a reduced basis consisting of the most significant eigenmodes is retained for each choice of the model parameters under consideration. Then, one is tempted to create a parametric reduced basis, by simply expressing the reduced basis parametrically by using an appropriate regression technique. However, an issue remains that limits the direct application of the just referred approach, the one related to the basis ordering. In order to order the modes before interpolating them, different techniques were proposed in the past, being the Modal Assurance Criterion—MAC—one of the most widely used. In the present paper, we proposed an alternative technique that, instead of operating at the eigenmodes level, classify the modes with respect to the deformed structure shapes that the eigenmodes induce, by invoking the so-called Topological Data Analysis—TDA—that ensures the invariance properties that topology ensure.

The present paper shows, for the first time, the technique known as PGD-Vademecum as a global path planner for mobile robots. The main idea of this method is to obtain a Vademecum containing all the possible paths from any start and goal positions derived from a harmonic potential field in a predefined map. The PGD is a numerical technique with three main advantages. The first one is the ability to bring together all the possible Poisson equation solutions for all start and goal combinations in a map, guaranteeing that the resulting potential field does not have deadlocks. The second one is that the PGD-Vademecum is expressed as a sum of uncoupled multiplied terms: the geometric map and the start and goal configurations. Therefore, the harmonic potential field for any start and goal positions can be reconstructed extremely fast, in a nearly negligible computational time, allowing real-time path planning. The third one is that only a few uncoupled parameters are required to reconstruct the potential field with a low discretization error. Simulation results are shown to validate the abilities of this technique.

We are interested in evaluating the state of drivers to determine whether they are attentive to the road or not by using motion sensor data collected from car driving experiments. That is, our goal is to design a predictive model that can estimate the state of drivers given the data collected from motion sensors. For that purpose, we leverage recent developments in topological data analysis (TDA) to analyze and transform the data coming from sensor time series and build a machine learning model based on the topological features extracted with the TDA. We provide some experiments showing that our model proves to be accurate in the identification of the state of the user, predicting whether they are relaxed or tense.

The aim of this paper is to leverage the main surface topological descriptors to classify tape surface profiles, through the modelling of the evolution of the degree of intimate contact along the consolidation of pre-impregnated preforms associated to a composite forming process. It is well-known at an experimental level that the consolidation degree strongly depends on the surface characteristics (roughness). In particular, same process parameters applied to di erent surfaces produce very di erent degrees of intimate contact. It allows us to think that the surface topology plays an important role along this process. However, solving the physics-based models for simulating the roughness squeezing occurring at the tapes interface represents a computational e ort incompatible with online process control purposes. An alternative approach consists of taking a population of di erent tapes, with di erent surfaces, and simulating the consolidation for evaluating for each one the progression of the degree of intimate contact –DIC– while compressing the heated tapes, until reaching its final value at the end of the compression. The final goal is creating a regression able to assign a final value of the DIC to any surface, enabling online process control. The main issue of such an approach is the rough surface description, that is, the most precise and compact way of describing it from some appropriate parameters easy to extract experimentally, to be included in the just referred regression. In the present paper we consider a novel, powerful and very promising technique based on the topological data analysis –TDA– that considers an adequate metrics to describe, compare and classify rough surfaces.

A fundamental robotics task is to plan collision-free motions for complex bodies from a start to a goal position among a set of static and dynamic obstacles. This problem is well known in the literature as motion planning (or the piano mover's problem). The complexity of the problem has motivated many works in the field of robot path planning. One of the most popular algorithms is the Artificial Potential Field technique (APF). This method defines an artificial potential field in the configuration space (C-space) that produces a robot path from a start to a goal position. This technique is very fast for RT applications. However, the robot could be trapped in a deadlock (local minima of the potential function). The solution of this problem lies in the use of harmonic functions in the generation of the potential field, which satisfy the Laplace equation. Unfortunately, this technique requires a numerical simulation in a discrete mesh, making useless for RT applications. In our previous work, it was presented for the first time, the Proper Generalized Decomposition method to solve the motion planning problem. In that work, the PGD was designed just for static obstacles and computed as a vademecum for all Start and Goal combinations. This work demonstrates that the PGD could be a solution for the motion planning problem. However, in a realistic scenario, it is necessary to take into account more parameters like for instance, dynamic obstacles. The goal of the present paper is to introduce a diffusion term into the Laplace equation in order to take into account dynamic obstacles as an extra parameter. Both cases, isotropic and non-isotropic cases are into account in order to generalize the solution.