Abstract
Dijkstra algorithms are typically used to find the shortest path from a source node to a destination node. It is widely used in various applications due to its reliability and less complexity. This paper presents the extended Dijkstra Algorithm with lower latency and consumes less computing memory intended for implementation in many AGVs networks for effective decentralized task distribution path planning. This paper proposed linear regression normalization across the node network in Dijkstra architecture to reduce computing time and memory consumption. The issue addressed through this optimization focused on reducing the possibilities of collision between AGVs and deadlock. The extended Dijkstra algorithm significantly reduces computing time compared to the traditional Dijkstra algorithm. In addition, the proposed solutions suggest better AGV routing for collision avoidance and deadlock prevention possibilities.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
