Search

The ideal gas molecular movement (IGMM) as a metaheuristic optimization method is a prominent option for solving optimization problems. However, in some complex cases, IGMM may possess premature convergence or get trapped in local optima. Therefore, to tackle these issues, this paper indicates a new modified IGMM algorithm named opposition‐based IGMM, which has been incorporated with opposition based learning (OBL), Cauchy mutation (CM), velocity clamping (VC), and mirror operator (MO) to enhance its performance. OBL, VC, and MO improve the convergence of IGMM, whereas CM assists IGMM to escape local optima. The effect of each strategy, OBL, CM, VC, and MO, on IGMM, is confirmed through 30 low and high‐dimensional benchmarks, including 23 well‐known mathematical problems and CEC2017 as complex test functions and three engineering problems. Analysis results represent that integration IGMM with OBL, CM, VC, and MO has the best performance among other IGMM variants and eventually improved IGMM in exploration, exploitation, accelerating convergence, and local optima avoidance. [ABSTRACT FROM AUTHOR]

One of the useful knowledge representation tools, which can describe the joint probability distribution between some random variables with a graphical model and can be trained by a dataset, is the Bayesian network (BN). A BN is composed of a network structure and a conditional probability distribution table for each node. Discovering an optimal BN structure is an NP‐hard optimization problem that various meta‐heuristic algorithms are applied to solve this problem by researchers. The genetic algorithms, ant colony optimization, evolutionary programming, artificial bee colony, and bacterial foraging optimization are some of the meta‐heuristic methods to solve this problem using a dataset. Most of these methods are applying a scoring metric to generate the best network structure from a set of candidates. A Fixed Structure Learning Automata‐Based (FSLA‐B) algorithm is presented in this paper to solve the structure learning problem of BNs. There is a fixed structure learning automaton for each pair of vertices in the BN's graph structure in the proposed algorithm. The action of this automaton determines the presence and direction of an edge between the vertices. The proposed algorithm performs a guided search procedure using the FSLA and escapes from local optimums. Several datasets are utilised in this paper to evaluate the performance of the proposed algorithm. By performing various experiments, multiple meta‐heuristic algorithms are compared with the introduced new one. The obtained results represented that the proposed algorithm could produce competitive results and find the near‐optimal solution for the BN structure learning problem. [ABSTRACT FROM AUTHOR]

Parameter extraction of photovoltaic (PV) models based on measured current–voltage data plays an important role in the control, simulation, and optimization of PV systems. Despite the fact that various parameter extraction strategies have been dedicated to solving this problem, they may have certain drawbacks. In this paper, an effective hybrid optimization method based on adaptive rat swarm optimization (ARSO) and pattern search (PS) is presented for effectively and consistently extracting PV parameters. The proposed method employs the global search ability of ARSO and the local search ability of PS. The performance of the new algorithm is investigated using a set of benchmark test functions, and the results are compared with those of the standard RSO and some other methods from the literature. The extraction of parameters from several PV models, such as single‐diode, double‐diode, and PV modules, confirms the performance of the suggested method. Simulation results show that the proposed method surpasses other state‐of‐the‐art procedures in terms of accuracy, reliability, and convergence speed. [ABSTRACT FROM AUTHOR]

To solve the problem that the local contrast algorithm is easily influenced by the heavy clutter background or strong noise and does not fully consider the spatial neighbourhood characteristics of the small target, a spatial dissimilarity weighted local contrast‐based method (SDWLCM) for infrared small target detection is proposed in this paper. Firstly, the two‐dimensional difference of the Gaussian filter with central excitation and lateral suppression characteristics is chosen to preprocess the original infrared image for removing the flat background and improving the signal‐to‐noise ratio (SNR) of the small target. Secondly, the spatial dissimilarity between the target and its surrounding backgrounds is designed for local contrast weighting to generate the contrast saliency map so that the heavy clutter background is greatly suppressed and the small target is further highlighted. Thirdly, the saliency map is segmented by the adaptive threshold to get the real targets. Experimental results show that, compared with other methods, the SDWLCM, which owns not only a higher SNR gain and a larger background suppression factor but also a higher detection rate and a lower false alarm rate, is confirmed to be an effective method to detect the small targets. [ABSTRACT FROM AUTHOR]

