IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

A Hybrid Fireworks Algorithm to Navigation and Mapping

A Hybrid Fireworks Algorithm to Navigation and Mapping
View Sample PDF
Author(s): Tingjun Lei (Mississippi State University, USA), Chaomin Luo (Mississippi State University, USA), John E. Ball (Mississippi State University, USA)and Zhuming Bi (Purdue University, Fort Wayne, USA)
Copyright: 2020
Pages: 20
Source title: Handbook of Research on Fireworks Algorithms and Swarm Intelligence
Source Author(s)/Editor(s): Ying Tan (Peking University, China)
DOI: 10.4018/978-1-7998-1659-1.ch010

Purchase

View A Hybrid Fireworks Algorithm to Navigation and Mapping on the publisher's website for pricing and purchasing information.

Abstract

In recent years, computer technology and artificial intelligence have developed rapidly, and research in the field of mobile robots has continued to deepen with development of artificial intelligence. Path planning is an essential content of mobile robot navigation of computing a collision-free path between a starting point and a goal. It is necessary for mobile robots to move and maneuver in different kinds of environment with objects and obstacles. The main goal of path planning is to find the optimal path between the starting point and the target position in the minimal possible time. A new firework algorithm (FWA) integrated with a graph theory, Dijkstra's algorithm developed for autonomous robot navigation, is proposed in this chapter. The firework algorithm is improved by a local search procedure that a LIDAR-based local navigator algorithm is implemented for local navigation and obstacle avoidance. The grid map is utilized for real-time intelligent robot mapping and navigation. In this chapter, both simulation and comparison studies of an autonomous robot navigation demonstrate that the proposed model is capable of planning more reasonable and shorter, collision-free paths in non-stationary and unstructured environments compared with other approaches.

Related Content

P. Chitra, A. Saleem Raja, V. Sivakumar. © 2024. 24 pages.
K. Ezhilarasan, K. Somasundaram, T. Kalaiselvi, Praveenkumar Somasundaram, S. Karthigai Selvi, A. Jeevarekha. © 2024. 36 pages.
Kande Archana, V. Kamakshi Prasad, M. Ashok. © 2024. 17 pages.
Ritesh Kumar Jain, Kamal Kant Hiran. © 2024. 23 pages.
U. Vignesh, R. Elakya. © 2024. 13 pages.
S. Karthigai Selvi, R. Siva Shankar, K. Ezhilarasan. © 2024. 16 pages.
Vemasani Varshini, Maheswari Raja, Sharath Kumar Jagannathan. © 2024. 20 pages.
Body Bottom