Quantum-inspired firefly algorithm integrated with cuckoo search for optimal path planning

Author(s):  
Harish Kundra ◽  
Wasim Khan ◽  
Meenakshi Malik ◽  
Kantilal Pitambar Rane ◽  
Rahul Neware ◽  
...  

The firefly algorithm and cuckoo search are the meta-heuristic algorithms efficient to determine the solution for the searching and optimization problems. The current work proposes an integrated concept of quantum-inspired firefly algorithm with cuckoo search (IQFACS) that adapts both algorithms’ expedient attributes to optimize the solution set. In the IQFACS algorithm, the quantum-inspired firefly algorithm (QFA) ensures the diversification of fireflies-based generated solution set using the superstitions quantum states of the quantum computing concept. The cuckoo search (CS) algorithm uses the Lévy flight attribute to escape the QFA from the premature convergence and stagnation stage more effectively than the quantum principles. Here, the proposed algorithm is applied for the application of optimal path planning. Before using the proposed algorithm for path planning, the algorithm is tested on different optimization benchmark functions to determine the efficacy of the proposed IQFACS algorithm than the firefly algorithm (FA), CS, and hybrid FA and CS algorithm. Using the proposed IQFACS algorithm, path planning is performed on the satellite images with vegetation as the focused region. These satellite images are captured from Google Earth and belong to the different areas of India. Here, satellite images are converted into morphologically processed binary images and considered as maps for path planning. The path planning process is also executed with the FA, CS, and QFA algorithms. The performance of the proposed algorithm and other algorithms are accessed with the evaluation of simulation time and the number of cycles to attain the shortest path from defined source to destination. The error rate measure is also incorporated to analyze the overall performance of the proposed IQFACS algorithm over the other algorithms.

2019 ◽  
Vol 16 (9) ◽  
pp. 3717-3727
Author(s):  
Monica Sood ◽  
Sahil Verma ◽  
Vinod Kumar Panchal ◽  
Kavita

The planning of optimal path is an important research domain due to vast applications of optimal path planning in the robotics, simulation and modeling, computer graphics, virtual reality estimation and animation, and bioinformatics. The optimal path planning application demands to determine the collision free shortest and optimal path. There can be numerous possibilities that to find the path with optimal length based on different types of available obstacles during the path and different types of workspace environment. This research work aims to identify the optimum path from the initial source-point to final point for the unknown workspace environment consists of static obstacles. For this experimentation, swarm intelligence based hybrid concepts are considered as the work collaboration and intelligence behavior of swarm agents provides the resourceful solution of NP hard problems. Here, the hybridization of concepts makes the solution of problem more efficient. Among swarm intelligence concepts, cuckoo search (CS) algorithm is one of the efficient algorithms due to clever behavior and brood parasitic property of cuckoo birds. In this research work, two hybrid concepts are proposed. First algorithm is the hybridized concept of cuckoo search with bat algorithm (BA) termed as CS-BAPP. Another algorithm is the hybridized concept of cuckoo search with firefly algorithm (FA) termed as CS-FAPP. Both algorithms are initially tested on the benchmarks functions and applied to the path planning problem. For path planning, a real time dataset area of Alwar region situated at Rajasthan (India) is considered. The selected region consists of urban and dense vegetation land cover features. The results for the optimal path planning on Alwar region are assessed using the evaluation metrics of minimum number of iterations, error rate, success rate, and simulation time. Moreover, the results are also compared with the individual FA, BA, and CS along with the comparison of hybrid concepts.


2018 ◽  
Vol 7 (4.12) ◽  
pp. 30
Author(s):  
Monica Sood ◽  
Dr. Sahil Verma ◽  
Vinod Kumar Panchal ◽  
Dr. Kavita

Path planning is key research topic in the field of robotics research, transportation, bioinformatics, virtual prototype designing, gaming, computer aided designs, and virtual reality estimation. In optimal path planning, it is important to determine the collision free optimal and shortest path. There may be various aspects to determine the optimal path based on workspace environment and obstacle types. In this research work, optimal path is determined based on the workspace environment having static obstacles and unknown environment area. A hybrid approach of meta-heuristic algorithm of Bat Algorithm (BA) and Cuckoo Search (CS) is used to determine the optimal path from defined source to destination. For experimentation, case study area of Alwar region, Rajasthan is considered which consist of urban and vegetation area. The reason for the selection of BA and CS for the path planning is the wide application and success of implementation of these concepts in the field of robotics and path planning. The consideration of individual BA for path planning can lead to problem of trapping between local optima. This obligates us to hybridize the concept of BA with some other efficient problem solving concept like CS. The hybridized concept of BA and CS is initially tested with standard benchmarks functions, after that considered for the application of path planning. Results of hybrid path planning concept are compared with individual CS and BA concepts in terms of simulation time and minimum number of iteration required to achieve the optimal path from defined source to destination. The evaluated results comparison of hybrid approach with individual concepts indicates the dominance of proposed hybrid concept in terms of standard benchmarks functions and other parameters as well.  


2018 ◽  
Vol 133 ◽  
pp. 510-517 ◽  
Author(s):  
Mbl Saraswathi ◽  
Gunji Bala Murali ◽  
B.B.V.L. Deepak

Procedia CIRP ◽  
2021 ◽  
Vol 96 ◽  
pp. 324-329
Author(s):  
Frederik Wulle ◽  
Max Richter ◽  
Christoph Hinze ◽  
Alexander Verl

Author(s):  
Ahmed Barnawi ◽  
Prateek Chhikara ◽  
Rajkumar Tekchandani ◽  
Neeraj Kumar ◽  
Mehrez Boulares

Sign in / Sign up

Export Citation Format

Share Document