I have an AGV path network that is a M x N grid (say 20x10) with a control point at every intersection. 2 AGVs make multiple stops on the grid at different control points. All paths are two-way, with a maximum allocation of 1 at each CP.
I always eventually get into a deadlock scenario even though both AGVs have multiple path options to get around each other.
I wanted to know if the AGVs ever recalculate and change paths or is it a static path calculated before the travel starts; i.e. if both AGVs calculate a path that is clear at the moment of planning but becomes blocked "live" when they meet on a path and block each other, leading to a deadlock.
If that is the case, is there a function to force an AGV to recalculate a path on the fly, or every time it is the Blocked state, or something along those lines?
Thanks
