We present an error tolerant path planning algorithm for Micro Aerial Vehicles (MAV) swarms. We assume a MAV navigation system without relying on GPS-like techniques. The MAV find their navigation path by using their sensors and cameras, in order to identify and follow a series of visual landmarks. The visual landmarks lead the MAV towards the target destination. MAVs are assumed to be unaware of the terrain and locations of the landmarks. Landmarks are also assumed to hold a-priori information, whose interpretation (by the MAVs) is prone to errors. We distinguish two types of errors, namely, recognition and advice. Recognition errors are due to misinterpretation of sensed data and a-priori information or confusion of objects (e.g., due to faulty sensors). Advice errors are due to outdated or wrong information associated to the landmarks (e.g., due to weather conditions). Our path planning algorithm proposes swarm cooperation. MAVs communicate and exchange information wirelessly, to minimize the recognition and advice error ratios. By doing this, the navigation system experiences a quality amplification in terms of error reduction. As a result, our solution successfully provides an adaptive error tolerant navigation system. Quality amplification is parametetrized with regard to the number of MAVs. We validate our approach with theoretical proofs and numeric simulations.
Surveys on path planning algorithms for unmanned aerial vehicles have been authored by @cite_18 and @cite_21 . Several algorithms build on solutions originally created for computer networks. Some of the proposed solutions leverage algorithms created in the field of classical robotics, such as approaches using artificial potential functions @cite_12 , random trees @cite_2 or Voronoi diagrams @cite_5 . Path planning may be addressed in conjunction with team work and formation control @cite_10 . There are ideas that have been tailored specifically to quadcopters @cite_20 .
@cite_18 @cite_21 @cite_2 @cite_5 @cite_20 @cite_10 @cite_12
2409009991 2739036405 2338554534 2571268510
This paper presents a novel path planning algorithm for the autonomous exploration of unknown space using aerial robotic platforms. The proposed planner employs a receding horizon “next-best-view” scheme: In an online computed random tree it finds the best branch, the quality of which is determined by the amount of unmapped space that can be explored. Only the first edge of this branch is executed at every planning step, while repetition of this procedure leads to complete exploration results. The proposed planner is capable of running online, onboard a robot with limited resources. Its high performance is evaluated in detailed simulation studies as well as in a challenging real world experiment using a rotorcraft micro aerial vehicle. Analysis on the computational complexity of the algorithm is provided and its good scaling properties enable the handling of large scale and complex problem setups. This paper presents a novel path planning algorithm for autonomous, uncertainty-aware exploration and mapping of unknown environments using aerial robots. The proposed planner follows a two-step, receding horizon, belief space-based approach. At first, in an online computed tree the algorithm finds the branch that optimizes the amount of space expected to be explored. The first viewpoint configuration of this branch is selected, but the path towards it is decided through a second planning step. Within that, a new tree is sampled, admissible branches arriving at the reference viewpoint are found and the robot belief about its state and the tracked landmarks of the environment is propagated. The branch that minimizes the expected localization and mapping uncertainty is selected, the corresponding path is executed by the robot and the whole process is iteratively repeated. The proposed planner is capable of running online onboard a small aerial robot and its performance is evaluated using experimental studies in a challenging environment. The objective of this paper is to develop a vision-based navigation technique for micro aerial vehicles, quadrotor type, to operate in GPS-denied environment. The navigation method has been developed while using appearance-based Visual-Teach-and-Repeat (VT&R) technique. In a teaching phase, a quadrotor is manually navigated along a desired route to collect a set of reference images. In a repeating phase, the quadrotor is able to autonomously follow the desired route using these reference images. Self-localization is developed to determine the current segment of the desired route by a number of Speeded-Up Robust Features (SURF), matched between the current image and the reference images. In this paper, three methods of self-localization are proposed and compared. After performing self-localization, the quadrotor computes appearance-based motion control commands (desired yaw and height) for the next movement in order to keep track of the desired route. This computation is developed on Funnel Lane theory, which was originally proposed in Chen and Birchfield (IEEE Trans. Robot. 25(3), 749---754 (11)) for 2D navigation of a ground vehicle. The paper extends this theory to 3D navigation of a quadrotor.The proposed self-localization methods are tested with several image databases. Finally, an online experiment of proposed VT&R technique is demonstrated using Ar.Drone quadrotor model. We address the problem of planning a path for a ground robot through unknown terrain, using observations from a flying robot. In search and rescue missions, which are our target scenarios, the time from arrival at the disaster site to the delivery of aid is critically important. Previous works required exhaustive exploration before path planning, which is time-consuming but eventually leads to an optimal path for the ground robot. Instead, we propose active exploration of the environment, where the flying robot chooses regions to map in a way that optimizes the overall response time of the system, which is the combined time for the air and ground robots to execute their missions. In our approach, we estimate terrain classes throughout our terrain map, and we also add elevation information in areas where the active exploration algorithm has chosen to perform 3-D reconstruction. This terrain information is used to estimate feasible and efficient paths for the ground robot. By exploring the environment actively, we achieve superior response times compared to both exhaustive and greedy exploration strategies. We demonstrate the performance and capabilities of the proposed system in simulated and real-world outdoor experiments. To the best of our knowledge, this is the first work to address ground robot path planning using active aerial exploration.