513 research outputs found

    Multi-agent knowledge integration mechanism using particle swarm optimization

    Get PDF
    This is the post-print version of the final paper published in Technological Forecasting and Social Change. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. Copyright @ 2011 Elsevier B.V.Unstructured group decision-making is burdened with several central difficulties: unifying the knowledge of multiple experts in an unbiased manner and computational inefficiencies. In addition, a proper means of storing such unified knowledge for later use has not yet been established. Storage difficulties stem from of the integration of the logic underlying multiple experts' decision-making processes and the structured quantification of the impact of each opinion on the final product. To address these difficulties, this paper proposes a novel approach called the multiple agent-based knowledge integration mechanism (MAKIM), in which a fuzzy cognitive map (FCM) is used as a knowledge representation and storage vehicle. In this approach, we use particle swarm optimization (PSO) to adjust causal relationships and causality coefficients from the perspective of global optimization. Once an optimized FCM is constructed an agent based model (ABM) is applied to the inference of the FCM to solve real world problem. The final aggregate knowledge is stored in FCM form and is used to produce proper inference results for other target problems. To test the validity of our approach, we applied MAKIM to a real-world group decision-making problem, an IT project risk assessment, and found MAKIM to be statistically robust.Ministry of Education, Science and Technology (Korea

    Predicting construction litigation outcome using particle swarm optimization

    Get PDF
    Author name used in this publication: Kwokwing ChauSeries: Lecture notes in computer science2004-2005 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

    Prediction of construction litigation outcome using a split-step PSO algorithm

    Get PDF
    2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

    Application of a PSO-based neural network in analysis of outcomes of construction claims

    Get PDF
    Author name used in this publication: K. W. Chau2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

    Robust and Efficient Swarm Communication Topologies for Hostile Environments

    Full text link
    Swarm Intelligence-based optimization techniques combine systematic exploration of the search space with information available from neighbors and rely strongly on communication among agents. These algorithms are typically employed to solve problems where the function landscape is not adequately known and there are multiple local optima that could result in premature convergence for other algorithms. Applications of such algorithms can be found in communication systems involving design of networks for efficient information dissemination to a target group, targeted drug-delivery where drug molecules search for the affected site before diffusing, and high-value target localization with a network of drones. In several of such applications, the agents face a hostile environment that can result in loss of agents during the search. Such a loss changes the communication topology of the agents and hence the information available to agents, ultimately influencing the performance of the algorithm. In this paper, we present a study of the impact of loss of agents on the performance of such algorithms as a function of the initial network configuration. We use particle swarm optimization to optimize an objective function with multiple sub-optimal regions in a hostile environment and study its performance for a range of network topologies with loss of agents. The results reveal interesting trade-offs between efficiency, robustness, and performance for different topologies that are subsequently leveraged to discover general properties of networks that maximize performance. Moreover, networks with small-world properties are seen to maximize performance under hostile conditions

    The Application of PSO in Structural Damage Detection: An Analysis of the Previously Released Publications (2005–2020)

    Get PDF
    The structural health monitoring (SHM) approach plays a key role not only in structural engineering but also in other various engineering disciplines by evaluating the safety and performance monitoring of the structures. The structural damage detection methods could be regarded as the core of SHM strategies. That is because the early detection of the damages and measures to be taken to repair and replace the damaged members with healthy ones could lead to economic advantages and would prevent human disasters. The optimization-based methods are one of the most popular techniques for damage detection. Using these methods, an objective function is minimized by an optimization algorithm during an iterative procedure. The performance of optimization algorithms has a significant impact on the accuracy of damage identification methodology. Hence, a wide variety of algorithms are employed to address optimization-based damage detection problems. Among different algorithms, the particle swarm optimization (PSO) approach has been of the most popular ones. PSO was initially proposed by Kennedy and Eberhart in 1995, and different variants were developed to improve its performance. This work investigates the objectives, methodologies, and results obtained by over 50 studies (2005-2020) in the context of the structural damage detection using PSO and its variants. Then, several important open research questions are highlighted. The paper also provides insights on the frequently used methodologies based on PSO, the computational time, and the accuracy of the existing methodologies

    DeepEvolution: A Search-Based Testing Approach for Deep Neural Networks

    Full text link
    The increasing inclusion of Deep Learning (DL) models in safety-critical systems such as autonomous vehicles have led to the development of multiple model-based DL testing techniques. One common denominator of these testing techniques is the automated generation of test cases, e.g., new inputs transformed from the original training data with the aim to optimize some test adequacy criteria. So far, the effectiveness of these approaches has been hindered by their reliance on random fuzzing or transformations that do not always produce test cases with a good diversity. To overcome these limitations, we propose, DeepEvolution, a novel search-based approach for testing DL models that relies on metaheuristics to ensure a maximum diversity in generated test cases. We assess the effectiveness of DeepEvolution in testing computer-vision DL models and found that it significantly increases the neuronal coverage of generated test cases. Moreover, using DeepEvolution, we could successfully find several corner-case behaviors. Finally, DeepEvolution outperformed Tensorfuzz (a coverage-guided fuzzing tool developed at Google Brain) in detecting latent defects introduced during the quantization of the models. These results suggest that search-based approaches can help build effective testing tools for DL systems

    Can Single Solution Optimisation Methods Be Structurally Biased?

    Get PDF
    open access articleThis paper investigates whether optimisation methods with the population made up of one solution can suffer from structural bias just like their multisolution variants. Following recent results highlighting the importance of choice of strategy for handling solutions generated outside the domain, a selection of single solution methods are considered in conjunction with several such strategies. Obtained results are tested for the presence of structural bias by means of a traditional approach from literature and a newly proposed here statistical approach. These two tests are demonstrated to be not fully consistent. All tested methods are found to be structurally biased with at least one of the tested strategies. Confirming results for multisolution methods, it is such strategy that is shown to control the emergence of structural bias in single solution methods. Some of the tested methods exhibit a kind of structural bias that has not been observed before
    corecore