1,776 questions
4
votes
1
answer
309
views
How to make Beam Stack Search optimal and complete
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 ...
- 957
1
vote
0
answers
99
views
Pathfinding in a 3D grid with max 1 obstacle per column
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 ...
2
votes
1
answer
265
views
How to implement a recursive distance function for Hex game AI evaluation?
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 ...
- 45
1
vote
1
answer
38
views
Meaning of "visited" nodes in Anytime Dynamic A*
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 ...
- 45
3
votes
1
answer
88
views
A* algorithm problem when it comes to go through one way diagonal
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(...
- 31
0
votes
2
answers
57
views
How to make turtles follow a path at different speeds in Netlogo?
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 ...
- 19
2
votes
1
answer
138
views
Graph traversal algorithm using shapely geometry points
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 ...
- 43
1
vote
1
answer
54
views
How to manage monster collision range during calculating path by A* algorithm?
Pathfinder by A* algorithm working fine, the smoothing path algorithm is working excellent too.
The problem is: pathfinder grid is not equal to monster hitbox (collision range), the grid size and ...
2
votes
1
answer
109
views
networkx finding shortest path in edge label order
I work for an airport, and my task is to calculate the taxiing routes for airplanes on taxiways, ensuring they follow the prescribed road sequence. Here, I'll give an example and would like to ask if ...
- 176
2
votes
1
answer
103
views
Finding the Optimal Path in a Graph from Start to End with Necessary and Optional Waypoints Under a Cost Constraint [closed]
I am working on a problem involving pathfinding in a weighted graph where I need to travel from a start node to an end node while considering a mix of necessary and optional waypoint nodes. The key ...
- 33
2
votes
1
answer
130
views
Maximum points a round trip can get in a 2D grid
I am developing a snake-like game that involving solving the following problem:
Given an m*n 2D grid, some of the locations are one while other locations are zero. The snake starts at (0,0) and will ...
- 53
0
votes
1
answer
35
views
Navmesh pro objects can't go through 1x1 spaces
In Unity 2D, I am using NavMesh Pro to add pathfinding to my enemies, but now matter how much I experimented with the inspector I couldn't get the enemies to go through 2 blocks that are 1 tile apart. ...
- 1
0
votes
0
answers
47
views
What model can I use to get a dynamic path from one point to another as an output?
I am working on a drone and want to make it autonomous. As a first step, I decided to make a PyTorch algorithm that can output a path from one point to another. To do that, two random points are ...
1
vote
0
answers
43
views
Fitting circles on each end of a prolong region on binary masks to find a path for extrusion
I work on a program to find path for an extruder to fill prolonged regions, represented as white regions on 2D binary masks (mask size 1280x720 px). On a mask, there is always a single region. The ...
0
votes
1
answer
247
views
Best maze solving algorithm when the maze structure is known [duplicate]
I am interested in learning what the best algortihm for finding a way between two points in a grid, while there are walls present, which makes it a maze. Once the maze has been scanned once, and we ...
- 21
2
votes
0
answers
141
views
Are there effective any-angle pathfinding algorithms for infinite weighted grids?
I am developing a game that involves pathfinding on terrain where different surfaces have different movement costs (e.g., snow, mud, etc.). I need an any-angle pathfinding algorithm that works ...
- 21
0
votes
0
answers
55
views
Ensure basic A star pathfinding is creating a linked path in C#
I have a function for A star pathfinding that does not allow diagonal movement where I have penalties for changing direction (F score increased). However, I have found that the resulting path is not ...
0
votes
1
answer
87
views
Linear algebra applications in graph and tree search algorithms
How is linear algebra used within A* pathfinding algorithms?
I know that a graph can be
expressed as a matrix of the weights of the edges and a vector of the optimistic cost of the nodes. However I'm ...
- 29
1
vote
0
answers
261
views
Unity NavMesh.CalculatePath creates a path that jumps around when moving an obstacle
I am working on a tower defense deck building game, there is a path that leads the enemies from their point of origin to their target, I have a line renderer that shows it on the NavMeshSurface, when ...
- 11
1
vote
0
answers
73
views
Matlab's genetic algorithm ignores obstacle when pathfinding in 2D space
I'm playing with Matlab's Global Optimization Toolbox and learning about genetic algorithms. My goal is to implement an algorithm that can navigate in 2D space, searching for the shortest path from a ...
- 13
1
vote
0
answers
108
views
Unity Nav Mesh Agent Local Avoidance
I'm trying to make a RTS game with Unity, trying out the nav mesh agent. Basically when an agent calculates it's path, it does not consider other agents so if they want to reach the same destination ...
- 11
-1
votes
2
answers
551
views
how to make enemies chasing the player by using finding path algorithm in C++?
I'm doing a game using SDL2 and C++. My problem is I'm trying to use finding path algorithm (A*) to create an enemies that chases the player. My idea is to get the update of every moment and rect of ...
1
vote
0
answers
204
views
a-star algorithm visualisation
I'm trying to display the path found by the astar algorithm on a map using OSMnx, but I'm having a lot of issues displaying the nodes, edges & path on the graph. I'm pretty new to coding, I took a ...
- 11
2
votes
1
answer
482
views
Simplify 2D map to optimize pathfinding
I'm working on a personal project that requires solving the well-known shortest-path problem.
I have 256x256 tiles maps like the following:
Example map
I'm only interested in white (walkable) areas. ...
4
votes
2
answers
159
views
Finding paths covering all edges in complete digraphs
I'm writing a test suite for a state machine where every state is reachable from every other state except itself by exactly one step, so the state graph of the system is a complete digraph. I'd like ...
- 12.4k