Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with path-finding
Search options not deleted
user 30660
Methods used to map out a path of travel from one point to another, typically avoiding obstacles in the way.
1
vote
How to make natural-looking paths with A* on a grid?
Adapting A*
As Philipp said, you should add costs when the direction doesn't change for long time. But, the function by Philipp may quickly lead to summing up additional costs, that are higher than t …
- 661
1
vote
Looking for detailed pathfinding examples
A* and Dijkstra are quite a bit slow when you use it for a huge amount of units at the same time. You could use some simpler algorithms as robust trace and improve their found solution. The solutions …
- 661
3
votes
How to predict future location of a Car in a Navigation Mesh based pathfinding system?
I guess you mixed up "path finding" and "object state" (e.g. position, speed, direction, ..). Path finding is used to find a path from position A to position B. As far as I understand, the "Mesh based …
- 661
2
votes
Accepted
A*, Tile costs and heuristic; How to approach
What am I doing wrong that the Manhattan Heuristic isn't working?
The Manhattan distance doesn't work as a heuristic for A*, as the heuristic for A* must never overestimate the distance. But, the Man …
- 661