We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Previous work [3, 6, 9, 8, 7, 1] has presented the time optimal trajectories for three classes of non-holonomic mobile robots: steered cars that can only go forwards, steered cars...
— In this paper, we propose an action planning algorithm and its evaluation method based on dynamic simulation for a novel type of hybrid leg-wheel rover for planetary exploratio...
Eric Rohmer, Giulio Reina, Genya Ishigami, Keiji N...
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
Two stereo vision-based mobile robots navigate and autonomously explore their environment safely while building occupancy grid maps of the environment. A novel landmark recognitio...