Traversability Based Obstacle Avoidance Path-Planning Algorithm and Simulation System for Lunar Rover

2012 ◽  
Vol 5 (2) ◽  
pp. 827-830
Author(s):  
Linhui Li ◽  
Shumei Wu ◽  
Yibing Zhao ◽  
Mingheng Zhang ◽  
Lie Guo
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Simulation System ◽  
Lunar Rover ◽  
Planning Algorithm ◽  
Path Planning Algorithm

scholarly journals A 2D Optimal Path Planning Algorithm for Autonomous Underwater Vehicle Driving in Unknown Underwater Canyons

2021 ◽  
Vol 9 (3) ◽  
pp. 252
Author(s):  
Yushan Sun ◽  
Xiaokun Luo ◽  
Xiangrui Ran ◽  
Guocheng Zhang
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Autonomous Underwater Vehicles ◽  
Optimal Path ◽  
Small Scale ◽  
Target Point ◽  
Safe Driving ◽  
Policy Gradient ◽  
Planning Algorithm ◽  
Path Planning Algorithm

This research aims to solve the safe navigation problem of autonomous underwater vehicles (AUVs) in deep ocean, which is a complex and changeable environment with various mountains. When an AUV reaches the deep sea navigation, it encounters many underwater canyons, and the hard valley walls threaten its safety seriously. To solve the problem on the safe driving of AUV in underwater canyons and address the potential of AUV autonomous obstacle avoidance in uncertain environments, an improved AUV path planning algorithm based on the deep deterministic policy gradient (DDPG) algorithm is proposed in this work. This method refers to an end-to-end path planning algorithm that optimizes the strategy directly. It takes sensor information as input and driving speed and yaw angle as outputs. The path planning algorithm can reach the predetermined target point while avoiding large-scale static obstacles, such as valley walls in the simulated underwater canyon environment, as well as sudden small-scale dynamic obstacles, such as marine life and other vehicles. In addition, this research aims at the multi-objective structure of the obstacle avoidance of path planning, modularized reward function design, and combined artificial potential field method to set continuous rewards. This research also proposes a new algorithm called deep SumTree-deterministic policy gradient algorithm (SumTree-DDPG), which improves the random storage and extraction strategy of DDPG algorithm experience samples. According to the importance of the experience samples, the samples are classified and stored in combination with the SumTree structure, high-quality samples are extracted continuously, and SumTree-DDPG algorithm finally improves the speed of the convergence model. Finally, this research uses Python language to write an underwater canyon simulation environment and builds a deep reinforcement learning simulation platform on a high-performance computer to conduct simulation learning training for AUV. Data simulation verified that the proposed path planning method can guide the under-actuated underwater robot to navigate to the target without colliding with any obstacles. In comparison with the DDPG algorithm, the stability, training’s total reward, and robustness of the improved Sumtree-DDPG algorithm planner in this study are better.

scholarly journals Learning-Based End-to-End Path Planning for Lunar Rovers with Safety Constraints

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 796
Author(s):  
Xiaoqiang Yu ◽  
Ping Wang ◽  
Zexu Zhang
Keyword(s):  
Path Planning ◽  
Lunar Surface ◽  
Training Environment ◽  
Lunar Rover ◽  
Reward Function ◽  
Safety Constraints ◽  
Planning Algorithm ◽  
Lunar Rovers ◽  
End To End ◽  
Path Planning Algorithm

Path planning is an essential technology for lunar rover to achieve safe and efficient autonomous exploration mission, this paper proposes a learning-based end-to-end path planning algorithm for lunar rovers with safety constraints. Firstly, a training environment integrating real lunar surface terrain data was built using the Gazebo simulation environment and a lunar rover simulator was created in it to simulate the real lunar surface environment and the lunar rover system. Then an end-to-end path planning algorithm based on deep reinforcement learning method is designed, including state space, action space, network structure, reward function considering slip behavior, and training method based on proximal policy optimization. In addition, to improve the generalization ability to different lunar surface topography and different scale environments, a variety of training scenarios were set up to train the network model using the idea of curriculum learning. The simulation results show that the proposed planning algorithm can successfully achieve the end-to-end path planning of the lunar rover, and the path generated by the proposed algorithm has a higher safety guarantee compared with the classical path planning algorithm.

scholarly journals 2D Lidar-Based SLAM and Path Planning for Indoor Rescue Using Mobile Robots

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Xuexi Zhang ◽  
Jiajun Lai ◽  
Dongliang Xu ◽  
Huaijun Li ◽  
Minyue Fu
Keyword(s):  
Path Planning ◽  
Mobile Robots ◽  
Real Time ◽  
Obstacle Avoidance ◽  
Basic System ◽  
Rescue Robot ◽  
Planning Algorithm ◽  
Local Path ◽  
Slam Algorithm ◽  
Path Planning Algorithm

As the basic system of the rescue robot, the SLAM system largely determines whether the rescue robot can complete the rescue mission. Although the current 2D Lidar-based SLAM algorithm, including its application in indoor rescue environment, has achieved much success, the evaluation of SLAM algorithms combined with path planning for indoor rescue has rarely been studied. This paper studies mapping and path planning for mobile robots in an indoor rescue environment. Combined with path planning algorithm, this paper analyzes the applicability of three SLAM algorithms (GMapping algorithm, Hector-SLAM algorithm, and Cartographer algorithm) in indoor rescue environment. Real-time path planning is studied to test the mapping results. To balance path optimality and obstacle avoidance, A ∗ algorithm is used for global path planning, and DWA algorithm is adopted for local path planning. Experimental results validate the SLAM and path planning algorithms in simulated, emulated, and competition rescue environments, respectively. Finally, the results of this paper may facilitate researchers quickly and clearly selecting appropriate algorithms to build SLAM systems according to their own demands.

