25,034 research outputs found
Efficient Multi-Robot Coverage of a Known Environment
This paper addresses the complete area coverage problem of a known
environment by multiple-robots. Complete area coverage is the problem of moving
an end-effector over all available space while avoiding existing obstacles. In
such tasks, using multiple robots can increase the efficiency of the area
coverage in terms of minimizing the operational time and increase the
robustness in the face of robot attrition. Unfortunately, the problem of
finding an optimal solution for such an area coverage problem with multiple
robots is known to be NP-complete. In this paper we present two approximation
heuristics for solving the multi-robot coverage problem. The first solution
presented is a direct extension of an efficient single robot area coverage
algorithm, based on an exact cellular decomposition. The second algorithm is a
greedy approach that divides the area into equal regions and applies an
efficient single-robot coverage algorithm to each region. We present
experimental results for two algorithms. Results indicate that our approaches
provide good coverage distribution between robots and minimize the workload per
robot, meanwhile ensuring complete coverage of the area.Comment: In proceedings of IEEE/RSJ International Conference on Intelligent
Robots and Systems (IROS), 201
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
Efficient exploration of unknown indoor environments using a team of mobile robots
Whenever multiple robots have to solve a common task, they need to coordinate their actions to carry out the task efficiently and to avoid interferences between individual robots. This is especially the case when considering the problem of exploring an unknown environment with a team of mobile robots. To achieve efficient terrain coverage with the sensors of the robots, one first needs to identify unknown areas in the environment. Second, one has to assign target locations to the individual robots so that they gather new and relevant information about the environment with their sensors. This assignment should lead to a distribution of the robots over the environment in a way that they avoid redundant work and do not interfere with each other by, for example, blocking their paths. In this paper, we address the problem of efficiently coordinating a large team of mobile robots. To better distribute the robots over the environment and to avoid redundant work, we take into account the type of place a potential target is located in (e.g., a corridor or a room). This knowledge allows us to improve the distribution of robots over the environment compared to approaches lacking this capability. To autonomously determine the type of a place, we apply a classifier learned using the AdaBoost algorithm. The resulting classifier takes laser range data as input and is able to classify the current location with high accuracy. We additionally use a hidden Markov model to consider the spatial dependencies between nearby locations. Our approach to incorporate the information about the type of places in the assignment process has been implemented and tested in different environments. The experiments illustrate that our system effectively distributes the robots over the environment and allows them to accomplish their mission faster compared to approaches that ignore the place labels
Robot swarming applications
This paper discusses the different modes of operation of a swarm of robots: (i) non-communicative swarming, (ii) communicative swarming, (iii) networking, (iv) olfactory-based navigation and (v) assistive swarming. I briefly present the state of the art in swarming and outline the major techniques applied for each mode of operation and discuss the related problems and expected results
Autonomous 3D Exploration of Large Structures Using an UAV Equipped with a 2D LIDAR
This paper addressed the challenge of exploring large, unknown, and unstructured
industrial environments with an unmanned aerial vehicle (UAV). The resulting system combined
well-known components and techniques with a new manoeuvre to use a low-cost 2D laser to measure
a 3D structure. Our approach combined frontier-based exploration, the Lazy Theta* path planner, and
a flyby sampling manoeuvre to create a 3D map of large scenarios. One of the novelties of our system
is that all the algorithms relied on the multi-resolution of the octomap for the world representation.
We used a Hardware-in-the-Loop (HitL) simulation environment to collect accurate measurements
of the capability of the open-source system to run online and on-board the UAV in real-time. Our
approach is compared to different reference heuristics under this simulation environment showing
better performance in regards to the amount of explored space. With the proposed approach, the UAV
is able to explore 93% of the search space under 30 min, generating a path without repetition that
adjusts to the occupied space covering indoor locations, irregular structures, and suspended obstaclesUnión Europea Marie Sklodowska-Curie 64215Unión Europea MULTIDRONE (H2020-ICT-731667)Uniión Europea HYFLIERS (H2020-ICT-779411
- …