Unity A*寻路算法（人物移动AI）

最近闲来无事，从网上看了一些大神的心得，再融合自己的体会，写了一个简单点的寻路算法，废话不多说，直接上代码

<Grid>

---

using UnityEngine ;

using System . Collections ;

using System . Collections . Generic ;

using System ;

/// <summary>

/// 格子类型

/// </summary>

public enum GridType

{

        //正常类型

        Normal ,

        //障碍物类型

        Obstacle ,

        //起点类型

        Start ,

        //终点类型

        End

}

/// <summary>

/// 格子类（实现IComparable方便排序）

/// </summary>

public class Grid : IComparable

{

        //格子坐标x-y

        public int x ;

        public int y ;

        //格子A*三属性f-g-h

        public int f ;

        public int g ;

        public int h ;

        //格子类型

        public GridType type ;

        //格子的归属（父格子）

        public Grid parent ;

        //构造赋值

        public Grid ( int x , int y )

       {

               this . x = x ;

               this . y = y ;

       }

        /// <summary>

        /// 实现排序接口方法

        /// </summary>

        /// <returns> The to. </returns>

        /// <param name="obj"> Object. </param>

        public int CompareTo ( object obj )

       {

               Grid grid = ( Grid ) obj ;

               if ( this . f < grid . f ) {

                      //升序

                      return -1;

              }

               if ( this . f > grid . f ) {

                      //降序

                      return 1;

              }

               return 0;

       }

}

---

<MyAStar>

---

using UnityEngine ;

using System . Collections ;

using System . Collections . Generic ;

public class MyAStar : MonoBehaviour

{

        /// <summary>

        /// 单例脚本

        /// </summary>

        public static MyAStar instance ;

        // 白色格子

        public GameObject reference ;

        //格子数组

        public Grid [,] grids ;

        //格子数组对应的参考物（方块）对象

        public GameObject [,] objs ;

        // 开启和关闭列表

        public List < Grid > openList ;

        public List < Grid > closeList ;

        //目标点坐标

        public int targetX