Class RandomPath Extends ABPath

Public

Finds a path in a random direction from the start node.

Terminates and returns when G >= length (passed to the constructor) + RandomPath.spread or when there are no more nodes left to search.
// Call a RandomPath call like this, assumes that a Seeker is attached to the GameObject

// The path will be returned when the path is over a specified length (or more accurately when the traversal cost is greater than a specified value).
// A score of 1000 is approximately equal to the cost of moving one world unit.
int theGScoreToStopAt = 50000;

// Create a path object
RandomPath path = RandomPath.Construct(transform.position, theGScoreToStopAt);
// Determines the variation in path length that is allowed
path.spread = 5000;

// Get the Seeker component which must be attached to this GameObject
Seeker seeker = GetComponent<Seeker>();

// Start the path and return the result to MyCompleteFunction (which is a function you have to define, the name can of course be changed)
seeker.StartPath(path, MyCompleteFunction);

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

Public Methods

RandomPath ()
Public

Public Static Methods

Construct (start, length, callback=null)
Public Static

Public Variables

aim

An aim can be used to guide the pathfinder to not take totally random paths.

Public
aimStrength

If an aim is set, the higher this value is, the more it will try to reach aim.

Public
searchLength

G score to stop searching at.

Public
spread

All G scores between searchLength and searchLength+spread are valid end points, a random one of them is chosen as the final point.

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
chosenNodeR

Currently chosen end node.

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
FloodingPath
Package
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
hasEndPoint
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
maxGScore

The G score of maxGScoreNodeR.

Private
maxGScoreNodeR

The node with the highest G score which is still lower than searchLength.

Private
next

Internal linked list implementation.

Package
nodesEvaluatedRep
Private
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
Reset ()

Reset all values to their default values.

Protected
ReturnPath ()

Calls callback to return the calculated path.

Protected
rnd

Random number generator.

Private Readonly
searchedNodes

Number of nodes this path has searched.

Package
Setup (start, end, callbackDelegate)
Protected
Setup (start, length, callback)
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