Search

This paper reviews the novel concept of a controllable variational autoencoder (ControlVAE), discusses its parameter tuning to meet application needs, derives its key analytic properties, and offers useful extensions and applications. ControlVAE is a new variational autoencoder (VAE) framework that combines automatic control theory with the basic VAE to stabilize the KL-divergence of VAE models to a specified value. It leverages a non-linear PI controller, a variant of the proportional-integral-derivative (PID) controller, to dynamically tune the weight of the KL-divergence term in the evidence lower bound (ELBO) using the output KL-divergence as feedback. This allows us to precisely control the KL-divergence to a desired value (set point) that is effective in avoiding posterior collapse and learning disentangled representations. While prior work developed alternative techniques for controlling the KL divergence, we show that our PI controller has better stability properties and thus better convergence, thereby producing better disentangled representations from finite training data. In order to improve the ELBO of ControlVAE over that of the regular VAE, we provide a simplified theoretical analysis to inform the choice of set point for the KL-divergence of ControlVAE. We evaluate the proposed method on three tasks: image generation, language modeling, and disentangled representation learning. The results show that ControlVAE can achieve much better reconstruction quality than the other methods for comparable disentanglement. On the language modeling task, our method can avoid posterior collapse (KL vanishing) and improve the diversity of generated text. Moreover, it can change the optimization trajectory, improving the ELBO and the reconstruction quality for image generation. [ABSTRACT FROM AUTHOR]

This paper reviews the novel concept of a controllable variational autoencoder (ControlVAE), discusses its parameter tuning to meet application needs, derives its key analytic properties, and offers useful extensions and applications. ControlVAE is a new variational autoencoder (VAE) framework that combines automatic control theory with the basic VAE to stabilize the KL-divergence of VAE models to a specified value. It leverages a non-linear PI controller, a variant of the proportional-integral-derivative (PID) controller, to dynamically tune the weight of the KL-divergence term in the evidence lower bound (ELBO) using the output KL-divergence as feedback. This allows us to precisely control the KL-divergence to a desired value (set point) that is effective in avoiding posterior collapse and learning disentangled representations. While prior work developed alternative techniques for controlling the KL divergence, we show that our PI controller has better stability properties and thus better convergence, thereby producing better disentangled representations from finite training data. In order to improve the ELBO of ControlVAE over that of the regular VAE, we provide a simplified theoretical analysis to inform the choice of set point for the KL-divergence of ControlVAE. We evaluate the proposed method on three tasks: image generation, language modeling, and disentangled representation learning. The results show that ControlVAE can achieve much better reconstruction quality than the other methods for comparable disentanglement. On the language modeling task, our method can avoid posterior collapse (KL vanishing) and improve the diversity of generated text. Moreover, it can change the optimization trajectory, improving the ELBO and the reconstruction quality for image generation. [ABSTRACT FROM AUTHOR]

Robot motion planning methods based on trajectory optimization can efficiently generate feasible and optimal trajectories by minimizing a suitable cost function, even in high-dimensional spaces. However, the main drawback of these methods lies in their proneness to infeasible local minima, especially in complex environments. To mitigate this issue, we propose a novel motion planning method that represents trajectories as samples from a mixture of continuous-time Gaussian processes (MGP) and employs stochastic optimization in order to update the MGP parameters in a cost-minimizing manner. The contributions of the proposed trajectory optimization method arise from the introduced mixture representation and stochastic gradient estimation, dominantly enabling better exploration of the trajectory space and including nondifferentiable optimizing costs. We evaluated the proposed method in multiple simulation benchmarks featuring 7 degree-of-freedom (DOF) robot arms and a 10DOF mobile manipulator. We also conducted a real-world experiment with a 14DOF dual-arm robot. The experimental results demonstrated that the proposed method achieves higher success rate than several state-of-the-art methods, while the advantages stemming from MGPs and stochastic optimization, like trajectory smoothness, support of nondifferentiable cost functions, multiple trajectory solutions, and the ability to tackle high-dimensional planning problems, are inherently kept. [ABSTRACT FROM AUTHOR]

For the induction motor (IM) current loop, the supertwisting sliding-mode control (ST-SMC) has been considered as an effective approach to achieve chattering suppression and steady-state errorless control. However, due to the system disturbance, the conventional ST-SMC suffers from control delay in the convergence trajectory, resulting in decreased antidisturbance capability. To address this problem, this article proposed a ST-SMC with convergence trajectory optimization. First, a nonlinear sliding-mode manifold is designed to achieve the ideal ST-SMC convergence trajectory. Then, a disturbance compensation term is added into the control law to eliminate the system control delay. Compared with the conventional ST-SMC, the studied method can effectively enhance the antidisturbance capability of IM current loop, leading to improved transient performance. Finally, the superiority of the investigated method is verified by the experimental results from a 3.7 kW IM test bench. [ABSTRACT FROM AUTHOR]

Motion blur in dynamic scenes is an important yet challenging research topic. Recently, deep learning methods have achieved impressive performance for dynamic scene deblurring. However, the motion information contained in a blurry image has yet to be fully explored and accurately formulated because: (i) the ground truth of dynamic motion is difficult to obtain; (ii) the temporal ordering is destroyed during the exposure; and (iii) the motion estimation from a blurry image is highly ill-posed. By revisiting the principle of camera exposure, motion blur can be described by the relative motions of sharp content with respect to each exposed position. In this paper, we define exposure trajectories, which represent the motion information contained in a blurry image and explain the causes of motion blur. A novel motion offset estimation framework is proposed to model pixel-wise displacements of the latent sharp image at multiple timepoints. Under mild constraints, our method can recover dense, (non-)linear exposure trajectories, which significantly reduce temporal disorder and ill-posed problems. Finally, experiments demonstrate that the recovered exposure trajectories not only capture accurate and interpretable motion information from a blurry image, but also benefit motion-aware image deblurring and warping-based video extraction tasks. Codes are available on https://github.com/yjzhang96/Motion-ETR. [ABSTRACT FROM AUTHOR]

