Development of a path follower in real-time environment

2017 ◽  
Vol 14 (4) ◽  
pp. 297-306 ◽  
Author(s):  
B.B.V.L. Deepak ◽  
M.V.A. Raju Bahubalendruni
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Optimal Path ◽  
Shortest Paths ◽  
Planning Problem ◽  
Content Type ◽  
Ground Vehicle ◽  
Planning Strategy ◽  
Institute Of Technology ◽  
The Given

Purpose The purpose of this paper is to study the path-planning problem of an unmanned ground vehicle (UGV) in a predefined, structured environment. Design/methodology/approach In this investigation, the environment chosen was the roadmap of the National Institute of Technology, Rourkela, obtained from Google maps as reference. An UGV is developed and programmed so as to move autonomously from an indicated source location to the defined destination in the given map following the most optimal path. Findings An algorithm based on linear search is implemented to the autonomous robot to generate shortest paths in the environment. The developed algorithm is verified with the simulations as well as in experimental environments. Originality/value Unlike the past methodologies, the current investigation deals with the global path-planning strategy as the line following mechanism. Moreover, the proposed technique has been implemented in a real-time environment.

scholarly journals COLREG-Compliant Optimal Path Planning for Real-Time Guidance and Control of Autonomous Ships

2021 ◽  
Vol 9 (4) ◽  
pp. 405
Author(s):  
Raphael Zaccone
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Collision Avoidance ◽  
Autonomous Navigation ◽  
Optimal Path ◽  
Open Water ◽  
Optimal Path Planning ◽  
Guidance And Control ◽  
Real Time Applications ◽  
And Control

While collisions and groundings still represent the most important source of accidents involving ships, autonomous vessels are a central topic in current research. When dealing with autonomous ships, collision avoidance and compliance with COLREG regulations are major vital points. However, most state-of-the-art literature focuses on offline path optimisation while neglecting many crucial aspects of dealing with real-time applications on vessels. In the framework of the proposed motion-planning, navigation and control architecture, this paper mainly focused on optimal path planning for marine vessels in the perspective of real-time applications. An RRT*-based optimal path-planning algorithm was proposed, and collision avoidance, compliance with COLREG regulations, path feasibility and optimality were discussed in detail. The proposed approach was then implemented and integrated with a guidance and control system. Tests on a high-fidelity simulation platform were carried out to assess the potential benefits brought to autonomous navigation. The tests featured real-time simulation, restricted and open-water navigation and dynamic scenarios with both moving and fixed obstacles.

scholarly journals Real - Time Trajectory and Velocity Planning for Autonomous Vehicles

2021 ◽  
Vol 10 (5) ◽  
pp. 439-448
Author(s):  
Hrishikesh Dey ◽  
Rithika Ranadive ◽  
Abhishek Chaudhari
Keyword(s):  
Path Planning ◽  
Velocity Profile ◽  
Real Time ◽  
Autonomous Vehicle ◽  
Optimal Path ◽  
Autonomous Driving ◽  
Navigation Algorithm ◽  
Velocity Planning ◽  
Planning Algorithm ◽  
Path Planner

Path planning algorithm integrated with a velocity profile generation-based navigation system is one of the most important aspects of an autonomous driving system. In this paper, a real-time path planning solution to obtain a feasible and collision-free trajectory is proposed for navigating an autonomous car on a virtual highway. This is achieved by designing the navigation algorithm to incorporate a path planner for finding the optimal path, and a velocity planning algorithm for ensuring a safe and comfortable motion along the obtained path. The navigation algorithm was validated on the Unity 3D Highway-Simulated Environment for practical driving while maintaining velocity and acceleration constraints. The autonomous vehicle drives at the maximum specified velocity until interrupted by vehicular traffic, whereas then, the path planner, based on the various constraints provided by the simulator using µWebSockets, decides to either decelerate the vehicle or shift to a more secure lane. Subsequently, a splinebased trajectory generation for this path results in continuous and smooth trajectories. The velocity planner employs an analytical method based on trapezoidal velocity profile to generate velocities for the vehicle traveling along the precomputed path. To provide smooth control, an s-like trapezoidal profile is considered that uses a cubic spline for generating velocities for the ramp-up and ramp-down portions of the curve. The acceleration and velocity constraints, which are derived from road limitations and physical systems, are explicitly considered. Depending upon these constraints and higher module requirements (e.g., maintaining velocity, and stopping), an appropriate segment of the velocity profile is deployed. The motion profiles for all the use-cases are generated and verified graphically.

