Search

In this work, we focus on a drone-fleet-enabled package delivery scenario, in which multiple drones fly from a start point and cooperatively deliver packages to the ground users in the presence of a number of no-fly zones (NFZs). We first mathematically model the package delivery scenario in a rigorous manner. Then, a package value maximization problem is established to optimize the flight trajectory and package delivery under the constraints of drone load and collision as well as NFZs. The formulated problem is a highly challenging mixed-integer non-convex problem. To facilitate solving it, we transform the formulated problem into an equivalent problem with special structure by using some appropriate transformations, based on which a low-complexity algorithm with favorable performance is developed using the penalty convex-concave procedure method. Finally, numerical results demonstrate the superiority of the proposed solution.

With the rapid development of the intelligent driving technology, achieving accurate path planning for unmanned vehicles has become increasingly crucial. However, path planning algorithms face challenges when dealing with complex and ever-changing road conditions. In this paper, aiming at improving the accuracy and robustness of the generated path, a global programming algorithm based on optimization is proposed, while maintaining the efficiency of the traditional A* algorithm. Firstly, turning penalty function and obstacle raster coefficient are integrated into the search cost function to increase the adaptability and directionality of the search path to the map. Secondly, an efficient search strategy is proposed to solve the problem that trajectories will pass through sparse obstacles while reducing spatial complexity. Thirdly, a redundant node elimination strategy based on discrete smoothing optimization effectively reduces the total length of control points and paths, and greatly reduces the difficulty of subsequent trajectory optimization. Finally, the simulation results, based on real map rasterization, highlight the advanced performance of the path planning and the comparison among the baselines and the proposed strategy showcases that the optimized A* algorithm significantly enhances the security and rationality of the planned path. Notably, it reduces the number of traversed nodes by 84%, the total turning angle by 39%, and shortens the overall path length to a certain extent. [ABSTRACT FROM AUTHOR]

Increased performance with reduced overall cost, and precise design and optimization of launch systems are critical to affordability. In this respect, the use of hybrid motors has increased to ease handling based on motor selection. In the current study, the launch vehicle's performance is enhanced by incorporating a hybrid rocket motor into the last stage and optimized using particle swarm optimization to develop a six-degrees-of-freedom tool. This modification aims to increase payload placement flexibility, facilitate handling, and reduce costs. Thanks to the interactive subsystems within this research, this innovative study more comprehensively considers the launch vehicle trajectory design problem, allowing the simultaneous consideration of the effect of launch vehicle geometry along with other parameters in the system. In this context, the proposed method is applied to the Minotaur-I launch vehicle, and contributions of the detailed design and optimization are presented. Optimization results show that the percentage differences between these models for the original vehicle were observed to be 11.55% in velocity and 8.02% in altitude. However, there were differences of 10.06% and 48.8%, 15.8% and 23.2%, and 19.5% and 78.9% in altitudes and velocities when the center of gravity and moment of inertia changes were neglected, and constant aerodynamic coefficients were assumed, respectively. In all these cases, it was observed that the flight path angle was not close to zero. Moreover, the same mission was achieved by the launch vehicle with the optimized hybrid last stage and the propulsion performance was increased by about 7.64% based on the specific impulse and total impulse-over-weight ratio. [ABSTRACT FROM AUTHOR]

The flight management system is a basic component of avionics for modern airliners. However, the airborne flight management system needs to be improved and relies on imports; path planning is the key to the flight management system. Based on the classical A* algorithm, this paper proposes an improved A* path planning algorithm, which solves the problem of low planning efficiency and following a non-smooth path. In order to solve the problem of the large amount of data calculation and long planning time of the classical A* algorithm, a new data structure called a "value table" is designed to replace the open table and close table of the classical A* algorithm to improve the retrieval efficiency, and the Heap sort algorithm is used to optimize the efficiency of node sorting. Aiming at the problem that the flight trajectory is hard to follow, the trajectory smoothing optimization algorithm combined with turning angle limit is proposed. The gray value in the digital map is added to the A* algorithm, and the calculation methods of gray cost, cumulative cost, and estimated cost are improved, which can better meet the constraints of obstacle avoidance. Through the comparative simulation verification of the algorithm, the improved A* algorithm can significantly reduce the path planning time to 1% compared to the classical A* algorithm; it can be seen that the proposed algorithm improves the efficiency of path planning and the smoother planned path, which has obvious advantages compared to the classical A* algorithm. [ABSTRACT FROM AUTHOR]