Due to the wide distribution and high energy-saving potential of industrial robots, energy optimization techniques of industrial robots attract increasing attention. Dynamic time-scaling methods can optimize the energy consumption of robots only by stretching or shrinking reference trajectories in the time dimension. Dynamic time-scaling methods show advantages over other energy-saving techniques because time-scaling methods can achieve energy savings without hardware investment. Traditional dynamic time-scaling methods need to search the possible state transitions from the initial configuration to the final configuration to obtain the optimal solution. The integration of robot transient power has to be carried out for each possible state transition, which directly leads to intensive computation. Therefore, in this article, an efficient computation method for robot trajectory optimization is proposed. Based on parameter separation, an energy characteristic parameter model based on the dynamic time-scaling is developed, which describes the energy consumption during the state transition as a function of the scaling parameters. Based on the energy characteristic parameter model, the dynamic programming algorithm can replace the integral operation of transient power with the substitution calculations, which avoids intensive computation. Experimental results show that the proposed method can achieve 33.7% less energy consumption, and the computation time can be reduced by nearly 99%. [ABSTRACT FROM AUTHOR]

Safe deployment of autonomous robots in diverse scenarios requires agents that are capable of efficiently adapting to new environments while satisfying constraints. In this article, we propose a practical and theoretically justified approach to maintain safety in the presence of dynamics uncertainty. Our approach leverages Bayesian meta-learning with last-layer adaptation. The expressiveness of neural-network features trained offline, paired with efficient last-layer online adaptation, enables the derivation of tight confidence sets, which contract around the true dynamics as the model adapts online. We exploit these confidence sets to plan trajectories that guarantee the safety of the system. Our approach handles problems with high dynamics uncertainty, where reaching the goal safely is potentially initially infeasible, by first exploring to gather data and reduce uncertainty, before autonomously exploiting the acquired information to safely perform the task. Under reasonable assumptions, we prove that our framework guarantees the high-probability satisfaction of all constraints at all times jointly, i.e., over the total task duration. This theoretical analysis also motivates two regularizers of last-layer meta-learning models that improve online adaptation capabilities as well as performance by reducing the size of the confidence sets. We extensively demonstrate our approach in simulation and on hardware. [ABSTRACT FROM AUTHOR]

In this article, we present an optimization-based framework for multicopter trajectory planning subject to geometrical configuration constraints and user-defined dynamic constraints. The basis of the framework is a novel trajectory representation built upon our novel optimality conditions for unconstrained control effort minimization. We design linear-complexity operations on this representation to conduct spatial–temporal deformation under various planning requirements. Smooth maps are utilized to exactly eliminate geometrical constraints in a lightweight fashion. A variety of state-input constraints are supported by the decoupling of dense constraint evaluation from sparse parameterization and the backward differentiation of flatness map. As a result, this framework transforms a generally constrained multicopter planning problem into an unconstrained optimization that can be solved reliably and efficiently. Our framework bridges the gaps among solution quality, planning efficiency, and constraint fidelity for a multicopter with limited resources and maneuvering capability. Its generality and robustness are both demonstrated by applications to different flight tasks. Extensive simulations and benchmarks are also conducted to show its capability of generating high-quality solutions while retaining the computation speed against other specialized methods by orders of magnitude. [ABSTRACT FROM AUTHOR]

The objective of trajectory optimization algorithms is to achieve an optimal collision-free path between start and goal states. In real-world scenarios, where environments can be complex and nonhomogeneous, a robot needs to be able to gauge whether a state will be in collision with various objects in order to meet some safety metrics. The collision detector should be computationally efficient and, ideally, analytically differentiable to facilitate stable and rapid gradient descent during optimization. However, methods today lack an elegant approach to detect collision differentiably, relying rather on numerical gradients that can be unstable. We present DiffCo, the first, fully autodifferentiable, nonparametric model for collision detection. Its nonparametric behavior allows one to compute collision boundaries on the fly and update them, requiring no pretraining and allowing it to update continuously in dynamic environments. It provides robust gradients for trajectory optimization via backpropagation and is often 10–100 times faster to compute than its geometric counterparts. DiffCo also extends trivially to modeling different object collision classes for semantically informed trajectory optimization. [ABSTRACT FROM AUTHOR]

This article considers the problem of estimating the trajectory of a ballistic target in the reentry phase using 2-D measurements (azimuth and elevation angles) from a moving passive sensor. Previous works investigated the estimation problem of an object in the thrusting and initial ballistic phase from a single fixed passive sensor. This article shows that the 3-D trajectory in the reentry phase can be obtained by estimating the target's state at the end of the observation interval. The 7-d motion parameter vector (velocity azimuth angle, velocity elevation angle, drag coefficient, target speed, and 3-D position) is estimated by the maximum likelihood (ML) estimator with numerical search. Then we can predict the future position at an arbitrary time and the impact point of the target. The observability of the system for a sensor on a fast aircraft moving with constant velocity or maneuvering is verified via the invertibility of the Fisher information matrix. This is a major extension of the applicability of the recent observability proof for a stationary passive sensor observing a target in a gravitational field. The Cramer–Rao lower bound for the estimated parameters is evaluated and it shows that the estimates are statistically efficient. The angle estimation performance for the ML estimator is also compared with that of the polynomial fitting method. Simulation results illustrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Optimizing k-space sampling trajectories is a promising yet challenging topic for fast magnetic resonance imaging (MRI). This work proposes to optimize a reconstruction method and sampling trajectories jointly concerning image reconstruction quality in a supervised learning manner. We parameterize trajectories with quadratic B-spline kernels to reduce the number of parameters and apply multi-scale optimization, which may help to avoid sub-optimal local minima. The algorithm includes an efficient non-Cartesian unrolled neural network-based reconstruction and an accurate approximation for backpropagation through the non-uniform fast Fourier transform (NUFFT) operator to accurately reconstruct and back-propagate multi-coil non-Cartesian data. Penalties on slew rate and gradient amplitude enforce hardware constraints. Sampling and reconstruction are trained jointly using large public datasets. To correct for possible eddy-current effects introduced by the curved trajectory, we use a pencil-beam trajectory mapping technique. In both simulations and in- vivo experiments, the learned trajectory demonstrates significantly improved image quality compared to previous model-based and learning-based trajectory optimization methods for $10\times $ acceleration factors. Though trained with neural network-based reconstruction, the proposed trajectory also leads to improved image quality with compressed sensing-based reconstruction. [ABSTRACT FROM AUTHOR]