scholarly journals MODIFIED VIRTUAL SEMI-CIRCLE PATH PLANNING

2016 ◽  
Vol 78 (6-6) ◽  
Author(s):  
R. N. Farah ◽  
Amira Shahirah ◽  
N. Irwan ◽  
R. L. Zuraida
Keyword(s):  
Path Planning ◽  
Path Length ◽  
Optimal Path ◽  
Unmanned Ground Vehicle ◽  
Ground Vehicle ◽  
Reactive Navigation ◽  
Optimal Path Planning ◽  
Two Phases

The challenging part of path planning for an Unmanned Ground Vehicle (UGV) is to conduct a reactive navigation. Reactive navigation is implemented to the sensor based UGV. The UGV defined the environment by collecting the information to construct it path planning. The UGV in this research is known as Mobile Guard UGV-Truck for Surveillance (MG-TruckS). Modified Virtual Semi Circle (MVSC) helps the MG-TruckS to reach it predetermined goal point successfully without any collision. MVSC is divided into two phases which are obstacles detection phase and obstacles avoidance phase to compute an optimal path planning. MVSC produces shorter path length, smoothness of velocity and reach it predetermined goal point successfully.

Navigation of a wheeled mobile robotic agent using modified grey wolf optimization controller

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Chittaranjan Paital ◽  
Saroj Kumar ◽  
Manoj Kumar Muni ◽  
Dayal R. Parhi ◽  
Prasant Ranjan Dhal
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Mobile Robots ◽  
Real Time ◽  
Autonomous Navigation ◽  
Simulation Software ◽  
Grey Wolf ◽  
Grey Wolf Optimization ◽  
Content Type ◽  
Cluttered Environment

PurposeSmooth and autonomous navigation of mobile robot in a cluttered environment is the main purpose of proposed technique. That includes localization and path planning of mobile robot. These are important aspects of the mobile robot during autonomous navigation in any workspace. Navigation of mobile robots includes reaching the target from the start point by avoiding obstacles in a static or dynamic environment. Several techniques have already been proposed by the researchers concerning navigational problems of the mobile robot still no one confirms the navigating path is optimal.Design/methodology/approachTherefore, the modified grey wolf optimization (GWO) controller is designed for autonomous navigation, which is one of the intelligent techniques for autonomous navigation of wheeled mobile robot (WMR). GWO is a nature-inspired algorithm, which mainly mimics the social hierarchy and hunting behavior of wolf in nature. It is modified to define the optimal positions and better control over the robot. The motion from the source to target in the highly cluttered environment by negotiating obstacles. The controller is authenticated by the approach of V-REP simulation software platform coupled with real-time experiment in the laboratory by using Khepera-III robot.FindingsDuring experiments, it is observed that the proposed technique is much efficient in motion control and path planning as the robot reaches its target position without any collision during its movement. Further the simulation through V-REP and real-time experimental results are recorded and compared against each corresponding results, and it can be seen that the results have good agreement as the deviation in the results is approximately 5% which is an acceptable range of deviation in motion planning. Both the results such as path length and time taken to reach the target is recorded and shown in respective tables.Originality/valueAfter literature survey, it may be said that most of the approach is implemented on either mathematical convergence or in mobile robot, but real-time experimental authentication is not obtained. With a lack of clear evidence regarding use of MGWO (modified grey wolf optimization) controller for navigation of mobile robots in both the environment, such as in simulation platform and real-time experimental platforms, this work would serve as a guiding link for use of similar approaches in other forms of robots.

