3 accepted papers
This paper introduces the Close Enough Orienteering Problem (CEOP) for planning missions with multi-rotor aerial vehicles considering their maximal velocity and acceleration limits. The addressed problem stands to select the most rewarding target locations and sequence to visit them in the given lim…
Sampling-based motion planners are often used to solve motion planning problems for robots with many degrees of freedom. These planners explore the related configuration space by random sampling. The well-known issue of the sampling-based planners is the narrow passage problem. Narrow passages are s…
In this paper, we address a generalization of the Orienteering Problem (OP) for curvature-constrained vehicles and to problems where it is allowed to collect a reward associated to each target location within a specified distance from the target. The addressed problem combines challenges of the comb…