Contribution to the factory io project 115 (Calculate shipments using the DIJKSTRA algorithm)

Hello

In this contribution, I won’t be creating the scene, as I find it repetitive to do the same thing again. Instead, I’ll use the simulator to test the application I designed to calculate the shortest distance between two points. While we can force a specific route by simply adjusting the distances, I want to explore it in as much detail as possible, because I like things done well.

It goes without saying that none of this would be possible without having known the FACTORY IO simulator, because this app is a continuation of contribution 114, regarding message control, which also addresses this topic that brings us here.

Here’s the idea; I hope you find it interesting:

Regards.

Hello

Finally, we completed the part where the data was sent to each crane. I must emphasize that if you are new to this programming, you should only do what you see in the videos, excluding the Dijkstra section, focusing solely on the conveyor belts and tables. You will have time to complete the rest later.

In this case, we won’t be adding any more cranes or tables. We simulated it with Vijeo Designer, and if the program runs as you see it, I assure you it will work in the scene as well.

Finally, it just needs the pallet to be picked up by the crane and taken to the designated shelf once it’s moving towards it, and that’s it. But in my case, that would be too repetitive; everything has its limits, and I’m not going to go beyond them.

For now, that’s all. Unless I discover something new in the future, I hope these shared projects will serve as a reference for future students and teachers.

Regards.