Path Planning for Vehicle-borne System Consisting of Multi Air–ground Robots

Robotica ◽  
2019 ◽  
Vol 38 (3) ◽  
pp. 493-511 ◽  
Author(s):  
Yang Chen ◽  
Shiwen Ren ◽  
Zhihuan Chen ◽  
Mengqing Chen ◽  
Huaiyu Wu
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Maximum Speed ◽  
Planning Problem ◽  
Robot System ◽  
Ground Vehicle ◽  
Dynamic Constraints ◽  
Charging Time ◽  
Path Planning Problem ◽  
Flying Robots

SummaryThis paper considers the path planning problem for deployment and collection of a marsupial vehicle system which consists of a ground mobile robot and two aerial flying robots. The ground mobile robot, usually unmanned ground vehicle (UGV), as a carrier, is able to deploy and harvest the aerial flying robots, and each aerial flying robot, usually unmanned aerial vehicles (UAVs), takes off from and lands on the carrier. At the same time, owing to the limited duration in the air in one flight, UAVs should return to the ground mobile robot timely for its energy-saving and recharge. This work is motivated by cooperative search and reconnaissance missions in the field of heterogeneous robot system. Especially, some targets with given positions are assumed to be visited by any of the UAVs. For the cooperative path planning problem, this paper establishes a mathematical model to solve the path of two UAVs and UGV. Many real constraints including the maximum speed of two UAVs and UGV, the minimum charging time of two UAVs, the maximum hovering time of UAVs, and the dynamic constraints among UAVs and UGV are considered. The objective function is constructed by minimizing the time for completing the whole mission. Finally, the path planning problem of the robot system is transformed into a multi-constrained optimization problem, and then the particle swarm optimization algorithm is used to obtain the path planning results. Simulations and comparisons verify the feasibility and effectiveness of the proposed method.

scholarly journals An adaptive model predictive approach for automated vehicle control in fallback procedure based on virtual vehicle scheme

2019 ◽  
Vol 2 (2) ◽  
pp. 67-77
Author(s):  
Wei Xue ◽  
Rencheng Zheng ◽  
Bo Yang ◽  
Zheng Wang ◽  
Tsutomu Kaizuka ◽  
...  
Keyword(s):  
Path Planning ◽  
Human Error ◽  
Driving Safety ◽  
Planning Problem ◽  
Adaptive Model ◽  
Sensor Failure ◽  
Automated Driving ◽  
Content Type ◽  
Automated Vehicle ◽  
Virtual Vehicle

Purpose Automated driving systems (ADSs) are being developed to avoid human error and improve driving safety. However, limited focus has been given to the fallback behavior of automated vehicles, which act as a fail-safe mechanism to deal with safety issues resulting from sensor failure. Therefore, this study aims to establish a fallback control approach aimed at driving an automated vehicle to a safe parking lane under perceptive sensor malfunction. Design/methodology/approach Owing to an undetected area resulting from a front sensor malfunction, the proposed ADS first creates virtual vehicles to replace existing vehicles in the undetected area. Afterward, the virtual vehicles are assumed to perform the most hazardous driving behavior toward the host vehicle; an adaptive model predictive control algorithm is then presented to optimize the control task during the fallback procedure, avoiding potential collisions with surrounding vehicles. This fallback approach was tested in typical cases related to car-following and lane changes. Findings It is confirmed that the host vehicle avoid collision with the surrounding vehicles during the fallback procedure, revealing that the proposed method is effective for the test scenarios. Originality/value This study presents a model for the path-planning problem regarding an automated vehicle under perceptive sensor failure, and it proposes an original path-planning approach based on virtual vehicle scheme to improve the safety of an automated vehicle during a fallback procedure. This proposal gives a different view on the fallback safety problem from the normal strategy, in which the mode is switched to manual if a driver is available or the vehicle is instantly stopped.

