Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Luigi Freda

dblp:36/3969 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
0since 2021 · last 2017
0000-0002-2268-6045ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 5 first-authorSystems, architecture and hardware · 9 · 5 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Reinforcement learning · 73% Robot navigation and mapping · 15% Multi-agent systems · 12%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
exploration
0.232007
A Randomized Strategy for Cooperative Robot Exploration · ICRA 2007
Frontier-Based Probabilistic Strategies for Sensor-Based Exploration · ICRA 2005
The SRT Method: Randomized Strategies for Exploration · ICRA 2004
Machine learning › Reinforcement learning › exploration › autonomous exploration › mobile robot exploration
cooperative exploration
0.112007
A Randomized Strategy for Cooperative Robot Exploration · ICRA 2007
Machine learning › Reinforcement learning › exploration › multi-robot exploration
decentralized exploration
0.112007
A Randomized Strategy for Cooperative Robot Exploration · ICRA 2007
Robotics › Robot navigation and mapping
localization
0.112007
Learning Combinatorial Information from Alignments of Landmarks · ICRA 2007
Knowledge, reasoning and agents › Multi-agent systems
multi-robot systems
0.112007
A Randomized Strategy for Cooperative Robot Exploration · ICRA 2007
Computational geometry › geometric data structures › space partitioning
cell decomposition
0.112007
Learning Combinatorial Information from Alignments of Landmarks · ICRA 2007
Machine learning › Reinforcement learning › exploration › autonomous exploration
frontier-based exploration
0.112005
Frontier-Based Probabilistic Strategies for Sensor-Based Exploration · ICRA 2005
Machine learning › Reinforcement learning › exploration › autonomous exploration
sensor-based exploration
0.012004
The SRT Method: Randomized Strategies for Exploration · ICRA 2004
Robotics › Robot navigation and mapping
map building
0.012004
The SRT Method: Randomized Strategies for Exploration · ICRA 2004

Methods — techniques the papers use, named apart from their topics