An optimal switching heating control strategy based on minimum margin (OS-MM) is proposed for high efficiency, low energy consumption, and high-uniformity fine control in a large-scale vertical quench furnace. This work was stimulated by the need for solving the contradiction between the heating rate and temperature overshoot to achieve a rapid rise in temperature with no overshoot. Based on a three-dimensional (3-D) transient temperature field model of the quenching furnace, the temperature field optimization control problem is transformed into a boundary optimization control problem of rapid heating, whereby it is rigorously proved that the fastest rise in temperature is attained by the full-power heating, which satisfies the bang-bang characteristics. The key parameter that determines the overshoot in the full-power heating mode is introduced and defined as the minimum margin in the temperature-rising process. The analytical expression for solving the minimum margin is calculated by the eigenfunction expansion method and using the strong metal thermal inertia of the internal temperature field, the OS-MM method is designed to stop the heating in advance at a calculated switching point to optimize full-power heating, thus conserving energy by reducing its consumption. The results of simulation and industrial experiments show that this strategy greatly shortens the temperature adjusting time, significantly reduces energy consumption, and effectively improves the control performance indices, such as overshoot and static error in the temperature holding period of the thermal treatment process, as compared to the existing heating methods. [ABSTRACT FROM AUTHOR]

Policy search and model predictive control (MPC) are two different paradigms for robot control: policy search has the strength of automatically learning complex policies using experienced data, and MPC can offer optimal control performance using models and trajectory optimization. An open research question is how to leverage and combine the advantages of both approaches. In this article, we provide an answer by using policy search for automatically choosing high-level decision variables for MPC, which leads to a novel policy-search-for-model-predictive-control framework. Specifically, we formulate the MPC as a parameterized controller, where the hard-to-optimize decision variables are represented as high-level policies. Such a formulation allows optimizing policies in a self-supervised fashion. We validate this framework by focusing on a challenging problem in agile drone flight: flying a quadrotor through fast-moving gates. Experiments show that our controller achieves robust and real-time control performance in both simulation and the real world. The proposed framework offers a new perspective for merging learning and control. [ABSTRACT FROM AUTHOR]

Placing robotsoutside controlled conditions requires versatile movement representations that allow robots to learn new tasks and adapt them to environmental changes. The introduction of obstacles or the placement of additional robots in the workspace and the modification of the joint range due to faults or range-of-motion constraints are typical cases, where the adaptation capabilities play a key role for safely performing the robot’s task. Probabilistic movement primitives (ProMPs) have been proposed for representing adaptable movement skills, which are modeled as Gaussian distributions over trajectories. These are analytically tractable and can be learned from a small number of demonstrations. However, both the original ProMP formulation and the subsequent approaches only provide solutions to specific movement adaptation problems, e.g., obstacle avoidance, and a generic, unifying, probabilistic approach to adaptation is missing. In this article, we develop a generic probabilistic framework for adapting ProMPs. We unify previous adaptation techniques, for example, various types of obstacle avoidance, via-points, and mutual avoidance, in one single framework and combine them to solve complex robotic problems. Additionally, we derive novel adaptation techniques such as temporally unbound via-points and mutual avoidance. We formulate adaptation as a constrained optimization problem, where we minimize the Kullback–Leibler divergence between the adapted distribution and the distribution of the original primitive,while we constrain the probability mass associated with undesired trajectories to be low. We demonstrate our approach on several adaptation problems on simulated planar robot arms and seven-degree-of-freedom Franka Emika robots in a dual-robot-arm setting. [ABSTRACT FROM AUTHOR]

The air-ground cooperative emergency networks can assist with the rapid reconstruction of communication in the disaster area, where unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) are deployed as base stations. The trajectory optimization of emergency base stations is of vital importance to the communication performance, which is related to the timeliness and effectiveness of rescue. In this paper, federated multi-agent deep deterministic policy gradient (F-MADDPG) based trajectory optimization algorithm is proposed to maximize the average spectrum efficiency. Specifically, the property of MADDPG is inherited to jointly control of multiple vehicles and federated averaging (FA) is utilized to eliminate the isolation of data to accelerate the convergence. Distributed F-MADDPG (DF-MADDPG) is further designed to reduce the communication overhead with a distributed architecture. The simulation results indicate that the proposed F-MADDPG and DF-MADDPG based algorithms significantly outperform the existing trajectory optimization algorithms, in terms of the average spectrum efficiency and the speed of convergence. [ABSTRACT FROM AUTHOR]

This article investigates the fuel-optimal guidance problem of the end-to-end human-Mars entry, powered-descent, and landing (EDL) mission. It applies a unified modeling scheme and develops a computationally efficient new optimization algorithm to solve the multiphase optimal guidance problem. The end-to-end EDL guidance problem is first modeled as a multiphase optimal control problem with different dynamics and constraints at each phase. Via polynomial approximation and discretization techniques, this multiphase optimal control problem is then reformulated as a polynomial programming problem. By introducing intermediate variables and quadratic equality constraints, a polynomial program is equivalently converted into a nonconvex quadratically constrained quadratic program (QCQP). Then, a novel customized alternating direction method of multipliers (ADMM) is proposed to efficiently solve the large-scale QCQP with convergence proof to a local optimum under certain conditions on the algorithmic parameters. The fuel savings under the end-to-end human-Mars EDL guidance are verified by comparing to the fuel consumption using the separate phase guidance approach. Furthermore, the computational efficiency of the customized ADMM algorithm is validated by comparing to the state-of-the-art nonlinear programming method. The robustness of the customized ADMM algorithm is verified via extensive simulation cases with random initial conditions. [ABSTRACT FROM AUTHOR]

Considering the requirement of avoiding obstacles in different planetary landing missions, this article presents a generalized method dealing with the obstacle avoidance constrained landing trajectory optimization problem with vectorized strategy, i.e., vector trajectory method (VTM). By introducing a trajectory direction constraint with vectorized description, the character of the obstacle avoidance trajectory can be more specifically depicted. Moreover, by satisfying proper trajectory direction constraint, the lander's particular performances, such as the observation to the target or probability of a safe flight, can be improved. To this end, the VTM and relevant theorem are first developed, revealing the relationship between the two aspects of obstacle avoidance constraint (i.e., distance constraint and trajectory direction constraint). Then, both aspects of constraints are uniformly transformed as the auxiliary angle magnitude constraint with the vectorized strategy, which significantly simplifies the solving procedure of obstacle avoidance constrained trajectory optimization problem. Finally, the proposed VTM is illustrated in detail through the examples with the planetary landing background of atmospheric entry and powered descent landing. [ABSTRACT FROM AUTHOR]

