scholarly journals Autonomous Mobile Robot Navigation in Structured Rough Terrain

2018 ◽  
pp. 67-74
Author(s):  
Azad Asar ◽  
Erkan Uslu ◽  
Nihal Altuntas ◽  
Mehmet Fatih Amasyali ◽  
Sirma Yavuz
Keyword(s):  
Path Planning ◽  
Optimal Path ◽  
Path Following ◽  
Mobile Robot Navigation ◽  
Rough Terrain ◽  
Depth Sensor ◽  
Navigation Problem ◽  
Optimal Path Planning ◽  
Localization And Mapping ◽  
The Given

Main study areas for robotics research can be given as: mapping, localization, navigation and exploration. Given a robot’s current position, partial map of the environment and a goal position; navigation problem can be defined as optimal path planning and path following. Path planning and path following problem should be handled according to environment being static or dynamic, robot's mobility capabilities, sensors used on the robot and the roughness of the environment. In the study a four wheeled, skid-steering robot with laser range finder and depth sensor is built for Gazebo simulation environment. Also a statically structured labyrinth that consists of 15 degree continuous ramps, 15 degree discontinuous ramps, amorphous holes that robot cannot autonomously escape from if fallen into, walls and discontinuous obstacles that are below the robot laser height. 2D simultaneous localization and mapping, 3D mapping, path planning and path following with respect to the 3D map are implemented on Robot Operating System (ROS). Optimal path planning in rough terrain is accomplished by combining A* heuristic with a function of height difference of the 3D map nodes. Path following is carried out by turning-to and moving-towards actions on each sequential path node pairs. Tests performed on the labyrinth shows that obstacle avoidance, path planning and path following can be carried out successfully with the given implementation.

Optimal path planning of a disinfection mobile robot against COVID-19 in a ROS-based research platform

2021 ◽  
Vol 16 (4) ◽  
pp. 405-417
Author(s):  
L. Banjanovic-Mehmedovic ◽  
I. Karabegovic ◽  
J. Jahic ◽  
M. Omercic
Keyword(s):  
Path Planning ◽  
Optimal Path ◽  
Pso Algorithm ◽  
Optimal Path Planning ◽  
Localization And Mapping ◽  
Increasing Demand ◽  
Window Approach ◽  
Path Planner ◽  
Hardware Platforms ◽  
Reactive Collision

Due to COVID-19 pandemic, there is an increasing demand for mobile robots to substitute human in disinfection tasks. New generations of disinfection robots could be developed to navigate in high-risk, high-touch areas. Public spaces, such as airports, schools, malls, hospitals, workplaces and factories could benefit from robotic disinfection in terms of task accuracy, cost, and execution time. The aim of this work is to integrate and analyse the performance of Particle Swarm Optimization (PSO) algorithm, as global path planner, coupled with Dynamic Window Approach (DWA) for reactive collision avoidance using a ROS-based software prototyping tool. This paper introduces our solution – a SLAM (Simultaneous Localization and Mapping) and optimal path planning-based approach for performing autonomous indoor disinfection work. This ROS-based solution could be easily transferred to different hardware platforms to substitute human to conduct disinfection work in different real contaminated environments.

Graph-based path planning for intelligent UAVs in area coverage applications

2020 ◽  
Vol 39 (6) ◽  
pp. 8191-8203
Author(s):  
J. Akshya ◽  
P.L.K. Priyadarsini
Keyword(s):  
Path Planning ◽  
Minimum Spanning Tree ◽  
Optimal Path ◽  
Approximate Solutions ◽  
Geographic Area ◽  
Optimal Path Planning ◽  
Area Of Interest ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
The Given

In recent times, Unmanned Air Vehicles (UAVs) are being deployed for several tasks of terrain coverage such as surveillance, photogrammetry, smart irrigation, civil security, and disaster management. In these applications, one of the most vital issues to be addressed is, covering the area under observation with minimum traversal for the UAV. So, the problem addressed in this paper is as follows: For a given geographic area and the given parameters describing the UAV’s coverage capacity, the problem is to find an optimal route that covers the given geographic area. In this paper, an optimal path planning algorithm for the area under observation, given as a closed curve, is proposed. The algorithm partitions the given area of interest into multiple non-uniform rectangles while considering other parameters such as the flying altitude of the UAV and obstacles that could be encountered during its flight. The problem is transformed into Traveling Salesman Problem by constructing a graph from the rectangular partitioning. Effective approximate solutions are provided to this problem, using the Minimum Spanning Tree (MST) approximation algorithm and Ant Colony Optimization (ACO). The experimental results show that ACO outperforms the MST based algorithm as it does not get stuck in local minima.

Global Path Planning for Mobile Robot Based on Improved Ant Colony Algorithms

2013 ◽  
Vol 418 ◽  
pp. 15-19 ◽  
Author(s):  
Min Huang ◽  
Ping Ding ◽  
Jiao Xue Huan
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Optimal Path ◽  
Ant Colony ◽  
Mobile Robot Navigation ◽  
Local Optimum ◽  
Planning Problem ◽  
Optimal Path Planning ◽  
Global Path Planning ◽  
Global Optimal

Global optimal path planning is always an important issue in mobile robot navigation. To avoid the limitation of local optimum and accelerate the convergence of the algorithm, a new robot global optimal path planning method is proposed in the paper. It adopts a new transition probability function which combines with the angle factor function and visibility function, and at the same time, sets penalty function by a new pheromone updating model to improve the accuracy of the route searching. The results of computer emulating experiments prove that the method presented is correct and effective, and it is better than the genetic algorithm and traditional ant colony algorithm for global path planning problem.

scholarly journals Fuzzy Logic-Ant Colony Optimization for Explorer-Follower Robot with Global Optimal Path Planning

2018 ◽  
Vol 7 (1) ◽  
pp. 67-80
Author(s):  
Bambang Tutuko ◽  
Siti Nurmaini ◽  
Ganesha Ogi
Keyword(s):  
Fuzzy Logic ◽  
Path Planning ◽  
Ant Colony Optimization ◽  
Low Cost ◽  
Optimal Path ◽  
Ant Colony ◽  
Mobile Robot Navigation ◽  
Optimal Path Planning ◽  
Fuzzy Logic Approach ◽  
Logic Approach

Path planning is an essential task for the mobile robot navigation. However, such a task is difficult to solve, due to the optimal path needs to be rerouted in real-time when a new obstacle appears. It produces a sub-optimal path and the robot can be trapped in local minima. To overcome the problem the Ant Colony Optimization (ACO) is combined with Fuzzy Logic Approach to make a globally optimal path. The Fuzzy-ACO algorithm is selected because the fuzzy logic has good performance in imprecision and uncertain environment and the ACO produce simple optimization with an ability to find the globally optimal path. Moreover, many optimization algorithms addressed only at the simulation level. In this research, the real experiment is conducted with the low-cost Explorer-Follower robot. The results show that the proposed algorithm, enables them to successfully identify the shortest path without collision and stack in “local minima”.

Sign in / Sign up

Export Citation Format

Share Document