scholarly journals A Hybrid Path-Planning Strategy for Mobile Robots with Limited Sensor Capabilities

Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1049 ◽  
Author(s):  
Guilherme de Oliveira ◽  
Kevin de Carvalho ◽  
Alexandre Brandão
Keyword(s):  
Path Planning ◽  
Avoidance Task ◽  
Planning Problem ◽  
Local Planning ◽  
Mapping Algorithm ◽  
Planning Strategy ◽  
Algorithm Efficiency ◽  
Cost Efficient ◽  
Environment Experiment ◽  
Path Planner

This paper introduces a strategy for the path planning problem for platforms with limited sensor and processing capabilities. The proposed algorithm does not require any prior information but assumes that a mapping algorithm is used. If enough information is available, a global path planner finds sub-optimal collision-free paths within the known map. For the real time obstacle avoidance task, a simple and cost-efficient local planner is used, making the algorithm a hybrid global and local planning solution. The strategy was tested in a real, cluttered environment experiment using the Pioneer P3-DX and the Xbox 360 kinect sensor, to validate and evaluate the algorithm efficiency.

An Improvement of the Rapidly-Exploring Random Tree Method for Path Planning of a Car-Like Robot in Virtual Environment

2015 ◽  
Vol 772 ◽  
pp. 471-476 ◽  
Author(s):  
Teodora Gîrbacia ◽  
Gheorghe Mogan
Keyword(s):  
Computational Complexity ◽  
Path Planning ◽  
Real Time ◽  
Virtual Environment ◽  
Minimum Distance ◽  
Optimal Path ◽  
Random Tree ◽  
Real Time Application ◽  
Simulation Time ◽  
Tree Method

In this paper we present a method of reducing the computational complexity necessary in path planning for a car-like robot in order to generate the optimal path according to the constrains set by the user. The proposed method implies adding the following constrains: setting the maximum and minimum distance between the possible paths and the obstacles placed in the virtual environment in order to reduce the simulation time and to obtain a real-time application and to remove the paths that contain unnecessary turns around the environment without avoiding an obstacle. By applying this method the simulation complexity is reduced and the optimal path is easier to find.

scholarly journals Proposed Smooth-STC Algorithm for Enhanced Coverage Path Planning Performance in Mobile Robot Applications

Robotics ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 44 ◽  
Author(s):  
Hai Van Pham ◽  
Philip Moore ◽  
Dinh Xuan Truong
Keyword(s):  
Path Planning ◽  
Optimal Path ◽  
Forest Monitoring ◽  
Planning Problem ◽  
Operational Environment ◽  
Uncertain Environments ◽  
Coverage Path Planning ◽  
Agricultural Robots ◽  
Cleaning Robots ◽  
Path Planning Problem

Robotic path planning is a field of research which is gaining traction given the broad domains of interest to which path planning is an important systemic requirement. The aim of path planning is to optimise the efficacy of robotic movement in a defined operational environment. For example, robots have been employed in many domains including: Cleaning robots (such as vacuum cleaners), automated paint spraying robots, window cleaning robots, forest monitoring robots, and agricultural robots (often driven using satellite and geostationary positional satellite data). Additionally, mobile robotic systems have been utilised in disaster areas and locations hazardous to humans (such as war zones in mine clearance). The coverage path planning problem describes an approach which is designed to determine the path that traverses all points in a defined operational environment while avoiding static and dynamic (moving) obstacles. In this paper we present our proposed Smooth-STC model, the aim of the model being to identify an optimal path, avoid all obstacles, prevent (or at least minimise) backtracking, and maximise the coverage in any defined operational environment. The experimental results in a simulation show that, in uncertain environments, our proposed smooth STC method achieves an almost absolute coverage rate and demonstrates improvement when measured against alternative conventional algorithms.

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