Hybrid obstacle avoidance system with vision and ultrasonic sensors for multi-rotor MAVs

2018 ◽  
Vol 45 (2) ◽  
pp. 227-236 ◽  
Author(s):  
Qiang Zhou ◽  
Danping Zou ◽  
Peilin Liu
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Moving Objects ◽  
Point Clouds ◽  
Ultrasonic Sensor ◽  
Content Type ◽  
Stereo Camera ◽  
3D Point Clouds ◽  
Planning Algorithm ◽  
Path Planning Algorithm

Purpose This paper aims to develop an obstacle avoidance system for a multi-rotor micro aerial vehicle (MAV) that flies in indoor environments which usually contain transparent, texture-less or moving objects. Design/methodology/approach The system adopts a combination of a stereo camera and an ultrasonic sensor to detect obstacles and extracts three-dimensional (3D) point clouds. The obstacle map is built on a coarse global map and updated by local maps generated by the recent 3D point clouds. An efficient layered A* path planning algorithm is also proposed to address the path planning in 3D space for MAVs. Findings The authors conducted a lot of experiments in both static and dynamic scenes. The results show that the obstacle avoidance system works reliably even when transparent or texture-less obstacles are present. The layered A* path planning algorithm is much faster than the traditional 3D algorithm and makes the system response quickly when the obstacle map has been changed because of the moving objects. Research limitations/implications The limited field of view of both stereo camera and ultrasonic sensor makes the system need to change heading first before moving side to side or moving backward. But this problem could be addressed when multiple systems are mounted toward different directions on the MAV. Practical implications The developed approach could be valuable to applications in indoors. Originality/value This paper presents a robust obstacle avoidance system and a fast layered path planning algorithm that are easy to be implemented for practical systems.

scholarly journals Intelligent Beetle Antennae Search for UAV Sensing and Avoidance of Obstacles

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1758 ◽  
Author(s):  
Qing Wu ◽  
Xudong Shen ◽  
Yuanzhe Jin ◽  
Zeyu Chen ◽  
Shuai Li ◽  
...  
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Heuristic Algorithm ◽  
Heuristic Algorithms ◽  
Search Range ◽  
Turning Angle ◽  
Planning Algorithm ◽  
Search Speed ◽  
Path Planner ◽  
Path Planning Algorithm

Based on a bio-heuristic algorithm, this paper proposes a novel path planner called obstacle avoidance beetle antennae search (OABAS) algorithm, which is applied to the global path planning of unmanned aerial vehicles (UAVs). Compared with the previous bio-heuristic algorithms, the algorithm proposed in this paper has advantages of a wide search range and breakneck search speed, which resolves the contradictory requirements of the high computational complexity of the bio-heuristic algorithm and real-time path planning of UAVs. Besides, the constraints used by the proposed algorithm satisfy various characteristics of the path, such as shorter path length, maximum allowed turning angle, and obstacle avoidance. Ignoring the z-axis optimization by combining with the minimum threat surface (MTS), the resultant path meets the requirements of efficiency and safety. The effectiveness of the algorithm is substantiated by applying the proposed path planning algorithm on the UAVs. Moreover, comparisons with other existing algorithms further demonstrate the superiority of the proposed OABAS algorithm.

scholarly journals Obstacle Avoidance Path Planning for Worm-like Robot Using Bézier Curve

Biomimetics ◽  
2021 ◽  
Vol 6 (4) ◽  
pp. 57
Author(s):  
Yifan Wang ◽  
Zehao Liu ◽  
Akhil Kandhari ◽  
Kathryn A. Daltorio
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Optimization Techniques ◽  
Bézier Curve ◽  
Bezier Curve ◽  
Planning Optimization ◽  
Planning Algorithm ◽  
Lateral Clearance ◽  
Path Planner ◽  
Path Planning Algorithm

Worm-like robots have demonstrated great potential in navigating through environments requiring body shape deformation. Some examples include navigating within a network of pipes, crawling through rubble for search and rescue operations, and medical applications such as endoscopy and colonoscopy. In this work, we developed path planning optimization techniques and obstacle avoidance algorithms for the peristaltic method of locomotion of worm-like robots. Based on our previous path generation study using a modified rapidly exploring random tree (RRT), we have further introduced the Bézier curve to allow more path optimization flexibility. Using Bézier curves, the path planner can explore more areas and gain more flexibility to make the path smoother. We have calculated the obstacle avoidance limitations during turning tests for a six-segment robot with the developed path planning algorithm. Based on the results of our robot simulation, we determined a safe turning clearance distance with a six-body diameter between the robot and the obstacles. When the clearance is less than this value, additional methods such as backward locomotion may need to be applied for paths with high obstacle offset. Furthermore, for a worm-like robot, the paths of subsequent segments will be slightly different than the path of the head segment. Here, we show that as the number of segments increases, the differences between the head path and tail path increase, necessitating greater lateral clearance margins.

Sign in / Sign up

Export Citation Format

Share Document