A Preliminary Report on the Utilization of PSO for Solving the Hamiltonian Systems

When one uses the Pontryagin’s Maximum Principle for solving fixed-time and fixedendpoint optimal control problems, one will face a Hamiltonian system. The Hamiltonian system consists of a pair of differential equations. The first equation is equipped with initial and final condition, but the second one lacks any boundary conditions. Thus, in most cases, one cannot solve this problem directly. This is a classic difficulty for using the maximum principle. We will proposed a new method for overcoming this difficulty here. This method utilizes an algorithm called Particle Swarm Optimization or PSO. At the end this paper will present some numerical result

Uncovering the social interaction network in swarm intelligence algorithms

This is the final version. Available from the publisher via the DOI in this record.Swarm intelligence is the collective behavior emerging in systems with locally interacting components. Because of their self-organization capabilities, swarm-based systems show essential properties for handling real-world problems, such as robustness, scalability, and flexibility. Yet, we fail to understand why swarm-based algorithms work well, and neither can we compare the various approaches in the literature. The absence of a common framework capable of characterizing these several swarm-based algorithms, transcending their particularities, has led to a stream of publications inspired by different aspects of nature without a systematic comparison over existing approaches. Here we address this gap by introducing a network-based framework—the swarm interaction network—to examine computational swarm-based systems via the optics of the social dynamics. We investigate the structure of social interaction in four swarm-based algorithms, showing that our approach enables researchers to study distinct algorithms from a common viewpoint. We also provide an in-depth case study of the Particle Swarm Optimization, revealing that different communication schemes tune the social interaction in the swarm, controlling the swarm search mode. With the swarm interaction network, researchers can study swarm algorithms as systems, removing the algorithm particularities from the analyses while focusing on the structure of the swarm social interaction

Estratégias de Atualização de Políticas para a Coordenação de Agentes Baseados em Enxames

Neste artigo é analisada a influência dos parâmetros de aprendizagem de algoritmos de enxames e propostas estratégias de atualização de políticas geradas por recompensas (feromônios) para ambientes dinâmicos. Nós verificamos que quando os parâmetros de algoritmos baseados em recompensas são ajustados inadequadamente pode ocorrer atrasos no aprendizado e convergência para uma solução não-satisfatória. Além disso, esse problema é agravado em ambientes dinâmicos, pois o ajuste dos parâmetros de tais algoritmos não é suficiente para garantir convergência. Para solucionar tal problema, nós desenvolvemos estratégias que modificam valores de feromônio, melhorando a coordenação entre os agentes e permitindo convergência mesmo quando o ambiente é alterado dinamicamente. Para isso, um framework capaz de demonstrar de maneira iterativa a influência dos parâmetros e das estratégias foi desenvolvido. Resultados experimentais mostram que é possível acelerar a convergência para uma política global consistente, superando os resultados de abordagens clássicas de algoritmos baseados em enxames