51,552 research outputs found
Multi-Robot Complete Coverage Using Directional Constraints
Complete coverage relies on a path planning algorithm that will move one or more robots, including the actuator, sensor, or body of the robot, over the entire environment. Complete coverage of an unknown environment is used in applications like automated vacuum cleaning, carpet cleaning, lawn mowing, chemical or radioactive spill detection and cleanup, and humanitarian de-mining.
The environment is typically decomposed into smaller areas and then assigned to individual robots to cover. The robots typically use the Boustrophedon motion to cover the cells. The location and size of obstacles in the environment are unknown beforehand. An online algorithm using sensor-based coverage with unlimited communication is typically used to plan the path for the robots.
For certain applications, like robotic lawn mowing, a pattern might be desirable over a random irregular pattern for the coverage operation. Assigning directional constraints to the cells can help achieve the desired pattern if the path planning part of the algorithm takes the directional constraints into account.
The goal of this dissertation is to adapt the distributed coverage algorithm with unrestricted communication developed by Rekleitis et al. (2008) so that it can be used to solve the complete coverage problem with directional constraints in unknown environments while minimizing repeat coverage. It is a sensor-based approach that constructs a cellular decomposition while covering the unknown environment.
The new algorithm takes directional constraints into account during the path planning phase. An implementation of the algorithm was evaluated in simulation software and the results from these experiments were compared against experiments conducted by Rekleitis et al. (2008) and with an implementation of their distributed coverage algorithm.
The results of this study confirm that directional constraints can be added to the complete coverage algorithm using multiple robots without any significant impact on performance. The high-level goals of complete coverage were still achieved. The work was evenly distributed between the robots to reduce the time required to cover the cells
Visibility-based coverage of mobile sensors in non-convex domains
The area coverage problem of mobile sensor networks has attracted much attention recently, as mobile sensors find many important applications in remote and hostile environments. However, the deployment of mobile sensors in a non-convex domain is nontrivial due to the more general shape of the domain and the attenuation of sensing capabilities caused by the boundary walls or obstacles. We consider the problem of exploration and coverage by mobile sensors in an unknown non-convex domain. We propose the definition of 'visibility-based Voronoi diagram' and extend the continuous-time Lloyd's method, which only works for convex domains, to deploy the mobile sensors in the unknown environments in a distributed manner. Our simulations show the effectiveness of the proposed algorithms. © 2011 IEEE.published_or_final_versionThe 8th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD2011), Qingdao, China, 28-30 June 2011. In Proceedings of the 8th ISVD, 2011, p. 105-11
Sensor-Based Topological Coverage And Mapping Algorithms For Resource-Constrained Robot Swarms
Coverage is widely known in the field of sensor networks as the task of deploying sensors to completely cover an environment with the union of the sensor footprints. Related to coverage is the task of exploration that includes guiding mobile robots, equipped with sensors, to map an unknown environment (mapping) or clear a known environment (searching and pursuit- evasion problem) with their sensors. This is an essential task for robot swarms in many robotic applications including environmental monitoring, sensor deployment, mine clearing, search-and-rescue, and intrusion detection. Utilizing a large team of robots not only improves the completion time of such tasks, but also improve the scalability of the applications while increasing the robustness to systems’ failure.
Despite extensive research on coverage, mapping, and exploration problems, many challenges remain to be solved, especially in swarms where robots have limited computational and sensing capabilities. The majority of approaches used to solve the coverage problem rely on metric information, such as the pose of the robots and the position of obstacles. These geometric approaches are not suitable for large scale swarms due to high computational complexity and sensitivity to noise. This dissertation focuses on algorithms that, using tools from algebraic topology and bearing-based control, solve the coverage related problem with a swarm of resource-constrained robots.
First, this dissertation presents an algorithm for deploying mobile robots to attain a hole-less sensor coverage of an unknown environment, where each robot is only capable of measuring the bearing angles to the other robots within its sensing region and the obstacles that it touches. Next, using the same sensing model, a topological map of an environment can be obtained using graph-based search techniques even when there is an insufficient number of robots to attain full coverage of the environment. We then introduce the landmark complex representation and present an exploration algorithm that not only is complete when the landmarks are sufficiently dense but also scales well with any swarm size. Finally, we derive a multi-pursuers and multi-evaders planning algorithm, which detects all possible evaders and clears complex environments
End-to-end Reinforcement Learning for Online Coverage Path Planning in Unknown Environments
Coverage path planning is the problem of finding the shortest path that
covers the entire free space of a given confined area, with applications
ranging from robotic lawn mowing and vacuum cleaning, to demining and
search-and-rescue tasks. While offline methods can find provably complete, and
in some cases optimal, paths for known environments, their value is limited in
online scenarios where the environment is not known beforehand, especially in
the presence of non-static obstacles. We propose an end-to-end reinforcement
learning-based approach in continuous state and action space, for the online
coverage path planning problem that can handle unknown environments. We
construct the observation space from both global maps and local sensory inputs,
allowing the agent to plan a long-term path, and simultaneously act on
short-term obstacle detections. To account for large-scale environments, we
propose to use a multi-scale map input representation. Furthermore, we propose
a novel total variation reward term for eliminating thin strips of uncovered
space in the learned path. To validate the effectiveness of our approach, we
perform extensive experiments in simulation with a distance sensor, surpassing
the performance of a recent reinforcement learning-based approach
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
Safe Local Exploration for Replanning in Cluttered Unknown Environments for Micro-Aerial Vehicles
In order to enable Micro-Aerial Vehicles (MAVs) to assist in complex,
unknown, unstructured environments, they must be able to navigate with
guaranteed safety, even when faced with a cluttered environment they have no
prior knowledge of. While trajectory optimization-based local planners have
been shown to perform well in these cases, prior work either does not address
how to deal with local minima in the optimization problem, or solves it by
using an optimistic global planner.
We present a conservative trajectory optimization-based local planner,
coupled with a local exploration strategy that selects intermediate goals. We
perform extensive simulations to show that this system performs better than the
standard approach of using an optimistic global planner, and also outperforms
doing a single exploration step when the local planner is stuck. The method is
validated through experiments in a variety of highly cluttered environments
including a dense forest. These experiments show the complete system running in
real time fully onboard an MAV, mapping and replanning at 4 Hz.Comment: Accepted to ICRA 2018 and RA-L 201
- …