In order to improve the safety and efficiency of inspection robots for solar power plants, the Rapidly Exploring Random Tree Star (RRT*) algorithm is studied and an improved method based on an adaptive target bias and heuristic circular sampling is proposed. Firstly, in response to the problem of slow search speed caused by random samplings in the traditional RRT* algorithm, an adaptive target bias function is applied to adjust the generation of sampling points in real-time, which continuously expands the random tree towards the target point. Secondly, to solve the problem that the RRT* algorithm has a low search efficiency and stability in narrow and long channels of solar power plants, the strategy of heuristic circular sampling combined with directional deviation is designed to resample nodes located on obstacles to generate more valid nodes. Then, considering the turning range of the inspection robot, our method will prune nodes on the paths that fail to meet constraint of the minimum turning radius. Finally, the B-spline curve is used to fit and smooth the path. A simulation experiment based on the environment of solar power plant is conducted and the result demonstrates that, compared with the RRT*, the improved RRT* algorithm reduces the search time, iterations, and path cost by 62.06%, 45.17%, and 1.6%, respectively, which provides a theoretical basis for improving the operational efficiency of inspection robots for solar power plants. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new optimal trajectory planning method for the manipulator to optimize its operating efficiency and ensure the smoothness of the motion process. The position sequences in joint space corresponding to a specified trajectory in task space are obtained by using the inverse kinematic algorithm, and the seventh-degree B-spline curve interpolation method is used to construct the joint trajectory with controllable start–stop kinematic parameters, and continuous velocity, acceleration and jerk. The kinematic constraints of the manipulator are transformed into the control point constraints of the B-spline curve, the sequential quadratic programming method is used to solve the optimal motion time node, and then the time-optimal continuous jerk trajectory satisfying the nonlinear kinematic constraints is planned. Simulation results show that the proposed trajectory planning method provides the ideal trajectory for the joint controller, ensuring the manipulator can smoothly track any specified trajectory in the task space in the shortest time. [ABSTRACT FROM AUTHOR]

Featured Application: Healthcare, remote sensing, and military. Background: Over the last few decades, telepresence robots (TRs) have drawn significant attention in academic and healthcare systems due to their enormous benefits, including safety improvement, remote access and economics, reduced traffic congestion, and greater mobility. COVID-19 and advancements in the military play a vital role in developing TRs. Since then, research on the advancement of robots has been attracting much attention. Methods: In critical areas, the placement and movement of humans are not safe, and researchers have started looking at the development of robots. Robot development includes many parameters to be analyzed, and trajectory planning and optimization are among them. The main objective of this study is to present a trajectory control and optimization algorithm for a cognitive architecture named auto-MERLIN. Optimization algorithms are developed for trajectory control. Results: The derived work empirically tests the solutions and provides execution details for creating the trajectory design. We develop the trajectory algorithm for the clockwise direction and another one for the clockwise and counterclockwise directions. Conclusions: Experimental results are drawn to support the proposed algorithm. Self-localization, self-driving, and right and left turn trajectories are drawn. All of the experimental results show that the designed TR works properly, with better accuracy and only a slight jitter in the orientation. The jitter is found due to the environmental factor caught by the sensors, which can be filtered easily. The results show that the proposed approach is less complex and provides better trajectory planning accuracy. [ABSTRACT FROM AUTHOR]

