scholarly journals Learning from Sensors and Past Experience in an Autonomous Oceanographic Probe

2021 ◽  
Vol 24 (2) ◽  
pp. 1859-1864
Author(s):  
Albert Vilamala ◽  
Enric Plaza ◽  
Josep Arcos
Keyword(s):  
Particle Swarm Optimization ◽  
Multidisciplinary Team ◽  
Autonomous System ◽  
Particle Swarm ◽  
Past Experience ◽  
Sensor Data ◽  
Swarm Optimization ◽  
Simulated Environments ◽  
Case Based

The work presented in this paper is part of a multidisciplinary team collaborating in the deployment of an autonomous oceanographic probe with the task of exploring marine regions and take phytoplankton samples for their subsequent analysis in a laboratory. We will describe an autonomous system that, from sensor data, is able to characterize phytoplankton structures. Because the system has to work inboard, a main goal of our approach is to dramatically reduce the dimensionality of the problem. Specifically, our development uses two AI techniques, namely Particle Swarm Optimization and Case-Based Reasoning.We report results of experiments performed with simulated environments.

scholarly journals Hybrid Particle Swarm Optimization for Multi-Sensor Data Fusion

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2792 ◽  
Author(s):  
Hyunseok Kim ◽  
Dongjun Suh
Keyword(s):  
Particle Swarm Optimization ◽  
Data Fusion ◽  
Large Scale ◽  
Synergistic Effects ◽  
Particle Swarm ◽  
Sensor Data ◽  
Fusion Model ◽  
Swarm Optimization ◽  
Hybrid Particle ◽  
Hybrid Particle Swarm Optimization

A hybrid particle swarm optimization (PSO), able to overcome the large-scale nonlinearity or heavily correlation in the data fusion model of multiple sensing information, is proposed in this paper. In recent smart convergence technology, multiple similar and/or dissimilar sensors are widely used to support precisely sensing information from different perspectives, and these are integrated with data fusion algorithms to get synergistic effects. However, the construction of the data fusion model is not trivial because of difficulties to meet under the restricted conditions of a multi-sensor system such as its limited options for deploying sensors and nonlinear characteristics, or correlation errors of multiple sensors. This paper presents a hybrid PSO to facilitate the construction of robust data fusion model based on neural network while ensuring the balance between exploration and exploitation. The performance of the proposed model was evaluated by benchmarks composed of representative datasets. The well-optimized data fusion model is expected to provide an enhancement in the synergistic accuracy.

scholarly journals A Novel KGP Algorithm for Improving INS/GPS Integrated Navigation Positioning Accuracy

Sensors ◽  
2019 ◽  
Vol 19 (7) ◽  
pp. 1623 ◽  
Author(s):  
Huibing Zhang ◽  
Tong Li ◽  
Lihua Yin ◽  
Dingke Liu ◽  
Ya Zhou ◽  
...  
Keyword(s):  
Neural Network ◽  
Particle Swarm Optimization ◽  
Kalman Filter ◽  
Decision Tree ◽  
Particle Swarm ◽  
Sensor Data ◽  
Gradient Boosting ◽  
Integrated Navigation ◽  
Swarm Optimization ◽  
Positioning Accuracy

The fusion of multi-source sensor data is an effective method for improving the accuracy of vehicle navigation. The generalization abilities of neural-network-based inertial devices and GPS integrated navigation systems weaken as the nonlinearity in the system increases, resulting in decreased positioning accuracy. Therefore, a KF-GDBT-PSO (Kalman Filter-Gradient Boosting Decision Tree-Particle Swarm Optimization, KGP) data fusion method was proposed in this work. This method establishes an Inertial Navigation System (INS) error compensation model by integrating Kalman Filter (KF) and Gradient Boosting Decision Tree (GBDT). To improve the prediction accuracy of the GBDT, we optimized the learning algorithm and the fitness parameter using Particle Swarm Optimization (PSO). When the GPS signal was stable, the KGP method was used to solve the nonlinearity issue between the vehicle feature and positioning data. When the GPS signal was unstable, the training model was used to correct the positioning error for the INS, thereby improving the positioning accuracy and continuity. The experimental results show that our method increased the positioning accuracy by 28.20–59.89% compared with the multi-layer perceptual neural network and random forest regression.

