Digital Twin for Automatic Transportation in Industry 4.0.

Industry 4.0 is the fourth industrial revolution consisting of the digitalization of processes facilitating an incremental value chain. Smart Manufacturing (SM) is one of the branches of the Industry 4.0 regarding logistics, visual inspection of pieces, optimal organization of processes, machine sensorization, real-time data adquisition and treatment and virtualization of industrial activities. Among these tecniques, Digital Twin (DT) is attracting the research interest of the scientific community in the last few years due to the cost reduction through the simulation of the dynamic behaviour of the industrial plant predicting potential problems in the SM paradigm. In this paper, we propose a new DT design concept based on external service for the transportation of the Automatic Guided Vehicles (AGVs) which are being recently introduced for the Material Requirement Planning satisfaction in the collaborative industrial plant. We have performed real experimentation in two different scenarios through the definition of an Industrial Ethernet platform for the real validation of the DT results obtained. Results show the correlation between the virtual and real experiments carried out in the two scenarios defined in this paper with an accuracy of 97.95% and 98.82% in the total time of the missions analysed in the DT. Therefore, these results validate the model created for the AGV navigation, thus fulfilling the objectives of this paper.

Memetic Chains for Improving the Local Wireless Sensor Networks Localization in Urban Scenarios.

Local Positioning Systems (LPS) have become an active field of research in the last few years. Their application in harsh environments for high-demanded accuracy applications is allowing the development of technological activities such as autonomous navigation, indoor localization, or low-level flights in restricted environments. LPS consists of ad-hoc deployments of sensors which meets the design requirements of each activity. Among LPS, those based on temporal measurements are attracting higher interest due to their trade-off among accuracy, robustness, availability, and costs. The Time Difference of Arrival (TDOA) is extended in the literature for LPS applications and consequently we perform, in this paper, an analysis of the optimal sensor deployment of this architecture for achieving practical results. This is known as the Node Location Problem (NLP) and has been categorized as NP-Hard. Therefore, heuristic solutions such as Genetic Algorithms (GA) or Memetic Algorithms (MA) have been applied in the literature for the NLP. In this paper, we introduce an adaptation of the so-called MA-Solis Wets-Chains (MA-SW-Chains) for its application in the large-scale discrete discontinuous optimization of the NLP in urban scenarios. Our proposed algorithm MA-Variable Neighborhood Descent-Chains (MA-VND-Chains) outperforms the GA and the MA of previous proposals for the NLP, improving the accuracy achieved by 17% and by 10% respectively for the TDOA architecture in the urban scenario introduced.

Hybrid Memetic Algorithm for the Node Location Problem in Local Positioning Systems.

Local Positioning Systems (LPS) have shown excellent performance for applications that demand high accuracy. They rely on ad-hoc node deployments which fit the environment characteristics in order to reduce the system uncertainties. The obtainment of competitive results through these systems requires the solution of the Node Location Problem (finding the optimal cartesian coordinates of the architecture sensors). This problem has been assigned as NP-Hard, therefore a heuristic solution is recommended for addressing this complex problem. Genetic Algorithms (GA) have shown an excellent trade-off between diversification and intensification in the literature. However, in Non-Line-of-Sight (NLOS) environments in which there is not continuity in the fitness function evaluation of a particular node distribution among contiguous solutions, challenges arise for the GA during the exploration of new potential regions of the space of solutions. Consequently, in this paper, we first propose a Hybrid GA with a combination of the GA operators in the evolutionary process for the Node Location Problem. Later, we introduce a Memetic Algorithm (MA) with a Local Search (LS) strategy for exploring the most different individuals of the population in search of improving the previous results. Finally, we combine the Hybrid Genetic Algorithm (HGA) and Memetic Algorithm (MA), designing an enhanced novel methodology for solving the Node Location Problem, a Hybrid Memetic Algorithm (HMA). Results show that the HMA proposed in this article outperforms all of the individual configurations presented and attains an improvement of 14.2% in accuracy for the Node Location Problem solution in the scenario of simulations with regards to the previous GA optimizations of the literature.

Local Wireless Sensor Networks Positioning Reliability Under Sensor Failure.