For the trajectory optimization of the time–jerk of robotic arms with a chicken swarm optimization algorithm, using five-order B-spline interpolation can ensure smooth and continuous acceleration, but, due to the performance problems of the algorithm, the low solution accuracy and the slow convergence speed, the ideal trajectory curve cannot be obtained. To address these problems, an improved chicken swarm algorithm based on a parallel strategy and dynamic constraints (PDCSO) is proposed, where the rooster update method is employed with a parallel strategy using X-best guidance and a Levy flight step. Dynamic constraints for the rooster are given, followed by the hens, and the optimal rooster position that improved the convergence accuracy while preventing the local optimum was determined. Simulation experiments using 18 classical test functions showed that the PDCSO algorithm outperformed other comparative algorithms in terms of convergence speed, solution accuracy and solution stability. Simulation validation in ADAMS and real machine tests proved that PDCSO can effectively reduce the running time and motion shock for robotic arms and improve the execution efficiency of such arms. [ABSTRACT FROM AUTHOR]

Featured Application: The method proposed can be used for accurate trajectory generation of a re-entry glide vehicle in the flight range domain with distributed grid points. It also provides ideas for trajectory generation based on the guidance mechanism. Optimal trajectory generation for the guidance of re-entry glide vehicles is of great significance. To realize a faster generation speed and consistency with the guidance mechanism, an improved convex optimization trajectory generation algorithm based on the flight range domain for the re-entry glide vehicles is proposed in this paper. Firstly, according to the definition of the range-to-go, the projected range-to-go of the re-entry glide vehicle is presented when the dynamic model is converted to the flight range domain. Then, the attack angle and bank angle are expanded to the state variables and the change rate, which is designed as a new control variable. When the dynamic models and constraints are convexificated and discretized, the vehicle trajectory discrete convex model in the flight range domain is proposed. In order to further improve the generation speed and accuracy, an initial trajectory generation method that is close to the guidance requirements is proposed by the landing points of different control laws. In addition, by analyzing the nonlinear illegal degree of grid points, the probability density of grid points and the adjustment strategy of grid points are proposed. Finally, the ablation experiment shows that the initial trajectory generation and distributed grid points method works. With different target points, different no-fly zones, different initial states, and the Monte Carlo experiment, our method can effectively and robustly complete the generation. The lateral and longitudinal generation error is less than 1 km. And compared with the Gaussian pseudo-spectral method, our method obtained comparable accuracy and faster speed. [ABSTRACT FROM AUTHOR]

In order to make the grid-connected composite device (GCCD) controller meet the requirements of different operating modes and complex working conditions of power grid, this paper proposes to introduce sliding mode control (SMC) into GCCD controller. Firstly, the mathematical model of MMC converter is established, and the sliding mode controller is designed based on the SMC principle. Then, aiming at the problems of complex controller structure and difficult parameter tuning in multiple modes of the GCCD, this paper proposes a controller parameter optimization method based on improved Month Flame optimization (IMFO) algorithm. This method improves the MFO algorithm by introducing good point set (GPS) initialization and Levy flight strategy, which accelerates the convergence speed of the algorithm while avoiding falling into local optimization, and realizes the optimization of converter controller parameters. Under a variety of standard test functions, the advantages of the proposed IMFO algorithm are verified by comparing it with the traditional algorithm. Finally, in order to realize the automatic tuning of control parameters, the Python–PSCAD joint simulation method is studied and implemented. Taking the comprehensive integral of time and absolute error (CITAE) index as the objective function, the parameters of the sliding mode controller are optimized. The simulation results show that the controller parameters optimized by the IMFO algorithm can make the GCCD have better dynamic performance. [ABSTRACT FROM AUTHOR]

The total heat exchange factor is one of the most important thermal physical parameters in the heat transfer model for a reheating furnace machine. In this paper, a novel general strategy, which is combined with the first-optimize-then-discretize (FOTD) approach and an improved hybrid conjugate gradient (IHCG) algorithm, is proposed to identify the total heat exchange factor by solving a nonlinear inverse heat conduction problem (IHCP). Firstly, a nonlinear IHCP with the Dirichlet-type boundary condition T m (t) = T (0 , t) is built to determine the unknown total heat exchange factor w (t) . Secondly, the analysis of the Fréchet gradient of the cost functional is given and the gradient is proved as Lipschitz continuous by the FOTD approach. Thirdly, based on the gradient information by FOTD, a new IHCG algorithm, whose global convergence is proved by us, is proposed for fast solving of the optimization problem. Finally, simulation experiments are given to verify the effectiveness of the proposed strategy. Compared with the first-discretize-then-optimize (FDTO) approach, the FOTD approach can reduce running time and iteration number. Compared with other CG algorithms, the proposed IHCG algorithm has better convergence performance. The experimental data by the thermocouples experiments from a reheating furnace are also given to identify the total heat exchange factor. [ABSTRACT FROM AUTHOR]

