Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Particle Swarm Optimization" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    Collision-free autonomous robot navigation in unknown environments utilizing PSO for path planning
    Autorzy:
    Krell, Evan
    Sheta, Alaa
    Balasubramanian, Arun Prassanth Ramaswamy
    King, Scott A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91555.pdf
    Data publikacji:
    2019
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    mobile robot
    particle swarm optimization (PSO)
    path planning
    Opis:
    The autonomous navigation of robots in unknown environments is a challenge since it needs the integration of a several subsystems to implement different functionality. It needs drawing a map of the environment, robot map localization, motion planning or path following, implementing the path in real-world, and many others; all have to be implemented simultaneously. Thus, the development of autonomous robot navigation (ARN) problem is essential for the growth of the robotics field of research. In this paper, we present a simulation of a swarm intelligence method is known as Particle Swarm Optimization (PSO) to develop an ARN system that can navigate in an unknown environment, reaching a pre-defined goal and become collision-free. The proposed system is built such that each subsystem manipulates a specific task which integrated to achieve the robot mission. PSO is used to optimize the robot path by providing several waypoints that minimize the robot traveling distance. The Gazebo simulator was used to test the response of the system under various envirvector representing a solution to the optimization problem.onmental conditions. The proposed ARN system maintained robust navigation and avoided the obstacles in different unknown environments. vector representing a solution to the optimization problem.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 4; 267-282
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Magnetic Particle Swarm Optimization
    Autorzy:
    Prampero, P. S.
    Attux, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/91715.pdf
    Data publikacji:
    2012
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    Magnetic Particle Swarm Optimization
    multimodal search
    metaheuristics
    sensitivity analysis
    convergence
    Opis:
    This paper presents and analyzes a search paradigm called Magnetic Particle Swarm Optimization. This paradigm gives support to two algorithms that combine elements of the behavior of magnetic dipoles within a framework that includes several elements that are known to be essential to effective multimodal search. The algorithms are applied to a variety of functions and their performance is compared with those of a number of related well-established metaheuristics. In addition to that, convergence and sensitivity analyses are presented for the first time.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 1; 59-72
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new auto adaptive fuzzy hybrid particle swarm optimization and genetic algorithm
    Autorzy:
    Dziwiński, Piotr
    Bartczuk, Łukasz
    Paszkowski, Józef
    Powiązania:
    https://bibliotekanauki.pl/articles/1837533.pdf
    Data publikacji:
    2020
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    hybrid methods
    Particle Swarm Optimization
    Genetic Algorithm
    fuzzy systems
    multimodal function
    Opis:
    The social learning mechanism used in the Particle Swarm Optimization algorithm allows this method to converge quickly. However, it can lead to catching the swarm in the local optimum. The solution to this issue may be the use of genetic operators whose random nature allows them to leave this point. The degree of use of these operators can be controlled using a neuro-fuzzy system. Previous studies have shown that the form of fuzzy rules should be adapted to the fitness landscape of the problem. This may suggest that in the case of complex optimization problems, the use of different systems at different stages of the algorithm will allow to achieve better results. In this paper, we introduce an auto adaptation mechanism that allows to change the form of fuzzy rules when solving the optimization problem. The proposed mechanism has been tested on benchmark functions widely adapted in the literature. The results verify the effectiveness and efficiency of this solution.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 2; 95-111
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Particle swarm optimization based fuzzy clustering approach to identify optimal number of clusters
    Autorzy:
    Chen, M.
    Ludwig, S. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91549.pdf
    Data publikacji:
    2014
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    optimization
    fuzzy clustering
    cluster analysis
    particle swarm optimization (PSO)
    PSO
    fuzzy Sammon mapping
    Sammon mapping
    Opis:
    Fuzzy clustering is a popular unsupervised learning method that is used in cluster analysis. Fuzzy clustering allows a data point to belong to two or more clusters. Fuzzy c-means is the most well-known method that is applied to cluster analysis, however, the shortcoming is that the number of clusters need to be predefined. This paper proposes a clustering approach based on Particle Swarm Optimization (PSO). This PSO approach determines the optimal number of clusters automatically with the help of a threshold vector. The algorithm first randomly partitions the data set within a preset number of clusters, and then uses a reconstruction criterion to evaluate the performance of the clustering results. The experiments conducted demonstrate that the proposed algorithm automatically finds the optimal number of clusters. Furthermore, to visualize the results principal component analysis projection, conventional Sammon mapping, and fuzzy Sammon mapping were used.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2014, 4, 1; 43-56
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the hybridization of the artificial Bee Colony and Particle Swarm Optimization Algorithms
    Autorzy:
    El-Abd, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/91658.pdf
    Data publikacji:
    2012
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    Artificial Bee Colony Algorithm
    ABC
    particle swarm optimization (PSO)
    PSO
    hybridization
    hybrid algorithm
    CEC05
    Opis:
    In this paper we investigate the hybridization of two swarm intelligence algorithms; namely, the Artificial Bee Colony Algorithm (ABC) and Particle Swarm Optimization (PSO). The hybridization technique is a component-based one, where the PSO algorithm is augmented with an ABC component to improve the personal bests of the particles. Three different versions of the hybrid algorithm are tested in this work by experimenting with different selection mechanisms for the ABC component. All the algorithms are applied to the well-known CEC05 benchmark functions and compared based on three different metrics, namely, the solution reached, the success rate, and the performance rate.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 2; 147-155
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Particle swarm optimization for solving a class of type-1 and type-2 fuzzy nonlinear equations
    Autorzy:
    Sadiqbatcha, S.
    Jafarzadeh, S.
    Ampatzidis, Y.
    Powiązania:
    https://bibliotekanauki.pl/articles/91663.pdf
    Data publikacji:
    2018
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    type-1 fuzzy sets
    type-2 fuzzy sets
    polynomial
    exponential equation
    particle swarm optimization (PSO)
    Opis:
    This paper proposes a modified particle swarm optimization (PSO) algorithm that can be used to solve a variety of fuzzy nonlinear equations, i.e. fuzzy polynomials and exponential equations. Fuzzy nonlinear equations are reduced to a number of interval nonlinear equations using alpha cuts. These equations are then sequentially solved using the proposed methodology. Finally, the membership functions of the fuzzy solutions are constructed using the interval results at each alpha cut. Unlike existing methods, the proposed algorithm does not impose any restriction on the fuzzy variables in the problem. It is designed to work for equations containing both positive and negative fuzzy sets and even for the cases when the support of the fuzzy sets extends across 0, which is a particularly problematic case.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 2; 103-110
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An arma type pi-sigma artificial neural network for nonlinear time series forecasting
    Autorzy:
    Akdeniz, E.
    Egrioglu, E.
    Bas, E.
    Yolcu, U.
    Powiązania:
    https://bibliotekanauki.pl/articles/91816.pdf
    Data publikacji:
    2018
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    high order artificial neural networks
    pi-sigma neural network, forecasting
    recurrent neural network
    particle swarm optimization (PSO)
    Opis:
    Real-life time series have complex and non-linear structures. Artificial Neural Networks have been frequently used in the literature to analyze non-linear time series. High order artificial neural networks, in view of other artificial neural network types, are more adaptable to the data because of their expandable model order. In this paper, a new recurrent architecture for Pi-Sigma artificial neural networks is proposed. A learning algorithm based on particle swarm optimization is also used as a tool for the training of the proposed neural network. The proposed new high order artificial neural network is applied to three real life time series data and also a simulation study is performed for Istanbul Stock Exchange data set.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 2; 121-132
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Using particle swarm optimization to accurately identify syntactic phrases in free text
    Autorzy:
    Tambouratzis, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/91802.pdf
    Data publikacji:
    2018
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    parsing of natural language
    machine translation
    syntactically-derived phrasing
    particle swarm optimization (PSO)
    PSO
    parameter optimization
    Adaptive PSO
    AdPSO
    Opis:
    The present article reviews the application of Particle Swarm Optimization (PSO) algorithms to optimize a phrasing model, which splits any text into linguistically-motivated phrases. In terms of its functionality, this phrasing model is equivalent to a shallow parser. The phrasing model combines attractive and repulsive forces between neighbouring words in a sentence to determine which segmentation points are required. The extrapolation of phrases in the specific application is aimed towards the automatic translation of unconstrained text from a source language to a target language via a phrase-based system, and thus the phrasing needs to be accurate and consistent to the training data. Experimental results indicate that PSO is effective in optimising the weights of the proposed parser system, using two different variants, namely sPSO and AdPSO. These variants result in statistically significant improvements over earlier phrasing results. An analysis of the experimental results leads to a proposed modification in the PSO algorithm, to prevent the swarm from stagnation, by improving the handling of the velocity component of particles. This modification results in more effective training sequences where the search for new solutions is extended in comparison to the basic PSO algorithm. As a consequence, further improvements are achieved in the accuracy of the phrasing module.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 1; 63-77
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Feature selection using particle swarm optimization in text categorization
    Autorzy:
    Aghdam, M. H.
    Heidari, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/91792.pdf
    Data publikacji:
    2015
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    classification system
    feature selection
    text categorization
    particle swarm optimization (PSO)
    system klasyfikacji
    wybór funkcji
    kategoryzacja tekstu
    optymalizacja rojem cząstek
    Opis:
    Feature selection is the main step in classification systems, a procedure that selects a subset from original features. Feature selection is one of major challenges in text categorization. The high dimensionality of feature space increases the complexity of text categorization process, because it plays a key role in this process. This paper presents a novel feature selection method based on particle swarm optimization to improve the performance of text categorization. Particle swarm optimization inspired by social behavior of fish schooling or bird flocking. The complexity of the proposed method is very low due to application of a simple classifier. The performance of the proposed method is compared with performance of other methods on the Reuters-21578 data set. Experimental results display the superiority of the proposed method.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 4; 231-238
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Repulsive self - adaptive acceleration particle swarm optimization approach
    Autorzy:
    Ludwig, S. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91874.pdf
    Data publikacji:
    2014
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    adaptive Particle Swarm Optimization
    adaptive PSO
    optimization
    Repulsive Self-adaptive Acceleration PSO
    RSAPSO
    velocity weights
    optimal solution of the problem
    function evaluations
    Opis:
    Adaptive Particle Swarm Optimization (PSO) variants have become popular in recent years. The main idea of these adaptive PSO variants is that they adaptively change their search behavior during the optimization process based on information gathered during the run. Adaptive PSO variants have shown to be able to solve a wide range of difficult optimization problems efficiently and effectively. In this paper we propose a Repulsive Self-adaptive Acceleration PSO (RSAPSO) variant that adaptively optimizes the velocity weights of every particle at every iteration. The velocity weights include the acceleration constants as well as the inertia weight that are responsible for the balance between exploration and exploitation. Our proposed RSAPSO variant optimizes the velocity weights that are then used to search for the optimal solution of the problem (e.g., benchmark function). We compare RSAPSO to four known adaptive PSO variants (decreasing weight PSO, time-varying acceleration coefficients PSO, guaranteed convergence PSO, and attractive and repulsive PSO) on twenty benchmark problems. The results show that RSAPSO achives better results compared to the known PSO variants on difficult optimization problems that require large numbers of function evaluations.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2014, 4, 3; 189-204
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies