Browsing by Author "Yildiz, B."

Now showing 1 - 2 of 2

Citation - WoS: 17
Citation - Scopus: 26
Consensus-Based Virtual Leader Tracking Swarm Algorithm With Gdrrt*-Pso for Path-Planning of Multiple-Uavs
(Elsevier B.V., 2024) Yildiz, B.; Aslan, M.F.; Durdu, A.; Kayabasi, A.
UAV technology is rapidly advancing and widely utilized, particularly in social and military domains, due to its extensive motion and maneuverability. Coordinating multiple UAVs enables more rapid and efficient task execution compared to a single UAV. The proliferation of UAVs across various sectors, including entertainment, transportation, delivery, and social domains, as well as military applications such as surveillance, tracking, and attack, has spurred research in swarm systems. In this study, a new swarm topology is presented by combining the Consensus-Based Virtual Leader Tracking Swarm Algorithm (CBVLTSA), which provides formation control in swarm systems, with the Goal Distance-based Rapidly-Exploring Random Tree with Particle Swarm Optimization (GDRRT*-PSO) route planning algorithm. Recently proposed, GDRRT* is notable for its efficient operation in expansive environments and rapid convergence to the goal. Within this framework, the path generated by GDRRT* is optimized using PSO to yield the shortest current route. CBVLTSA employs a potential push and pull function to facilitate cooperative, coordinated flight among swarm members. While applying pushing force to avoid collisions with each other and obstacles, members also exert pulling force to maintain flight formation while navigating to target points. This ensures controlled flight formation and collision-free traversal along the GDRRT*-PSO route. Consequently, unlike the others, the proposed algorithm achieves faster target reach with pre-planned routes, demonstrating a robust and flexible swarm topology with CBVLTSA. Moreover, we anticipate the significant utility of this algorithm across various swarm applications, including target detection, observation, tracking, trade and transportation logistics, and collective defense and attack strategies. © 2024 Elsevier B.V.
Graph-Based Collision Avoidance Algorithm Among Swarm Agents
(Institute of Electrical and Electronics Engineers Inc., 2023) Durdu, A.; Tuncer, M.; Yildiz, B.
More than one homogenous or heterogenous type unmanned vehicle can work in a coordinated manner and perform large-scale swarm tasks (firefighting, search and rescue, mapping, and military operations, etc.) efficiently in a shorter time by sharing tasks. Collision of these vehicles is among the most significant problems encountered during their work. The crash of the vehicles causes the vehicles to be out of duty and, accordingly, to the mission's failure. In this study, Quadrotor-type UAVs used as agents can go to any target point by receiving location, speed, and compass information with GPS and IMU sensors. In the application, the agents' locations were kept and updated in a list in pairs, similar to the traversing process in the Optimized Bubble Sort Algorithm. The projections of the velocity vectors on the agents' axis (local) on a single coordinate plane are taken to determine the collision situation between these two agents that are traveling instantaneously. These global velocity vectors, whose projections are taken, are re-projected to the edge formed by these two agents in the graph and then subtracted from each other. Suppose the size of the vector is greater than the distance between two agents obtained by any GPS distance algorithm (Pythagoras, Haversine, etc.). In this case, collision is detected, and the separation process is activated. Separation is the process of advancing one agent in the opposite direction of the other until a minimum safe distance is achieved, where one agent entered by the user will not affect the other. Once the separation is complete, the agent moves to the final destination point. © 2023 IEEE.