GitHub

BMSSP (Python) — Bounded Multi-Source Shortest Path

An efficient and faithful Python implementation of the Bounded Multi-Source Shortest Path (BMSSP) algorithm, along with baselines using pure-Python Dijkstra and SciPy-accelerated Dijkstra. This ...
IEEE

Optimizing Dijkstra’s Algorithm: Enhancing Pathfinding Efficiency Through Heuristics and Structural Techniques

Abstract: Dijkstra’s shortest path algorithm is a fundamental graph search method widely used in domains such as navigation, robotics, gaming, and network routing. However, its performance can degrade ...
IEEE

Extended Dijkstra Algorithm in Path Planning for Vision Based Patrol Robot

Abstract: In the recent years, Global positioning system (GPS) has worked with Global Navigation Satellite System (GNSS) to provide higher accuracy quality of locating a device. However, this ...
GitHub

p-sarikas/quadrotor-planning-and-decision-making

This repository contains all the code used for group 3's final project for Planning and Decision Making (RO470005) course. While most of the code is developed by us, we have a significant amount of ...