scholarly journals Application of Improved Particle Swarm Optimization for Navigation of Unmanned Surface Vehicles

Sensors ◽  
2019 ◽  
Vol 19 (14) ◽  
pp. 3096 ◽  
Author(s):  
Junfeng Xin ◽  
Shixin Li ◽  
Jinlu Sheng ◽  
Yongbo Zhang ◽  
Ying Cui
Keyword(s):  
Particle Swarm Optimization ◽  
Real Time ◽  
Sensor Fusion ◽  
Autonomous Navigation ◽  
Particle Swarm ◽  
Sensor Data ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Unmanned Surface Vehicles ◽  
Inertia Weight

Multi-sensor fusion for unmanned surface vehicles (USVs) is an important issue for autonomous navigation of USVs. In this paper, an improved particle swarm optimization (PSO) is proposed for real-time autonomous navigation of a USV in real maritime environment. To overcome the conventional PSO’s inherent shortcomings, such as easy occurrence of premature convergence and human experience-determined parameters, and to enhance the precision and algorithm robustness of the solution, this work proposes three optimization strategies: linearly descending inertia weight, adaptively controlled acceleration coefficients, and random grouping inversion. Their respective or combinational effects on the effectiveness of path planning are investigated by Monte Carlo simulations for five TSPLIB instances and application tests for the navigation of a self-developed unmanned surface vehicle on the basis of multi-sensor data. Comparative results show that the adaptively controlled acceleration coefficients play a substantial role in reducing the path length and the linearly descending inertia weight help improve the algorithm robustness. Meanwhile, the random grouping inversion optimizes the capacity of local search and maintains the population diversity by stochastically dividing the single swarm into several subgroups. Moreover, the PSO combined with all three strategies shows the best performance with the shortest trajectory and the superior robustness, although retaining solution precision and avoiding being trapped in local optima require more time consumption. The experimental results of our USV demonstrate the effectiveness and efficiency of the proposed method for real-time navigation based on multi-sensor fusion.

An Improved Particle Swarm Optimization Algorithm for Dynamic Power Allocation Problem

2014 ◽  
Vol 687-691 ◽  
pp. 1380-1384
Author(s):  
Jian Jun Zhao ◽  
Wen Jie Zhao
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Dynamic Environment ◽  
Particle Swarm ◽  
Case Based Reasoning ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Case Based

In this paper, we propose a fast multiobjective particle swarm optimization algorithm (called CBR-fMOPSO for short). In the algorithm, a case-based reasoning (CBR) technique is used to retrieve history optimization results and experts’ experience and add them into the population of multiobjective particle swarm optimization algorithm (MOPSO) in dynamic environment. The optimal solutions found by CBR-fMOPSO are used to mend the case library to improve the accuracy of solving based on CBR in next solving. The results from a suit of experiments in electric furnaces show that the proposed algorithm maintains good performances however the environment changes.

scholarly journals Matching Sensor Ontologies with Simulated Annealing Particle Swarm Optimization

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Hai Zhu ◽  
Xingsi Xue ◽  
Aifeng Geng ◽  
He Ren
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Particle Swarm ◽  
Location Based Services ◽  
Sensor Data ◽  
Ontology Matching ◽  
Ontology Alignment ◽  
Matching Problem ◽  
Swarm Optimization

