You are given a N×NN×N 2D grid representing possible quantum states, where each cell contains a 32-bit unsigned integer. Your task is to find a continuous path from the top-left (0,0) to bottom-right (...

I was reading the paper Beam-Stack Search: Integrating Backtracking with Beam Search by Rong Zhou and Eric A. Hansen and I was attempting to implement it in Java (see PathFinding.java repository in ...

Recently, I developed a MATLAB-based simulation to evaluate my robot pathfinding algorithm. The robots operate on a network of unidirectional tracks, where each robot computes a single path from its ...

I need to pathfind an agent in a uniform 3D grid (Minecraft) of dimensions 160x128x160. The agent can move freely (flying, no gravity). What's unique about this problem is that for each column in the ...

I have forked PathFinding.js and have added the IDDFS pathfinder. (It is based on this Java implementation.) I followed some arbitrary guidelines and made it visible in the visual/index.html, yet it ...

I'm working on a Hex game AI that uses the alpha-beta pruning algorithm, and as part of evaluating the board state. More detailed information about this distance metric can be found in this paper (see ...

I've been trying to create an app that uses driving navigation, but when trying to find how to get from one point to another (defined with latitude and longitude) using osmnx pathfinding, it looks ...

I am working on an implementation of the Anytime Dynamic A* algorithm as described here. I am ~50% of the way through an initial, basic implementation but am stuck at the following line: In the ...

I'm developing my own pathfinding algorithm for a 2D grid-based game in Unity 2D, and I've run into an issue affecting how enemies navigate toward their target. Problem Currently, when an enemy ...

I'm trying to make path finder, but I can't fix it to work both at the same time: not cutting corners going diagonal when it's the only way to go or it's necessary My current code is: def heuristic(...

It is alleged that the standard BFS can be extended to output all possible shortest paths between two given vertices in a directed unweighted graph (without loops? it does not seem to matter whether ...

I am modeling people commuting using different transportation methods: walking, biking, and driving. I use nw:path-to to find the shortest path between their home and work and then move them along the ...

I am looking for a pathfinding algorithm that has a few properties: Speed is very necessary, and once a goal is selected a suboptimal path needs to be made quickly, and then can be improved upon ...

I am trying to create a path planning algorithm for a robotic mower to cut all the grass in a defined area while avoiding obstacles or restricted areas. I am using the Python Shapely library to define ...

I have an NxM grid of square cells. traversal can only happen in North, South, East and West directions in the cells. Some of the cells are blocked and cannot be traversed. A bot is given a start and ...