Timeline for Pathfinding in non tile-based 2d map (maybe potential field)
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2014 at 14:13 | vote | accept | Riccardo Vailati | ||
| Feb 2, 2014 at 14:13 | comment | added | Riccardo Vailati | I've been thinking, and I decided I will use waypoints instead. Thanks for the insight. | |
| Feb 1, 2014 at 21:46 | comment | added | user41442 | Euclidean, yes. Computing the walkable distance requires A* or another graph search algorithm. That's the trick with the potential method: it doesn't need to compute the walkable distance. For environments with rooms and such, potential methods work poorly. If you have an open world with few sparse, convex obstacles, then they work great. This answer is about how to apply the potential field method, not about whether it is appropriate (which it might not be). | |
| Feb 1, 2014 at 21:18 | comment | added | Riccardo Vailati | "Here p_target should be small around the target, and grow larger the further you are. Typically:p_target(x) = |x - target| You mean EUCLIDEAN distance? It can't be right... I should consider walkable distance, isn't that so? | |
| Feb 1, 2014 at 18:40 | history | answered | user41442 | CC BY-SA 3.0 |