Link Search Menu Expand Document

Plot Edges Pathfinding

Find a path that goes through multiple chained points.

The Plot Edges Pathfinding mode …


Vtx
Endpoints of the input Edges
Edges
Edges associated with the input Vtxs
Plots
Plot points in the form of points collections.
Heuristics
Heuristics nodes that will be used by the pathfinding search algorithm
Paths
A single path per plot collection input

Table of content


DOC TDB – Heuristics underwent a thorough refactor that isn’t documented yet. Each heuristic has its own node and they can be combined into the heuristic input of the pathfinding node. See the example project!

details/details-pathfinding-edges-plot.png

Property Description
Settings
Add Seed to Path Prepends the seed position at the beginning of the output path.
This will create a point with the position of the seed.
Add Goal to Path Appends the goal position at the end of the output path.
This will create a point with the position of the goal.
Add Plot Points to Path Include plot points positions as part of the output path.
Modules
Search Algorithm The search algorithm that will be used to solve pathfinding.
Each module has individual settings and documentation – See Available Search Algorithms.
Heuristics The base heuristics module that will be used during pathfinding.
Each module has individual settings and documentation – See Available Heuristics.
Heuristics Modifiers This property group is available no matter what Heuristics have been picked.
See 🝰 Heuristic Attribute.

Statistics

Statistics  
wip
Extra Weighting
Weight up Visited If enabled, points and edges will accumulate additional weight are paths are found.
This allows you to make “already in use” points & edges either more or less desirable for the next internal execution.
Note that accumulated weight is consolidated between each plot points, as opposed to between each plotted path.
Visited Points Weight Factor The weight to add to points that have been visited. This is a multiplier of the Heuristic’ Modifiers Reference Weight.
The weight is added each time a point is used.
Visited Edges Weight Factor The weight to add to edges that have been visited. This is a multiplier of the Heuristic’ Modifiers Reference Weight.
The weight is added each time an edge is used.
Global Visited Weight If enabled, additive weight will be shared across the different plotted path.

Important note on weighting up visited Vtx and Edges:

  • The weight is only computed for the pathfinding node and isn’t carried over or cached.
  • Enabling Global Visited Weight breaks parallelism. Tasks are still ran asynchronously, but each path must wait for the previous one to be computed. Impact is usually negligible, but if you have lots of paths, it may take noticeably more time to process.

Modules

Available ⊚ Search modules


Dijkstra

Dijkstra’s Algorithm

The Dijkstra’s Algorithm search mode …

A* Star

A* Algorithm

The A* Algorithm search mode …


Available 🝰 Heuristics modules


🝰 Heuristic Attribute

Attribute-driven heuristics

The Heuristic Attribute heuristic node …

🝰 Shortest Distance

Subtitle

The Shortest Distance heuristic node …

🝰 Feedback

Subtitle

The Feedback heuristic node …

🝰 Inertia

Subtitle

The Inertia heuristic node …

🝰 Steepness

Favor flat paths

The Steepness heuristic node …

🝰 Azimuth

Subtitle

The Azimuth heuristic node …

🝰 Least Nodes

Subtitle

The Least Nodes heuristic node …