The Jump Point Search (JPS) algorithm ignores the possibility of any-angle walking, so the paths found by the JPS algorithm under the discrete grid map still have a gap with the real paths. To address the above problems, this paper improves the path optimization strategy of the JPS algorithm by combining the viewable angle of the Angle-Propagation Theta* (AP Theta*) algorithm, and it proposes the AP-JPS algorithm based on an any-angle pathfinding strategy. First, based on the JPS algorithm, this paper proposes a vision triangle judgment method to optimize the generated path by selecting the successor search point. Secondly, the idea of the node viewable angle in the AP Theta* algorithm is introduced to modify the line of sight (LOS) reachability detection between two nodes. Finally, the paths are optimized using a seventh-order polynomial based on minimum snap, so that the AP-JPS algorithm generates paths that better match the actual robot motion. The feasibility and effectiveness of this method are proved by simulation experiments and comparison with other algorithms. The results show that the path planning algorithm in this paper obtains paths with good smoothness in environments with different obstacle densities and different map sizes. In the algorithm comparison experiments, it can be seen that the AP-JPS algorithm reduces the path by 1.61–4.68% and the total turning angle of the path by 58.71–84.67% compared with the JPS algorithm. The AP-JPS algorithm reduces the computing time by 98.59–99.22% compared with the AP-Theta* algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a robust trajectory tracking control for a Permanent Magnet Synchronous Motor (PMSM) with consideration a fault, parametric uncertainties and external disturbances by effectively integrating robust optimal linear quadratic control. One kind of fault is considered in the machine, particularly the presence of fissure rotor. The dynamic model of the PMSM with the presence of fissure presents highly non-linear behaviors, which means that tuning is quite complicated, which the tuning was chosen through swarm intelligence optimization (Dragonfly Algorithm). A sensitivity analysis is carried out, in order to limit the search range to minimize the evaluation time. This methodology was used to diminish these defects during motor operation. Simulation results show that the optimal linear quadratic control method has a robust fault-tolerant performance. [ABSTRACT FROM AUTHOR]

Featured Application: The design of this article can be applied to Travelling Salesman Problem and related problems. In order to solve the problem of poor local optimization of the Slime Mold Algorithm (SMA) in the Travelling Salesman Problem (TSP), a Two-way Parallel Slime Mold Algorithm by Flow and Distance (TPSMA) is proposed in this paper. Firstly, the flow between each path point is calculated by the "critical pipeline and critical culture" model of SMA; then, according to the two indexes of flow and distance, the set of path points to be selected is obtained; finally, the optimization principle with a flow index is improved with two indexes of flow and distance and added random strategy. Hence, a two-way parallel optimization method is realized and the local optimal problem is solved effectively. Through the simulation of Traveling Salesman Problem Library (TSPLIB) on ulysses16, city31, eil51, gr96, and bier127, the results of TPSMA were improved by 24.56, 36.10, 41.88, 49.83, and 52.93%, respectively, compared to SMA. Furthermore, the number of path points is more and the optimization ability of TPSMA is better. At the same time, TPSMA is closer to the current optimal result than other algorithms by multiple sets of tests, and its time complexity is obviously better than others. Therefore, the superiority of TPSMA is adequately proven. [ABSTRACT FROM AUTHOR]