In the manufacturing industry, spray painting is often an important part of the manufacturing process. Especially in the automotive industry, the perceived quality of the final product is closely linked to the exactness and smoothness of the painting process. For complex products or low batch size production, manual spray painting is often used. But in large scale production with a high degree of automation, the painting is usually performed by industrial robots. There is a need to improve and simplify the generation of robot trajectories used in industrial paint booths. A novel method for spray paint optimization is presented, which can be used to smooth out a generated initial trajectory and minimize paint thickness deviations from a target thickness. The smoothed out trajectory is found by solving, using an interior point solver, a continuous non-linear optimization problem. A two-dimensional reference function of the applied paint thickness is selected by fitting a spline function to experimental data. This applicator footprint profile is then projected to the geometry and used as a paint deposition model. After generating an initial trajectory, the position and duration of each trajectory segment are used as optimization variables. The primary goal of the optimization is to obtain a paint applicator trajectory, which would closely match a target paint thickness when executed. The algorithm has been shown to produce satisfactory results on both a simple 2-dimensional test example, and a non-trivial industrial case of painting a tractor fender. The resulting trajectory is also proven feasible to be executed by an industrial robot. Note to Practitioners—The work is motivated by the need to generate well performing robot trajectories in robotized spray-painting booths. The described method applies to cases where robotic spray painting is to be used for painting a surface with an even layer of paint at a specified thickness. The method generates and optimizes robot trajectories and is shown to be able to generate a satisfactory paint cover for simple test cases as well as more realistic industrial cases. For a user it could be implemented as is, or be obtained as a standalone service, but there are some prerequisites that need to be fulfilled to make use of the optimization method. It is assumed that the surface to be painted is available as a CAD-model and that physical testing has been performed to determine the characteristics of the paint and nozzle. These physical tests amount to spraying paint on a flat piece of material at a few different distances from the surface and measuring the cross section of the paint thickness. The resulting trajectory can be executed on any industrial painting robot that can handle linear motion commands. [ABSTRACT FROM AUTHOR]

In the field of sculptured surfaces machining, the robot trajectory planning, under high-order complex constraints, aiming at minimizing energy or time, is always a challenge. The complexity of curvature characteristics of sculptured surfaces and the nonlinearity of relevant constraints are the main reasons. This article proposes an efficient planning method of minimum-energy robot trajectory, for high-speed machining of sculptured surfaces. First, the energy characteristic model of the robot machining system (RMS) is established, to acquire the energy-optimal feedrate, under velocity constraints, to use in the subsequent trajectory planning. Next, a trajectory planning model, with complex constraints, is developed. The proposed method transforms the original trajectory planning into a minimal modification of the initial objective-optimal B-spline feedrate curve (BFC). Furthermore, two main coupling problems, which influence the minimal change of curves, in the direct evolution-based BFC modification, are addressed. Based on the derived solutions, a novel modification algorithm of BFC, with a callback mechanism (CBM), is proposed. Finally, the performance of the proposed method and the specific algorithm is validated by two case studies. Results show that the proposed method can significantly improve the efficiency of robot trajectory planning, aiming at minimum energy, while exhibiting excellent performance. Note to Practitioners—This work was motivated by how to automatically and effectively acquire the energy-saving trajectory of a robotic system, executing sculptured surface machining. This article suggests a new approach that transforms the original trajectory optimization into a minimal modification of the initial energy-optimal BFC, obtained under velocity constraints. This approach calculates the complex energy formula only once. A CBM, for constraint-based BFC modification, is proposed, to revise the redundant reduction of the feedrate. The proposed modification algorithm significantly decreases the detrimental effect of two coupling problems, on the adjustment of the BFC. Results show that the computational efficiency of the proposed method is significantly superior to the one of the direct optimization method. The performance of the proposed modification algorithm is obviously advanced compared to the existing B-spline evolution algorithm. In blade machining, after optimizing the trajectory using the proposed method and algorithm, both energy and time decrease by more than 45% compared to the conservative feed. The proposed algorithm improves significantly the trajectory compared to the prior art algorithm. Technologists benefit from reduced planning time and improved machining performance. However, incorporation into a CAM or manufacturing system has not yet been realized and remains a significant work to be done in the future. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) energy consumption and task completion time are two significant aspects in UAV-enabled Internet of Things (IoT) data acquisition. However, while energy consumption and task completion time are not conflicting constraints, optimizing the former often does not automatically lead to optimization of the latter, and vice-versa. In this paper, we aim to further decrease UAV energy consumption while minimizing UAV task completion time. We propose a novel UAV utility function to describe task completion time for data acquisition and energy consumption for propulsion and receiver's circuits. Then, we formulate a mixed-integer nonconvex utility maximization problem, involving joint optimization of UAV trajectory, velocity, acceleration, task completion time and scheduling of IoT devices for data uploading. To tackle this problem, we decompose the original problem into two sub-problems and propose a two-layer joint task time and trajectory optimization (JTTTO) iterative algorithm, which converges in polynomial time. Accordingly, we apply block coordinate descent (BCD) and successive convex approximation (SCA) algorithms to optimize UAV trajectory, and bisection search algorithm to minimize task completion time, respectively. Simulation results show that the proposed data acquisition scheme significantly decreases the UAV's energy consumption while minimizing task completion time, compared with the other time-minimization schemes. [ABSTRACT FROM AUTHOR]

Previous deep learning-based video stabilizers require a large scale of paired unstable and stable videos for training, which are difficult to collect. Traditional trajectory-based stabilizers, on the other hand, divide the task into several sub-tasks and tackle them subsequently, which are fragile in textureless and occluded regions regarding the usage of hand-crafted features. In this paper, we attempt to tackle the video stabilization problem in a deep unsupervised learning manner, which borrows the divide-and-conquer idea from traditional stabilizers while leveraging the representation power of DNNs to handle the challenges in real-world scenarios. Technically, DUT is composed of a trajectory estimation stage and a trajectory smoothing stage. In the trajectory estimation stage, we first estimate the motion of keypoints, initialize and refine the motion of grids via a novel multi-homography estimation strategy and a motion refinement network, respectively, and get the grid-based trajectories via temporal association. In the trajectory smoothing stage, we devise a novel network to predict dynamic smoothing kernels for trajectory smoothing, which can well adapt to trajectories with different dynamic patterns. We exploit the spatial and temporal coherence of keypoints and grid vertices to formulate the training objectives, resulting in an unsupervised training scheme. Experiment results on public benchmarks show that DUT outperforms state-of-the-art methods both qualitatively and quantitatively. The source code is available at https://github.com/Annbless/DUTCode. [ABSTRACT FROM AUTHOR]

