Dynamic area coverage is widely used in military and civil fields. Improving coverage efficiency is an important research direction for multi-agent dynamic area coverage. In this paper, we focus on the non-optimal coverage problem of free dynamic area coverage algorithms. We propose a distributed dynamic area coverage algorithm based on reinforcement learning and a γ-information map. The γ-information map can transform the continuous dynamic coverage process into a discrete γ point traversal process, while ensuring no-hole coverage. When agent communication covers the whole target area, agents can obtain the global optimal coverage strategy by learning the whole dynamic coverage process. In the event that communication does not cover the whole target area, agents can obtain a local optimal coverage strategy; in addition, agents can use the proposed algorithm to obtain a global optimal coverage path through off-line planning. Simulation results demonstrate that the required time for area coverage with the proposed algorithm is close to the optimal value, and the performance of the proposed algorithm is significantly better than the distributed anti-flocking Algorithms for dynamic area coverage.

The use of electroencephalograms (EEGs) to diagnose and analyses Alzheimer’s disease (AD) has received much attention in recent years. The sample entropy (SE) has been widely applied to the diagnosis of AD. In our study, nine EEGs from 21 scalp electrodes in 3 AD patients and 9 EEGs from 3 age-matched controls are recorded. The calculations show that the kurtoses of the AD patients’ EEG are positive and much higher than that of the controls. This finding encourages us to introduce a kurtosis-based de-noising method. The 21-electrode EEG is first decomposed using independent component analysis (ICA), and second sort them using their kurtoses in ascending order. Finally, the subspace of EEG signal using back projection of only the last five components is reconstructed. SE will be calculated after the above de-noising preprocess. The classifications show that this method can significantly improve the accuracy of SE-based diagnosis. The kurtosis analysis of EEG may contribute to increasing the understanding of brain dysfunction in AD in a statistical way.

The paper proposes a new Kalman filtering (KF) algorithm called VBI-MCKF that combines the variational Bayesian inference (VBI)-based KF algorithm and the maximum correntropy KF (MCKF) for visual tracking problem. The VBI-based KF algorithm works to estimate the unknown measurement noise covariance matrix (MNCM) and process noise covariance matrix (PNCM), and the MCKF works to deal with non-Gaussian process noise and measurement noise. In order to cater for the visual tracking target scenario, where the MNCM and PNCM are unknown and non-Gaussian, we modify the VBI-based KF algorithm to work for suddenly occurring outliers and modify the MCKF work for small bandwidth. Simulations show that the proposed VBI-MCKF algorithm performs well when both covariance matrices of Gaussian process noise and non-Gaussian measurement noise are unknown or inaccurate.