scholarly journals Application of the Improved Grey Wolf Algorithm in Spacecraft Maneuvering Path Planning

2022 ◽  
Vol 2022 ◽  
pp. 1-14
Author(s):  
Changqing Wu ◽  
Xiaodong Han ◽  
Weiyu An ◽  
Jianglei Gong ◽  
Nan Xu
Keyword(s):  
Path Planning ◽  
Simulation Analysis ◽  
Point Of View ◽  
Convergence Time ◽  
Optimal Time ◽  
Target Point ◽  
Grey Wolf ◽  
Boundary Constraints ◽  
Attitude Maneuver ◽  
Grey Wolf Algorithm

In many space missions, spacecraft are required to have the ability to avoid various obstacles and finally reach the target point. In this paper, the path planning of spacecraft attitude maneuver under boundary constraints and pointing constraints is studied. The boundary constraints and orientation constraints are constructed as finite functions of path evaluation. From the point of view of optimal time and shortest path, the constrained attitude maneuver problem is reduced to optimal time and path solving problem. To address this problem, a metaheuristic maneuver path planning method is proposed (cross-mutation grey wolf algorithm (CMGWO)). In the CMGWO method, we use angular velocity and control torque coding to model attitude maneuver, which increases the difficulty of solving the problem. In order to deal with this problem, the grey wolf algorithm is used for mutation and evolution, so as to reduce the difficulty of solving the problem and shorten the convergence time. Finally, simulation analysis is carried out under different conditions, and the feasibility and effectiveness of the method are verified by numerical simulation.

scholarly journals Hybrid Path Planning for Efficient Data Collection in UAV-Aided WSNs for Emergency Applications

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2839
Author(s):  
Sabitri Poudel ◽  
Sangman Moh
Keyword(s):  
Sensor Networks ◽  
Data Collection ◽  
Path Planning ◽  
Three Dimensional ◽  
Base Station ◽  
Sensor Nodes ◽  
Convergence Time ◽  
Target Point ◽  
Efficient Data ◽  
Efficient Data Collection

In unmanned aerial vehicle (UAV)-aided wireless sensor networks (UWSNs), a UAV is employed as a mobile sink to gather data from sensor nodes. Incorporating UAV helps prolong the network lifetime and avoid the energy-hole problem faced by sensor networks. In emergency applications, timely data collection from sensor nodes and transferal of the data to the base station (BS) is a prime requisite. The timely and safe path of UAV is one of the fundamental premises for effective UWSN operations. It is essential and challenging to identify a suitable path in an environment comprising various obstacles and to ensure that the path can efficiently reach the target point. This paper proposes a hybrid path planning (HPP) algorithm for efficient data collection by assuring the shortest collision-free path for UAV in emergency environments. In the proposed HPP scheme, the probabilistic roadmap (PRM) algorithm is used to design the shortest trajectory map and the optimized artificial bee colony (ABC) algorithm to improve different path constraints in a three-dimensional environment. Our simulation results show that the proposed HPP outperforms the PRM and conventional ABC schemes significantly in terms of flight time, energy consumption, convergence time, and flight path.

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 Time-jerk optimal trajectory planning of hydraulic robotic excavator

2021 ◽  
Vol 13 (7) ◽  
pp. 168781402110346
Author(s):  
Yunyue Zhang ◽  
Zhiyi Sun ◽  
Qianlai Sun ◽  
Yin Wang ◽  
Xiaosong Li ◽  
...  
Keyword(s):  
Angular Velocity ◽  
Trajectory Planning ◽  
Optimal Trajectory ◽  
High Efficiency ◽  
Optimal Solution ◽  
Optimal Time ◽  
Target Point ◽  
Robotic Excavator ◽  
The Impact ◽  
Optimal Trajectory Planning

Due to the fact that intelligent algorithms such as Particle Swarm Optimization (PSO) and Differential Evolution (DE) are susceptible to local optima and the efficiency of solving an optimal solution is low when solving the optimal trajectory, this paper uses the Sequential Quadratic Programming (SQP) algorithm for the optimal trajectory planning of a hydraulic robotic excavator. To achieve high efficiency and stationarity during the operation of the hydraulic robotic excavator, the trade-off between the time and jerk is considered. Cubic splines were used to interpolate in joint space, and the optimal time-jerk trajectory was obtained using the SQP with joint angular velocity, angular acceleration, and jerk as constraints. The optimal angle curves of each joint were obtained, and the optimal time-jerk trajectory planning of the excavator was realized. Experimental results show that the SQP method under the same weight is more efficient in solving the optimal solution and the optimal excavating trajectory is smoother, and each joint can reach the target point with smaller angular velocity, and acceleration change, which avoids the impact of each joint during operation and conserves working time. Finally, the excavator autonomous operation becomes more stable and efficient.