The control objective of the vertical plane underactuated manipulator (VPUM) is generally to swing up the end point (EP) from the vertical down equilibrium point (VDEP) to the vertical up equilibrium point (VUEP), and finally, to stabilize it at the VUEP. The zone control methods are usually used to achieve this control objective, but the problem of these methods is that they cannot find a unified zone range, and it is easy to appear singularity in the motion process. In this article, for two-link VPUMs, we propose a control strategy based on trajectory planning and optimization, which does not need to divide the zone range, avoids the singularity problem, and can achieve the control objective quickly and smoothly. We design the trajectory by using the time scale method for the active link according to the initial and target states. Then, we obtain the trajectory parameters by employing differential evolution algorithm to ensure that the passive link can also move from the initial states to the target states simultaneously. We design a sliding mode tracking controller to make the active link move along the designed trajectory, so the EP is moved to VUEP. Meantime, we design a sliding mode stabilization controller to ensure that the system is stable at VUEP. Finally, the universality and robustness of the proposed method are proved by simulations. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) cooperated with the simultaneous wireless information and power transfer (SWIPT) can reinforce the desired signal and deal with the energy supply problem effectively. By leveraging the on-demand mobility of unmanned aerial vehicles (UAVs), the IRS cooperated SWIPT can be deployed in more flexible and reliable scenarios. In this article, we investigate the UAV-mounted IRS-assisted SWIPT for Internet of Things (IoT) networks. In particular, a UAV-mounted IRS is deployed to assist the information transmission and power transfer from the access point to several IoT devices simultaneously. Taking full advantage of the UAV-mounted IRS in attending multiple IoT devices flexibly, a time division multiple access (TDMA)-based scheduling protocol is proposed to serve different IoT devices alternatively during the UAV flying along an optimized trajectory with the information and power transfer executed. Then, an optimization problem of maximizing the minimum average achievable rate of multiple devices is formulated with the specific energy harvesting requirement guaranteed. To solve the nonconvex problem, we leverage the successive convex approximation and block coordinate descent methods to develop an iterative algorithm. Simulation results demonstrate that with the help of the more flexible and reliable UAV-mounted IRS, the minimum achievable rate of the IoT network can be significantly improved. [ABSTRACT FROM AUTHOR]

Industrial robots are characterized by good flexibility and a large working space, and offer a new approach for the machining of large and complex parts with small machining allowances (extra material allowed for subsequent machining). Parts of this type (such as aircraft skin parts, wind turbine blades, etc.) are easily deformed due to their large scale and low stiffness. Therefore, these parts cannot be directly machined according to the designed model. A feasible method is to plan a robotic machining path by using the point clouds of parts after clamping from onsite measurement which contains inherent defects of measurement such as noise points and abrupt points. In this article, a novel method is proposed to plan and optimize a robotic machining path that meets the requirements of smoothness, dexterity, and stiffness based on the point cloud from onsite measurement. The dual nonuniform rational B-spline curves of the machining path points and tool axis points are generated at first. Next, an objective function of smoothness optimization is established to filter out the local mutation of the path by considering the constraints of both the deformation energy and the deviation. Then, the objective function of robot postures optimization is established to optimize dexterity and Cartesian stiffness of a robot during the machining process. To show the feasibility of the proposed method, simulation and experiments are carried out. It is proved that the proposed method can generate a smooth machining trajectory. The stability of joint rotation and the rigidity and dexterity of the robot are improved during the machining process. [ABSTRACT FROM AUTHOR]

Due to their promising applications and intriguing characteristics, Unmanned Aerial Vehicles (UAVs) can be dispatched as flying base stations to serve multiple energy-constrained Internet-of-Things (IoT) sensors. Moreover, to ensure fresh data collection while providing sustainable energy support to a large set of IoT devices, a required number of UAVs should be deployed to carry out these two tasks efficiently and promptly. Indeed, the data collection requires that UAVs first make Wireless Energy Transfer (WET) to supply IoT devices with the necessary energy in the downlink. Then, IoT devices perform Wireless Information Transmission (WIT) to UAVs in the uplink based on the harvested energy. However, it turns out that when the same UAV performs WIT and WET, its energy usage and the data collection time are severely penalized. Worse yet, it is difficult to efficiently coordinate between UAVs to improve the performance in terms of WET and WIT. This work proposes to divide UAVs into two teams to behave as data collectors and energy transmitters, respectively. A Multi-Agent Deep Reinforcement Learning (MADRL) method, called TEAM, is leveraged to jointly optimize both teams’ trajectories, minimize the expected Age of Information (AoI), maximize the throughput of IoT devices, minimize the energy utilization of UAVs, and enhance the energy transfer. Simulation results depict that TEAM can effectively synchronize UAV teams and adapt their trajectories while serving a large-scale dynamic IoT environment. [ABSTRACT FROM AUTHOR]

Rapid and responsive Earth observation satellites enable the evaluation of disaster risk, improve relief effectiveness, and reduce suffering and fatalities in the event of sudden disaster events. One promising method for responsive space satellites is orbital maneuvering. This article describes a multitree search framework for multisatellite responsiveness scheduling considering orbital maneuvering, where multiple ground targets are cooperatively observed by multiple observation satellites over a short period of time. Based on the traditional tree search, the proposed method constructs multiple trees and distributes all the targets to multiple satellites, allowing the observation sequence of a single satellite to be optimized. To apply the tree search algorithm, a tree node collection (TNC) composed of the corresponding nodes in multiple trees is used to represent the state of each satellite. Before the expansion phase, one specific node in the TNC is determined for later expansion. A beam search is then used to optimize the observation sequence. Ground-track adjustment techniques using impulse maneuver are considered for visiting a given target. The proposed framework is more effective than other algorithms and achieves a better performance than the previous best method in a typical multisatellite responsiveness scheduling scenario. [ABSTRACT FROM AUTHOR]

A robust algorithm to solve the low-thrust fuel-optimal trajectory optimization problem for interplanetary spacecraft is developed in this article. The original nonlinear optimal control problem is convexified and transformed into a parameter optimization problem using an arbitrary-order Gauss–Lobatto discretization scheme with nonlinear control interpolation. A homotopic approach that considers the energy-to-fuel smoothing path is combined with an adaptive second-order trust-region mechanism to increase performance. The overall robustness is assessed in several fuel-optimal transfers with poor initial guesses. The results show a superior performance in terms of convergence and computational time compared to standard convex programming approaches in the literature. [ABSTRACT FROM AUTHOR]

