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
11
votes
1 answer

ActiveMQ Broker Factory Could not find factory class for failover

I am getting this error when trying to create a ActiveMQ broker with the BrokerFactory: java.io.IOException: Could not load failover factory:java.io.IOException: Could not find factory class for resource:…
Tim
  • 189
  • 1
  • 14
10
votes
3 answers

Algorithm for finding distinct paths from A to B in weighted, directed, cyclic graph

Suppose we have a DIRECTED, WEIGHTED and CYCLIC graph. Suppose we are only interested in paths with a total weight of less than MAX_WEIGHT What is the most appropriate (or any) algorithm to find the number of distinct paths between two nodes A and B…
Babak
  • 582
  • 4
  • 14
10
votes
3 answers

How to avoid two NavMeshAgent push away each other in Unity?

In my game, all player and monster characters have a NavMeshAgent component, when one character moves to another, it will push away the second one. I read the unity docs of NavMeshAgent, found the problem is affected by Obstacle Avoidance Type and…
Cosmore
  • 3,193
  • 4
  • 20
  • 22
10
votes
5 answers

how to get the last node in path in neo4j?

In this cypher query,the longest path/paths between nodes which have relationship with STATUS="on" property with each other,will be returned,but I want to get also the last node of the path/paths. query: START n=node(*) MATCH p=n-[rels:INCLUDE*]->m…
fereshteh
  • 499
  • 5
  • 18
10
votes
2 answers

A* Pathfinding over multiple grids

I'm attempting to implement A* pathfinding around a cube, the cube is made up of 6 grids and to keep it simple I have 4 methods GetXPlus, GetXMinus, GetYPlus, GetYMinus. Each method checks to see if the next tile is within the current grid space, if…
Caius Eugene
  • 855
  • 4
  • 13
  • 26
10
votes
3 answers

A star algorithm without diagonal movement

Situation: I'm trying to translate the A* algoritm into c++ code where there is no diagonal movement allowed but I'm having some strange behaviour. My question: Is it needed to also take into account the diagonal cost even when there is no diagonal…
Thomas
  • 1,678
  • 4
  • 24
  • 47
10
votes
4 answers

Is there a way to keep direction priorities in A*? (ie. Generating the same path as breadth-first)

I have an application that would benefit from using A*; however, for legacy reasons, I need it to continue generating exactly the same paths it did before when there are multiple best-paths to choose from. For example, consider this…
BlueRaja - Danny Pflughoeft
  • 84,206
  • 33
  • 197
  • 283
9
votes
5 answers

Basic pathfinding with obstacle avoidance in a continuous 2D space

I'm writing a simulation in which a creature object should be able to move towards some other arbitrary object in the environment, sliding around obstacles rather than doing any intelligent pathfinding. I'm not trying to have it plan a path -- just…
kpozin
  • 25,691
  • 19
  • 57
  • 76
9
votes
2 answers

Polygon based pathfinding

I have implemented a basic grid based A* pathfindinder in Java. I would like to make a navigational mesh/polygon based pathfinder, but the problem I have is this: If I found the orange route then I could use something like a funnel algorithm to…
angrydust
  • 453
  • 3
  • 14
9
votes
2 answers

The D*-Lite algorithm

I'm trying to implement the D*-Lite pathfinding algorithm, as described in the 2002 article by Koenig and Likhachev, for Boost::Graph. I think I've gotten a decent grasp on the basic ideas and theory behind it, but I'm having a problem understanding…
carlpett
  • 12,203
  • 5
  • 48
  • 82
9
votes
1 answer

R - Finding least cost path through raster image (maze)?

How can I find a non-linear path through raster image data? e.g., least cost algorithm? Starting and ending points are known and given as: Start point = (0,0) End point = (12,-5) For example, extract the approximate path of a winding river…
Brian D
  • 2,570
  • 1
  • 24
  • 43
9
votes
1 answer

Python: A* routing from dataframe with longitude and latitude

I have a dataframe with 30,000 records in the following format: ID | Name | Latitude | Longitude | Country | 1 | Hull | 53.744 | -0.3456 | GB | I would like to select one record to be the start location and one record to be the…
brian4342
  • 1,265
  • 8
  • 33
  • 69
9
votes
2 answers

Finding cheapest path on a graph, cost determined by max-weight of used nodes

I have a graph G with a starting node S and an ending node E. What's special with this graph is that instead of edges having costs, here it's the nodes that have a cost. I want to find the way (a set of nodes, W) between S and E, so that max(W) is…
DrPhil
  • 377
  • 1
  • 12
9
votes
4 answers

AI navigation around a 2d map - avoiding obstacles

I know my question seems pretty vague, but I can't think of a better way to put it, so I'll start off by explaining what I'm trying to do. I'm currently working on a project whereby I've been given a map and I'm coding a 'Critter' that should be…
Curt Walker
  • 128
  • 1
  • 5
9
votes
5 answers

C# XNA: AI Engine?

I'm developing a game with zombie running around in a swamp. I want AIs to have functionality like "chase this target" or "run away". A major stumbling block is pathfinding. Is there a good pathfinding/AI engine in XNA, or should I roll my own? Does…
Nick Heiner
  • 119,074
  • 188
  • 476
  • 699
1 2 3
…
99 100