Optimal Routing Schedules for Robots Operating in Aisle-Structures
Francesco Betti Sorbelli,Stefano Carpin,Federico Corò,Alfredo Navarra,Cristina M. Pinotti,Francesco Betti Sorbelli,Stefano Carpin,Federico Corò,Alfredo Navarra,Cristina M. Pinotti
In this paper, we consider the Constant-cost Orienteering Problem (COP) where a robot, constrained by a limited travel budget, aims at selecting a path with the largest reward in an aisle-graph. The aisle-graph consists of a set of loosely connected rows where the robot can change lane only at either end, but not in the middle. Even when considering this special type of graphs, the orienteering pr...
