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
0
votes
0 answers

Finding the right collection or writing my own way?

I am busy building some path-finding. I currently use a Dictionary to hold all points to be evaluated, and then remove them when they are no longer needed. This is quite fast because i can address a point directly when adding and deleting and get…
Smileynator
  • 677
  • 8
  • 24
0
votes
0 answers

LibGDX enemy pathfinding

So, I want to implement AI to my LibGDX 2d platformer game. I have read stuff about A* pathfinding, but I think that if I make an A* pathfinding the performance would be very bad(on android), it is not great already. Then I stumbled upon an article…
user4441930
0
votes
1 answer

Calculate best collection to use in method

I have a search method in my custom A* algorithm. It uses a collection to keep track of what the search is doing. For a set path i know i am doing the following with the collection: Contains 860x (lookup) Remove 91x Add 270x The order or sorting…
Smileynator
  • 677
  • 8
  • 24
0
votes
0 answers

Filter options displayed on another page

I am looking to use Excel to generate reports using a database I have already built. I am wondering if it is possible to be able to filter my data and have my filter options show up on a separate page. This way it can all be done from a control…
0
votes
0 answers

Java/javac not found opensuse

I have installed java jdk-1-7-0 through yast and zypper. I keep seeing things about changing the path but nothing is specific enough for me to fix my issue, I am new to openSUSE and from what I have read there are problems with openSUSE and Java.…
0
votes
2 answers

Pathfinding - StackOverflowError

I have a problem with pathfinding: The start is at 0,0 and the finish as "C" at right bottom corner. It throws an exeption java.lang.StackOverflowError at if(getPath(x, y+1)==true){ return true; } and if(getPath(x, y-1)==true){ …
0
votes
0 answers

Collaborative pathfinding - rigid shape troops staying together while travelling

That's my first question here. Please advice me. Even little help is relevant for me. I'm having trouble thinking of an algorithm about pathfinding. But not normal. There are plenty of algorithms for single units trying to find each other. But what…
TheTobruk
  • 17
  • 4
0
votes
0 answers

3D grid generation for voxel world: data structure and voxelization

I have to implement a path-finding algorithm in a complex 3D environment. My input is a CATIA model which can be exported as stl or stp. After some research, I reckon my best option is to apply A* Path-finding to a voxelised world. I am coding in…
Nic
  • 1,262
  • 2
  • 22
  • 42
0
votes
2 answers

I need to make an AI character that follows the player when they reach a certain distance in C# XNA

Here is the code that I have so far for my game. I am wanting to create an AI character (BlackBall) that will follow the player (WhiteBall) when they are a certain distance away. I have no idea where to start to get this working but it will be a…
Kieren Wells
  • 65
  • 1
  • 6
0
votes
0 answers

Unity avoiding obstacles with pathfinding c#

I have a simple project which includes pathfinding with obstacle avoidance. Now, I have void Steer which steers the object around since the path is not straight. then I have void AvoidObstacles which has raycast and the obstacle avoidance part…
Cerberus
  • 1
  • 3
0
votes
1 answer

Connecting disjoint sets in a 2D array

I am trying to generate a random grid with positions that are Traversable and Non-Traversable and ensure that there is a path from one Traversable position to any other Traversable position in one of the 4 directions {Right, Up, Left, Down}.…
hededo
  • 371
  • 2
  • 16
0
votes
2 answers

check validation for input for perfect maze

I'm working on a project to build a perfect maze. I have a class Maze and a class Cell which represents each square in a maze. In my Cell class, I have four Boolean variable(north, south, east, west) to represent whether there is a wall at north or…
TIANQI QI
  • 9
  • 1
0
votes
0 answers

Is it possible to generate a map from a list of points with distance?

I have got a list of nodes and each node has got a weight. This weight represents the distance from one node to another and it is directed. Is it possible to generate a map similar to a game graph where each of these nodes contains a 2D or 3D…
0
votes
1 answer

How to guarantee that all open nodes are traversable

In a project, I'm currently using A* for finding paths. I first put down my agent. Then I place all of the blockers on any nodes that are free. The agent needs to be able to get to any open node. However, the following situation can happen: A =…
Programmer_D
  • 601
  • 2
  • 15
  • 27
0
votes
2 answers

Will Dijkstra or A* work correctly with cost a function of full path?

What I'm considering is this: when a node becomes the current node, compute "on the fly" the cost to each neighbor, where the cost is a function of the complete path to arrive at the current node. I can't think how this would break the assumptions…
Mastiff
  • 2,101
  • 2
  • 23
  • 38
1 2 3
99
100