question

Lv GG avatar image
0 Likes"
Lv GG asked Steven Hamoen commented

How to apply a path planning algorithm to AGV module, such as Astar algorithm

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。

FlexSim 19.0.0
agvalgorithm
1616742838898.png (103.9 KiB)
· 2
5 |100000
Toggle Comment visibility. Current Visibility: Viewable by all users

Up to 12 attachments (including images) can be used with a maximum of 23.8 MiB each and 47.7 MiB total.

Wang Yang avatar image Wang Yang commented ·

We have noticed your problem, you can also directly contact the Chinese service provider, our technical support email address: [email protected]

0 Likes 0 ·
Lv GG avatar image Lv GG Wang Yang commented ·

thank you. I willl take your advice.

0 Likes 0 ·

1 Answer

Steven Hamoen avatar image
1 Like"
Steven Hamoen answered Steven Hamoen commented

@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.

· 2
5 |100000
Toggle Comment visibility. Current Visibility: Viewable by all users

Up to 12 attachments (including images) can be used with a maximum of 23.8 MiB each and 47.7 MiB total.

Lv GG avatar image Lv GG commented ·

Thank you for your prompt answer. If you can give some specific operation or related examples, I will be very grateful.

0 Likes 0 ·
Steven Hamoen avatar image Steven Hamoen Lv GG commented ·

@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.

0 Likes 0 ·