Portada: Infraestructura para la Logística Sustentable 2050
DESTACADO | CPI Propone - Resumen Ejecutivo

Infraestructura para el desarrollo que queremos 2026-2030

Elaborado por el Consejo de Políticas de Infraestructura (CPI), este documento constituye una hoja de ruta estratégica para orientar la inversión y la gestión de infraestructura en Chile. Presenta propuestas organizadas en siete ejes estratégicos, sin centrarse en proyectos específicos, sino en influir en las decisiones de política pública para promover una infraestructura que conecte territorios, genere oportunidades y eleve la calidad de vida de la población.
ARTÍCULO
TITULO

LFA: A Lévy Walk and Firefly-Based Search Algorithm: Application to Multi-Target Search and Multi-Robot Foraging

Ouarda Zedadra    
Antonio Guerrieri and Hamid Seridi    

Resumen

In the literature, several exploration algorithms have been proposed so far. Among these, Lévy walk is commonly used since it is proved to be more efficient than the simple random-walk exploration. It is beneficial when targets are sparsely distributed in the search space. However, due to its super-diffusive behavior, some tuning is needed to improve its performance, specifically when targets are clustered. Firefly algorithm is a swarm intelligence-based algorithm useful for intensive search, but its exploration rate is very limited. An efficient and reliable search could be attained by combining the two algorithms since the first one allows exploration space, and the second one encourages its exploitation. In this paper, we propose a swarm intelligence-based search algorithm called Lévy walk and Firefly-based Algorithm (LFA), which is a hybridization of the two aforementioned algorithms. The algorithm is applied to Multi-Target Search and Multi-Robot Foraging. Numerical experiments to test the performances are conducted on the robotic simulator ARGoS. A comparison with the original firefly algorithm proves the goodness of our contribution.

Artículos similares

Hemos preparados una selección de otros artículos que pudieran ser de tu interés
Hristo Tonchev and Petar Danev    
In this work, the quantum random walk search algorithm with a walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with an arbitrary dimension. Monte Carlo simulations, in combi... ver más
Revista: Algorithms
Guangzhong Liu, Sheng Zhang, Guojie Ma and Yipeng Pan    
In order to solve the problem of many constraints and a complex navigation environment in the path planning of unmanned surface vehicles (USV), an improved sparrow search algorithm combining cubic chaotic map and Gaussian random walk strategy was propose... ver más
Mengmeng Qiao, Zexu Yu, Zhenhai Dou, Yuanyuan Wang, Ye Zhao, Ruishuo Xie and Lianxin Liu    
The reasonable and efficient use of the abundant biomass resources in rural areas has not been realized. Therefore, the concept of a combined cooling, heating, and power (CCHP) microgrid system, considering biomass pyrolysis and gasification, has been de... ver más
Revista: Energies
Jesse T. Richman and Ryan J. Roberts    
Big search data offers the opportunity to identify new and potentially real-time measures and predictors of important political, geographic, social, cultural, economic, and epidemiological phenomena, measures that might serve an important role as leading... ver más
Revista: Forecasting
Majid Almarashi, Wael Deabes, Hesham H. Amin and Abdel-Rahman Hedar    
Simulated annealing is a well-known search algorithm used with success history in many search problems. However, the random walk of the simulated annealing does not benefit from the memory of visited states, causing excessive random search with no divers... ver más
Revista: Algorithms