Online cooperative path planning for multi-quadrotors in an unknown dynamic environment

2021 ◽  
pp. 095441002110166
Author(s):  
Zhenyue Jia ◽  
Ping Lin ◽  
Jiaolong Liu ◽  
Luyang Liang
Keyword(s):  
Path Planning ◽  
Partial Information ◽  
Three Dimensional ◽  
Dynamic Environment ◽  
Planning Problem ◽  
Planning Strategy ◽  
Coordination Strategy ◽  
Planning Strategies ◽  
Feasible Path ◽  
Path Planning Problem

The online cooperative path planning problem is discussed for multi-quadrotor maneuvering in an unknown dynamic environment. Based on the related basic concepts, typical three-dimensional obstacle models, such as spherical and cubic, and their collision checking criteria are presented in this article. An improved rapidly exploring random tree (RRT) algorithm with goal bias and greed property is proposed based on the heuristic search strategy to overcome the shortcomings of the classical RRT algorithm. Not only are the kinematic constraints of the quadrotor established but the time and space coordination strategy matching with the improved RRT algorithm is also presented in this article. Furthermore, a novel online collision avoidance strategy according to the partial information of the surrounding environment is proposed. On the basis of the above work, a distributed online path planning strategy is proposed to obtain the feasible path for each quadrotor. Numerical simulation results show that the improved RRT algorithm has better search efficiency than the classical RRT algorithm. And the satisfactory path planning and path tracking results prove that the above model and related planning strategies are reasonable and effective.

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.

Three Dimensional Robot Path Planning With Workspace Considerations

1992 ◽  
Author(s):  
C. Y. Liu ◽  
R. W. Mayne
Keyword(s):  
Path Planning ◽  
Three Dimensional ◽  
Optimization Methods ◽  
Planning Problem ◽  
Robot Path Planning ◽  
Recursive Quadratic Programming ◽  
Six Degree Of Freedom ◽  
Nonlinear Programming Method ◽  
Path Planning Problem ◽  
Robot Path

Abstract This paper considers the problem of robot path planning by optimization methods. It focuses on the use of recursive quadratic programming (RQP) for the optimization process and presents a formulation of the three dimensional path planning problem developed for compatibility with the RQP selling. An approach 10 distance-to-contact and interference calculations appropriate for RQP is described as well as a strategy for gradient computations which are critical to applying any efficient nonlinear programming method. Symbolic computation has been used for general six degree-of-freedom transformations of the robot links and to provide analytical derivative expressions. Example problems in path planning are presented for a simple 3-D robot. One example includes adjustments in geometry and introduces the concept of integrating 3-D path planning with geometric design.

scholarly journals Research and Implementation of Robot Path Planning Based onVSLAM

2018 ◽  
Vol 160 ◽  
pp. 06004
Author(s):  
Zi-Qiang Wang ◽  
He-Gen Xu ◽  
You-Wen Wan
Keyword(s):  
Path Planning ◽  
Three Dimensional ◽  
Planning Problem ◽  
A Algorithm ◽  
Algorithm Efficiency ◽  
Grid Map ◽  
Localization And Mapping ◽  
Improve Algorithm ◽  
Path Planning Problem ◽  
Robot Path

In order to solve the problem of warehouse logistics robots planpath in different scenes, this paper proposes a method based on visual simultaneous localization and mapping (VSLAM) to build grid map of different scenes and use A* algorithm to plan path on the grid map. Firstly, we use VSLAMto reconstruct the environment in three-dimensionally. Secondly, based on the three-dimensional environment data, we calculate the accessibility of each grid to prepare occupied grid map (OGM) for terrain description. Rely on the terrain information, we use the A* algorithm to solve path planning problem. We also optimize the A* algorithm and improve algorithm efficiency. Lastly, we verify the effectiveness and reliability of the proposed method by simulation and experimental results.

scholarly journals A Novel Three-Dimensional Path Planning Method for Fixed-Wing UAV Using Improved Particle Swarm Optimization Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Chen Huang
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Three Dimensional ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Planning Problem ◽  
Dimensional Problem ◽  
Complex Environment ◽  
Swarm Optimization ◽  
Path Planning Problem

This paper proposed an improved particle swarm optimization (PSO) algorithm to solve the three-dimensional problem of path planning for the fixed-wing unmanned aerial vehicle (UAV) in the complex environment. The improved PSO algorithm (called DCA ∗ PSO) based dynamic divide-and-conquer (DC) strategy and modified A ∗ algorithm is designed to reach higher precision for the optimal flight path. In the proposed method, the entire path is divided into multiple segments, and these segments are evolved in parallel by using DC strategy, which can convert the complex high-dimensional problem into several parallel low-dimensional problems. In addition, A ∗ algorithm is adopted to generated an optimal path from the particle swarm, which can avoid premature convergence and enhance global search ability. When DCA ∗ PSO is used to solve the large-scale path planning problem, an adaptive dynamic strategy of the segment selection is further developed to complete an effective variable grouping according to the cost. To verify the optimization performance of DCA ∗ PSO algorithm, the real terrain data is utilized to test the performance for the route planning. The experiment results show that the proposed DCA ∗ PSO algorithm can effectively obtain better optimization results in solving the path planning problem of UAV, and it takes on better optimization ability and stability. In addition, DCA ∗ PSO algorithm is proved to search a feasible route in the complex environment with a large number of the waypoints by the experiment.

scholarly journals Solving the Path Planning Problem in Mobile Robotics with the Multi-Objective Evolutionary Algorithm