The processing and analysis of trajectories are the core of many location-based applications and services, while trajectory similarity is an essential concept regularly used. To address the time-consuming problem of similarity query, an efficient algorithm based on Fréchet distance called Ordered Coverage Judge (OCJ) is proposed, which could realize the filtering query with a given Fréchet distance threshold on large-scale trajectory datasets. The OCJ algorithm can obtain the result set quickly by a two-step operation containing morphological characteristic filtering and ordered coverage judgment. The algorithm is expedient to be implemented in parallel for further increases of speed. Demonstrated by experiments over real trajectory data in a multi-core hardware environment, the new algorithm shows favorable stability and scalability besides its higher efficiency in comparison with traditional serial algorithms and other Fréchet distance algorithms. [ABSTRACT FROM AUTHOR]

In an effort to allow to increase the number of aircraft and airport operations while mitigating their negative impacts (e.g., noise and pollutant emission) on near-airport communities, the optimal design of new departure routes with less noise and fuel consumption becomes more important. In this paper, a multi-objective evolutionary algorithm based on decomposition (MOEA/D), which recently emerged as a potential method for solving multi-objective optimization problems (MOPs), is developed for this kind of problem. First, to minimize aircraft noise for departure routes while taking into account the interests of various stakeholders, bi-objective optimization problems involving noise and fuel consumption are formulated where both the ground track and vertical profile of a departure route are optimized simultaneously. Second, in order to make the design space of vertical profiles feasible during the optimization process, a trajectory parameterization technique recently proposed is employed. Furthermore, some modifications to MOEA/D that are aimed at significantly reducing the computational cost are also introduced. Two different examples of departure routes at Schiphol Airport in the Netherlands are shown to demonstrate the applicability and reliability of the proposed method. The simulation results reveal that the proposed method is an effective and efficient approach for solving this kind of problem. [ABSTRACT FROM AUTHOR]

In this paper, a novel Model Reference Adaptive Control (MRAC)-based hybrid control algorithm is presented for the trajectory tracking of a tri-rotor Unmanned Aerial Vehicle (UAV). The mathematical model of the tri-rotor is based on the Newton-Euler formula, whereas the MRAC-based hybrid controller consists of Fuzzy Proportional Integral Derivative (F-PID) and Fuzzy Proportional Derivative (F-PD) controllers. MRAC is used as the main controller for the dynamics, while the parameters of the adaptive controller are fine-tuned by the F-PD controller for the altitude control subsystem and the F-PID controller for the attitude control subsystem of the UAV. The stability of the system is ensured and proven by Lyapunov stability analysis. The proposed control algorithm is tested and verified using computer simulations for the trajectory tracking of the desired path as an input. The effectiveness of our proposed algorithm is compared with F-PID and the Fuzzy Logic Controller (FLC). Our proposed controller exhibits much less steady state error, quick error convergence in the presence of disturbance or noise, and model uncertainties. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of measuring complexity from embedded attractors as a way to characterize changes in the dynamical behavior of different types of systems with a quasi-periodic behavior by observing their outputs. With the aim of measuring the stability of the trajectories of the attractor along time, this paper proposes three new estimations of entropy that are derived from a Markov model of the embedded attractor. The proposed estimators are compared with traditional nonparametric entropy measures, such as approximate entropy, sample entropy and fuzzy entropy, which only take into account the spatial dimension of the trajectory. The method proposes the use of an unsupervised algorithm to find the principal curve, which is considered as the "profile trajectory", that will serve to adjust the Markov model. The new entropy measures are evaluated using three synthetic experiments and three datasets of physiological signals. In terms of consistency and discrimination capabilities, the results show that the proposed measures perform better than the other entropy measures used for comparison purposes. [ABSTRACT FROM AUTHOR]

Spacecraft need to be able to reliably slew quickly and rather than simply commanding a final angle, a trajectory calculated and known throughout a maneuver is preferred. A fully solved trajectory allows for control based off comparing current attitude to a time varying desired attitude, allowing for much better use of control effort and command over slew orientation. This manuscript introduces slew trajectories using sinusoidal functions compared to optimal trajectories using Pontryagin's method. Use of Pontryagin's method yields approximately 1.5% lower control effort compared to sinusoidal trajectories. Analysis of the simulated system response demonstrates that correct understanding of the effect of cross-coupling is necessary to avoid unwarranted control costs. Additionally, a combination of feedforward with proportional derivative control generates a system response with 3% reduction in control cost compared to a Feedforward with proportional integral derivative control architecture. Use of a calculated trajectory is shown to reduce control cost by five orders of magnitude and allows for raising of gains by an order of magnitude. When control gains are raised, an eight orders of magnitude lower error is achieved in the slew direction, and rather than an increase in control cost, a decrease by 11.7% is observed. This manuscript concludes that Pontryagin's method for generating slew trajectories outperforms the use of sinusoidal trajectories and trajectory generation schemes are essential for efficient spacecraft maneuvering. [ABSTRACT FROM AUTHOR]

