Evolving A Diverse Collection of Robot Path Planning Problems

Author(s):  
D.A. Ashlock ◽  
T.W. Manikas ◽  
K. Ashenayi
2019 ◽  
pp. 582-608
Author(s):  
Diego Alexander Tibaduiza Burgos ◽  
Maribel Anaya Vejar

This chapter presents the development and implementation of three approaches that contribute to solving the mobile robot path planning problems in dynamic and static environments. The algorithms include some items regarding the implementation of on-line and off-line situations in an environment with static and mobile obstacles. A first technique involves the use of genetic algorithms where a fitness function and the emulation of the natural evolution are used to find a free-collision path. The second and third techniques consider the use of potential fields for path planning using two different ways. Brief descriptions of the techniques and experimental setup used to test the algorithms are also included. Finally, the results applying the algorithms using different obstacle configurations are presented and discussed.


Author(s):  
Haibin Duan ◽  
Peixin Qiao

Purpose – The purpose of this paper is to present a novel swarm intelligence optimizer — pigeon-inspired optimization (PIO) — and describe how this algorithm was applied to solve air robot path planning problems. Design/methodology/approach – The formulation of threat resources and objective function in air robot path planning is given. The mathematical model and detailed implementation process of PIO is presented. Comparative experiments with standard differential evolution (DE) algorithm are also conducted. Findings – The feasibility, effectiveness and robustness of the proposed PIO algorithm are shown by a series of comparative experiments with standard DE algorithm. The computational results also show that the proposed PIO algorithm can effectively improve the convergence speed, and the superiority of global search is also verified in various cases. Originality/value – In this paper, the authors first presented a PIO algorithm. In this newly presented algorithm, map and compass operator model is presented based on magnetic field and sun, while landmark operator model is designed based on landmarks. The authors also applied this newly proposed PIO algorithm for solving air robot path planning problems.


Author(s):  
Diego Alexander Tibaduiza Burgos ◽  
Maribel Anaya Vejar

This chapter presents the development and implementation of three approaches that contribute to solving the mobile robot path planning problems in dynamic and static environments. The algorithms include some items regarding the implementation of on-line and off-line situations in an environment with static and mobile obstacles. A first technique involves the use of genetic algorithms where a fitness function and the emulation of the natural evolution are used to find a free-collision path. The second and third techniques consider the use of potential fields for path planning using two different ways. Brief descriptions of the techniques and experimental setup used to test the algorithms are also included. Finally, the results applying the algorithms using different obstacle configurations are presented and discussed.


2015 ◽  
Vol 20 (10) ◽  
pp. 4149-4171 ◽  
Author(s):  
Adel Ammar ◽  
Hachemi Bennaceur ◽  
Imen Châari ◽  
Anis Koubâa ◽  
Maram Alajlan

1989 ◽  
Author(s):  
Jerome Barraquand ◽  
Bruno Langlois ◽  
Jean-Claude Latombe

Sign in / Sign up

Export Citation Format

Share Document