feedback motion commands · 0.1randomized incremental planning · 0.1decentralized coordination · 0.1simulation · 0.1probabilistic strategy · 0.1randomized incremental tree · 0.0perception strategies · 0.0
YearPublicationVenuePosition
2017 RCAMP: A resilient communication-aware motion planner for mobile robots with autonomous repair of wireless connectivity
abstract
Mobile robots, be it autonomous or teleoperated, require stable communication with the base station to exchange valuable information. Given the stochastic elements in radio signal propagation, such as shadowing and fading, and the possibilities of unpredictable events or hardware failures, communication loss often presents a significant mission risk, both in terms of probability and impact, especially in Urban Search and Rescue (USAR) operations. Depending on the circumstances, disconnected robots are either abandoned, or attempt to autonomously back-trace their way to the base station. Although recent results in Communication-Aware Motion Planning can be used to effectively manage connectivity with robots, there are no results focusing on autonomously re-establishing the wireless connectivity of a mobile robot without back-tracing or using detailed a priori information of the network. In this paper, we present a robust and online radio signal mapping method using Gaussian Random Fields, and propose a Resilient Communication-Aware Motion Planner (RCAMP) that integrates the above signal mapping framework with a motion planner. RCAMP considers both the environment and the physical constraints of the robot, based on the available sensory information. We also propose a self-repair strategy using RCMAP, that takes both connectivity and the goal position into account when driving to a connection-safe position in the event of a communication loss. We demonstrate the proposed planner in a set of realistic simulations of an exploration task in single or multi-channel communication scenarios.
Sergio Caccamo, Ramviyas Parasuraman, Luigi Freda, Mario Gianni, Petter Ögren
IROS3
2009 An exploration method for general robotic systems equipped with multiple sensors
abstract
This paper presents a novel method for sensor-based exploration of unknown environments by a general robotic system equipped with multiple sensors. The method is based on the incremental generation of a configuration-space data structure called Sensor-based Exploration Tree (SET). The expansion of the SET is driven by information at the world level, where the perception process takes place. In particular, the frontiers of the explored region efficiently guide the search for informative view configurations. Different exploration strategies may be obtained by instantiating the general SET method with different sampling techniques. Two such strategies are presented and compared by simulations in non-trivial 2D and 3D worlds. A completeness analysis of SET is given in the paper.
Luigi Freda, Giuseppe Oriolo, Francesco Vecchioli
IROS1
2008 Sensor-based Exploration for general robotic systems
abstract
We present a method for sensor-based exploration of unknown environments by a robotic system equipped with rangefinders. The method is based on the incremental generation of a configuration-space data structure called sensor-based exploration tree (SET). The expansion of the SET is driven by information at the world level, where the perception process takes place. In particular, the frontiers of the explored region are used to guide the search for informative view configurations. Various exploration strategies may be obtained by instantiating the general SET method with different sampling techniques. Two of these are compared by simulations in 2D and 3D worlds.
Luigi Freda, Giuseppe Oriolo, Francesco Vecchioli
IROS1
2007 A Randomized Strategy for Cooperative Robot Exploration
abstract
We present a cooperative exploration strategy for mobile robots. The method is based on the randomized incremental generation of a collection of data structures called sensor-based random trees, each representing a roadmap of an explored area with an associated safe region. Decentralized cooperation and coordination mechanisms are introduced so as to improve the exploration efficiency and to avoid conflicts. Simulations in various environments are presented to show the performance of the proposed technique.
Antonio Franchi, Luigi Freda, Giuseppe Oriolo, Marilena Vendittelli
ICRA2
2007 Learning Combinatorial Information from Alignments of Landmarks
abstract
This paper characterizes the information space of a robot moving in the plane with limited sensing. The robot has a landmark detector, which provides the cyclic order of the landmarks around the robot, and it also has a touch sensor, that indicates when the robot is in contact with the environment boundary. The robot cannot measure any precise distances or angles, and does not have an odometer or a compass. We propose to characterize the information space associated with such robot through the swap cell decomposition. We show how to construct such decomposition through its dual, called the swap graph, using two kinds of feedback motion commands based on the landmarks sensed.
Luigi Freda, Benjamín Tovar, Steven M. LaValle
ICRA1
2006 A Randomized Method for Integrated Exploration
abstract
We present an integrated exploration strategy for mobile robots. The method is based on the randomized incremental generation of a data structure called sensor-based random tree (SRT), which represents a roadmap of the explored area with an associated safe region. A continuous localization procedure based on natural features of the safe region is integrated in the scheme. Both the information gain and the localization potential are taken into account when evaluating candidate configurations for exploration. Simulations and experiments on the MagellanPro robot show the performance of the proposed technique
Luigi Freda, Francesco Loiudice, Giuseppe Oriolo
IROS1
2005 Frontier-Based Probabilistic Strategies for Sensor-Based Exploration
abstract
We present a frontier-based modification of the SRT (Sensor-based Random Tree) method, a previously proposed probabilistic strategy for sensor-based exploration of unknown environments by a mobile robot. The idea is to improve the efficiency of the method by biasing the randomized generation of configurations towards unexplored areas. Effective implementations of this strategy are proposed for SRT-Ball and SRT-Star, two instances of the general SRT method corresponding to different perception attitudes and sensing equipments. Comparative simulations are presented to show the benefits of the proposed technique.
Luigi Freda, Giuseppe Oriolo
ICRA1
2005 Visual servoing of a wheeled mobile robot for intercepting a moving object
abstract
We present a vision-based scheme for driving a nonholonomic mobile robot to intercept a moving target. Our method relies on a two-level approach. On the lower level, the pan-tilt platform which carries the on-board camera is controlled so as to keep the target at the center of the image plane. On the higher level, the robot operates under the assumption that the camera system achieves perfect tracking. In particular, the relative position of the ball is retrieved from the pan/tilt angles through simple geometry, and used to compute a control law driving the robot to the target. Various possible choices are discussed for the high-level robot controller. The proposed visual interception method is validated through simulations as well as experiments on the mobile robot MagellanPro.
Francesco Capparella, Luigi Freda, Marco Malagnino, Giuseppe Oriolo
IROS2
2004 The SRT Method: Randomized Strategies for Exploration
abstract
We present a method for sensor-based exploration of unknown environments by a mobile robot. The method is based on the randomized incremental generation of a data structure called sensor-based random tree (SRT), which represents a roadmap of the explored area with an associated safe region. Different exploration strategies may be obtained by instantiating the general method with different perception techniques. Two such techniques are discussed: the first, conservative and particularly suited to noisy sensors, results in an exploration strategy called SRT-Ball. The second perception technique is more confident, and the corresponding strategy is called SRT-Star. The two strategies are critically compared by simulations as well as by experiments on the MagellanPro robot.
Giuseppe Oriolo, Marilena Vendittelli, Luigi Freda, Giulio Troso
ICRA3