Computationally Efficient Stochastic Algorithm Supported by Deterministic Technique: A Futuristic Approach
| dc.contributor.author | Gul, Faiza | |
| dc.contributor.author | Mir, Imran | |
| dc.contributor.author | Almohamad, Tarik Adnan | |
| dc.date.accessioned | 2024-09-29T16:03:28Z | |
| dc.date.available | 2024-09-29T16:03:28Z | |
| dc.date.issued | 2023 | |
| dc.department | Karabük Üniversitesi | en_US |
| dc.description.abstract | The challenge of creating a map of the territory solely based on information collected from one or more sensors without any prior knowledge is addressed by simultaneous localization and mapping. Most of the time, a human operator controls the robot, but certain systems can navigate autonomously while mapping; this process is known as active simultaneous localization and mapping. The locomotion mechanism is frequently the primary design consideration for Exploration Robots because of the difficult conditions in which they are typically deployed. Strategies for locomotion that are based on biological systems are frequently advantageous. A common focus is on overall platform design and system integration to build robots that can endure harsh settings long enough to complete their tasks. The aim of the paper is to present the integration of the deterministic method (MAE) with the biologically inspired method for robotic space exploration purposes. The method is called the Multi-Agent Exploration Adaptive Aquila Optimizer (MAE-AAO). The occupancy grid is used as a map for exploration. The algorithms run by first calculating the cost & utility values of all the adjacent surrounding cells of the agent. To increase the rate of exploration, adaptive aquila is used. Upon comparing with other contemporary algorithms, the proposed method outshines in terms of rate of exploration, execution time, and number of aborted simulation runs. The proposed algorithm offers an average of 98% exploration rate with a mean time of only 29 seconds. The method has another distinct feature: zero failed simulation runs, which is the added advantage in the exploration rate. | en_US |
| dc.identifier.doi | 10.1109/ACCESS.2023.3300037 | |
| dc.identifier.endpage | 85965 | en_US |
| dc.identifier.issn | 2169-3536 | |
| dc.identifier.scopus | 2-s2.0-85166745286 | en_US |
| dc.identifier.scopusquality | Q1 | en_US |
| dc.identifier.startpage | 85951 | en_US |
| dc.identifier.uri | https://doi.org/10.1109/ACCESS.2023.3300037 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14619/6105 | |
| dc.identifier.volume | 11 | en_US |
| dc.identifier.wos | WOS:001051646300001 | en_US |
| dc.identifier.wosquality | Q2 | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Ieee-Inst Electrical Electronics Engineers Inc | en_US |
| dc.relation.ispartof | Ieee Access | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Multi-agent | en_US |
| dc.subject | space exploration | en_US |
| dc.subject | meta-heuristic | en_US |
| dc.subject | bio-inspired | en_US |
| dc.title | Computationally Efficient Stochastic Algorithm Supported by Deterministic Technique: A Futuristic Approach | en_US |
| dc.type | Article | en_US |
