DSpace Repository

A Fuzzy Gain-Based Dynamic Ant Colony Optimization for Path Planning in Dynamic Environments

Show simple item record

dc.contributor.author Viswanathan, Sangeetha
dc.date.accessioned 2024-10-26T06:38:41Z
dc.date.available 2024-10-26T06:38:41Z
dc.date.issued 2021-01
dc.identifier.uri https://www.mdpi.com/2073-8994/13/2/280
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16194
dc.description.abstract Path planning can be perceived as a combination of searching and executing the optimal path between the start and destination locations. Deliberative planning capabilities are essential for the motion of autonomous unmanned vehicles in real-world scenarios. There is a challenge in handling the uncertainty concerning the obstacles in a dynamic scenario, thus requiring an intelligent, robust algorithm, with the minimum computational overhead. In this work, a fuzzy gain-based dynamic ant colony optimization (FGDACO) for dynamic path planning is proposed to effectively plan collision-free and smooth paths, with feasible path length and the minimum time. The ant colony system’s pheromone update mechanism was enhanced with a sigmoid gain function for effective exploitation during path planning. Collision avoidance was achieved through the proposed fuzzy logic control. The results were validated using occupancy grids of variable size, and the results were compared against existing methods concerning performance metrics, namely, time and length. The consistency of the algorithm was also analyzed, and the results were statistically verified. en_US
dc.language.iso en en_US
dc.publisher MDPI en_US
dc.subject Computer Science en_US
dc.subject Ant colony optimization en_US
dc.subject Collision avoidance en_US
dc.subject Dynamic environment en_US
dc.subject Sigmoidal function en_US
dc.title A Fuzzy Gain-Based Dynamic Ant Colony Optimization for Path Planning in Dynamic Environments en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account