758 research outputs found

    New Approaches in Cognitive Radios using Evolutionary Algorithms

    Get PDF
    Cognitive radio has claimed a promising technology to exploit the spectrum in an ad hoc network. Due many techniques have become a topic of discussion on cognitive radios, the aim of this paper was developed a contemporary survey of evolutionary algorithms in Cognitive Radio. According to the art state, this work had been collected the essential contributions of cognitive radios with the particularity of base they research in evolutionary algorithms. The main idea was classified the evolutionary algorithms and showed their fundamental approaches. Moreover, this research will be exposed some of the current issues in cognitive radios and how the evolutionary algorithms will have been contributed. Therefore, current technologies have matters presented in optimization, learning, and classification over cognitive radios where evolutionary algorithms can be presented big approaches. With a more comprehensive and systematic understanding of evolutionary algorithms in cognitive radios, more research in this direction may be motivated and refined

    AquaHet-PSO: An Informative Path Planner for a Fleet of Autonomous Surface Vehicles with Heterogeneous Sensing Capabilities based on Multi-Objective PSO

    Get PDF
    This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivativesThe importance of monitoring and evaluating the quality of water resources has significantly grown over time. To achieve this effectively, an option is to employ an intelligent monitoring system capable of measuring the physical and chemical parameters of water. Surface vehicles equipped with sensors for measuring water quality parameters offer a viable solution for these missions. This work presents a novel approach called AquaHet-PSO, which addresses the challenge of simultaneously monitoring multiple water quality parameters with several peaks of contamination using a heterogeneous fleet of autonomous surface vehicles. Each vehicle in the fleet possesses a different set of sensors, such as number of sensors and sensor types, which is the definition provided by the authors for a heterogeneous fleet. The AquaHet- PSO consists of three main phases. In the initial phase, the vehicles traverse the water resource to obtain preliminary models of water quality parameters. These models are then utilized in the second phase to identify potential contamination areas and assign vehicles to specific action zones. In the final phase, the vehicles focus on a comprehensive characterization of the parameters. The proposed system combines several techniques, including Particle Swarm Optimization and Gaussian Processes, with the integration of genetic algorithm to maximize the distances between the initial positions of vehicles equipped with identical sensors, and a distributed communication system in the final phase of the AquaHet-PSO. Simulation results in the Ypacarai lake demonstrate the effectiveness and efficiency of AquaHet-PSO in generating accurate water quality models and detecting contamination peaks. The proposed method demonstrated improvements compared to the lawnmower approach. It achieved a remarkable 17% improvement, on r-squared data, in generating complete models of water quality parameters throughout the lake. In addition, it achieved a 230% improvement in accurate characterization of high pollution areas and a 24% increase in pollution peak detection specifically for heterogeneous fleets equipped with four or more identical sensors.Ministerio de Ciencia e Innovación PID2021-126921OB-C21 TED2021-131326BC21Universidad de Sevill

    Ontology Alignment using Biologically-inspired Optimisation Algorithms

    Get PDF
    It is investigated how biologically-inspired optimisation methods can be used to compute alignments between ontologies. Independent of particular similarity metrics, the developed techniques demonstrate anytime behaviour and high scalability. Due to the inherent parallelisability of these population-based algorithms it is possible to exploit dynamically scalable cloud infrastructures - a step towards the provisioning of Alignment-as-a-Service solutions for future semantic applications

    Novel Resource Allocation Algorithm for TV White Space Networks Using Hybrid Firefly Algorithm

    Get PDF
    There is continued increased demand for dynamic spectrum access of TV White Spaces (TVWS) due to growing need for wireless broadband. Some of the use cases such as cellular (2G/3G/4G/5G) access to TVWS may have a high density of users that want to make use of TVWS. When there is a high of density secondary users (SUs) in a TVWS network, there is possibility of high interference among SUs that exceeds the desired threshold and also harmful interference to primary users (PUs). Optimization of resource allocation (power and spectrum allocation) is therefore necessary so as to protect the PUs against the harmful interference and to reduce the level of interference among SUs. In this paper, a novel and improved resource allocation algorithm based on hybrid firefly algorithm, genetic algorithm  and particle swarm optimization (FAGAPSO) has been designed and applied for joint power and spectrum allocation. Computer simulations have been done using Matlab to validate the performance of the proposed algorithm.   Simulation results show that compared to firefly algorithm (FA), particle swarm optimization (PSO) and genetic algorithm (GA), the algorithm improves the PU SINR, SU sum throughput and SU signal to interference noise (SINR) ratio in a TVWS network. Only one algorithm considered (SAP) has better PU SINR, SU sum throughput and SU signal to interference noise (SINR) ratio in a TVWS network but it has poor running time

    Optimal control problems solved via swarm intelligence

    Get PDF
    Questa tesi descrive come risolvere problemi di controllo ottimo tramite swarm in telligence. Grande enfasi viene posta circa la formulazione del problema di controllo ottimo, in particolare riguardo a punti fondamentali come l’identificazione delle incognite, la trascrizione numerica e la scelta del risolutore per la programmazione non lineare. L’algoritmo Particle Swarm Optimization viene preso in considerazione e la maggior parte dei problemi proposti sono risolti utilizzando una formulazione differential flatness. Quando viene usato l’approccio di dinamica inversa, il problema di ottimo relativo ai parametri di trascrizione è risolto assumendo che le traiettorie da identificare siano approssimate con curve B-splines. La tecnica Inverse-dynamics Particle Swarm Optimization, che viene impiegata nella maggior parte delle applicazioni numeriche di questa tesi, è una combinazione del Particle Swarm e della formulazione differential flatness. La tesi investiga anche altre opportunità di risolvere problemi di controllo ottimo tramite swarm intelligence, per esempio usando un approccio di dinamica diretta e imponendo a priori le condizioni necessarie di ottimalitá alla legge di controllo. Per tutti i problemi proposti, i risultati sono analizzati e confrontati con altri lavori in letteratura. Questa tesi mostra quindi the algoritmi metaeuristici possono essere usati per risolvere problemi di controllo ottimo, ma soluzioni ottime o quasi-ottime possono essere ottenute al variare della formulazione del problema.This thesis deals with solving optimal control problems via swarm intelligence. Great emphasis is given to the formulation of the optimal control problem regarding fundamental issues such as unknowns identification, numerical transcription and choice of the nonlinear programming solver. The Particle Swarm Optimization is taken into account, and most of the proposed problems are solved using a differential flatness formulation. When the inverse-dynamics approach is used, the transcribed parameter optimization problem is solved assuming that the unknown trajectories are approximated with B-spline curves. The Inverse-dynamics Particle Swarm Optimization technique, which is employed in the majority of the numerical applications in this work, is a combination of Particle Swarm and differential flatness formulation. This thesis also investigates other opportunities to solve optimal control problems with swarm intelligence, for instance using a direct dynamics approach and imposing a-priori the necessary optimality conditions to the control policy. For all the proposed problems, results are analyzed and compared with other works in the literature. This thesis shows that metaheuristic algorithms can be used to solve optimal control problems, but near-optimal or optimal solutions can be attained depending on the problem formulation

    A dynamic multi-objective evolutionary algorithm based on decision variable classification

    Get PDF
    The file attached to this record is the author's final peer reviewed version.In recent years, dynamic multi-objective optimization problems (DMOPs) have drawn increasing interest. Many dynamic multi-objective evolutionary algorithms (DMOEAs) have been put forward to solve DMOPs mainly by incorporating diversity introduction or prediction approaches with conventional multi-objective evolutionary algorithms. Maintaining good balance of population diversity and convergence is critical to the performance of DMOEAs. To address the above issue, a dynamic multi-objective evolutionary algorithm based on decision variable classification (DMOEA-DVC) is proposed in this study. DMOEA-DVC divides the decision variables into two and three different groups in static optimization and change response stages, respectively. In static optimization, two different crossover operators are used for the two decision variable groups to accelerate the convergence while maintaining good diversity. In change response, DMOEA-DVC reinitializes the three decision variable groups by maintenance, prediction, and diversity introduction strategies, respectively. DMOEA-DVC is compared with the other six state-of-the-art DMOEAs on 33 benchmark DMOPs. Experimental results demonstrate that the overall performance of the DMOEA-DVC is superior or comparable to that of the compared algorithms

    Living analytics methods for the social web

    Get PDF
    [no abstract
    corecore