I have used Dijkstra's algorithm for shortest path which enables the bots to find their way.
At the beginning of the level, the algorithm executes and starts calculating paths between all connected nodes. A static tree is created in a 3D array object.
The bot then uses this to reach a destination platform given its current platform.
It still has a few bugs, but will get better with some tweaking.
Please have a look and would love some feedback.