Localization uncertainty-aware autonomous exploration and mapping with aerial robots using receding horizon path-planning

Developing a Flying Explorer for Autonomous Digital Modelling in Wild Unknowns

Digital modelling stands as a pivotal step in the realm of Digital Twinning. The future trend of Digital Twinning involves automated exploration and environmental modelling in complex scenes. In our study, we propose an innovative solution for robot odometry, path planning, and exploration in unknown outdoor environments, with a focus on Digital modelling. The approach uses a minimum cost formulation with pseudo-randomly generated objectives, integrating multi-path planning and evaluation, with emphasis on full coverage of unknown maps based on feasible boundaries of interest. The approach allows for dynamic changes to expected targets and behaviours. The evaluation is conducted on a robotic platform with a lightweight 3D LiDAR sensor model. The robustness of different types of odometry is compared, and the impact of parameters on motion planning is explored. The consistency and efficiency of exploring completely unknown areas are assessed in both indoor and outdoor scenarios. The experiment shows that the method proposed in this article can complete autonomous exploration and environmental modelling tasks in complex indoor and outdoor scenes. Finally, the study concludes by summarizing the reasons for exploration failures and outlining future focuses in this domain.

Efficient Informative Path Planning via Normalized Utility in Unknown Environments Exploration

Exploration is an important aspect of autonomous robotics, whether it is for target searching, rescue missions, or reconnaissance in an unknown environment. In this paper, we propose a solution to efficiently explore the unknown environment by unmanned aerial vehicles (UAV). Innovatively, a topological road map is incrementally built based on Rapidly-exploring Random Tree (RRT) and maintained along with the whole exploration process. The topological structure can provide a set of waypoints for searching an optimal informative path. To evaluate the path, we consider the information measurement based on prior map uncertainty and the distance cost of the path, and formulate a normalized utility to describe information-richness along the path. The informative path is determined in every period by a local planner, and the robot executes the planned path to collect measurements of the unknown environment and restructure a map. The proposed framework and its composed modules are verified in two 3-D environments, which exhibit better performance in improving the exploration efficiency than other methods.

Fixed-Wing UAV Energy Efficient 3D Path Planning in Cluttered Environments

UAV path planning in 3D cluttered and uncertain environments centers on finding an optimal / sub-optimal collision-free path, considering in parallel geometric, physical and temporal constraints, fox example, obstacles, infrastructure, physical or artificial landmarks, etc. This paper introduces a novel node-based algorithm, called Energy Efficient A* (EEA*), which is based on the A* search algorithm, but overcomes some of its key limitations. The EEA* deals with 3D environments, it is robust converging fast to the solution, it is energy efficient and it is real-time implementable and executable. In addition to the EEA*, a local path planner is also derived to cope with unknown dynamic threats within the working environment. The EEA* and the local path planner are first implemented and evaluated via simulated experiments using a fixed-wing UAV operating in mountain-like 3D environments, and in the presence of unknown dynamic obstacles. This is followed by evaluating a set up where three UAVs are commanded to follow their respective paths in a safe way. The energy efficiency of EEA* is also tested and compared with the conventional A* algorithm.

Perception-Aware Planning for Active SLAM in Dynamic Environments

This paper presents a perception-aware path planner for active SLAM in dynamic environments using micro-aerial vehicles (MAV). The “Next-Best-View” planner (NBVP planner) is combined with an active loop closing, which is called the Active Loop Closing Planner (ALCP planner). The planner is proposed to avoid both static and dynamic obstacles in unknown environments while reducing the uncertainty of the SLAM system and further improving the accuracy of localization. First, the receding horizon strategy is adopted to find the next waypoint. The cost function that combines the exploration gain and the loop closing gain is designed. The former can reduce the mapping uncertainty, while the latter takes the loop closing possibility into consideration. Second, a key waypoint selection strategy is designed. The selected key waypoints, instead of all waypoints, are treated as potential loop-closing points to make the algorithm more efficient. Moreover, a fuzzy RRT-based dynamic obstacle avoidance algorithm is adopted to realize obstacle avoidance in dynamic environments. Simulations in different challenging scenarios are conducted to verify the effectiveness of the proposed algorithm.

Path Planning in Localization Uncertaining Environment Based on Dijkstra Method

Path planning obtains the trajectory from one point to another with the robot's kinematics model and environment understanding. However, as the localization uncertainty through the odometry sensors is inevitably affected, the position of the moving path will deviate further and further compared to the original path, which leads to path drift in GPS denied environments. This article proposes a novel path planning algorithm based on Dijkstra to address such issues. By combining statistical characteristics of localization error caused by dead-reckoning, the replanned path with minimum cumulative error is generated with uniforming distribution in the searching space. The simulation verifies the effectiveness of the proposed algorithm. In a real scenario with measurement noise, the results of the proposed algorithm effectively reduce cumulative error compared to the results of the conventional planning algorithm.