func (me Movable) ComputeMove(org d2.Vec2, dt time.Duration) d2.Vec2 {
// update position on the player path
if dst, exists := me.waypoints.Peek(); exists {
// compute distance to be covered as time * speed
distance := float32(dt.Seconds()) * me.Speed
// compute translation and direction vectors
dir := dst.Sub(org)
b := dir.Len()
dir.Normalize()
// compute next position
pos := org.Add(dir.Scale(distance))
a := pos.Sub(org).Len()
// check against edge-cases
isNan := math32.IsNaN(a) || math32.IsNaN(b) || math32.IsNaN(dir.Len()) || math32.Abs(a-b) < 1e-3
if a > b || isNan {
return dst
} else {
return pos
}
}
return org
}
/*
* FindPath searches for the best path to reach a destination in the whole grid.
*
* The search is performed with the A* algorithm, running on a matrix-shaped
* graph representing the world. The grid is scaled to achieve a better
* resolution.
*/
func (pf Pathfinder) FindPath(org, dst d2.Vec2) (path Path, dist float32, found bool) {
world := pf.game.State().World()
// scale org and dst coordinates
scaledOrg, scaledDst := org.Scale(world.GridScale), dst.Scale(world.GridScale)
// retrieve origin and destination tiles by rounding the scaled org/dst points down
porg := world.Tile(int(scaledOrg[0]), int(scaledOrg[1]))
pdst := world.Tile(int(scaledDst[0]), int(scaledDst[1]))
switch {
case porg == nil, pdst == nil:
log.WithFields(log.Fields{"org": org, "dst": dst}).Error("Couldn't find origin or destination Tile")
found = false
return
}
// perform A*
rawPath, _, found := astar.Path(porg, pdst)
if !found {
return
}
// generate a cleaner path, in one pass:
// - basic path smoothing (remove consecutive equal segments)
// - clip path segment ends to cell center
invScale := 1.0 / world.GridScale
txCenter := d2.Vec2{0.5, 0.5} // tx vector to the cell center
path = make(Path, 0, len(rawPath))
var last d2.Vec2
for pidx := range rawPath {
tile := rawPath[pidx].(*Tile)
pt := d2.Vec2{float32(tile.X), float32(tile.Y)}
if pidx == 0 {
path = append(path, dst)
} else if pidx == len(rawPath)-1 {
path = append(path, org)
} else {
// basic path smoothing
dir := last.Sub(pt)
if pidx+1 < len(rawPath)-1 {
// there are at least 1 pt between the current one and the last one
ntile := rawPath[pidx+1].(*Tile)
npt := d2.Vec2{float32(ntile.X), float32(ntile.Y)}
nextDir := pt.Sub(npt)
if dir.Approx(nextDir) {
last = pt
continue
}
}
// re-scale coords when adding point to the path
path = append(path, pt.Add(txCenter).Scale(invScale))
}
last = pt
}
return
}