3 citations · 4 across the 6 of their papers we have counts for
10 papers
Solving Stochastic Orienteering Problems with Chance Constraints Using Monte Carlo Tree Search
Stefano Carpin
We present a new Monte Carlo Tree Search (MCTS) algorithm to solve the stochastic orienteering problem with chance constraints, i.e., a version of the problem where travel costs ar…
Solving Stochastic Orienteering Problems with Chance Constraints Using a GNN Powered Monte Carlo Tree Search
Marcos Abel Zuzuárregui, Stefano Carpin
Leveraging the power of a graph neural network (GNN) with message passing, we present a Monte Carlo Tree Search (MCTS) method to solve stochastic orienteering problems with chance…
Informative path planning for scalar dynamic reconstruction using coregionalized Gaussian processes and a spatiotemporal kernel
Lorenzo Booth, Stefano Carpin
The proliferation of unmanned vehicles offers many opportunities for solving environmental sampling tasks with applications in resource monitoring and precision agriculture. Inform…
Speeding up Routing Schedules on Aisle-Graphs with Single Access
Francesco Betti Sorbelli, Stefano Carpin, Federico Coro +3
In this paper, we study the Orienteering Aisle-graphs Single-access Problem (OASP), a variant of the orienteering problem for a robot moving in a so-called single-access aisle-grap…
Task Planning on Stochastic Aisle Graphs for Precision Agriculture
Xinyue Kan, Thomas C. Thayer, Stefano Carpin +1
This work addresses task planning under uncertainty for precision agriculture applications whereby task costs are uncertain and the gain of completing a task is proportional to res…
Optimal Routing Schedules for Robots Operating in Aisle-Structures
Francesco Betti Sorbelli, Stefano Carpin, Federico Corò +2
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 a…