I’ve successfully set up my nodes everywhere for the graph, and I’m using the “AIPath” script included in the A* pathfinding package. Everything works great, except I need to somehow be able to access how far away the enemy is from the player on the path. I don’t want the distance to be calculated in a straight line from the enemy to the player, I need it to take into account where the enemy is going to have to go before they can get to the player. So is there a way to calculate the distance based on the designated path the enemy’s AI has created? Is it even possible to calculate the distance it will have to travel on the path until it reaches the player? I thought about figuring out how many nodes are between the two, but after trying some different things and still not being able to pull that off, I’m pretty stuck. I’m fine with JS, but A* is C#, and not to mention the fact that I’ve always been pretty bad at working with AI. If someone could help me out with this, I would be very much obliged.
Seeker.cs:
using UnityEngine;
using System.Collections;
using System.Collections.Generic;
using Pathfinding;
using System.Diagnostics;
[AddComponentMenu ("Pathfinding/Seeker")]
/** Handles path calls for a single unit.
* \ingroup relevant
* This is a component which is meant to be attached to a single unit (AI, Robot, Player, whatever) to handle it's pathfinding calls.
* It also handles post-processing of paths using modifiers.
* \see \ref calling-pathfinding
*/
public class Seeker : MonoBehaviour {
//====== SETTINGS ======
/* Recalculate last queried path when a graph changes. \see AstarPath.OnGraphsUpdated */
//public bool recalcOnGraphChange = true;
public bool drawGizmos = true;
public bool detailedGizmos = false;
/** Saves nearest nodes for previous path to enable faster Get Nearest Node calls.
* This variable basically does not a affect anything at the moment. So it is hidden in the inspector */
[HideInInspector]
public bool saveGetNearestHints = true;
public StartEndModifier startEndModifier = new StartEndModifier ();
[HideInInspector]
public TagMask traversableTags = new TagMask (-1,-1);
[HideInInspector]
/** Penalties for each tag.
* Tag 0 which is the default tag, will have added a penalty of tagPenalties[0].
* These should only be positive values since the A* algorithm cannot handle negative penalties.
*
ote This array should always have a length of 32.
* \see Pathfinding.Path.tagPenalties
*/
public int tagPenalties = new int[32];
public int totalPoints;
//====== SETTINGS ======
//public delegate Path PathReturn (Path p);
/** Callback for when a path is completed. Movement scripts should register to this delegate.
* A temporary callback can also be set when calling StartPath, but that delegate will only be called for that path */
public OnPathDelegate pathCallback;
/** Called before pathfinding is started */
public OnPathDelegate preProcessPath;
/** For anything which requires the original nodes (Node[]) (before modifiers) to work */
public OnPathDelegate postProcessOriginalPath;
/** Anything which only modifies the positions (Vector3[]) */
public OnPathDelegate postProcessPath;
//public GetNextTargetDelegate getNextTarget;
//DEBUG
//public Path lastCompletedPath;
[System.NonSerialized]
public List<Vector3> lastCompletedVectorPath;
[System.NonSerialized]
public List<Node> lastCompletedNodePath;
//END DEBUG
/** The current path */
[System.NonSerialized]
protected Path path;
/** Previous path. Used to draw gizmos */
private Path prevPath;
/** Returns #path */
public Path GetCurrentPath () {
return path;
}
private Node startHint;
private Node endHint;
private OnPathDelegate onPathDelegate;
private OnPathDelegate onPartialPathDelegate;
/** Temporary callback only called for the current path. This value is set by the StartPath functions */
private OnPathDelegate tmpPathCallback;
/** The path ID of the last path queried */
protected uint lastPathID = 0;
/** Initializes a few variables
*/
public void Awake () {
onPathDelegate = OnPathComplete;
startEndModifier.Awake (this);
}
/** Cleans up some variables.
* Releases any eventually claimed paths.
* Calls OnDestroy on the #startEndModifier.
*
* \see ReleaseClaimedPath
* \see startEndModifier
*/
public void OnDestroy () {
ReleaseClaimedPath ();
startEndModifier.OnDestroy (this);
}
/** Releases an eventual claimed path.
* The seeker keeps the latest path claimed so it can draw gizmos.
* In some cases this might not be desireable and you want it released.
* In that case, you can call this method to release it (not that path gizmos will then not be drawn).
*
* If you didn't understand anything from the description above, you probably don't need to use this method.
*/
public void ReleaseClaimedPath () {
if (prevPath != null) {
prevPath.ReleaseSilent (this);
prevPath = null;
}
}
private List<IPathModifier> modifiers = new List<IPathModifier> ();
public void RegisterModifier (IPathModifier mod) {
if (modifiers == null) {
modifiers = new List<IPathModifier> (1);
}
modifiers.Add (mod);
}
public void DeregisterModifier (IPathModifier mod) {
if (modifiers == null) {
return;
}
modifiers.Remove (mod);
}
public enum ModifierPass {
PreProcess,
PostProcessOriginal,
PostProcess
}
/** Post Processes the path.
* This will run any modifiers attached to this GameObject on the path.
* This is identical to calling RunModifiers(ModifierPass.PostProcess, path)
* \see RunModifiers
* \since Added in 3.2
*/
public void PostProcess (Path p) {
RunModifiers (ModifierPass.PostProcess,p);
}
/** Runs modifiers on path \a p */
public void RunModifiers (ModifierPass pass, Path p) {
//Sort the modifiers based on priority (bubble sort (slow but since it's a small list, it works good))
bool changed = true;
while (changed) {
changed = false;
for (int i=0;i<modifiers.Count-1;i++) {
if (modifiers*.Priority < modifiers[i+1].Priority) {*
_ IPathModifier tmp = modifiers*;_
_ modifiers = modifiers[i+1];
modifiers[i+1] = tmp;
changed = true;
}
}
}*_
* //Call eventual delegates*
* switch (pass) {*
* case ModifierPass.PreProcess:*
* if (preProcessPath != null) preProcessPath (p);*
* break;*
* case ModifierPass.PostProcessOriginal:*
* if (postProcessOriginalPath != null) postProcessOriginalPath (p);*
* break;*
* case ModifierPass.PostProcess:*
* if (postProcessPath != null) postProcessPath (p);*
* break;*
* }*
* //No modifiers, then exit here*
* if (modifiers.Count == 0) return;*
* ModifierData prevOutput = ModifierData.All;*
* IPathModifier prevMod = modifiers[0];*
* //Loop through all modifiers and apply post processing*
* for (int i=0;i<modifiers.Count;i++) {*
* //Cast to MonoModifier, i.e modifiers attached as scripts to the game object*
_ MonoModifier mMod = modifiers as MonoModifier;_
* //Ignore modifiers which are not enabled*
* if (mMod != null && !mMod.enabled) continue;*
* switch (pass) {*
* case ModifierPass.PreProcess:*
_ modifiers*.PreProcess (p);
break;
case ModifierPass.PostProcessOriginal:
modifiers.ApplyOriginal (p);
break;
case ModifierPass.PostProcess:*_
* //Convert the path if necessary to match the required input for the modifier*
_ ModifierData newInput = ModifierConverter.Convert (p,prevOutput,modifiers*.input);*_
* if (newInput != ModifierData.None) {*
_ modifiers*.Apply (p,newInput);
prevOutput = modifiers.output;
} else {*_
_ UnityEngine.Debug.Log (“Error converting “+(i > 0 ? prevMod.GetType ().Name : “original”)+”'s output to “+(modifiers*.GetType ().Name)+”'s input.
Try rearranging the modifier priorities on the Seeker.”);*_
* prevOutput = ModifierData.None;*
* }*
_ prevMod = modifiers*;
break;
}*_
* if (prevOutput == ModifierData.None) {*
* break;*
* }*
* }*
* }*
_ /** Is the current path done calculating.
* Returns true if the current #path has been returned or if the #path is null.
*
ote Do not confuse this with Pathfinding.Path.IsDone. They do mostly return the same value, but not always.
* \since Added in 3.0.8_
_ * \version Behaviour changed in 3.2_
_ * /
public bool IsDone () {
return path == null || path.GetState() >= PathState.Returned;
}*_
_ /** Called when a path has completed.
* This should have been implemented as optional parameter values, but that didn’t seem to work very well with delegates (the values weren’t the default ones)
* \see OnPathComplete(Path,bool,bool) /
public void OnPathComplete (Path p) {
OnPathComplete (p,true,true);
}*_
_ /** Called when a path has completed.
* Will post process it and return it by calling #tmpPathCallback and #pathCallback /
public void OnPathComplete (Path p, bool runModifiers, bool sendCallbacks) {*_
* AstarProfiler.StartProfile (“Seeker OnPathComplete”);*
* if (p != null && p != path && sendCallbacks) {*
* return;*
* }*
* if (this == null || p == null || p != path)*
* return;*
* if (!path.error && runModifiers) {*
* AstarProfiler.StartProfile (“Seeker Modifiers”);*
* //This will send the path for post processing to modifiers attached to this Seeker*
* RunModifiers (ModifierPass.PostProcessOriginal, path);*
* //This will send the path for post processing to modifiers attached to this Seeker*
* RunModifiers (ModifierPass.PostProcess, path);*
* AstarProfiler.EndProfile ();*
* }*
* if (sendCallbacks) {*
* p.Claim (this);*
* AstarProfiler.StartProfile (“Seeker Callbacks”);*
* lastCompletedNodePath = p.path;*
* lastCompletedVectorPath = p.vectorPath;*
* //This will send the path to the callback (if any) specified when calling StartPath*
* if (tmpPathCallback != null) {*
* tmpPathCallback (p);*
* }*
* //This will send the path to any script which has registered to the callback*
* if (pathCallback != null) {*
* pathCallback (p);*
* }*
* //Recycle the previous path*
* if (prevPath != null) {*
* prevPath.ReleaseSilent (this);*
* }*
* prevPath = p;*
* //If not drawing gizmos, then storing prevPath is quite unecessary*
* //So clear it and set prevPath to null*
* if (!drawGizmos) ReleaseClaimedPath ();*
* AstarProfiler.EndProfile();*
* }*
* AstarProfiler.EndProfile ();*
* }*
_ /public void OnEnable () {
//AstarPath.OnGraphsUpdated += CheckPathValidity;
}*_
* public void OnDisable () {*
* //AstarPath.OnGraphsUpdated -= CheckPathValidity;*
_ }*/_
_ /*public void CheckPathValidity (AstarPath active) {_
_ /if (!recalcOnGraphChange) {
return;
}*_
* //Debug.Log (“Checking Path Validity”);*
* //Debug.Break ();*
* if (lastCompletedPath != null && !lastCompletedPath.error) {*
* //Debug.Log (“Checking Path Validity”);*
* StartPath (transform.position,lastCompletedPath.endPoint);*
_ /if (!lastCompletedPath.path[0].IsWalkable (lastCompletedPath)) {
StartPath (transform.position,lastCompletedPath.endPoint);
return;
}*_
* for (int i=0;i<lastCompletedPath.path.Length-1;i++) {*
_ if (!lastCompletedPath.path*.ContainsConnection (lastCompletedPath.path[i+1],lastCompletedPath)) {
StartPath (transform.position,lastCompletedPath.endPoint);
return;
}
Debug.DrawLine (lastCompletedPath.path.position,lastCompletedPath.path[i+1].position,Color.cyan);
}
}
}/_
* //The frame the last call was made from this Seeker*
* //private int lastPathCall = -1000;*
_ /** Returns a new path instance. The path will be taken from the path pool if path recycling is turned on.
* This path can be sent to #StartPath(Path,OnPathDelegate,int) with no change, but if no change is required #StartPath(Vector3,Vector3,OnPathDelegate) does just that.
* \code Seeker seeker = GetComponent (typeof(Seeker)) as Seeker;
* Path p = seeker.GetNewPath (transform.position, transform.position+transform.forward100);
* p.nnConstraint = NNConstraint.Default; \endcode /
public Path GetNewPath (Vector3 start, Vector3 end) {
* //Construct a path with start and end points*
* Path p = ABPath.Construct (start, end, null);*_
* return p;*
* }*
_ /** Call this function to start calculating a path.
* \param start The start point of the path_
_ * \param end The end point of the path_
_ /
public Path StartPath (Vector3 start, Vector3 end) {
return StartPath (start,end,null,-1);
}*_
_ /** Call this function to start calculating a path.
* \param start The start point of the path_
_ * \param end The end point of the path_
_ * \param callback The function to call when the path has been calculated_
_
* \a callback will be called when the path has completed.
* \a Callback will not be called if the path is canceled (e.g when a new path is requested before the previous one has completed) /
public Path StartPath (Vector3 start, Vector3 end, OnPathDelegate callback) {
* return StartPath (start,end,callback,-1);
}*_
_ /** Call this function to start calculating a path.
* \param start The start point of the path_
_ * \param end The end point of the path_
_ * \param callback The function to call when the path has been calculated_
_ * \param graphMask Mask used to specify which graphs should be searched for close nodes. See Pathfinding.NNConstraint.graphMask.
* \a callback will be called when the path has completed.
* \a Callback will not be called if the path is canceled (e.g when a new path is requested before the previous one has completed) /
public Path StartPath (Vector3 start, Vector3 end, OnPathDelegate callback, int graphMask) {
* Path p = GetNewPath (start,end);
return StartPath (p, callback, graphMask);
}*_
_ /** Call this function to start calculating a path.
* \param p The path to start calculating_
_ * \param callback The function to call when the path has been calculated_
_ * \param graphMask Mask used to specify which graphs should be searched for close nodes. See Pathfinding.NNConstraint.graphMask. \astarproParam_
_
* \a callback will be called when the path has completed.
* \a Callback will not be called if the path is canceled (e.g when a new path is requested before the previous one has completed) /
public Path StartPath (Path p, OnPathDelegate callback = null, int graphMask = -1) {
* p.enabledTags = traversableTags.tagsChange;
p.tagPenalties = tagPenalties;*_
* //Cancel a previously requested path is it has not been processed yet and also make sure that it has not been recycled and used somewhere else*
* if (path != null && path.GetState() <= PathState.Processing && lastPathID == path.pathID) {*
* path.LogError ("Canceled path because a new one was requested
GameObject: "+gameObject.name);*
* //No callback should be sent for the canceled path*
* }*
* path = p;*
* path.callback += onPathDelegate;*
* tmpPathCallback = callback;*
* //Set the Get Nearest Node hints if they have not already been set*
_ /if (path.startHint == null)
path.startHint = startHint;*_
* if (path.endHint == null)*
* path.endHint = endHint;*
_ */_
* //Save the path id so we can make sure that if we cancel a path (see above) it should not have been recycled yet.*
* lastPathID = path.pathID;*
* //Delay the path call by one frame if it was sent the same frame as the previous call*
_ /if (lastPathCall == Time.frameCount) {
StartCoroutine (DelayPathStart (path));
return path;
}/_
* //lastPathCall = Time.frameCount;*
* //Pre process the path*
* RunModifiers (ModifierPass.PreProcess, path);*
* //Send the request to the pathfinder*
* AstarPath.StartPath (path);*
* return path;*
* }*
* public IEnumerator DelayPathStart (Path p) {*
* yield return 0;*
* //lastPathCall = Time.frameCount;*
* RunModifiers (ModifierPass.PreProcess, p);*
* AstarPath.StartPath (p);*
* }*
* public void OnDrawGizmos () {*
* if (lastCompletedNodePath == null || !drawGizmos) {*
* return;*
* }*
* if (detailedGizmos) {*
* Gizmos.color = new Color (0.7F,0.5F,0.1F,0.5F);*
* if (lastCompletedNodePath != null) {*
* for (int i=0;i<lastCompletedNodePath.Count-1;i++) {*
_ Gizmos.DrawLine ((Vector3)lastCompletedNodePath*.position,(Vector3)lastCompletedNodePath[i+1].position);
}
}
}*_
* Gizmos.color = new Color (0,1F,0,1F);*
* if (lastCompletedVectorPath != null) {*
* for (int i=0;i<lastCompletedVectorPath.Count-1;i++) {*
_ Gizmos.DrawLine (lastCompletedVectorPath*,lastCompletedVectorPath[i+1]);
}
}
}*_
}