Stack Overflow
Stack Overflow

Questions tagged [path-finding]

Pathfinding generally refers to the problem of finding the shortest route between two points, subject to any obstacles. Pathfinding has application in a wide range of areas including robotics and game development. Algorithms for pathfinding tend to be closely related to graph and tree search algorithms.

Pathfinding generally refers to the problem of finding the shortest route between two points, subject to any obstacles. Pathfinding has application in a wide range of areas including robotics and game development. Algorithms for pathfinding tend to be closely related to graph and tree search algorithms.

Significant Literature

External Links

Related Tags

1746 questions
6
votes
2 answers

In pathfinding, what is the difference between DFS and Dijkstra?

I'm studying about DFS and Dijkstra. In my simple test cases, most of them shows that DFS is faster. Passing every nodes costs the same in my test cases. But most people prefer Dijkstra to DFS in pathfinding because Dijkstra is so accurate. So,…
Gengaozo
  • 51
  • 1
  • 3
6
votes
3 answers

Updating Shortest path distances matrix if one edge weight is decreased

We are given a weighed graph G and its Shortest path distance's matrix delta. So that delta(i,j) denotes the weight of shortest path from i to j (i and j are two vertexes of the graph). delta is initially given containing the value of the shortest…
parsa rastegari
  • 61
  • 1
  • 4
6
votes
1 answer

How to include javascript third party library in ionic app?

I am sorry to ask this silly question. I am trying to use pathfinding.js (https://github.com/qiao/PathFinding.js/) in ionic for my navigation.html page (a partial file located in the www/templates/ directory) but it's not working with partials files…
Hardyanto Putra Antoni
  • 577
  • 1
  • 7
  • 25
6
votes
2 answers

Maximum bounty from two paths through a rectangular grid

I am trying to solve problem similar to this problem at GeeksforGeeks, yet different: Given a rectangular 2-d grid with some coin value present in each cell, the task is to start from the top-left and bottom-right corner going right or down, and…
Prashant Bhanarkar
  • 930
  • 3
  • 14
  • 32
6
votes
1 answer

Path-finding through one obstacle (Google Foobar: Prepare the Bunnies' Escape)

I'm having trouble solving a Google Foobar question involving path-finding. My solution fails 2 test cases, the inputs and outputs of which are hidden. The prompt: You have maps of parts of the space station, each starting at a prison exit and…
dcao
  • 81
  • 2
  • 7
6
votes
2 answers

Given a start and goal ,how to find the shortest way in a navigation mesh?

I googled "A* algorithm on navigation mesh" only to get wrong ways to estimate g-values,like this or this By summing up the length of the blue line segments ,we get the g-value ,but it's overestimated (g-value should be underestimated). This…
iouvxz
  • 89
  • 9
  • 27
6
votes
2 answers

3-dimensional jump point search algorithm

Is there an implementation of three-dimensional (or even D-dimensional) jump point search algorithm? Currently I can find only a 2-dimensional one, but I think it possible to formulate the algorithm for higher dimensions.
Tomilov Anatoliy
  • 15,657
  • 10
  • 64
  • 169
6
votes
3 answers

A* pathfinder obstacle collision problem

I am working on a project with a robot that has to find its way to an object and avoid some obstacles when going to that object it has to pick up. The problem lies in that the robot and the object the robot needs to pick up are both one pixel wide…
Cheesebaron
  • 24,131
  • 15
  • 66
  • 118
6
votes
0 answers

Find shortest path on SVG Object

I have an SVG object with a floor map which is made from a creator user and I want to find dynamically the shortest path between 2 points on this object. Dijkstra algorithm is the better solution for finding shortest path into a graph but this…
user3016999
6
votes
4 answers

Heuristic for A*-Algorithm with irregular distances between nodes

I am currently working on an implementation of the A* Algorithm with irregular distances between two nodes. The graph containing the nodes is a directed and weighted graph. Every node is connected to at least one other node, there may also be…
mezzodrinker
  • 998
  • 10
  • 28
6
votes
2 answers

Algorithm that discovers all the fields on a map with as least turns as possible

Let's say I have such map: ##### ..### W.### . is a discovered cell. # is an undiscovered cell. W is a worker. There can be many workers. Each of them can move once per turn. In one turn he can move by one cell in 4 directions (up, right, down or…
Adam Stelmaszczyk
  • 19,665
  • 4
  • 70
  • 110
6
votes
2 answers

Fast visibility graph solver?

I am trying to program a pathfinder on the worlds oceans. I have used an A* algorithm on a cell mesh containing land and water cells previously. But I think that a better solution will be to have continents and islands and polygons; calculate a…
Laetitia
  • 409
  • 5
  • 8
6
votes
1 answer

how to find all the longest paths with cypher query?

I want to write a cypher query which finds all the longest paths among nodes which have relationship with STATUS="on" property with each other,this is what I have done so far: start n=node(*) match p = n-[r:INCLUDE*..]->m with…
fereshteh
  • 499
  • 5
  • 18
6
votes
2 answers

Anyone has implemented SMA* search algorithm?

I find the algorithm description in AIMA (Artificial Intelligence: A Modern Approach) is not correct at all. What does 'necessary' mean? What is the memory limit? The queue size or processed nodes? What if the current node has no children at all? I…
Endy
  • 69
  • 1
  • 2
6
votes
1 answer

A Star Pathfinding Algorithm Heuristic for Cube Surface

I'm building a snake game that plays on the surface of a cube. Currently it uses Dijkstra's algorithm for pathfinding. Despite optimizations with set and priority queue data structures, it is still a bit too slow. You notice the delay when the snake…
Maros
  • 1,825
  • 4
  • 25
  • 56
1 2 3
…
99 100