| ... | ... | @@ -43,6 +43,7 @@ If a child is on the outside path the algorithm creates the following points, th |
|
|
|
|
|
|
|
|
|
|
|
**2. Inside Path**
|
|
|
|
|
|
|
|
On the inside path the Algorithm just creates the *LastPointOfCurrentPath* and adjusts the walking speed such that the child arrives there at the same time the parent arrives at the Waypoint.
|
|
|
|
|
|
|
|

|
| ... | ... | @@ -54,6 +55,7 @@ If the angle from the last Waypoint towards the next Waypoint is very large (clo |
|
|
|
In general the movement of children is always triggered by the parent. In combination with walking speed adjustment, it is guaranteed that the formation is always maintained. It can for example happen, that a child on the outside path cannot reach the last point on its current walking path, which would be *FistPointOfNextPath*, due to movement speed restrictions (speed is restricted because it would look bad if the child suddenly starts running while the parent walks normally). Therefore, the parent would trigger walking to the next Waypoint upon arriving at the current. The child would then abort the current path and would start to walk to its corresponding points for the next Waypoint.
|
|
|
|
|
|
|
|
#### InLine
|
|
|
|
|
|
|
|
This formation is handled in a very simple way so far. The only additional points that are calculated for the child are around the first Waypoint. Then every child will walk towards the next Waypoint. Therefore, the formation is only formed once around the first Waypoint. Distances between children and parent will not be maintained strictly.
|
|
|
|
|
|
|
|
## Future implementations
|
| ... | ... | |
| ... | ... | |