scholarly journals A hybridized model based on neural network and swarm intelligence-grey wolf algorithm for spatial prediction of urban flood-inundation

2021 ◽  
pp. 126854
Author(s):  
Hamid Darabi ◽  
Ali Torabi Haghighi ◽  
Omid Rahmati ◽  
Abolfazl Jalali Shahrood ◽  
Sajad Rouzbeh ◽  
...  
Keyword(s):  
Neural Network ◽  
Swarm Intelligence ◽  
Spatial Prediction ◽  
Flood Inundation ◽  
Grey Wolf ◽  
Urban Flood ◽  
Model Based ◽  
Grey Wolf Algorithm

Path Planning for Spheres in Three Dimensional Environments With Low Interference Index

1994 ◽  
Author(s):  
Duane W. Storti ◽  
Debasish Dutta
Keyword(s):  
Path Planning ◽  
Free Path ◽  
Configuration Space ◽  
Local Knowledge ◽  
Three Dimensional ◽  
Target Point ◽  
Planning Problem ◽  
Spherical Object ◽  
Starting Point ◽  
Path Planning Problem

Abstract We consider the path planning problem for a spherical object moving through a three-dimensional environment composed of spherical obstacles. Given a starting point and a terminal or target point, we wish to determine a collision free path from start to target for the moving sphere. We define an interference index to count the number of configuration space obstacles whose surfaces interfere simultaneously. In this paper, we present algorithms for navigating the sphere when the interference index is ≤ 2. While a global calculation is necessary to characterize the environment as a whole, only local knowledge is needed for path construction.

Path planning of patrol robot based on improved discrete electrostatic discharge algorithm

2022 ◽  
pp. 1-12
Author(s):  
Yang Li ◽  
Simeng Chen ◽  
Ke Bai ◽  
Hao Wang
Keyword(s):  
Path Planning ◽  
Electrostatic Discharge ◽  
Fire Risk ◽  
Convergence Time ◽  
Economic Losses ◽  
Risk Level ◽  
Support Vector ◽  
Initial Population ◽  
Local Optimum ◽  
Planning Problem

Safety is the premise of the stable and sustainable development of the chemical industry, safety accidents will not only cause casualties and economic losses, but also cause panic among workers and nearby residents. Robot safety inspection based on the fire risk level in a chemical industrial park can effectively reduce process accident losses and can even prevent accidents. The optimal inspection path is an important support for patrol efficiency, therefore, in this study, the fire risk level of each location to be inspected, which is obtained by the electrostatic discharge algorithm (ESDA)–nonparallel support vector machine evaluation model, is combined with the optimisation of the inspection path; that is, the fire risk level is used to guide the inspection path planning. The inspection path planning problem is a typical travelling salesman problem (TSP). The discrete ESDA (DESDA), based on the ESDA, is proposed. In view of the shortcomings of the long convergence time and ease of falling into the local optimum of the DESDA, further improvements are proposed in the form of the IDESDA, in which the greedy algorithm is used for the initial population, the 2-opt algorithm is applied to generate new solutions, and the elite set is joined to provide the best segment for jumping out of the local optimum. In the experiments, 11 public calculation examples were used to verify the algorithm performance. The IDESDA exhibited higher accuracy and better stability when solving the TSP. Its application to chemical industrial parks can effectively solve the path optimisation problem of patrol robots.

Path planning of spot welding robot based on multi-objective grey wolf algorithm

2021 ◽  
pp. 1-9
Author(s):  
Yun-Tao Zhao ◽  
Lei Gan ◽  
Wei-Gang Li ◽  
Ao Liu
Keyword(s):  
Path Planning ◽  
Density Estimation ◽  
Spot Welding ◽  
Teaching Method ◽  
Grey Wolf ◽  
Pareto Solution ◽  
Multi Objective ◽  
Operation Rules ◽  
Welding Sequence ◽  
Body In White

The path planning of traditional spot welding mostly uses manual teaching method. Here, a new model of path planning is established from two aspects of welding length and welding time. Then a multi-objective grey wolf optimization algorithm with density estimation (DeMOGWO) is proposed to solve multi-object discrete problems. The algorithm improves the coding method and operation rules, and sets the density estimation mechanism in the environment update. By comparing with other five algorithms on the benchmark problem, the simulation results show that DeMOGWO is competitive which takes into account both diversity and convergence. Finally, the DeMOGWO algorithm is used to solve the model established of path planning. The Pareto solution obtained can be used to guide the welding sequence of body-in-white(BIW) workpieces.

Sign in / Sign up

Export Citation Format

Share Document