如何在基于环形2D网格的地图上进行追随Ai工作

时间:2019-06-17 22:39:59

标签: c# grid 2d artificial-intelligence console-application

我在2D矩阵中有一些NPC,这些NPC环绕了周围,我必须使用环形图使它们跟随敌方NPC。

我已经尝试了几种解决方案,但是它们都给我怪异的行为,它们仅对网格的某个xy值起作用,然后才跟随它们返回一个图块。 / p>

这就是我现在要决定要走的路:

public Position GetNextStepTowards(Position origin, Position target)
{
    Position nextStep = new Position(0, 0);

    float dx = MathF.Abs(target.X - origin.X);
    float dy = MathF.Abs(target.Y - origin.Y);

    if (dx > mapXSize / 2) nextStep.X = -1;
    else if (dx < mapXSize / 2) nextStep.X = 1;

    if (dy > mapYSize / 2) nextStep.Y = 1;
    else if (dy < mapYSize / 2) nextStep.Y = -1;

    return nextStep;
}

位置为:

public struct Position
{
    public int X { get; set; }
    public int Y { get; set; }

    public Position(int x, int y)
    {
        this.X = x;
        this.Y = y;
    }
}

NPC只能移动一个单元格(摩尔),因此运动矢量只能是-11之间的值。

谢谢您的帮助!

2 个答案:

答案 0 :(得分:1)

所以过了一会儿,我想出了这个解决方案,我认为这有点笨拙:

public Position GetNextStepTowards(Position origin, Position target)
{
    // Returned Position
    Position nextStep = new Position(0, 0);

    int dx = target.X - origin.X;
    int dy = target.Y - origin.Y;

    // Toroidal distance
    if (dx > mapXSize / 2) dx = mapXSize - dx;
    if (dy > mapYSize / 2) dy = mapXSize - dy;

    // First verify whether the difference in positions is 
    // greater on the X or Y axis.
    // Then check if the target is lower/higher/forwards/backwards
    if (MathF.Pow(dx, 2) > MathF.Pow(dy, 2))
    {
        if (dx > 0) nextStep.X = 1;
        else if (dx < 0) nextStep.X = -1;
    }
    else if (MathF.Pow(dy, 2) > MathF.Pow(dx, 2))
    {
        if (dy > 0) nextStep.Y = 1;
        else if (dy < 0) nextStep.Y = -1;
    }

    // If the difference in the X and Y axis are the same, 
    // move diagonally
    // use CompareTo do decide what direction in specific.
    else if ((int)MathF.Pow(dx, 2) == (int)MathF.Pow(dy, 2))
    {
        nextStep.X = 1 * target.X.CompareTo(origin.X);
        nextStep.Y = 1 * target.Y.CompareTo(origin.Y);
    }

    return nextStep;
}

答案 1 :(得分:1)

如果考虑X轴,则有两种情况,如下图所示:

enter image description here

在第一种情况下(顶部),目标位于原点的右侧。在这种情况下,向右移动是直接的,向左移动是环形的。

在第二种情况下(底部),目标位于原点的左侧。在这种情况下,向左移动是直接的,向右移动是环形的。

因此,代码需要检查原点和目标的相对位置,然后适当地计算左右距离。较小的距离确定deltaX的方向和大小。相同的逻辑适用于deltaY。

然后,如果deltaX和deltaY具有相同的大小,则我们沿对角线移动。否则,我们将向较大的方向移动。

private int ComputeDelta(int src, int dst, int mapSize)
{
    int increasing, decreasing;
    if (dst >= src)
    {
        increasing = dst - src;               // increasing direction is direct
        decreasing = (mapSize + src) - dst;   // decreasing direction is toroidal
    }
    else
    {
        increasing = (mapSize + dst) - src;   // increasing direction is toroidal
        decreasing = src - dst;               // decreasing direction is direct
    }

    if (increasing <= decreasing) { return  increasing; }
    else                          { return -decreasing; }
}

public Position GetNextStepTowards(Position origin, Position target)
{
    Position nextStep = new Position(0, 0);

    // compute the distances
    int dx = ComputeDelta(origin.X, target.X, mapXSize);
    int dy = ComputeDelta(origin.Y, target.Y, mapYSize);

    // keep the dominant distance, and clear the other distance
    // keep both if they're equal
    if      (dx*dx > dy*dy) { dy = 0; }
    else if (dx*dx < dy*dy) { dx = 0; }

    // normalize the distances so they are -1, 0, or 1
    nextStep.X = dx.CompareTo(0);
    nextStep.Y = dy.CompareTo(0);

    return nextStep;
}