{'fraction_non_alphanumeric': 0.022658610271903322, 'fraction_numerical': 0.0, 'mean_word_length': 5.76530612244898, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Versatility of Particle Swarm Optimization in identification for continuous-time systems

This paper shows the versatility of the Particle Swarm Optimization, which attracts a lot of attention recently in the evolutionary computation area due to its empirical evidence of its superiority, in the area of continuous-time system identification. First, a method to identify (possibly nonlinear) continuous-time systems is shown, which uses the Particle Swarm Optimization to minimize the mean square prediction error. Second, its effectiveness is demonstrated through various numerical examples which include time-delay systems, closed loop ones and nonlinear ones.