scholarly journals Environment Detection and Path Planning Using the E-puck Robot

2016 ◽  
Vol 5 (3) ◽  
pp. 151
Author(s):  
Muhammad Saleem Sumbal
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Mobile Robotics ◽  
Autonomous Robots ◽  
Search Algorithm ◽  
Optimal Path ◽  
Graph Search ◽  
Optimal Paths ◽  
Planning Project ◽  
Environment Detection

Automatic path planning is one of the most challenging problems confronted by autonomous robots. Generating optimal paths for autonomous robots are some of the heavily studied subjects in mobile robotics applications. This paper documents the implementation of a path planning project using a mobile robot in a structured environment. The environment is detected through a camera and then a roadmap of the environment is built using some algorithms. Finally a graph search algorithm called A* is implemented that searches through the roadmap and finds an optimal path for robot to move from start position to goal position avoiding obstacles

A Review of Path Planning Method for Mobile Robot

2014 ◽  
Vol 1030-1032 ◽  
pp. 1588-1591 ◽  
Author(s):  
Zong Sheng Wu ◽  
Wei Ping Fu
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Optimal Path ◽  
Grid Method ◽  
Field Method ◽  
Planning Method ◽  
Artificial Potential Field ◽  
Planning Methods ◽  
Basic Ideas ◽  
Artificial Potential Field Method

The ability of a mobile robot to plan its path is the key task in the field of robotics, which is to find a shortest, collision free, optimal path in the various scenes. In this paper, different existing path planning methods are presented, and classified as: geometric construction method, artificial intelligent path planning method, grid method, and artificial potential field method. This paper briefly introduces the basic ideas of the four methods and compares them. Some challenging topics are presented based on the reviewed papers.

Reinforcement learning-based radar-evasive path planning: a comparative analysis

2021 ◽  
pp. 1-18
Author(s):  
R.U. Hameed ◽  
A. Maqsood ◽  
A.J. Hashmi ◽  
M.T. Saeed ◽  
R. Riaz
Keyword(s):  
Reinforcement Learning ◽  
Path Planning ◽  
Learning Algorithms ◽  
Optimal Path ◽  
Trust Region ◽  
Optimal Path Planning ◽  
Optimal Paths ◽  
Policy Gradient ◽  
Model Aircraft ◽  
Tracking Model

Abstract This paper discusses the utilisation of deep reinforcement learning algorithms to obtain optimal paths for an aircraft to avoid or minimise radar detection and tracking. A modular approach is adopted to formulate the problem, including the aircraft kinematics model, aircraft radar cross-section model and radar tracking model. A virtual environment is designed for single and multiple radar cases to obtain optimal paths. The optimal trajectories are generated through deep reinforcement learning in this study. Specifically, three algorithms, namely deep deterministic policy gradient, trust region policy optimisation and proximal policy optimisation, are used to find optimal paths for five test cases. The comparison is carried out based on six performance indicators. The investigation proves the importance of these reinforcement learning algorithms in optimal path planning. The results indicate that the proximal policy optimisation approach performed better for optimal paths in general.

Priority-based speed control strategy for automated guided vehicle path planning in automated container terminals

2020 ◽  
Vol 42 (16) ◽  
pp. 3079-3090 ◽  
Author(s):  
Meisu Zhong ◽  
Yongsheng Yang ◽  
Shu Sun ◽  
Yamin Zhou ◽  
Octavian Postolache ◽  
...  
Keyword(s):  
Path Planning ◽  
Control Strategy ◽  
Search Algorithm ◽  
Waiting Times ◽  
Optimal Path ◽  
Speed Control ◽  
Container Terminals ◽  
Automated Guided Vehicles ◽  
Operating Efficiency ◽  
Continuous Increase

With the continuous increase in labour costs and the demands of the supply chain, improving the efficiency of automated container terminals has been a key factor in the development of ports. Automated guided vehicles (AGVs) are the main means of horizontal transport in such terminals, and problems in relation to their use such as vehicle conflict, congestion and waiting times have become very serious, greatly reducing the operating efficiency of the terminals. In this article, we model the minimum driving distance of AGVs that transport containers between quay cranes (QCs) and yard cranes (YCs). AGVs are able to choose the optimal path from pre-planned paths by testing the overlap rate and the conflict time. To achieve conflict-free AGV path planning, a priority-based speed control strategy is used in conjunction with the Dijkstra depth-first search algorithm to solve the model. The simulation experiments show that this model can effectively reduce the probability of AGVs coming into conflict, reduce the time QCs and YCs have to wait for their next task and improve the operational efficiency of AGV horizontal transportation in automated container terminals.

Optimal Path Planning of Redundant Cooperative Robots Under Equality and Inequality Constraints

2003 ◽  
Author(s):  
Ali Hosseini ◽  
Mehdi Keshmiri
Keyword(s):  
Path Planning ◽  
Optimization Problem ◽  
Search Algorithm ◽  
Minimum Principle ◽  
Optimal Path ◽  
Inequality Constraints ◽  
Optimal Path Planning ◽  
Nonlinear Inequality ◽  
Nonlinear Inequality Constraints ◽  
Cooperative Manipulators

Using kinematic resolution, the optimal path planning for two redundant cooperative manipulators carrying a solid object on a desired trajectory is studied. The optimization problem is first solved with no constraint. Consequently, the nonlinear inequality constraints, which model obstacles, are added to the problem. The formulation has been derived using Pontryagin Minimum Principle and results in a Two Point Boundary Value Problem (TPBVP). The problem is solved for a cooperative manipulator system consisting of two 3-DOF serial robots jointly carrying an object and the results are compared with those obtained from a search algorithm. Defining the obstacles in workspace as functions of joint space coordinates, the inequality constrained optimization problem is solved for the cooperative manipulators.

Optimal path planning of mobile robot using the hybrid cuckoo–bat algorithm in assorted environment

2019 ◽  
Vol 7 (1) ◽  
pp. 35-52 ◽  
Author(s):  
Balamurali Gunji ◽  
Deepak B.B.V.L. ◽  
Saraswathi M.B.L. ◽  
Umamaheswara Rao Mogili
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Real World ◽  
Hybrid Algorithm ◽  
Optimal Path ◽  
Bat Algorithm ◽  
Cuckoo Search ◽  
Content Type ◽  
The Real ◽  
World Environment

Purpose The purpose of this paper is to obtain an optimal mobile robot path planning by the hybrid algorithm, which is developed by two nature inspired meta-heuristic algorithms, namely, cuckoo-search and bat algorithm (BA) in an unknown or partially known environment. The cuckoo-search algorithm is based on the parasitic behavior of the cuckoo, and the BA is based on the echolocation behavior of the bats. Design/methodology/approach The developed algorithm starts by sensing the obstacles in the environment using ultrasonic sensor. If there are any obstacles in the path, the authors apply the developed algorithm to find the optimal path otherwise reach the target point directly through diagonal distance. Findings The developed algorithm is implemented in MATLAB for the simulation to test the efficiency of the algorithm for different environments. The same path is considered to implement the experiment in the real-world environment. The ARDUINO microcontroller along with the ultrasonic sensor is considered to obtain the path length and time of travel of the robot to reach the goal point. Originality/value In this paper, a new hybrid algorithm has been developed to find the optimal path of the mobile robot using cuckoo search and BAs. The developed algorithm is tested with the real-world environment using the mobile robot.

Sign in / Sign up

Export Citation Format

Share Document