question

Steven Chen avatar image
0 Likes"
Steven Chen asked Joerg Vogel commented

AGV's Selection of shortest Path

Dear FLEXSIM users,

As you may have known, AGVs select the shortest path to go by default when we do not design additional logics. But here I just got a question – how and where can we be sure about such a setting, for instance, by its coding or function interfaces?

In light of this, I have already observed the behavior by designing a simple AGV model, which validated the logic successfully.

Despite the proven system, I would like to know by what other means I can understand the path-selecting mechanism and how it works.

Thank you for your precious time and review

FlexSim 21.1.0
agvflexsim 21.1.0pathdijkstra
· 1
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.

Jeanette F avatar image Jeanette F ♦♦ commented ·

Hi @Steven Chen, was Joerg Vogel's answer helpful? If so, please click the red "Accept" button at the bottom of their answer. Or if you still have questions, add a comment and we'll continue the conversation.

If we haven't heard back from you within 3 business days we'll auto-accept an answer, but you can always unaccept and comment back to reopen your question.

0 Likes 0 ·

1 Answer

Joerg Vogel avatar image
0 Likes"
Joerg Vogel answered Joerg Vogel commented

Keyword is dijkstra

here is an example

https://answers.flexsim.com/questions/45455/which-path-to-take-between-two-points-on-a-network.html

by Phil.

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

anthony.johnson avatar image anthony.johnson ♦♦ commented ·

FYI, the soon-to-be-released version 21.2 will add more flexibility for configuring Dijkstra's algorithm.

1. You can configure the "cost" function to divide by speed, meaning choose fastest route instead of shortest.

2. You can configure the "cost" function to multiply by a path-specific multiplier.

3. You can define conditional rules for paths. When the conditional rule is false, the path will be closed, and agvs will route around them.

Also, it will provide more information on the Dijkstra path costing. When you right-click on a control point and select "show routing accessibility" then hover the cursor over other path points, it will show various costing data associated with navigating to the destination from the hovered point

1 Like 1 ·
Joerg Vogel avatar image Joerg Vogel anthony.johnson ♦♦ commented ·
@anthony.johnson , will we see a demo model demonstrating the effects like you introduced demo models and a video for social forces?
0 Likes 0 ·