Stable, efficient and lossless fruit picking has always been a difficult problem, perplexing the development of fruit automatic picking technology. In order to effectively solve this technical problem, this paper establishes a multi-objective trajectory model of the manipulator and proposes an improved multi-objective particle swarm optimization algorithm (represented as GMOPSO). The algorithm combines the methods of mutation operator, annealing factor and feedback mechanism to improve the diversity of the population on the basis of meeting the stable motion, avoiding the local optimal solution and accelerating the convergence speed. By adopting the average optimal evaluation method, the robot arm motion trajectory has been testified to constructively fulfill the picking standards of stability, efficiency and lossless. The performance of the algorithm is verified by ZDT1~ZDT3 benchmark functions, and its competitive advantages and disadvantages with other multi-objective evolutionary algorithms are further elaborated. In this paper, the algorithm is simulated and verified by practical experiments with the optimization objectives of time, energy consumption and pulsation. The simulation results show that the solution set of the algorithm is close to the real Pareto frontier. The optimal solution obtained by the average optimal evaluation method is as follows: the time is 34.20 s, the energy consumption is 61.89 °/S2 and the pulsation is 72.18 °/S3. The actual test results show that the trajectory can effectively complete fruit picking, the average picking time is 25.5 s, and the success rate is 96.67%. The experimental results show that the trajectory of the manipulator obtained by GMOPSO algorithm can make the manipulator run smoothly and facilitates efficient, stable and nondestructive picking. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) and reconfigurable intelligent surface (RIS) methods are promising techniques for improving the energy and spectrum efficiency of Fifth Generation/Beyond Fifth Generation (5G/B5G) networks. In order to take advantage of both techniques, we propose an RIS-assisted UAV secure communication scheme, where an UAV is equipped with RIS to facilitate secure transmission. To maximize the average secrecy rate, we jointly optimize the beamforming power, reflect phase shift, and UAV's trajectory. For this non-convex problem, we decompose it into the power beamforming problem, the phase shift optimization problem, and the UAV's trajectory design problem, and proposed an efficient iterative algorithm to solve the problem. The numerical results verify the superiority of the proposed scheme that can improve the average secure transmission rate by about 20% compared to that of Eavesdropping elimination methods. [ABSTRACT FROM AUTHOR]

The ability of an autonomous Unmanned Aerial Vehicle (UAV) in an unknown environment is a prerequisite for its execution of complex tasks and is the main research direction in related fields. The autonomous navigation of UAVs in unknown environments requires solving the problem of autonomous exploration of the surrounding environment and path planning, which determines whether the drones can complete mission-based flights safely and efficiently. Existing UAV autonomous flight systems hardly perform well in terms of efficient exploration and flight trajectory quality. This paper establishes an integrated solution for autonomous exploration and path planning. In terms of autonomous exploration, frontier-based and sampling-based exploration strategies are integrated to achieve fast and effective exploration performance. In the study of path planning in complex environments, an advanced Rapidly Exploring Random Tree (RRT) algorithm combining the adaptive weights and dynamic step size is proposed, which effectively solves the problem of balancing flight time and trajectory quality. Then, this paper uses the Hermite difference polynomial to optimization the trajectory generated by the RRT algorithm. We named proposed UAV autonomous flight system as Frontier and Sampling-based Exploration and Advanced RRT Planner system (FSEPlanner). Simulation performs in both apartment and maze environment, and results show that the proposed FSEPlanner algorithm achieves greatly improved time consumption and path distances, and the smoothed path is more in line with the actual flight needs of a UAV. [ABSTRACT FROM AUTHOR]

