We propose a decentralized variant of Monte Carlo tree search (MCTS) that is suitable for a
variety of tasks in multi-robot active perception. Our algorithm allows each robot to optimize …

Routing and path planning problems that involve spatial coverage have received increasing
attention in recent years in different application areas. Spatial coverage refers to the …

Travel route planning aims to map out a feasible sightseeing itinerary for a traveler covering
famous attractions and meeting the tourist's desire. It is very useful for tourists to plan their …

This paper addresses the recently proposed generalization of the Orienteering Problem
(OP), referred to as the Set Orienteering Problem (SOP). The OP stands to find a tour over a …

We propose a self-organising map (SOM) algorithm as a solution to a new multi-goal path
planning problem for active perception and data collection tasks. We optimise paths for a …

This paper addresses the Set Orienteering Problem which is a generalization of the
Orienteering Problem where the customers are grouped in clusters, and the profit associated …

Robotics has dramatically increased our ability to gather data about our environments. This
is an opportune time for the robotics and algorithms community to come together to …

In this paper, we address the Dubins Orienteering Problem with Neighborhoods (DOPN) a
novel problem derived from the regular Orienteering Problem (OP). In the OP, one tries to …

Data collection missions are one of the many effective use cases of unmanned aerial
vehicles (UAVs), where the UAV is required to visit a predefined set of target locations to …

In this paper, we present two novel algorithms for information space topological planning
that identify topological features in an information field and use them to plan maximally …