Local Positioning Systems are collecting high research interest over the last few years. Its accurate application in high-demanded difficult scenarios has revealed its stability and robustness for autonomous navigation. In this paper, we develop a new sensor deployment methodology to guarantee the system availability in case of a sensor failure of a five-node Time Difference of Arrival (TDOA) localization method. We solve the ambiguity of two possible solutions in the four-sensor TDOA problem in each combination of four nodes of the system by maximizing the distance between the two possible solutions in every target possible location. In addition, we perform a Genetic Algorithm Optimization in order to find an optimized node location with a trade-off between the system behavior under failure and its normal operating condition by means of the Cramer Rao Lower Bound derivation in each possible target location. Results show that the optimization considering sensor failure enhances the average values of the convergence region size and the location accuracy by 31% and 22%, respectively, in case of some malfunction sensors regarding to the non-failure optimization, only suffering a reduction in accuracy of less than 5% under normal operating conditions.

Genetic Algorithm Approach to the 3D Node Localization in TDOA Systems.

Positioning asynchronous architectures based on time measurements are reaching growing importance in Local Positioning Systems (LPS). These architectures have special relevance in precision applications and indoor/outdoor navigation of automatic vehicles such as Automatic Ground Vehicles (AGVs) and Unmanned Aerial Vehicles (UAVs). The positioning error of these systems is conditioned by the algorithms used in the position calculation, the quality of the time measurements, and the sensor deployment of the signal receivers. Once the algorithms have been defined and the method to compute the time measurements has been selected, the only design criteria of the LPS is the distribution of the sensors in the three-dimensional space. This problem has proved to be NP-hard, and therefore a heuristic solution to the problem is recommended. In this paper, a genetic algorithm with the flexibility to be adapted to different scenarios and ground modelings is proposed. This algorithm is used to determine the best node localization in order to reduce the Cramér-Rao Lower Bound (CRLB) with a heteroscedastic noise consideration in each sensor of an Asynchronous Time Difference of Arrival (A-TDOA) architecture. The methodology proposed allows for the optimization of the 3D sensor deployment of a passive A-TDOA architecture, including ground modeling flexibility and heteroscedastic noise consideration with sequential iterations, and reducing the spatial discretization to achieve better results. Results show that optimization with 15% of elitism and a Tournament 3 selection strategy offers the best maximization for the algorithm.

3D Tdoa Problem Solution with Four Receiving Nodes.

Time difference of arrival (TDOA) positioning methods have experienced growing importance over the last few years due to their multiple applications in local positioning systems (LPSs). While five sensors are needed to determine an unequivocal three-dimensional position, systems with four nodes present two different solutions that cannot be discarded according to mathematical standards. In this paper, a new methodology to solve the 3D TDOA problems in a sensor network with four beacons is proposed. A confidence interval, which is defined in this paper as a sphere, is defined to use positioning algorithms with four different nodes. It is proven that the separation between solutions in the four-beacon TDOA problem allows the transformation of the problem into an analogous one in which more receivers are implied due to the geometric properties of the intersection of hyperboloids. The achievement of the distance between solutions needs the application of genetic algorithms in order to find an optimized sensor distribution. Results show that positioning algorithms can be used 96.7% of the time with total security in cases where vehicles travel at less than 25 m/s.

Accuracy Analysis in Sensor Networks for Asynchronous Positioning Methods.

The accuracy requirements for sensor network positioning have grown over the last few years due to the high precision demanded in activities related with vehicles and robots. Such systems involve a wide range of specifications which must be met through positioning devices based on time measurement. These systems have been traditionally designed with the synchronization of their sensors in order to compute the position estimation. However, this synchronization introduces an error in the time determination which can be avoided through the centralization of the measurements in a single clock in a coordinate sensor. This can be found in typical architectures such as Asynchronous Time Difference of Arrival (A-TDOA) and Difference-Time Difference of Arrival (D-TDOA) systems. In this paper, a study of the suitability of these new systems based on a Cramér-Rao Lower Bound (CRLB) evaluation was performed for the first time under different 3D real environments for multiple sensor locations. The analysis was carried out through a new heteroscedastic noise variance modelling with a distance-dependent Log-normal path loss propagation model. Results showed that A-TDOA provided less uncertainty in the root mean square error (RMSE) in the positioning, while D-TDOA reduced the standard deviation and increased stability all over the domain.