This paper presents a novel and robust two-stage pursuit strategy for the incomplete-information impulsive space pursuit-evasion missions considering the J2 perturbation. The strategy firstly models the impulsive pursuit-evasion game problem into a far-distance rendezvous stage and a close-distance game stage according to the perception range of the evader. For the far-distance rendezvous stage, it is transformed into a rendezvous trajectory optimization problem and a new objective function is proposed to obtain the pursuit trajectory with the optimal terminal pursuit capability. For the close-distance game stage, a closed-loop pursuit approach is proposed using one of the reinforcement learning algorithms, i.e., the deep deterministic policy gradient algorithm, to solve and update the pursuit trajectory for the incomplete-information impulsive pursuit-evasion missions. The feasibility of this novel strategy and its robustness to different initial states of the pursuer and evader and to the evasion strategies are demonstrated for the sun-synchronous orbit pursuit-evasion game scenarios. The results of the Monte Carlo tests show that the successful pursuit ratio of the proposed method is over 91% for all the given scenarios. [ABSTRACT FROM AUTHOR]

With the rapid development of on-orbit services and space situational awareness, there is an urgent demand for multisatellite flyby inspection (MSFI) that can obtain information about a large number of space targets with little fuel consumption in a short time. There are two kinds of constraints, namely inspection constraints (ICs) at each flyby point and transfer process constraints (TPCs) in the actual mission. Further considering the influence of discrete and continuous variables such as inspection sequence, time, and maneuver scheme, it is complex and difficult to solve MSFI. To optimize it efficiently, the task flow and the problem model are defined firstly. Then, the algorithm framework based on constraint repairing is given, which contains repair methods of the ICs and the TPCs. Finally, the proposed method is compared with the nonrepair optimization method in two numerical examples. The results indicate that when the constraints are hard to meet, it is better and more efficient than the nonrepair method. [ABSTRACT FROM AUTHOR]

The energy efficiency and flight endurance of small unmanned aerial vehicles (SUAVs) can be improved through the implementation of autonomous soaring strategies. Biologically inspired flight techniques such as dynamic and thermal soaring offer significant energy savings through the exploitation of naturally occurring wind phenomena for thrustless flight. Recent interest in the application of artificial intelligence algorithms for autonomous soaring has been motivated by the pursuit of instilling generalized behavior in control systems, centered around the use of neural networks. However, the topology of such networks is usually predetermined, restricting the search space of potential solutions, while often resulting in complex neural networks that can pose implementation challenges for the limited hardware onboard small-scale autonomous vehicles. In exploring a novel method of generating neurocontrollers, this paper presents a neural network-based soaring strategy to extend flight times and advance the potential operational capability of SUAVs. In this study, the Neuroevolution of Augmenting Topologies (NEAT) algorithm is used to train efficient and effective neurocontrollers that can control a simulated aircraft along sustained dynamic and thermal soaring trajectories. The proposed approach evolves interpretable neural networks in a way that preserves simplicity while maximizing performance without requiring extensive training datasets. As a result, the combined trajectory planning and aircraft control strategy is suitable for real-time implementation on SUAV platforms. [ABSTRACT FROM AUTHOR]

Real-time collision-avoidance navigation of autonomous ships is required by many application scenarios, such as carriage of goods by sea, search, and rescue. The collision avoidance algorithm is the core of autonomous navigation for Maritime autonomous surface ships (MASS). In order to realize real-time and free-collision under the condition of multi-ship encounter in an uncertain environment, a real-time collision avoidance framework is proposed using B-spline and optimal decoupling control. This framework takes advantage to handle the uncertain environment with limited sensing MASS which plans dynamically feasible, highly reliable, and safe feasible collision avoidance. First, owing to the collision risk assessment, a B-spline-based collision avoidance trajectory search (BCATS) algorithm is proposed to generate free-collision trajectories effectively. Second, a waypoint-based collision avoidance trajectory optimization is proposed with the path-speed decoupling control. Two benefits, a reduction of control cost and an improvement in the smoothness of the collision avoidance trajectory, are delivered. Finally, we conducted an experiment using the Electronic Chart System (ECS). The results reveal the robustness and real-time collision avoidance trajectory planned by the proposed collision avoidance system. [ABSTRACT FROM AUTHOR]

