Bahareh Nakisa

A SURVEY: PARTICLE SWARM OPTIMIZATION BASED ALGORITHMS TO SOLVE PREMATURE CONVERGENCE PROBLEM

Particle Swarm Optimization (PSO) is a biologically inspired computational search and optimization method based on the social behaviors of birds flock ing or fish schooling. Although PSO is represented in solving many well-known numerical test problems, but it suffers from the premature convergence. A number of basic variations have been developed due to solve the premature convergence problem and improve quality of solution founded by the PSO. Thi s study presents a comprehensive survey of the various PSO-based algorithms. As part of this surve y, we include a classification of the approaches an d we identify the main features of each proposal. In the last part of the study, some of the topics with in this field that are considered as promising areas of fut ure research are listed.

Evolutionary computation algorithms for feature selection of EEG-based emotion recognition using mobile sensors

A review of state-of-the-art feature extraction methods from electroencephalogram signals.A new framework using evolutionary algorithms to find the most optimal features set and channels.Comprehensive experimental results based on two public datasets and one newly collected dataset. There is currently no standard or widely accepted subset of features to effectively classify different emotions based on electroencephalogram (EEG) signals. While combining all possible EEG features may improve the classification performance, it can lead to high dimensionality and worse performance due to redundancy and inefficiency. To solve the high-dimensionality problem, this paper proposes a new framework to automatically search for the optimal subset of EEG features using evolutionary computation (EC) algorithms. The proposed framework has been extensively evaluated using two public datasets (MAHNOB, DEAP) and a new dataset acquired with a mobile EEG sensor. The results confirm that EC algorithms can effectively support feature selection to identify the best EEG features and the best channels to maximize performance over a four-quadrant emotion classification problem. These findings are significant for informing future development of EEG-based emotion classification because low-cost mobile EEG sensors with fewer electrodes are becoming popular for many new applications.

A Hybrid of Modified PSO and Local Search on a Multi-robot Search System

Particle swarm optimization (PSO), a new population-based algorithm, has recently been used on multi-robot systems. Although this algorithm is applied to solve many optimization problems as well as multi-robot systems, it has some drawbacks when it is applied on multi-robot search systems to find a target in a search space containing big static obstacles. One of these defects is premature convergence. This means that one of the properties of basic PSO is that when particles are spread in a search space, as time increases they tend to converge in a small area. This shortcoming is also evident on a multi-robot search system, particularly when there are big static obstacles in the search space that prevent the robots from finding the target easily; therefore, as time increases, based on this property they converge to a small area that may not contain the target and become entrapped in that area. Another shortcoming is that basic PSO cannot guarantee the global convergence of the algorithm. In other words, initially particles explore different areas, but in some cases they are not good at exploiting promising areas, which will increase the search time. This study proposes a method based on the particle swarm optimization (PSO) technique on a multi-robot system to find a target in a search space containing big static obstacles. This method is not only able to overcome the premature convergence problem but also establishes an efficient balance between exploration and exploitation and guarantees global convergence, reducing the search time by combining with a local search method, such as A-star. To validate the effectiveness and usefulness of algorithms, a simulation environment has been developed for conducting simulation-based experiments in different scenarios and for reporting experimental results. These experimental results have demonstrated that the proposed method is able to overcome the premature convergence problem and guarantee global convergence.

A Critical Review of Proactive Detection of Driver Stress Levels Based on Multimodal Measurements

Stress is a major concern in daily life, as it imposes significant and growing health and economic costs on society every year. Stress and driving are a dangerous combination and can lead to life-threatening situations, evidenced by the large number of road traffic crashes that occur every year due to driver stress. In addition, the rate of general health issues caused by work-related chronic stress in drivers who work in public and private transport is greater than in many other occupational groups. An in-vehicle warning system for driver stress levels is needed to continuously predict dangerous driving situations and proactively alert drivers to ensure safe and comfortable driving. As a result of the recent developments in ambient intelligence, such as sensing technologies, pervasive devices, context recognition, and communications, driver stress can be automatically detected using multimodal measurements. This critical review investigates the state of the art of techniques and achievements for automatic driver stress level detection based on multimodal sensors and data. In this work, the most widely used data followed by frequent and highly performed selected features to detect driver stress levels are analyzed and presented. This review also discusses key methodological issues and gaps that hinder the implementation of driver stress detection systems and offers insights into future research directions.