PV Panel Model Parameter Estimation by Using Particle Swarm Optimization and Artificial Neural Network.

Photovoltaic (PV) panels are one of the popular green energy resources and PV panel parameter estimations are one of the popular research topics in PV panel technology. The PV panel parameters could be used for PV panel health monitoring and fault diagnosis. Recently, a PV panel parameters estimation method based in neural network and numerical current predictor methods has been developed. However, in order to further improve the estimation accuracies, a new approach of PV panel parameter estimation is proposed in this paper. The output current and voltage dynamic responses of a PV panel are measured, and the time series of the I-V vectors will be used as input to an artificial neural network (ANN)-based PV model parameter range classifier (MPRC). The MPRC is trained using an I-V dataset with large variations in PV model parameters. The results of MPRC are used to preset the initial particles' population for a particle swarm optimization (PSO) algorithm. The PSO algorithm is used to estimate the PV panel parameters and the results could be used for PV panel health monitoring and the derivation of maximum power point tracking (MMPT). Simulations results based on an experimental I-V dataset and an I-V dataset generated by simulation show that the proposed algorithms can achieve up to 3.5% accuracy and the speed of convergence was significantly improved as compared to a purely PSO approach.

PV Panel Model Parameter Estimation by Using Neural Network.

Photovoltaic (PV) panels have been widely used as one of the solutions for green energy sources. Performance monitoring, fault diagnosis, and Control of Operation at Maximum Power Point (MPP) of PV panels became one of the popular research topics in the past. Model parameters could reflect the health conditions of a PV panel, and model parameter estimation can be applied to PV panel fault diagnosis. In this paper, we will propose a new algorithm for PV panel model parameters estimation by using a Neural Network (ANN) with a Numerical Current Prediction (NCP) layer. Output voltage and current signals (VI) after load perturbation are observed. An ANN is trained to estimate the PV panel model parameters, which is then fined tuned by the NCP to improve the accuracy to about 6%. During the testing stage, VI signals are input into the proposed ANN-NCP system. PV panel model parameters can then be estimated by the proposed algorithms, and the estimated model parameters can be then used for fault detection, health monitoring, and tracking operating points for MPP conditions.

One-wire reconfigurable and damage-tolerant sensor matrix inspired by the auditory tonotopy.

Sensor matrices are essential in various fields including robotics, aviation, health care, and industrial machinery. However, conventional sensor matrix systems often face challenges such as limited reconfigurability, complex wiring, and poor robustness. To address these issues, we introduce a one-wire reconfigurable sensor matrix that is capable of conforming to three-dimensional curved surfaces and resistant to cross-talk and fractures. Our frequency-located technology, inspired by the auditory tonotopy, reduces the number of output wires from row × column to a single wire by superimposing the signals of all sensor units with unique frequency identities. The sensor units are connected through a shared redundant network, giving great freedom for reconfiguration and facilitating quick repairs. The one-wire frequency-located technology is demonstrated in two applications-a pressure sensor matrix and a pressure-temperature multimodal sensor matrix. In addition, we also show its potential in monitoring strain distribution in an airplane wing, emphasizing its advantages in simplified wiring and improved robustness.

Genetic Learning Particle Swarm Optimization.

Social learning in particle swarm optimization (PSO) helps collective efficiency, whereas individual reproduction in genetic algorithm (GA) facilitates global effectiveness. This observation recently leads to hybridizing PSO with GA for performance enhancement. However, existing work uses a mechanistic parallel superposition and research has shown that construction of superior exemplars in PSO is more effective. Hence, this paper first develops a new framework so as to organically hybridize PSO with another optimization technique for "learning." This leads to a generalized "learning PSO" paradigm, the *L-PSO. The paradigm is composed of two cascading layers, the first for exemplar generation and the second for particle updates as per a normal PSO algorithm. Using genetic evolution to breed promising exemplars for PSO, a specific novel *L-PSO algorithm is proposed in the paper, termed genetic learning PSO (GL-PSO). In particular, genetic operators are used to generate exemplars from which particles learn and, in turn, historical search information of particles provides guidance to the evolution of the exemplars. By performing crossover, mutation, and selection on the historical information of particles, the constructed exemplars are not only well diversified, but also high qualified. Under such guidance, the global search ability and search efficiency of PSO are both enhanced. The proposed GL-PSO is tested on 42 benchmark functions widely adopted in the literature. Experimental results verify the effectiveness, efficiency, robustness, and scalability of the GL-PSO.

Optimal Selection of Parameters for Nonuniform Embedding of Chaotic Time Series Using Ant Colony Optimization.

The optimal selection of parameters for time-delay embedding is crucial to the analysis and the forecasting of chaotic time series. Although various parameter selection techniques have been developed for conventional uniform embedding methods, the study of parameter selection for nonuniform embedding is progressed at a slow pace. In nonuniform embedding, which enables different dimensions to have different time delays, the selection of time delays for different dimensions presents a difficult optimization problem with combinatorial explosion. To solve this problem efficiently, this paper proposes an ant colony optimization (ACO) approach. Taking advantage of the characteristic of incremental solution construction of the ACO, the proposed ACO for nonuniform embedding (ACO-NE) divides the solution construction procedure into two phases, i.e., selection of embedding dimension and selection of time delays. In this way, both the embedding dimension and the time delays can be optimized, along with the search process of the algorithm. To accelerate search speed, we extract useful information from the original time series to define heuristics to guide the search direction of ants. Three geometry- or model-based criteria are used to test the performance of the algorithm. The optimal embeddings found by the algorithm are also applied in time-series forecasting. Experimental results show that the ACO-NE is able to yield good embedding solutions from both the viewpoints of optimization performance and prediction accuracy.

SamACO: variable sampling ant colony optimization algorithm for continuous optimization.

An ant colony optimization (ACO) algorithm offers algorithmic techniques for optimization by simulating the foraging behavior of a group of ants to perform incremental solution constructions and to realize a pheromone laying-and-following mechanism. Although ACO is first designed for solving discrete (combinatorial) optimization problems, the ACO procedure is also applicable to continuous optimization. This paper presents a new way of extending ACO to solving continuous optimization problems by focusing on continuous variable sampling as a key to transforming ACO from discrete optimization to continuous optimization. The proposed SamACO algorithm consists of three major steps, i.e., the generation of candidate variable values for selection, the ants' solution construction, and the pheromone update process. The distinct characteristics of SamACO are the cooperation of a novel sampling method for discretizing the continuous search space and an efficient incremental solution construction method based on the sampled values. The performance of SamACO is tested using continuous numerical functions with unimodal and multimodal features. Compared with some state-of-the-art algorithms, including traditional ant-based algorithms and representative computational intelligence algorithms for continuous optimization, the performance of SamACO is seen competitive and promising.

Adaptive particle swarm optimization.

An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity.