scholarly journals Path Planning for Aircraft Fleet Launching on the Flight Deck of Carriers

Mathematics ◽  
2018 ◽  
Vol 6 (10) ◽  
pp. 175 ◽  
Author(s):  
Yongtao Li ◽  
Yu Wu ◽  
Xichao Su ◽  
Jingyu Song
Keyword(s):  
Path Planning ◽  
Collision Detection ◽  
Planning Problem ◽  
Aircraft Carrier ◽  
Planning Algorithm ◽  
Rolling Optimization ◽  
Path Planner ◽  
Path Planning Algorithm ◽  
Flight Deck ◽  
Path Planning Problem

This paper studies the path planning problem for aircraft fleet taxiing on the flight deck of carriers, which is of great significance for improving the safety and efficiency level of launching. As there are various defects of manual command in the flight deck operation of carriers, the establishment of an automatic path planner for aircraft fleets is imperative. The requirements of launching, the particularities of the flight deck environment, the way of launch, and the work mode of catapult were analyzed. On this basis, a mathematical model was established which contains the constraints of maneuverability and the work mode of catapults; the ground motion and collision detection of aircraft are also taken into account. In the design of path planning algorithm, path tracking was combined with path planning, and the strategy of rolling optimization was applied to get the actual taxi path of each aircraft. Taking the Nimitz-class aircraft carrier as an example, the taxi paths of aircraft fleet launching was planned with the proposed method. This research can guarantee that the aircraft fleet complete launching missions safely with reasonable taxi paths.

scholarly journals Path Planning for Autonomous Landing of Helicopter on the Aircraft Carrier

Mathematics ◽  
2018 ◽  
Vol 6 (10) ◽  
pp. 178 ◽  
Author(s):  
Hanjie Hu ◽  
Yu Wu ◽  
Jinfa Xu ◽  
Qingyun Sun
Keyword(s):  
Path Planning ◽  
Vertical Motion ◽  
Planning Problem ◽  
Aircraft Carrier ◽  
Autonomous Landing ◽  
Planning Algorithm ◽  
Two Phases ◽  
The Impact ◽  
Flight Deck ◽  
Path Planning Problem

Helicopters are introduced on the aircraft carrier to perform the tasks which are beyond the capability of fixed-wing aircraft. Unlike fixed-wing aircraft, the landing path of helicopters is not regulated and can be determined autonomously, and the path planning problem for autonomous landing of helicopters on the carrier is studied in this paper. To solve the problem, the returning flight is divided into two phases, that is, approaching the carrier and landing on the flight deck. The feature of each phase is depicted, and the conceptual model is built on this basis to provide a general frame and idea of solving the problem. In the established mathematical model, the path planning problem is formulated into an optimization problem, and the constraints are classified by the characteristics of the helicopter and the task requirements. The goal is to reduce the terminal position error and the impact between the helicopter and the flight deck. To obtain a reasonable landing path, a multiphase path planning algorithm with the pigeon inspired optimization (MPPIO) algorithm is proposed to adapt to the changing environment. Three experiments under different situations, that is, static carrier, only horizontal motion of carrier considered, and 3D motion of carrier considered, are conducted. The results demonstrate that the helicopters can all reach the ideal landing point with the reasonable path in different situations. The small terminal error and relatively vertical motion between the helicopter and the carrier ensure a precise and safe landing.

Path Planning for Autonomous Car Parking

2018 ◽  
Author(s):  
Letian Lin ◽  
J. Jim Zhu
Keyword(s):  
Path Planning ◽  
Target Line ◽  
Planning Problem ◽  
Control Laws ◽  
Computational Costs ◽  
Planning Algorithm ◽  
Path Planner ◽  
Path Planning Algorithm ◽  
Path Planning Problem ◽  
Reverse Path

The path planning problem for autonomous car parking has been widely studied. However, it is challenging to design a path planner that can cope with parking in tight environment for all common parking scenarios. The important practical concerns in design, including low computational costs and little human’s knowledge and intervention, make the problem even more difficult. In this work, a path planner is developed using a novel four-phase algorithm. By using some switching control laws to drive two virtual cars to a target line, a forward path and a reverse path are obtained. Then the two paths are connected along the target line. As illustrated by the simulation results, the proposed path planning algorithm is fast, highly autonomous, sufficiently general and can be used in tight environment.

Collision-Free Motion Planning for an Aligned Multiple-turret System Operating in Extreme Environment

Robotica ◽  
2021 ◽  
pp. 1-30
Author(s):  
Ümit Yerlikaya ◽  
R.Tuna Balkan
Keyword(s):  
Path Planning ◽  
Extreme Environment ◽  
Configuration Spaces ◽  
Planning Problem ◽  
Different Types ◽  
Planning Algorithm ◽  
Line Path ◽  
Path Planning Algorithm ◽  
Path Planning Problem ◽  
System Operating

Abstract Instead of using the tedious process of manual positioning, an off-line path planning algorithm has been developed for military turrets to improve their accuracy and efficiency. In the scope of this research, an algorithm is proposed to search a path in three different types of configuration spaces which are rectangular-, circular-, and torus-shaped by providing three converging options named as fast, medium, and optimum depending on the application. With the help of the proposed algorithm, 4-dimensional (D) path planning problem was realized as 2-D + 2-D by using six sequences and their options. The results obtained were simulated and no collision was observed between any bodies in these three options.

A path planning model of a tiltrotor for approaching an aircraft carrier during landing

2021 ◽  
pp. 095441002199649
Author(s):  
Yu Wu ◽  
Haixu Li ◽  
Xichao Su
Keyword(s):  
Path Planning ◽  
Target Point ◽  
Planning Problem ◽  
Planning Model ◽  
State Variables ◽  
Aircraft Carrier ◽  
Control Variables ◽  
Planning Algorithm ◽  
Path Search ◽  
Path Planning Algorithm

A path planning model concerning a tiltrotor approaching an aircraft carrier is established in this study. In the model, the characteristic of the tiltrotor, the landing task, and the environment of the carrier are taken into account. First, the motion equations and the maneuverability of the tiltrotor in each flight mode are presented, and the constraints of control variables and flight envelope are given. The returning flight of the tiltrotor is divided into three phases corresponding to the three flight modes of the tiltrotor, and the constraints in each phase and the goal are set. Considering the flight safety of the tiltrotor, the environment of the carrier is described as flyable space and no-fly zones, and the no-fly zones are set taking the influences of turbulence and wind field induced by the moving aircraft carrier into account. The path planning issue is formulated into an optimization problem under the constraints of control variables and state variables. According to the characteristic of the established model, a pigeon inspired optimization (PIO)-based path planning algorithm is developed integrating the “step-by-step” and “one effort” path search strategies. Simulation results demonstrate that the tiltrotor can reach the target point with a reasonable landing path. Comparison among different algorithms is also conducted to verify that the PIO algorithm is capable of solving this online path planning problem.

scholarly journals A random sampling based algorithm for ship path planning with obstacles

2018 ◽  
Author(s):  
R Zaccone ◽  
M Martelli
Keyword(s):  
Path Planning ◽  
Time Domain ◽  
Random Sampling ◽  
Ad Hoc ◽  
Scientific Literature ◽  
Planning Problem ◽  
Planning Algorithm ◽  
Potential Benefits ◽  
Path Planning Algorithm ◽  
Path Planning Problem

The paper presents a path planning algorithm for ship guidance in presence of obstacles, based on an ad hoc modified version of the Rapidly-exploring Random Tree (RRT*) algorithm. The proposed approach is designed to be part of a decision support system for the bridge operators, in order to enhance traditional navigation. Focusing on the maritime field, a review of the scientific literature dealing with motion planning is presented, showing potential benefits and weaknesses of the different approaches. Among the several methods, details on RRT and RRT* algorithms are given. The ship path planning problem is introduced and discussed, formulating suitable cost functions and taking into account both topological and kinematic constraints. Eventually, an existing time domain ship simulator is used to test the effectiveness of the proposed algorithm over a number of realistic operation scenarios. The obtained results are presented and critically discussed. 

scholarly journals Decentralized Path Planning for Multi-Objective Robot Swarm System

2021 ◽  
Vol 2113 (1) ◽  
pp. 012002
Author(s):  
Zhuokai Wu
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Planning Problem ◽  
Robot Swarm ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Path Planning Problem ◽  
Multi Robot

Abstract The multi-robot path planning aims to explore a set of non-colliding paths with the shortest sum of lengths for multiple robots. The most popular approach is to artificially decompose the map into discrete small grids before applying heuristic algorithms. To solve the path planning in continuous environments, we propose a decentralized two-stage algorithm to solve the path-planning problem, where the obstacle and inter-robot collisions are both considered. In the first stage, an obstacle- avoidance path-planning problem is mathematically developed by minimizing the travel length of each robot. Specifically, the obstacle-avoidance trajectories are generated by approximating the obstacles as convex-concave constraints. In the second stage, with the given trajectories, we formulate a quadratic programming (QP) problem for velocity control using the control barrier and Lyapunov function (CBF-CLF). In this way, the multi-robot collision avoidance as well as time efficiency are satisfied by adapting the velocities of robots. In sharp contrast to the conventional heuristic methods, path length, smoothness and safety are fully considered by mathematically formulating the optimization problems in continuous environments. Extensive experiments as well as computer simulations are conducted to validate the effectiveness of the proposed path-planning algorithm.

Research on pull-type multi-AGV system dynamic path optimization based on time window

2021 ◽  
pp. 095440702098271
Author(s):  
Hongying Shan ◽  
Chuang Wang ◽  
Cungang Zou ◽  
Mengyao Qin
Keyword(s):  
Path Planning ◽  
Time Window ◽  
Planning Problem ◽  
Dijkstra Algorithm ◽  
Before And After ◽  
Common Planning ◽  
Planning Algorithm ◽  
Dynamic Path ◽  
Set Up ◽  
Path Planning Algorithm

This paper is a study of the dynamic path planning problem of the pull-type multiple Automated Guided Vehicle (multi-AGV) complex system. First, based on research status at home and abroad, the conflict types, common planning algorithms, and task scheduling methods of different AGV complex systems are compared and analyzed. After comparing the different algorithms, the Dijkstra algorithm was selected as the path planning algorithm. Secondly, a mathematical model is set up for the shortest path of the total driving path, and a general algorithm for multi-AGV collision-free path planning based on a time window is proposed. After a thorough study of the shortcomings of traditional single-car planning and conflict resolution algorithms, a time window improvement algorithm for the planning path and the solution of the path conflict covariance is established. Experiments on VC++ software showed that the improved algorithm reduces the time of path planning and improves the punctual delivery rate of tasks. Finally, the algorithm is applied to material distribution in the OSIS workshop of a C enterprise company. It can be determined that the method is feasible in the actual production and has a certain application value by the improvement of the data before and after the comparison.

A local-based method for manipulators path planning, using sub-goals resulting from a local graph

Robotica ◽  
2006 ◽  
Vol 24 (5) ◽  
pp. 539-548 ◽  
Author(s):  
S. Zeghloul ◽  
C. Helguera ◽  
G. Ramirez
Keyword(s):  
Path Planning ◽  
Local Environment ◽  
Linear Constraints ◽  
Geometric Constraints ◽  
Planning Problem ◽  
Cluttered Environments ◽  
Free Position ◽  
Local Methods ◽  
Path Planner ◽  
Path Planning Problem

This paper addresses the path planning problem for manipulators. The problem of path planning in robotics can be defined as follows: To find a collision free trajectory from an initial configuration to a goal configuration. In this paper a collision-free path planner for manipulators, based on a local constraints method, is proposed. In this approach the task is described by a minimization problem under geometric constraints. The anti-collision constraints are mapped as linear constraints in the configuration space and they are not included in the function to minimize. Also, the task to achieve is defined as a combination of two displacements. The first displacement brings the robot towards to the goal configuration, while the second one allows the robot to avoid the local minima. This formulation solves many of classical problems found in local methods. However, when the robot acts in some heavy cluttered environments, a zig-zaging phenomenon could appear. To solve this situation, a graph based on the local environment of the robot is constructed. On this graph, an A* search is performed, in order to find a dead-lock free position that can be used as a sub-goal in the optimization process. This path-planner has been implemented within SMAR, a CAD-Robotics system developed at our laboratory. Tests in heavy cluttered environments were successfully performed.

scholarly journals Intelligent Beetle Antennae Search for UAV Sensing and Avoidance of Obstacles

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1758 ◽  
Author(s):  
Qing Wu ◽  
Xudong Shen ◽  
Yuanzhe Jin ◽  
Zeyu Chen ◽  
Shuai Li ◽  
...  
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Heuristic Algorithm ◽  
Heuristic Algorithms ◽  
Search Range ◽  
Turning Angle ◽  
Planning Algorithm ◽  
Search Speed ◽  
Path Planner ◽  
Path Planning Algorithm

Based on a bio-heuristic algorithm, this paper proposes a novel path planner called obstacle avoidance beetle antennae search (OABAS) algorithm, which is applied to the global path planning of unmanned aerial vehicles (UAVs). Compared with the previous bio-heuristic algorithms, the algorithm proposed in this paper has advantages of a wide search range and breakneck search speed, which resolves the contradictory requirements of the high computational complexity of the bio-heuristic algorithm and real-time path planning of UAVs. Besides, the constraints used by the proposed algorithm satisfy various characteristics of the path, such as shorter path length, maximum allowed turning angle, and obstacle avoidance. Ignoring the z-axis optimization by combining with the minimum threat surface (MTS), the resultant path meets the requirements of efficiency and safety. The effectiveness of the algorithm is substantiated by applying the proposed path planning algorithm on the UAVs. Moreover, comparisons with other existing algorithms further demonstrate the superiority of the proposed OABAS algorithm.

A genetic path planning algorithm for redundant articulated robots

Robotica ◽  
1997 ◽  
Vol 15 (2) ◽  
pp. 213-224 ◽  
Author(s):  
Andreas C. Nearchou ◽  
Nikos A. Aspragathos
Keyword(s):  
Path Planning ◽  
Degrees Of Freedom ◽  
Target Location ◽  
Planning Problem ◽  
Worst Case ◽  
Pick And Place ◽  
Planning Algorithm ◽  
A New Technique ◽  
Articulated Robots ◽  
Path Planning Algorithm

In some daily tasks, such as pick and place, the robot is requested to reach with its hand tip a desired target location while it is operating in its environment. Such tasks become more complex in environments cluttered with obstacles, since the constraint for collision-free movement must be also taken into account. This paper presents a new technique based on genetic algorithms (GAs) to solve the path planning problem of articulated redundant robot manipulators. The efficiency of the proposed GA is demonstrated through multiple experiments carried out on several robots with redundant degrees-of-freedom. Finally, the computational complexity of the proposed solution is estimated, in the worst case.

Sign in / Sign up

Export Citation Format

Share Document