In recent years, due to the strong mobility, easy deployment, and low cost of unmanned aerial vehicles (UAV), great interest has arisen in utilizing UAVs to assist in wireless communication, especially for on-demand deployment in emergency situations and temporary events. However, UAVs can only provide users with data transmission services through wireless backhaul links established with a ground base station, and the limited capacity of the wireless backhaul link would limit the transmission speed of UAVs. Therefore, this paper designed a UAV-assisted wireless communication system that used cache technology and realized the transmission of multi-user data by using the mobility of UAVs and wireless cache technology. Considering the limited storage space and energy of UAVs, the joint optimization problem of the UAV's trajectory, cache placement, and transmission power was established to minimize the mission time of the UAV. Since this problem was a non-convex problem, it was decomposed into three sub-problems: trajectory optimization, cache placement optimization, and power allocation optimization. An iterative algorithm based on the successive convex approximation and alternate optimization techniques was proposed to solve these three optimization problems. Finally, in the power allocation optimization, the proposed algorithm was improved by changing the optimization objective function. Numerical results showed that the algorithm had good performance and could effectively reduce the task completion time of the UAV. [ABSTRACT FROM AUTHOR]

Speed advisories are used on highways to inform vehicles of upcoming changes in traffic conditions and apply a variable speed limit to reduce traffic conflicts and delays. This study applies a similar concept to intersections with respect to connected vehicles to provide dynamic speed advisories in real-time that guide vehicles towards an optimum speed. Real-time safety evaluation models for signalized intersections that depend on dynamic traffic parameters such as traffic volume and shock wave characteristics were used for this purpose. The proposed algorithm incorporates a rule-based approach alongside a Deep Deterministic Policy Gradient reinforcement learning technique (DDPG) to assign ideal speeds for connected vehicles at intersections and improve safety. The system was tested on two intersections using real-world data and yielded an average reduction in traffic conflicts ranging from 9% to 23%. Further analysis was performed to show that the algorithm yields tangible results even at lower market penetration rates (MPR). The algorithm was tested on the same intersection with different traffic volume conditions as well as on another intersection with different physical constraints and characteristics. The proposed algorithm provides a low-cost approach that is not computationally intensive and works towards optimizing for safety by reducing rear-end traffic conflicts. [ABSTRACT FROM AUTHOR]

A novel approach to solve optimal control problems dealing simultaneously with fractional differential equations and time delay is proposed in this work. More precisely, a set of global radial basis functions are firstly used to approximate the states and control variables in the problem. Then, a collocation method is applied to convert the time-delay fractional optimal control problem to a nonlinear programming one. By solving the resulting challenge, the unknown coefficients of the original one will be finally obtained. In this way, the proposed strategy introduces a very tunable framework for direct trajectory optimization, according to the discretization procedure and the range of arbitrary nodes. The algorithm's performance has been analyzed for several non-trivial examples, and the obtained results have shown that this scheme is more accurate, robust, and efficient than most previous methods. [ABSTRACT FROM AUTHOR]

Aircrafts require a large amount of fuel in order to generate enough power to perform a flight. That consumption causes the emission of polluting particles such as carbon dioxide, which is implicated in global warming. This paper proposes an algorithm which can provide the 3D reference trajectory that minimizes the flight costs and the fuel consumption. The proposed algorithm was conceived using the Floyd–Warshall methodology as a reference. Weather was taken into account by using forecasts provided by Weather Canada. The search space was modeled as a directional weighted graph. Fuel burn was computed using the Base of Aircraft DAta (BADA) model developed by Eurocontrol. The trajectories delivered by the developed algorithm were compared to long-haul flight plans computed by a European airliner and to as-flown trajectories obtained from Flightradar24®. The results reveal that up to 2000 kg of fuel can be reduced per flight, and flight time can be also reduced by up to 11 min. [ABSTRACT FROM AUTHOR]