Timeline for Pathfinding with multiple actors moving in sync
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2017 at 16:47 | comment | added | Puneet | Thanks for the explanation. Let me wrap my head around it. This is much more complex than implementing a simple A* in 2d space. | |
| Jan 28, 2017 at 16:44 | comment | added | wondra | @Puneet also note, you dont have to create the graph as preprocessing step when pathfinding on grid, you can just "try every move" and check if that move was valid (=any of objects is colliding for first 2 dimension, and if the objects has obstacle on correct side when moving in other two dimensions, displacement), if the edge exists. This could be implemented by bunch of else-ifs, still not easy task however. | |
| Jan 28, 2017 at 16:22 | comment | added | wondra | @Puneet It is important to understand you are looking for specific position and displacement vector(=slice) giving you 4D target for A*. In your example you want to navigate A1 to (8,1) coordinate and (0,4) slice (producing 4D coordine of 8,1,0,4). In other words, if A1 is at (8,1), the G1 node and the displacement of A2 is (0,4), then A2 must be at (8,5), the G2 node. | |
| Jan 28, 2017 at 16:06 | comment | added | Puneet | Thank you for trying to explain it in a relatively simple manner along with an illustration. I am not a math/physics major so anything beyond 2D/3D takes me a bit of time to grasp/visualize. Based on your answer, it is more a problem of redefining the graph. However, if I translate the obstacles by actor displacement vector, it would take care of both A1 and A2 reaching either G1 or G2 together. Instead, I need A1 and A2 to reach G1 and G2 respectively at the same time.(The bottom Goal was supposed to be G2. Apologies for the mistake.) | |
| Jan 28, 2017 at 13:18 | history | edited | wondra | CC BY-SA 3.0 | added 46 characters in body |
| Jan 28, 2017 at 13:10 | history | answered | wondra | CC BY-SA 3.0 |