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.

High-accuracy positioning is fundamental for modern applications of autonomous agent navigation. The accuracy and stability of predicted locations are key factors for evaluating the suitability of positioning architectures that have to be deployed to real-world cases. Asynchronous TDOA (A-TDOA) methodologies in Local Positioning Systems (LPS) are effective solutions that satisfy the given requirements and reduce temporal uncertainties induced during the synchronization process. In this paper, we propose a technique for the combined characterization of ranging errors -noise, and Non-Line-of-Sight (NLOS) propagation -through the Cramér-Rao Bound (CRB). NLOS propagation effects on signal quality are predicted with a new ray-tracing LOS/NLOS algorithm that provides LOS and NLOS travel distances for communication links in 3D irregular environments. In addition, we propose an algorithm for detecting multipath effects of destructive interference and disability of LOS paths. The proposed techniques are applied to sensor placement optimization in 3D real scenarios. A multi-objective optimization (MOP) process is used based on a Genetic Algorithm (GA) that provides the Pareto Fronts (PFs) for the joined minimization of location uncertainties (CRB) and multipath effects for a variable number of A-TDOA architecture sensors. Results show that the designed procedure can determine, before real implementation, the maximum capacities of the positioning system in terms of accuracy. This allows us to evaluate a trade-off between accuracy and cost of the architecture or support the design of the positioning system under accuracy demands.

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.

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.

The emergence of autonomous vehicles with high needs for accuracy in location has hardened the requirements of the positioning systems used for navigation. Local Positioning Systems (LPS) have shown an excellent adaptation to these conditions, thanks to stability and reduction in the levels of positioning uncertainty. The accuracy achieved by methodologies based on temporal measurements depends mainly on the uncertainties in the measurements of these systems. In this aspect, the presence of noise and the existence of temporary instabilities in measurement clocks, depending on the distribution of sensors in the environment, acquire great relevance. In this article, we introduce for the first time in the authors' best knowledge a Cramér-Rao Lower Bound (CRLB) model for the quantification of the global uncertainty in positioning systems caused by both noise and temporary instabilities in the measurement devices. Additionally, this technique is applied to the optimization of sensor distributions for Time of Arrival (TOA), Time Difference of Arrival (TDOA) and Asynchronous TDOA (A-TDOA) architectures using a Genetic Algorithm in a non-uniform 3D environment. Results show that A-TDOA methodology significantly overcomes synchronous architectures in terms of global accuracy and stability when noise and clock errors are considered in time measurements of LPS applications.

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.

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.

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.