2018 ◽  
Vol 8 (9) ◽  
pp. 1425 ◽  
Author(s):  
Yang Xue ◽  
Jian-Qiao Sun
Keyword(s):  
Path Planning ◽  
Evolutionary Algorithm ◽  
Mobile Robotics ◽  
Good Choice ◽  
Target Point ◽  
Planning Problem ◽  
Multi Objective ◽  
Starting Point ◽  
Feasible Path ◽  
Path Planning Problem

Path planning problems involve finding a feasible path from the starting point to the target point. In mobile robotics, path planning (PP) is one of the most researched subjects at present. Since the path planning problem is an NP-hard problem, it can be solved by multi-objective evolutionary algorithms (MOEAs). In this article, we propose a multi-objective method for solving the path planning problem. It is a population evolutionary algorithm and solves three different objectives (path length, safety, and smoothness) to acquire precise and effective solutions. In addition, five scenarios and another existing method are used to test the proposed algorithm. The results show the advantages of the algorithm. In particular, different quality metrics are used to assess the obtained results. In the end, the research indicates that the proposed multi-objective evolutionary algorithm is a good choice for solving the path planning problem.

An Improved Flower Pollination Algorithm for Optimal Unmanned Undersea Vehicle Path Planning Problem

2016 ◽  
Vol 30 (04) ◽  
pp. 1659010 ◽  
Author(s):  
Yongquan Zhou ◽  
Rui Wang
Keyword(s):  
Path Planning ◽  
Three Dimensional ◽  
Optimization Method ◽  
Population Based ◽  
Flower Pollination Algorithm ◽  
Planning Problem ◽  
Flower Pollination ◽  
3D Space ◽  
Undersea Vehicle ◽  
Path Planning Problem

Path planning of Unmanned Undersea Vehicle (UUV) is a rather complicated global optimum problem which is about seeking a superior sailing route considering the different kinds of constrains under complex combat field environment. Flower pollination algorithm (FPA) is a new optimization method motivated by flower pollination behavior. In this paper, a variant of FPA is proposed to solve the UUV path planning problem in two-dimensional (2D) and three-dimensional (3D) space. Optimization strategies of particle swarm optimization are applied to the local search process of IFPA to enhance its search ability. In the progress of iteration of this improved algorithm, a dimension by dimension based update and evaluation strategy on solutions is used. This new approach can accelerate the global convergence speed while preserving the strong robustness of standard FPA. The realization procedure for this improved flower pollination algorithm is also presented. To prove the performance of this proposed method, it is compared with nine population-based algorithms. The experiment result shows that the proposed approach is more effective and feasible in UUV path planning in 2D and 3D space.

scholarly journals Path Planning for a Solar-Powered UAV Inspecting Mountain Sites for Safety and Rescue

Energies ◽  
2021 ◽  
Vol 14 (7) ◽  
pp. 1968
Author(s):  
Hailong Huang ◽  
Andrey V. Savkin
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicle ◽  
Computer Simulations ◽  
Energy Requirement ◽  
Residual Energy ◽  
Planning Problem ◽  
Aerial Vehicle ◽  
Solar Powered ◽  
Feasible Path ◽  
Path Planning Problem

This paper focuses on the application using a solar-powered unmanned aerial vehicle (UAV) to inspect mountain sites for the purpose of safety and rescue. An inspection path planning problem is formulated, which looks for the path for an UAV to visit a set of sites where people may appear while avoiding collisions with mountains and maintaining positive residual energy. A rapidly exploring random tree (RRT)-based planning method is proposed. This method firstly finds a feasible path that satisfies the residual energy requirement and then shortens the path if there is some abundant residual energy at the end. Computer simulations are conducted to demonstrate the performance of the proposed method.

A Novel Method for SUAV Path Planning Based on MPC

2012 ◽  
Vol 616-618 ◽  
pp. 2153-2157
Author(s):  
Hang Yu Wang
Keyword(s):  
Path Planning ◽  
Predictive Control ◽  
Planning Problem ◽  
Planning Strategy ◽  
Control Actions ◽  
Small Uav ◽  
Novel Method ◽  
Effective Path ◽  
Path Planning Problem ◽  
Special Strategy

Path planning has always being one of the most significant study fields in Small UAV researching. And Model Predictive Control (MPC) is a special strategy in obtaining the control actions which were achieved by solving a finite horizon optimal control problem at each instant. The paper advanced a novel method which was called Model Predictive Path Planning Strategy (MPPS) based on MPC to deal with the SUAV path planning problem and a responding predictive planner was put forward to generate an effective path for SUAV in simulative urban environment. The results of the simulation show that the advanced method can be used to plan path for SUAV.

scholarly journals A Dynamic Path Planning Method for Social Robots in the Home Environment

Electronics ◽  
2020 ◽  
Vol 9 (7) ◽  
pp. 1173 ◽  
Author(s):  
Chen Zhang ◽  
Lelai Zhou ◽  
Yibin Li ◽  
Yong Fan
Keyword(s):  
Path Planning ◽  
Home Environment ◽  
Dynamic Environment ◽  
Social Robots ◽  
Planning Problem ◽  
Complex Dynamic ◽  
3D Space ◽  
Dynamic Path Planning ◽  
The Social ◽  
Feasible Path

The home environment is a typical dynamic environment with moveable obstacles. The social robots working in home need to search for feasible paths in this complex dynamic environment. In this work, we propose an improved RRT algorithm to plan feasible path in home environment. The algorithm pre-builds a tree that covers the whole map and maintains the effectiveness of all nodes with branch pruning, reconnection, and regrowth process. The method forms a path by searching the nearest node in the tree and then quickly accessing the nodes near the destination. Due to the effectiveness-maintaining process, the proposed method can effectively deal with the complex dynamic environment where the destination and multiple moving obstacles change simultaneously. In addition, our method can be extended to the path-planning problem in 3D space. The simulation experiments verify the effectiveness of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document