|
|
|
|
|
Tamás Kegyes, Alex Kummer, Zoltán Süle and János Abonyi
We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go. We showed that both constrained shortest Hamiltonian pathfinding problems and disassembly line bal...
ver más
|
|
|
|
|