Class MultiTargetPath Extends ABPath

Public

A path which searches from one point to a number of different targets in one search or from a number of different start points to a single target.

This is faster than searching with an ABPath for each target if pathsForAll is true. This path type can be used for example when you want an agent to find the closest target of a few different options.

When pathsForAll is true, it will calculate a path to each target point, but it can share a lot of calculations for the different paths so it is faster than requesting them separately.

When pathsForAll is false, it will perform a search using the heuristic set to None and stop as soon as it finds the first target. This may be faster or slower than requesting each path separately. It will run a Dijkstra search where it searches all nodes around the start point until the closest target is found. Note that this is usually faster if some target points are very close to the start point and some are very far away, but it can be slower if all target points are relatively far away because then it will have to search a much larger region since it will not use any heuristics.

A* Pro Feature:

This is an A* Pathfinding Project Pro feature only. This function/class/variable might not exist in the Free version of the A* Pathfinding Project or the functionality might be limited.
The Pro version can be bought here

Version

Since 3.7.1 the vectorPath and path fields are always set to the shortest path even when pathsForAll is true.

Public Methods

MultiTargetPath ()

Default constructor.

Public

Public Static Methods

Construct (start, targets, callbackDelegates, callback=null)
Public Static
Construct (startPoints, target, callbackDelegates, callback=null)
Public Static

Public Variables

callbacks

Callbacks to call for each individual path.

Public
chosenTarget

The closest target index (if any target was found)

Public
heuristicMode

How to calculate the heuristic.

Public
inverted

False if the path goes from one point to multiple targets.

Public
nodePaths

Stores all paths to the targets.

Public
originalTargetPoints

Target points specified when creating the path.

Public
pathsForAll

If true, a path to all targets will be returned, otherwise just the one to the closest one.

Public
targetNodes

Nearest nodes to the targetPoints.

Public
targetPoints

Target points specified when creating the path.

Public
targetsFound

Indicates if the target has been found.

Public
vectorPaths

Stores all vector paths to the targets.

Public

Public Enums

HeuristicMode
Public

Inherited Public Members

BlockUntilCalculated ()

Blocks until this path has been calculated and returned.

Public
calculatePartial

Calculate partial path if the target node cannot be reached.

Public
callback

Callback to call when the path is complete.

Public
Claim (o)

Claim this path (pooling).

Public
CompleteState

Current state of the path.

Public
Construct (start, end, callback=null)

Construct a path with a start and end point.

Public Static
duration

How long it took to calculate this path in milliseconds.

Public
enabledTags

Which graph tags are traversable.

Public
endNode

End node of the path.

Public
endPoint

End point of the path.

Public
error

If the path failed, this is true.

Public
Error ()

Aborts the path because of an error.

Public
errorLog

Additional info on why a path failed.

Public
FakePath (vectorPath, nodePath=null)

Creates a fake path.

Public Static
GetTagPenalty (tag)

Returns penalty for the given tag.

Public
GetTotalLength ()

Total Length of the path.

Public
heuristic

Determines which heuristic to use.

Public
heuristicScale

Scale of the heuristic values.

Public
immediateCallback

Immediate callback to call when the path is complete.

Public
IsDone ()

Returns if this path is done calculating.

Public
nnConstraint

Constraint for how to search for nodes.

Public
originalEndPoint

End Point exactly as in the path request.

Public
originalStartPoint

Start Point exactly as in the path request.

Public
path

Holds the path as a Node array.

Public
pathID

ID of this path.

Public
PipelineState

Returns the state of the path in the pathfinding pipeline.

Public
Release (o, silent=…)

Releases a path claim (pooling).

Public
startIntPoint

Start point in integer coordinates.

Public
startNode

Start node of the path.

Public
startPoint

Start point of the path.

Public
tagPenalties

Penalties for each tag.

Public
traversalProvider

Provides additional traversal information to a path request.

Public
vectorPath

Holds the (possibly post processed) path as a Vector3 list.

Public
WaitForPath ()

Waits until this path has been calculated and returned.

Public

Private/Protected Members

CalculateHScore (node)

Estimated cost from the specified node to the target.

Package
CalculateStep (targetTick)

Calculates the path until completed or until the time has passed targetTick.

Protected
CanTraverse (node)

Returns if the node can be traversed.

Package
ChooseShortestPath ()

Set chosenTarget to the index of the shortest path.

Private
Cleanup ()

Always called after the path has been calculated.

Protected
CompletePathIfStartIsValidTarget ()

Checks if the start node is the target and complete the path if that is the case.

Protected
completeState

Backing field for CompleteState.

Protected
currentR

The node currently being processed.

Protected
DebugString (logMode)

Returns a debug string for this path.

Package
DebugStringPrefix (logMode, text)

Writes text shared for all overrides of DebugString to the string builder.

Protected
DebugStringSuffix (logMode, text)

Writes text shared for all overrides of DebugString to the string builder.

Protected
endNodeCosts

Saved original costs for the end node.

Protected
EndPointGridGraphSpecialCase (closestWalkableEndNode)

Applies a special case for grid nodes.

Protected
FailWithError (msg)

Causes the path to fail and sets errorLog to msg.

Package
FloodingPath

True for paths that want to search all nodes and not jump over nodes as optimizations.

Package
FoundTarget (nodeR, i)
Protected
GetConnectionSpecialCost (a, b, currentCost)

May be called by graph nodes to get a special cost for some connections.

Package
GetHTarget ()
Package
GetTraversalCost (node)
Package
hasBeenReset

True if the Reset function has been called.

Protected
hasEndPoint

Determines if a search for an end node should be done.

Protected
hTarget

Target to use for H score calculations.

Protected
hTargetNode

Target to use for H score calculation.

Protected
Initialize ()

Initializes the path.

Protected
internalTagPenalties

The tag penalties that are actually used.

Protected
manualTagPenalties

Tag penalties set by other scripts.

Protected
next

Internal linked list implementation.

Package
OnEnterPool ()

Called when the path enters the pool.

Protected
partialBestTarget

Current best target for the partial path.

Protected
pathHandler

Data for the thread calculating this path.

Protected
Prepare ()

Prepares the path.

Protected
PrepareBase (pathHandler)

Prepares low level path variables for calculation.

Protected
RebuildOpenList ()
Protected
RecalculateHTarget (firstTime)
Private
Reset ()

Reset all values to their default values.

Protected
ResetFlags ()

Reset flag1 on all nodes after the pathfinding has completed (no matter if an error occurs or if the path is canceled)

Private
ReturnPath ()

Calls callback to return the calculated path.

Protected
searchedNodes

Number of nodes this path has searched.

Package
sequentialTarget

Current target for Sequential heuristicMode.

Private
SetPathParametersForReturn (target)
Private
Setup (start, end, callbackDelegate)
Protected
Setup (start, targets, callbackDelegates, callback)
Protected
targetNodeCount

Number of target nodes left to find.

Protected
Trace (from)

Traces the calculated path from the end node to the start.

Protected
UpdateStartEnd (start, end)

Sets the start and end points.

Protected