Timeline for Multi-tile agent path-finding algorithm?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4, 2011 at 8:00 | vote | accept | zzandy | ||
| Oct 3, 2011 at 13:00 | comment | added | Kylotan | If vehicles can rotate and that changes their shape then that could complicate things significantly, because rotation is a movement in itself and may not be possible in certain positions. But I don't see an easy short-cut, no. | |
| Oct 3, 2011 at 13:00 | review | Suggested edits | |||
| Oct 3, 2011 at 14:55 | |||||
| Oct 3, 2011 at 12:23 | comment | added | zzandy | True. Even with non-square (e.g. 2x3) vehicles at each step you get to check two rotated states. An L-shaped vehicle ... So, basicall yther is no shortcut, at each step you just have to check that the veicle is not ovelapping with obstacles? | |
| Oct 3, 2011 at 12:09 | comment | added | Kylotan | That also works. It's the same operation in reverse really. However the collision approach is a bit easier to think about if you have irregularly-shaped vehicles. | |
| Oct 3, 2011 at 11:51 | comment | added | zzandy | I see, I was thinking of modifying the obstacles my making them (vehicle-width) wider and (vehicle-height) taller. | |
| Oct 3, 2011 at 11:39 | history | answered | Kylotan | CC BY-SA 3.0 |