Centralized Path Planning for Multi-aircraft in the Presence of Static and Moving Obstacles
Authors
Abstract:
This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies as a popular and fast direct method to solve the constrained path planning problem. The three-degree-of-freedom nonlinear point mass equations of motion with realistic operational aircraft constraints consider through the simplified mathematical model. The fixed obstacle considers as a combination of spheres with different radius. Also, the moving obstacles consider as a sphere with a known radius and fly at a constant speed. The effectiveness of the proposed concept will be demonstrated by presenting four case studies with a different number of aircraft along with the static and moving obstacles in various scenarios to ensure safe and effective flights.
similar resources
Visibility Graph For Path Planning In The Presence Of Moving Obstacles
Path planning and navigation are two important areas in the control of autonomous mobile robots. In both cases, the resolution of the problem is to move the mobile robot while taking into account internal and external constraints. In this paper, we present an approach that operates in three steps. First, a construction of the visibility tree is performed. The following treatments are not perfor...
full textMotion Planning in the Presence of Moving Obstacles
This paper investigates the computational complexity of planning the motion of a body B in 2{D or 3{D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated. We provide evidence that the 3-D dynamic movement problem ...
full textPlanning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximal velocities of the moving obstacles, the regions that are possibly not collision-free are modeled by discs that grow over time. We present an approach to compute the shortest path between two points in the plane that avoids these growing disc...
full textMobile Robot Motion Planning Considering Path Ambiguity of Moving Obstacles
This paper describes a motion planning method for mobile robot which considers the path ambiguity of moving obstacles. Each moving obstacle has a set of paths and their probabilities. The robot selects the motion which minimizes the expected time to reach its destination, by recursively predicting future states of each obstacle and then selecting the best motion for them. To calculate the motio...
full textVelocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles
full text
A Maneuvering-Board Approach to Path Planning with Moving Obstacles
In this paper we describe a new approach to the problem of path planning with moving obstacles. Our approach is based on the maneuvering board method commonly used for nautical navigation. We have extended this method to handle cases where obstacles may maneuver at any time and where knowledge of the position and velocity of the obstacles may be uncertain.
full textMy Resources
Journal title
volume 33 issue 5
pages 923- 933
publication date 2020-05-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023