Abstract: This paper presents a heuristic algorithm for minimizing the makespan required to route a set of agents inhabiting a shared guidepath network from their initial locations to their respective ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results