Differential dynamic programming (DDP) is a well-recognized method for trajectory optimization due to its fast convergence characteristics. However, the original DDP requires a predefined final time and cannot handle nonlinear constraints in optimization. This prohibits the application of DDP for autonomous vehicles due to the heuristic nature of setting a final time beforehand and the existence of inherent physical limits. This article revisits DDP by dynamically optimizing the final time via the first-order optimality condition of the value function and using augmented Lagrangian method to tackle the issue of nonlinear constraints. The resultant algorithm is termed as flexible final time constrained differential dynamic programming (FFT-CDDP). Extensive numerical simulations for a three-dimensional guidance problem are used to demonstrate the working of FFT-CDDP. The results indicate that the proposed FFT-CDDP provides much higher computational efficiency and stronger robustness against the initial solution guess, compared with the off-the-shelf general purpose optimal control software (GPOPS) algorithm. [ABSTRACT FROM AUTHOR]

This paper investigates a wireless powered unmanned aerial vehicle (UAV) communication network with backscatter and caching technologies. Specifically, we assume a self-energized UAV with a cache memory is deployed as a flying backscatter device (BD), term the UAV-enabled BD (UB), to relay the source’s signals to the destination. Whereas the source S can act as a wireless charging station or a base station to supply power or transmit information to the UB using the dynamic time splitting (DTS) method. The UAV utilizes its harvested energy for backscattering (i.e., passive communication) and transmit information (i.e., active communication) to the destination. In this context, we aim to maximize the total throughput by jointly optimizing the DTS ratio and the UB’s trajectory with caching capability at the UB. The formulation is troublesome to solve since it is a non-convex problem. To find solutions, we decompose the original problem into two sub-problems, whereas we first optimize the DTS ratio for a given UB’s trajectory and the UB’s trajectory optimization for a given DTS ratio. By using the KKT conditions, a closed-form expression for the optimal value of the DTS ratio is obtained, greatly reducing the computation time. Moreover, the solution of the second sub-problem can be acquired by adopting the successive convex approximation (SCA) technique. Consequently, an efficient alternating algorithm is proposed by leveraging the block coordinate descent (BCD) method. To show the advantages of the proposed BCD-based algorithm, we also provide the solution of the original problem applying the inner approximation (IA) method. Finally, the intensive numerical results demonstrate that our proposed schemes achieve significant throughput gain in comparison to the benchmark schemes. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-enabled communication has emerged as an irreplaceable technology in military, disaster relief and emergency scenarios. This correspondence investigates the average throughput in a UAV-enabled cognitive radio network, where the UAV is regarded as a dedicated secondary user to enhance the network coverage and spectral efficiency. Based on the probabilistic line-of-sight channel, we exploit the joint design of UAV trajectory and resource allocation to maximize the average throughput under the constraints of co-channel interference and completion time. The original problem is a mixed integer non-convex problem which is generally NP-hard. We first decompose the primal problem into a bilevel programming problem, and then propose an efficient high-quality algorithm based on the particle swarm optimization approach. The optimized trajectory reveals the trade-off between throughput and co-channel interference. Numerical results verify the superiority of the proposed algorithm as compared to other benchmark schemes. [ABSTRACT FROM AUTHOR]

3D human trajectory reconstruction in an indoor scene is critical in various applications, such as indoor navigation and human activity recognition. This task is challenging due to occlusion and clutters of indoor scenes, flexible human body joints, and severe lack of relevant datasets. Although several methods have been proposed to reconstruct a 3D human trajectory, they either can recover only 2D positions or require human initiative cooperation. In this paper, we propose a novel framework for 3D human trajectory reconstruction in an indoor scene using monocular surveillance videos and static point clouds without any initiative cooperation. The proposed framework consists of three modules: 3D pose estimation, depth regression, and trajectory reconstruction. We first estimate 3D pose from videos. Especially, we reconstruct a half-body 3D pose to deal with the occlusion problem. Then, we propose a depth regression approach to iteratively regress the depth of a 3D pose. Unlike data-driven approaches, our depth regression approach does not require training data and can be integrated into any 3D pose model. Finally, we exploit the geometric constraints from the point cloud to optimize the 3D trajectory. We evaluated the 3D pose estimation and depth regression modules on the H3.6M datasets. Due to the lack of evaluation datasets, we also built a trajectory dataset to evaluate the trajectory reconstruction performance. Empirical evaluation shows that our framework achieves accurate trajectory reconstruction results on real-world videos. [ABSTRACT FROM AUTHOR]

Planning high-speed trajectories for UAVs in unknown environments requires algorithmic techniques that enable fast reaction times to guarantee safety as more information about the environment becomes available. The standard approaches that ensure safety by enforcing a “stop” condition in the free-known space can severely limit the speed of the vehicle, especially in situations where much of the world is unknown. Moreover, the ad-hoc time and interval allocation scheme usually imposed on the trajectory also leads to conservative and slower trajectories. This work proposes FASTER (Fast and Safe Trajectory Planner) to ensure safety without sacrificing speed. FASTER obtains high-speed trajectories by enabling the local planner to optimize in both the free-known and unknown spaces. Safety is ensured by always having a safe back-up trajectory in the free-known space. The MIQP formulation proposed also allows the solver to choose the trajectory interval allocation. FASTER is tested extensively in simulation and in real hardware, showing flights in unknown cluttered environments with velocities up to 7.8 m/s, and experiments at the maximum speed of a skid-steer ground robot (2 m/s). [ABSTRACT FROM AUTHOR]

This article describes a topological approach to generating families of open- and closed-loop walking gaits for underactuated 2-D and 3-D biped walkers subject to configuration inequality constraints, physical holonomic constraints (e.g., closed-loop linkages), and virtual holonomic constraints (user-defined constraints enforced through feedback control). Our method constructs implicitly defined manifolds of feasible periodic gaits within a state-time-control space that parameterizes the biped’s hybrid trajectories. Since equilibrium configurations of the biped often belong to such manifolds, we use equilibria as “templates” from which to grow the gait families. Equilibria are reliable seeds for the construction of gait families, eliminating the need for random, intuited, or bio-inspired initial guesses at feasible trajectories in an optimization framework. We demonstrate the approach on several 2-D and 3-D biped walkers. [ABSTRACT FROM AUTHOR]

