for example，I would like to find a shortest path from Processor1 to each Sink in the figure above. if possible, it is best to use a dynamic path planning algorithm, such as genetic algorithm。
How to apply a path planning algorithm to AGV module, such as Astar algorithm
FlexSim 19.0.0
We have noticed your problem, you can also directly contact the Chinese service provider, our technical support email address: [email protected]
@Lv GG FLexSim uses Dijkstra algorithm already to calculate the shortest path in networks. If you want to do something yourself you should get all the controlpoints from the tree, get the distances between them with cpdistance() and then program or link with what ever algorithm you want to use.
Thank you for your prompt answer. If you can give some specific operation or related examples, I will be very grateful.
@Lv GG I'm sorry I can't because you are not specifying what it exactly is that you need or want. For instance you ask for specific operations. But what operations are you looking for. Are you talking about finding all the controlpoints? In that case please try yourself and post your effort and ask why it is not working.
18 People are following this question.
