2. Universidad Cardenal Herrera-CEU

Our society is immersed in the Fourth Industrial Revolution due to the fast evolution of the new technologies that are modifying the labor market. In the near future, technologies related to Industry 4.0 will produce totally new goods and services. Therefore, the educational systems should adapt their programs to the future needs of an uncertain labor market. In particular, mathematics will play a key role in future jobs and there is a strong need to connect its teaching methodologies to the new technological scene. This work uses the STEAM approach (science, technology, engineering, arts and mathematics) along with active methodologies and educational robotics with the aim of developing a new strategy for the application of mathematics and physics in an engineering degree. In particular, a transportation challenge is posed to tackle the teaching–learning process of the Bézier curves and their applications in physics. A pilot project is developed using a LEGO EV3 robot and an active methodology, where students become the center of the learning process. The experimental results of the pilot study indicate an increase in the motivation due to the use of robots and the realistic context of the challenge.

This article defines a new concept for real-time factory management—manufacturing maps. Manufacturing maps are generated from two fundamental elements, mini-terms and Petri nets. Mini-terms are sub-times of a technical cycle, the time it takes for any component to perform its task. A mini-term, by definition, is a sub-cycle time and it would only make sense to use the term in connection with production improvement. Previous studies have shown that when the sub-cycle time worsens, this indicates that something unusual is happening, enabling anticipation of line failures. As a result, a mini-term has dual functionality, since, on the one hand, it is a production parameter and, on the other, it is a sensor used for predictive maintenance. This, combined with how easy and cheap it is to extract relevant data from manufacturing lines, has resulted in the mini-term becoming a new paradigm for predictive maintenance, and, indirectly, for production analysis. Applying this parameter using big data for machines and components can enable the complete modeling of a factory using Petri nets. This article presents manufacturing maps as a hierarchical construction of Petri nets in which the lowest level network is a temporary Petri net based on mini-terms, and in which the highest level is a global view of the entire plant. The user of a manufacturing map can select intermediate levels, such as a specific production line, and perform analysis or simulation using real-time data from the mini-term database. As an example, this paper examines the modeling of the 8XY line, a multi-model welding line at the Ford factory in Almussafes (Valencia), where the lower layers are modeled until the mini-term layer is reached. The results, and a discussion of the possible applications of manufacturing maps in industry, are provided at the end of this article.

Over the last years, mobile robot platforms are having a key role in education worldwide. Among others, LEGO Robots and MATLAB/Simulink are being used mainly in universities to improve the teaching experience. Most LEGO systems used in the literature are based on NXT, as the EV3 version is relatively recent. In contrast to the previous versions, the EV3 allows the development of real-time applications for teaching a wide variety of subjects as well as conducting research experiments. The goal of the research presented in this paper was to develop and validate a novel real-time educational platform based on the MATLAB/Simulink package and the LEGO EV3 brick for academic use in the fields of robotics and computer science. The proposed framework is tested here in different university teaching situations and several case studies are presented in the form of interactive projects developed by students. Without loss of generality, the platform is used for testing different robot path planning algorithms. Classical algorithms like rapidly-exploring random trees or artificial potential fields, developed by robotics researchers, are tested by bachelor students, since the code is freely available on the Internet. Furthermore, recent path planning algorithms developed by the authors are also tested in the platform with the aim of detecting the limits of its applicability. The restrictions and advantages of the proposed platform are discussed in order to enlighten future educational applications.

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.

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.

A novel algorithm called the Proper Generalized Decomposition (PGD) is widely used by the engineering community to compute the solution of high dimensional problems. However, it is well-known that the bottleneck of its practical implementation focuses on the computation of the so-called best rank-one approximation. Motivated by this fact, we are going to discuss some of the geometrical aspects of the best rank-one approximation procedure. More precisely, our main result is to construct explicitly a vector field over a low-dimensional vector space and to prove that we can identify its stationary points with the critical points of the best rank-one optimization problem. To obtain this result, we endow the set of tensors with fixed rank-one with an explicit geometric structure.

A necessity in the design of a path planning algorithm is to account for the environment. If the movement of the mobile robot is through a dynamic environment, the algorithm needs to include the main constraint: real-time collision avoidance. This kind of problem has been studied by different researchers suggesting different techniques to solve the problem of how to design a trajectory of a mobile robot avoiding collisions with dynamic obstacles. One of these algorithms is the artificial potential field (APF), proposed by O. Khatib in 1986, where a set of an artificial potential field is generated to attract the mobile robot to the goal and to repel the obstacles. This is one of the best options to obtain the trajectory of a mobile robot in real-time (RT). However, the main disadvantage is the presence of deadlocks. The mobile robot can be trapped in one of the local minima. In 1988, J.F. Canny suggested an alternative solution using harmonic functions satisfying the Laplace partial differential equation. When this article appeared, it was nearly impossible to apply this algorithm to RT applications. Years later a novel technique called proper generalized decomposition (PGD) appeared to solve partial differential equations, including parameters, the main appeal being that the solution is obtained once in life, including all the possible parameters. Our previous work, published in 2018, was the first approach to study the possibility of applying the PGD to designing a path planning alternative to the algorithms that nowadays exist. The target of this work is to improve our first approach while including dynamic obstacles as extra parameters.

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.