In recent years, innovative positioning and mobile communication techniques have been developing to achieve Location-Based Services (LBSs). With the help of sensors, LBS is able to detect and sense the information from the outside world to provide location-related services. To implement the intelligent LBS, it is necessary to develop the Semantic Sensor Web (SSW), which makes use of the sensor ontologies to implement the sensor data interoperability, information sharing, and knowledge fusion among intelligence systems. Due to the subjectivity of sensor ontology engineers, the heterogeneity problem is introduced, which hampers the communications among these sensor ontologies. To address this problem, sensor ontology matching is introduced to establish the corresponding relationship between different sensor terms. Among all ontology matching technologies, Particle Swarm Optimization (PSO) can represent a contributing method to deal with the low-quality ontology alignment problem. For the purpose of further enhancing the quality of matching results, in our work, sensor ontology matching is modeled as the meta-matching problem firstly, and then based on this model, aiming at various similarity measures, a Simulated Annealing PSO (SAPSO) is proposed to optimize their aggregation weights and the threshold. In particular, the approximate evaluation metrics for evaluating quality of alignment without reference are proposed, and a Simulated Annealing (SA) strategy is applied to PSO’s evolving process, which is able to help the algorithm avoid the local optima and enhance the quality of solution. The well-known Ontology Alignment Evaluation Initiative’s benchmark (OAEI’s benchmark) and three real sensor ontologies are used to verify the effectiveness of SAPSO. The experimental results show that SAPSO is able to effectively match the sensor ontologies.

A Particle Swarm Optimization Approach for Reuse Guided Case Retrieval

2014 ◽  
Vol 6 (3) ◽  
pp. 16-30 ◽  
Author(s):  
Nabila Nouaouria ◽  
Mounir Boukadoum ◽  
Robert Proulx
Keyword(s):  
Particle Swarm Optimization ◽  
Fitness Function ◽  
Particle Swarm ◽  
Direct Access ◽  
Memory Model ◽  
Case Based Reasoning ◽  
Optimization Approach ◽  
Case Retrieval ◽  
Swarm Optimization ◽  
Case Based

The success of Case Based Reasoning (CBR) problem solving is mainly based on the recall process. The ideal CBR memory is one that simultaneously speeds up the retrieval step while improving the reuse of retrieved cases. In this paper, the authors present a novel associative memory model to perform the retrieval stage in a case based reasoning system. The described approach makes no prior assumption of a specific organization of the case memory, thus leading to a generic recall process. This is made possible by using Particle Swarm Optimization (PSO) to compute the neighborhood of a new problem, followed by direct access to the cases it contains. The fitness function of the PSO stage has a reuse semantic that combines similarity and adaptability as criteria for optimal case retrieval. The model was experimented on two proprietary databases and compared to the flat memory model for performance. The obtained results are very promising.

scholarly journals Adapted Binary Particle Swarm Optimization for Efficient Features Selection in the Case of Imbalanced Sensor Data

2020 ◽  
Vol 10 (4) ◽  
pp. 1496 ◽  
Author(s):  
Dorin Moldovan ◽  
Ionut Anghel ◽  
Tudor Cioara ◽  
Ioan Salomie
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Sensor Data ◽  
Binary Particle Swarm Optimization ◽  
Features Selection ◽  
Swarm Optimization ◽  
Daily Life Activities ◽  
Using Data ◽  
Low Dimensional ◽  
Research Challenge

Daily living activities (DLAs) classification using data collected from wearable monitoring sensors is very challenging due to the imbalance characteristics of the monitored data. A major research challenge is to determine the best combination of features that returns the best accuracy results using minimal computational resources, when the data is heterogeneous and not fitted for classical algorithms that are designed for balanced low-dimensional datasets. This research article: (1) presents a modification of the classical version of the binary particle swarm optimization (BPSO) algorithm that introduces a particular type of particles called sensor particles, (2) describes the adaptation of this algorithm for data generated by sensors that monitor DLAs to determine the best positions and features of the monitoring sensors that lead to the best classification results, and (3) evaluates and validates the proposed approach using a machine learning methodology that integrates the modified version of the algorithm. The methodology is tested and validated on the Daily Life Activities (DaLiAc) dataset.

Sign in / Sign up

Export Citation Format

Share Document