Visual inspection of photovoltaic modules using electroluminescence (EL) images is a common method of quality inspection. Because human inspection requires a lot of time, object detection algorithm to replace human inspection is a popular research direction in recent years. To solve the problem of low accuracy and slow speed in EL image detection, we propose a YOLO‐based object detection algorithm YOLO‐PV, which achieves 94.55% of AP (average precision) on the photovoltaic module EL image data set, and the interference speed exceeds 35 fps. The improvement of speed and accuracy benefits from the targeted design of the network architecture according to the characteristics of EL image. First, we weaken the backbone's ability to extract deep‐level information so that it can focus on extracting the low‐level defect information. Second, the PAN network is used for feature fusion in the Neck part. But, only the single‐size feature map output is retained, which significantly reduces the amount of calculation. Also, we analyze the impact of data enhancement methods on model overfitting and performance. Finally, we give effective data enhancement methods. The results show that the object detection algorithm in this paper can meet the requirements for high‐precision and real‐time processing on the PV module production line. [ABSTRACT FROM AUTHOR]

The paper addresses the problem of finding a compact representation of the diagnoses within a model-based approach to diagnosis. To this end, we introduce the notion ofscenario, a special kind of CNF formula over the component variables, which can be used to encode a large number of diagnoses using the same amount of space needed for encoding just a single diagnosis. We show how the solutions to a diagnostic problem can be computed as sets of scenarios by presenting first an exhaustive algorithm and then an efficient algorithm, which exploits probabilistic information to restrict the result set to preferred scenarios. Finally, we discuss the issue of how to efficiently extract preferred diagnoses from sets of scenarios and characterize a class of system models for which our techniques perform particularly well. Concepts and algorithms introduced in the paper have been tested within the prototype of the diagnostic agent of a space robotic arm; resulting statistics are reported and critically discussed. [ABSTRACT FROM AUTHOR]

This paper proposes a classification framework based on simple classifiers organized in a tree-like structure. It is observed that simple classifiers, even though they have high error rate, find similarities among classes in the problem domain. The authors propose to trade on this property by recognizing classes that are mistaken and constructing overlapping subproblems. The subproblems are then solved by other classifiers, which can be very simple, giving as a result a hierarchical classifier (HC). It is shown that HC, together with the proposed training algorithm and evaluation methods, performs well as a classification framework. It is also proven that such constructs give better accuracy than the root classifier it is built upon. [ABSTRACT FROM AUTHOR]

Supply chain formation is the process by which a set of producers within a network determine the subset of these producers able to form a chain to supply goods to one or more consumers at the lowest cost. This problem has been tackled in a number of ways, including auctions, negotiations, and argumentation-based approaches. In this paper we show how this problem can be cast as an optimization of a pairwise cost function. Optimizing this class of energy functions is NP-hard but efficient approximations to the global minimum can be obtained using loopy belief propagation (LBP). Here we detail a max-sum LBP-based approach to the supply chain formation problem, involving decentralized message-passing between supply chain participants. Our approach is evaluated against a well-known decentralized double-auction method and an optimal centralized technique, showing several improvements on the auction method: it obtains better solutions for most network instances which allow for competitive equilibrium (Competitive equilibrium in Walsh and Wellman is a set of producer costs which permits a Pareto optimal state in which agents in the allocation receive non-negative surplus and agents not in the allocation would acquire non-positive surplus by participating in the supply chain) while also optimally solving problems where no competitive equilibrium exists, for which the double-auction method frequently produces inefficient solutions. [ABSTRACT FROM AUTHOR]

This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover exploring a largely unknown planet. It is argued that existing algorithms for decision-theoretic planning are based on a logically incorrect theory of rational decision making. Plans cannot be evaluated directly in terms of their expected values, because plans can be of different scopes, and they can interact with other previously adopted plans. Furthermore, in the real world, the search for optimal plans is completely intractable. An alternative theory of rational decision making is proposed, called “locally global planning.” [ABSTRACT FROM AUTHOR]