Slip Pridiction Based Path Planning for Planetary Rovers

2011 ◽  
Vol 267 ◽  
pp. 382-385
Author(s):  
Lan Feng Zhou
Keyword(s):  
Path Planning ◽  
Autonomous Navigation ◽  
Planetary Rover ◽  
Planetary Rovers ◽  
Navigation Algorithm ◽  
Planning Algorithm ◽  
Path Planning Algorithm

Most methods of path planning for planetary rovers were designed for fairly benign terrain and do not account for potential slippage . Though the TANav system addresses slip prediction issue,it does not integrate directional slip prediction into the path planning algorithm.This paper presents an autonomous navigation algorithm for planetary rover based on slip pridiction. This method does integrate directional slip prediction into the path planning algorithm resolving the essue of emerging higher-level behaviors such as planning a path with switch-backs up a slope. The result of simulation demonstrates that this method is effective.

scholarly journals Probability Dueling DQN active visual SLAM for autonomous navigation in indoor environment

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Shuhuan Wen ◽  
Xiaohan Lv ◽  
Hak Keung Lam ◽  
Shaokang Fan ◽  
Xiao Yuan ◽  
...  
Keyword(s):  
Path Planning ◽  
Autonomous Navigation ◽  
Indoor Environment ◽  
Prediction Method ◽  
Depth Image ◽  
Visual Slam ◽  
Content Type ◽  
Localization And Mapping ◽  
Planning Algorithm ◽  
Path Planning Algorithm

Purpose This paper aims to use the Monodepth method to improve the prediction speed of identifying the obstacles and proposes a Probability Dueling DQN algorithm to optimize the path of the agent, which can reach the destination more quickly than the Dueling DQN algorithm. Then the path planning algorithm based on Probability Dueling DQN is combined with FastSLAM to accomplish the autonomous navigation and map the environment. Design/methodology/approach This paper proposes an active simultaneous localization and mapping (SLAM) framework for autonomous navigation under an indoor environment with static and dynamic obstacles. It integrates a path planning algorithm with visual SLAM to decrease navigation uncertainty and build an environment map. Findings The result shows that the proposed method offers good performance over existing Dueling DQN for navigation uncertainty under the indoor environment with different numbers and shapes of the static and dynamic obstacles in the real world field. Originality/value This paper proposes a novel active SLAM framework composed of Probability Dueling DQN that is the improved path planning algorithm based on Dueling DQN and FastSLAM. This framework is used with the Monodepth depth image prediction method with faster prediction speed to realize autonomous navigation in the indoor environment with different numbers and shapes of the static and dynamic obstacles.

scholarly journals Desempeño en métodos de navegación autónoma para robots móviles

Minerva ◽  
2020 ◽  
Vol 1 (2) ◽  
pp. 19-29
Author(s):  
Gabriela Alvarez ◽  
Omar Flor
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Mobile Robots ◽  
Autonomous Navigation ◽  
Probabilistic Neural Network ◽  
Autonomous Systems ◽  
Random Trees ◽  
Annual Conference ◽  
Planning Algorithm ◽  
Path Planning Algorithm

En este trabajo se presenta una comparación de los tiempos de respuesta, optimización de la ruta y complejidad del grafo en métodos de planificación de trayectoria para robots móviles autónomos. Se contrastan los desarrollos de Voronoi, Campos potenciales, Roadmap probabilístico y Descomposición en celdas para la navegación en un mismo entorno y validándolos para un número variable de obstáculos. Las evaluaciones demuestran que el método de generación de trayectoria por Campos Potenciales, mejora la navegación respecto de la menor ruta obtenida, el método Rapidly Random Tree genera los grafos de menor complejidad y el método Descomposición en celdas, se desempeña con menor tiempo de respuesta y menor coste computacional. Palabras Clave: optimización, trayectoria, métodos de planificación, robots móviles. Referencias [1]H. Ajeil, K. Ibraheem, A. Sahib y J. Humaidi, “Multi-objective path planning of an autonomous mobile robot using hybrid PSO-MFB optimization algorithm, ” Applied Soft Computing, vol. 89, April 2020. [2]K.Patle, G. Babu, A. Pandey, D.R.K. Parhi y A. Jagadeesh, “A review: On path planning strategies for navigation of mobile robot,” Defence Technology, vol. 15, pp. 582-606, August 2019. [3]T. Mack, C. Copot, D. Trung y R. De Keyser, “Heuristic approaches in robot path planning: A survey,” Robotics and Autonomous Systems, vol. 86, pp. 13-28, December 2016. [4]L. Zhang, Z. Lin, J. Wang y B. He, “Rapidly-exploring Random Trees multi-robot map exploration under optimization framework,” Robotics and Autonomous Systems, vol. 131, 2020. [5]S. Khan y M. K. Ahmmed, "Where am I? Autonomous navigation system of a mobile robot in an unknown environment," 2016 5th International Conference on Informatics, Electronics and Vision (ICIEV), pp. 56-61, December 2016. [6]V. Castro, J. P. Neira, C. L. Rueda, J. C. Villamizar y L. Angel, "Autonomous Navigation Strategies for Mobile Robots using a Probabilistic Neural Network (PNN)," IECON 2007 - 33rd Annual Conference of the IEEE Industrial Electronics Society, pp. 2795-2800, Taipei, 2007. [7]Y. Li, W. Wei, Y. Gao, D. Wang y C. Fan, “PQ-RRT*: An improved path planning algorithm for mobile robots,” Expert Systems with Applications, vol. 152, August 2020. [8]A. Muñoz, “Generación global de trayectorias para robots móviles, basada en curvas betaspline,” Dep. Ingeniería de Sistemas y Automática Escuela Técnica Superior de Ingeniería Universidad de Sevilla, 2014. [9]H. Montiel, E. Jacinto y H. Martínez, “Generación de Ruta Óptima para Robots Móviles a Partir de Segmentación de Imágenes,” Información Tecnológica, vol. 26, 2015. [10] C. Expósito, “Los diagramas de Vornooi, la forma matemática de dividir el mundo,” Dialnet, Diciembre 2016.

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.

Sign in / Sign up

Export Citation Format

Share Document