In this paper, an unmanned aerial vehicle (UAV)-enabledspace-air-ground integrated relay system, in which UAV is equipped with phased-array antennas to receive satellite’s signal while utilizing non-orthogonal multiple access (NOMA) schemes to transmit data to land-based users, is proposed. For UAV signal collection, a detection-vector optimization problem can be addressed by introducing a serial of transformations into a second-order cone programming problem. Furthermore, the UAV-ground NOMA communication is summarized into a max-min problem in terms of UAV’s energy efficiency (EE), which is a fractional mixed-integer non-convex problem and has been widely recognized as hard work. Thus, a two-step solution is proposed. Firstly, we transfer the max-min fractional problem into a subtractive one. After that, the transformed problem is further divided into three sub-problems, which are used for jointly performing UAV trajectory optimization, NOMA scheduling optimization, and NOMA power allocation. In addition, the non-convexity of the above-mentioned problem is well solved by using the proposed iterative algorithm, achieving a rapid convergence. Numerical results illustrate the superiority of the proposed EE-NOMA scheme, which achieves three times higher energy-efficient than the conventional spectrum efficiency scheme, and NOMA is shown to globally outperform the orthogonal multiple access in UAV EE circumstance. [ABSTRACT FROM AUTHOR]

Indoor location-based services have become more and more important due to their potential applications in a wide range of personalized services in recent years. The accuracy of smartphone based 3D indoor localization is subjected to the poor performance of low-cost sensors and limited coverage of location sources. In order to solve these problems, this paper proposes a precise 3D indoor localization and trajectory optimization framework that uses the combination of sparse Wi-Fi Fine Time Measurement (FTM) anchors and built-in sensors (3D-LOWS). The inertial navigation system (INS) mechanization, multi-level constraints and observed values are integrated by the adaptive unscented Kalman filter to eliminate effects of cumulative error, indoor magnetic interference, and diversity of handheld modes. The Wi-Fi based ranging and landmark detection information is used to provide an accurate absolute reference to the built-in sensors based method. In addition, this paper proposes and evaluates two different trajectory optimization algorithms and compares the improved localization performance. The comprehensive experiments indicate that the proposed 3D-LOWS is proved to achieve accurate and stable 3D indoor positioning and trajectory optimization performance under complex indoor environments using sparse wireless stations. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-enabled wireless power transfer (WPT) is a viable solution to remotely charge several energy receivers (ERs) in areas with intermittent access to a source of energy. However, given the limited available energy in the on-board battery of the UAV, which is mainly required to suffice propulsion energy consumption, the UAV struggles to roam seamlessly for long intervals. A key challenge is thus to efficiently use the limited battery energy, and accordingly prolong the UAV’s endurance, via controlling the underlying associated parameters such as cruising velocity. To further extend the battery lifetime, the UAV can also harness other sources of sustainable energy, such as sunlight, via solar energy harvesting. This paper studies a UAV-enabled WPT system, where a rotary-wing UAV transfers radio frequency (RF) wireless energy to several ERs at known locations. To offer uninterrupted seamless service, the UAV also harvests solar energy using solar panels. Considering the propulsion energy consumption of the UAV, we maximize the minimum average power received among all ERs over a finite cycle duration by jointly optimizing the UAV’s time allocation between harvesting and charging, flight trajectory as well as velocity, and transmit power allocation. Due to the non-convexity of the problem, we utilize the block coordinate descent (BCD) and successive convex approximation (SCA) methods. Numerical results show that the proposed solution outperforms benchmark schemes. [ABSTRACT FROM AUTHOR]

This paper investigates the delay sensitive secure transmission problem in unmanned aerial vehicle (UAV)-relayed vehicular ad hoc networks (VANETs). Specifically, we take the security assurance into account and formulate this problem as a total information delay minimization problem by optimizing the UAV relay trajectory and channel allocation. To tackle this optimization problem, we propose an alternating optimization framework, where the UAV relay trajectory is solved by the Newton method, and the channel allocation is obtained by relax-and-round and sequential convex approximation methods. Finally, simulation results show the performance improvement of our algorithm compared with the current works in terms of the total information delay. [ABSTRACT FROM AUTHOR]

Satellite and unmanned aerial vehicle (UAV) networks have been introduced as enhanced approaches to provide dynamic control, massive connections and global coverage for future wireless communication systems. This paper considers a coordinated satellite-UAV communication system, where the UAV performs the environmental reconnaissance task with the assistance of satellites in a hostile jamming environment. To fulfill this task, the UAV needs to realize autonomous trajectory control and upload the collected data to the satellite. With the aid of the uploading data, the satellite builds the environment situation map integrating the beam quality, jamming status, and traffic distribution. Accordingly, we propose a closed-loop anti-jamming dynamic trajectory optimization approach, which is divided into three stages. Firstly, a coarse trajectory planning is made according to the limited prior information and preset points. Secondly, the flight control between two adjacent preset points is formulated as a Markov decision process, and reinforcement learning (RL) based automatic flying control algorithms are proposed to explore the unknown hostile environment and realize autonomous and precise trajectory control. Thirdly, based on the collected data during the UAV’s flight, the satellite utilizes an environment situation estimating algorithm to build an environment situation map, which is used to reselect the preset points for the first stage and provide better initialization for the RL process in the second stage. Simulation results verify the validity and superiority of the proposed approach. [ABSTRACT FROM AUTHOR]

This article is concerned with the trajectory optimization problem of a drilling process, which is of significance to drilling efficiency and safety. Due to the difference between an actual trajectory and a planned trajectory, this problem is a multiobjective optimization problem (MOP) with parameter uncertainties. To solve the problem, this study devises a new approach named nondominated sorting genetic Algorithm II using outlier removal (OR-NSGA-II). First, the optimization problem with parameter uncertainties is formulated, including two objective functions: 1) a trajectory length and 2) an expected value of drill-string torque. Then, an outlier-removal mechanism is devised in the sorting process of NSGA-II to reduce the negative effects of parameter uncertainties. Next, the crowding distance calculation in NSGA-II is improved to ensure population diversity. Comparison of simulation results show that our method is effective on the MOP with parameter uncertainties. [ABSTRACT FROM AUTHOR]

This work considers the observability problem in bearings-only tracking (BOT). Although the rank criterion has always been used for observability analysis, the evident drawback that it can only give a qualitative result prevents us from exploiting more information from the observability matrix. In reality, we want to know not only if the system is observable but also the degree of the observability. In order to quantitatively describe the system observability, we propose a series of metrics for BOT. Being derived based on the condition number, the novel metrics can reflect the observability degree as well as evaluate the tracking performance. Besides, the metrics can be extended to be used for sensor trajectory optimization and sensor configuration, which are crucial to enhancing the tracking performance. [ABSTRACT FROM AUTHOR]

