A New Algorithm Beats Dijkstra's Time For The Shortest Path To Any Point In A Network

Dijkstra's algorithm has long been the quickest way of finding the shortest possible paths in a network, but researchers have ...
IEEE

Multi-UAVs Cooperative Path Planning Based on DPB-SAS Algorithm in Hierarchical Architecture

Abstract: This paper proposes a multi-UAVs coordinated trajectory planning method based on hierarchical planning, aiming to solve the problem of flight path planning and speed adjustment of multi-UAVs ...
IEEE

Research on Path Planning for Power Inspection Robots Based on Improved Adaptive Multi-Modal Ant Colony Optimization Algorithm

Abstract: This paper proposes an adaptive multi-morph ant colony algorithm integrated with genetic algorithms for path planning of intelligent power inspection robots in complex environments. The ...
GitHub

Dynamic Pathfinding in Warehouses using Q-Learning

In this project I have showcased how AI can be used in Amazon, Flipkart, or in any e-commerce wearhouse to manage the orders using AI software in order-picking robots. This project solves a problem ...
GitHub

High-Performance SSSP & APSP Algorithms with OpenMP + CUDA

A research-grade performance study of classic shortest-path algorithms (SSSP & APSP) using Serial, OpenMP (CPU), and CUDA (GPU). This repo includes well-optimized C++ kernels, reproducible Jupyter ...