Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Journal of Robotics and Control (JRC)

Optimizing Mobile Robot Path Planning with a Hybrid Crocodile Hunting and Falcon Optimization Algorithm Hashim, Wassan Adnan; Ahmed, Saadaldeen Rashid; Mahmood, Mohammed Thakir; Almaiah, Mohammed Amin; Shehab, Rami; AlAli, Rommel
Journal of Robotics and Control (JRC) Vol. 6 No. 2 (2025)
Publisher : Universitas Muhammadiyah Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18196/jrc.v6i2.25586

Abstract

Thorough path planning is critical in unmanned ground vehicle control to reduce path length, computational time, and the number of collisions. This paper aims to introduce a new metaheuristic method called the Hybrid Crocodile Hunting-SearcH and Falcon Optimization (CHS-FO) algorithm. This method combines CHS's exploration and exploitation abilities with FO's rapid convergence rate. In this way, the use of both metaheuristic techniques limits the disadvantage of the individual approach, guaranteeing a high level of both global and local search. We conduct several simulations to compare the performance of the CHS-FO algorithm with conventional algorithms such as A* and Genetic Algorithms (GA). It is found The results show that the CHS-FO algorithm performs 30–50% better in terms of computation time, involves shorter path planning, and improves obstacle avoidance. Eristic also suggests that the path generation algorithm can adapt to environmental constraints and be used in real-world scenarios, such as automating product movement in a warehouse or conducting search and rescue operations for lost vehicles. The primary The proposed CHS-FO architecture makes the robot more independent and better at making choices, which makes it a good choice for developing the next generation of mobile robotic platforms. Goals will encompass the improvement of the algorithm's scalability for use in multiple robots, as well as the integration of the algorithm in a real environment in real time.
Investigating Quantum-Resilient Security Mechanisms for Flying Ad-Hoc Networks (FANETs) Abbood, Abdulnasser AbdulJabbar; AL-Shammri, Faris K.; Alzamili, Zainab Marid; Al-Shareeda‬‏, ‪Mahmood A.; Almaiah, Mohammed Amin; AlAli, Rommel
Journal of Robotics and Control (JRC) Vol. 6 No. 1 (2025)
Publisher : Universitas Muhammadiyah Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18196/jrc.v6i1.25351

Abstract

Flying Ad Hoc Networks (FANETs) are indispensable in applications such as Surveillance, Disaster response missions, and Military operations. Both security and communication efficiency must meet certain requirements. However, their effectiveness is hobbled by dynamic topologies, resource constraints, and cyber threats. Therefore, Post-Quantum Cryptography (PQC) is necessary. Classical algorithms and current PQC schemes for FANETs have been discussed in this thesis, including cryptographic solutions that are lightweight enough for resourceconstrained environments. The numerical results of the experiment show that while lattice-based cryptography involves minimal risk of breaches, its power consumption is 25% higher than that for other systems and its processing time 30% slower. In contrast, multivariate polynomial cryptography is better on metrics like usage of electricity: only 10% more power consumed energywise and 15% more CPU cycles needed for processing. The introduction of PQC algorithms and architectures resulted in a 5–10% reduction in network throughput and increased latency to 20% in some scenarios. The results show that hybrid cryptographic systems—combining classical with PQC techniques— have the potential to achieve both high efficiency and long-term security. Case studies have validated the feasibility of tailored quantum-safe algorithms in FANETs, which can offer considerable security benefits while standing rigorous scrutiny in terms of scalability and computational performance on dynamic, missioncritical operations.