Despite the wide utilization of unmanned aerial vehicles (UAVs), UAV communications are susceptible to eavesdropping due to air-ground line-of-sight channels. Intelligent reflecting surface (IRS) is capable of reconfiguring the propagation environment, and thus is an attractive solution for integrating with UAV to facilitate the security in wireless networks. In this paper, we investigate the secure transmission design for an IRS-assisted UAV network in the presence of an eavesdropper. With the aim at maximizing the average secrecy rate, the trajectory of UAV, the transmit beamforming, and the phase shift of IRS are jointly optimized. To address this sophisticated problem, we decompose it into three sub-problems and resort to an iterative algorithm to solve them alternately. First, we derive the closed-form solution to the active beamforming. Then, with the optimal transmit beamforming, the passive beamforming optimization problem of fractional programming is transformed into corresponding parametric sub-problems. Moreover, the successive convex approximation is applied to deal with the non-convex UAV trajectory optimization problem by reformulating a convex problem which serves as a lower bound for the original one. Simulation results validate the effectiveness of the proposed scheme and the performance improvement achieved by the joint trajectory and beamforming design. [ABSTRACT FROM AUTHOR]

This article presents MADER, a 3-D decentralized and asynchronous trajectory planner for UAVs that generates collision-free trajectories in environments with static obstacles, dynamic obstacles, and other planning agents. Real-time collision avoidance with other dynamic obstacles or agents is done by performing outer polyhedral representations of every interval of the trajectories and then including the plane that separates each pair of polyhedra as a decision variable in the optimization problem. MADER uses our recently developed MINVO basis to obtain outer polyhedral representations with volumes 2.36 and 254.9 times, respectively, smaller than the Bernstein or B-Spline bases used extensively in the planning literature. Our decentralized and asynchronous algorithm guarantees safety with respect to other agents by including their committed trajectories as constraints in the optimization and then executing a collision check-recheck scheme. Finally, extensive simulations in challenging cluttered environments show up to a 33.9% reduction in the flight time, and a 88.8% reduction in the number of stops compared to the Bernstein and B-Spline bases, shorter flight distances than centralized approaches, and shorter total times on average than synchronous decentralized approaches. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) communications are vulnerable to smart attacks, where the attacker can change the attack mode (e.g., eavesdropping and jamming) via smart radio devices. To ensure secure transmissions against hybrid attacks, UAVs may transmit confidential information and misleading information alternately. In this paper, we consider a dynamic anti-hybrid attack framework with trajectory optimization, where both a UAV and an attacker attempt to find their optimal trajectories without knowing the information type and the attack mode of each other. Given the major challenge due to incomplete knowledge (i.e., each agent knows only its own information), we establish an adversarial game with partial-observation feature to formulate an optimization problem, and propose a counterfactual regret minimization learning scheme to achieve the correlated equilibrium for both the UAV and attacker. Simulation results validate the superiority of our scheme over a benchmark in UAV communication scenarios with partial information. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-aided two-way relay networks with multiple terrestrial user pairs is investigated, where a fix-wing UAV is served as a two-way relay to assist information transmission. We aim to maximize the total rate of the two-way relay networks while the quality of service (QoS) being guaranteed. A novel relay strategy, namely time-slots pairing, is proposed by exploiting physical-layer network coding (PNC) protocol. Specifically, the UAV receives and buffers the signals from the scheduled user pair when the UAV approaches one of them, then forwards the modulated signal when the UAV is close to the other. As a result, a non-convex total rate maximization problem is formulated by joint trajectory design and resource optimization. To solve this problem, we first decompose it into three sub-problems, and then a three-step iterative algorithm that can effectively handle the non-convex problem with no worse than a polynomial complexity is developed leveraging the block coordinate descent (BCD) technique and successive convex approximation (SCA) method. Simulation results finally illustrate that: 1) Compared with amplify-and-forward (AF) or decode-and-forward (DF) protocols, the proposed design based on PNC protocol can significantly improve the total rate of the two-way relay networks; 2) the time-slots pairing relay strategy always achieves a significant enhancement on performance than the traditional non-time-slots pairing relay strategy; 3) the time-slots pairing relay strategy is more favorable for the mobile PNC relay networks since it can well resist the degradation of the entire networks caused by users’ increased service quality requirements. [ABSTRACT FROM AUTHOR]

The installment of $LC$ filter between the voltage source inverter and motor terminal can reduce the value of $dv$ / $dt$ considerably, and further mitigate the surge voltage stress on the motor windings during the long-distance transmission. However, the sophisticated controller needs to be designed to solve the additional resonance problems caused by the filter. Conventional active damping (AD) scheme mainly introduce the multiloop feedback based on the analysis in $s$ -domain or $z$ -domain, which is realized with limited bandwidth and high tuning complexity. In this article, the finite-control-set model predictive control (FCS-MPC) is adopted to realize the $q$ -axis current reference tracking for motor and suppress the filter resonance simultaneously. Different from the transfer-function-based AD scheme, the mechanism of resonance generation is revealed in the time-domain, where the cost function of FCS-MPC is designed to directly regulate the multivariable trajectory of the system. Therefore, the proposed FCS-MPC controller expresses the intuitive design principle, a simple structure, and fewer tuning parameters, which could be an alternative to the existing AD scheme. To reduce the number of sensors, the Kalman-filter based state estimation is used by considering the one-step delay of the control input. The cost function is further optimized to a simplified form that suits the implementation of the digital platform, and the lower computational burden is obtained. The experimental results prove that the proposed FCS-MPC scheme can ensure the motor-friendly waveform and overcome the resonance problem effectively. The robustness of the controller to parameter variations of the filter is also verified. [ABSTRACT FROM AUTHOR]

In maritime wireless communications, unmanned surface vehicles (USVs) can improve coverage and transmission performance due to their agile maneuverability and flexible deployment. This paper considers a USV-enabled maritime wireless network, where a USV is employed to assist the communication between the terrestrial base station and ships. Considering the maritime environment characteristics and earth curvature, we establish the systematic USV kinetics and information transmission models. To guarantee fairness, we aim to maximize the minimum expected throughput overall ships by jointly optimizing the trajectory and communication resource allocation, subject to the constraints of the USV kinetics, safe sailing, breakpoint distances, line-of-sight links, resource allocation, and information-causality. Due to the complexity of the maritime two-ray signal propagation model, we propose a channel approximation method to find an upper bound of the throughput for the original problem. By the problem decomposition, two sub-problems are derived and solved iteratively using successive convex approximation and interior-point methods. Simulation results confirm the effectiveness of the proposed method and show that USV can significantly improve transmission performance in maritime wireless networks. [ABSTRACT FROM AUTHOR]