This paper investigates the problem of cooperative standoff tracking using multiple fixed-wing unmanned aerial vehicles (UAVs) with control input constraints. In order to achieve accurate target tracking in the presence of unknown background wind and target motion, a coordinated standoff target tracking algorithm is proposed. The objective of the research is to steer multiple UAVs to fly a circular orbit around a moving target with prescribed intervehicle angular spacing. To achieve this goal, two control laws are proposed, including relative range regulation and space phase separation. On one hand, a heading rate control law based on Lyapunov guidance vector field is proposed. The convergence analysis show that the UAVs can asymptotically converge to a desired circular orbit around the target, regardless of their initial position and heading. Through rigorous theoretical proof, it is concluded that the command signal of the proposed heading rate controller will not violate the boundary constraint on heading rate. On the other hand, a temporal phase is introduced to represent the phase separation and avoid discontinuity of the wrapped space phase angle. On this basis, a speed controller is developed to achieve equal phase separation. The proposed airspeed controller met the requirement of airspeed constraint. In addition, to improve the robustness of the aircraft during target tracking, an estimator is developed to estimate the composition velocity of the unknown wind and target motion. The proposed estimator uses the offset vector between the UAV’s actual flight path and the desired orbit which is defined by Lyapunov guidance vector field to estimate the composition velocity. The stability of the estimator is proved. Simulations are conducted under different scenarios to demonstrate the effectiveness of the proposed cooperative standoff target tracking algorithm. The simulation results of indicate that, the temporal-phase-based speed controller can achieve fast convergence speed and small phase separation error. Additionally, the composition velocity estimator exhibits fast response speed and high estimation accuracy.

There is an increasing trend that Unmanned Combat Air Vehicles (UCAVs) are employed to complete different combat missions in modern wars. This paper investigates a UCAV routing problem, which simultaneously considers the decisions for the configuration of weapons carried by the UCAV subject to its capacity and the allocation of weapons to the targets subject to their destroying requirements. An integer linear programming model is developed to formulate the problem. An adaptive large neighborhood search (ALNS) heuristic is proposed to solve the problem, in which seven neighborhood structures are designed and employed. Randomly generated instances covering the small, medium and large sizes are used to test the proposed ALNS algorithm. CPLEX is also utilized to solve the small-size instances, whose results are compared with that obtained by the ALNS algorithm. And the extensive experimental results confirm the effectiveness and superiority of the proposed ALNS algorithm.

In order to solve the problem of many constraints and complex navigation environment in the path planning of unmanned surface vehicle(USV), an improved Sparrow search algorithm com-bining Cubic chaotic map and Gaussian random walk strategy was proposed to plan it. Firstly, in the population initialization stage, Cubic chaotic map was used to replace the random generation method of the traditional sparrow search algorithm to optimize the uneven initial distribution of the population and improve the global search ability of the population. Secondly, in the late it-eration of the algorithm, the standard deviation of fitness is introduced to determine whether the population is trapped in the local optimum. If true, the Gaussian random walk strategy is used to perturb the optimal individual and assist the algorithm to escape the local optimum. Thirdly, the chosen water environment is modeled, and the navigation information of the original inland electronic navigation chart(ENC) is preprocessed, gridized, and the obstacle swelling is processed. Finally, the path planning experiments of USV are carried out in inland ENC grid environment. The experimental results show that, compared with the traditional sparrow search algorithm, the average fitness value of the path planned by improved sparrow search algorithm is reduced by 14.8%, and the variance is reduced by 49.9%. The path planned by the algorithm is of good quality and high stability, and combined with ENC, it can provide a reliable path for USV.

A new variant of two-echelon routing problem is investigated, where the truck and the drone are used to cooperatively complete the deliveries of all parcels. The truck not only acts as a tool for parcel delivery, but also serves as a moving depot for the drone. The drone can carry several parcels and take off from the truck, while returning to the truck after completing the delivery. The energy consumption model for the routing process of the drone is analyzed, when it is utilized to deliver multiple parcels. A two-stage route-based modelling approach is proposed to optimize both the truck’s main route and the drone’s adjoint flying routes. A hybrid heuristic integrating nearest neighbor and cost saving strategies is developed to quickly construct a feasible solution. The simulated annealing algorithm is applied to improve the quality of the solution, where a Tabu list is employed to improve the search efficiency. Random instances at different scales are used to test the performance of the proposed algorithm. A case study based on the practical road network in Changsha, China, is presented, through which the sensitivity analysis is conducted with respect to some critical factors.

In this paper, we present a novel Two-Echelon Ground Vehicle and Its Mounted Unmanned Aerial Vehicle Cooperated Routing Problem (2E-GUCRP). The 2E-GUCRP arises in the field of Unmanned Aerial Vehicle (UAV) Routing Problem such as those encountered in the context of city logistics. In a typical cooperated system, the UAV is launched from the Ground Vehicle (GV) and automatically flies to the designated target. Meanwhile, acting as a mobile base station, the GV can charge or change the UAV’s battery on the designated landing points to enable the UAV to continue its mission. The objective is to design efficient GV and UAV routes to minimize the total mission time while meeting the operational constraints. A Mixed Integer Programming (MIP) model, which could be solved by commercial software, is constructed to describe this problem. In order to quickly solve the medium-scale problems, two existing heuristics to solve 2E-VRP are improved. The computational experiments are set up to compare our model with the 2E-VRP. The results indicate that the 2E-GUCRP obtains a better efficiency. Further discussion of the practical instance points out that the increase in efficiency is related to the speed relationship between the GV and the UAV.

A novel high-voltage powerline inspection system is investigated, which consists of the cooperated ground vehicle and drone. The ground vehicle acts as a mobile platform that can launch and recycle the drone, while the drone can fly over the powerline for inspection within limited endurance. This inspection system enables the drone to inspect powerline networks in a very large area. Both vehicle’ route in the road network and drone’s routes along the powerline network have to be optimized for improving the inspection efficiency, which generates a new two-layer point-arc routing problem. Two constructive heuristics are designed based on “Cluster First, Rank Second” and “Rank First, Split Second”. Then local search strategies are developed to further improve the quality of the solution. To test the performance of the proposed algorithms, practical cases with different-scale are designed based on the road network and powerline network of Ji’an, China. Sensitivity analysis on the parameters related with the drone’s inspection speed and battery capacity is conducted. Computational results indicate that technical improvement on the inspection sensor is more important for the cooperated ground vehicle and drone system.

The location routing problem of unmanned aerial vehicles (UAV) in border patrol for intelligence, surveillance and reconnaissance is investigated, where the location of UAV base stations and the UAV flying routes for visiting the targets in border area are jointly optimized. The capacity of the base station and the endurance of the UAV are considered. A binary integer programming model is developed to formulate the problem, and two heuristic algorithms combined with local search strategies are designed for solving the problem. The experiment design for simulating the distribution of stations and targets in border is proposed for generating random test instances. Also, an example based on the Sino-Vietnamese border is presented to illustrate the problem and the solution approach. The performance of the two algorithms are analyzed and compared through randomly generated instances.

The concept of ‘big data’ has been widely discussed, and its value has been illuminated throughout a variety of domains. To quickly mine potential values and alleviate the ever-increasing volume of information, machine learning is playing an increasingly important role and faces more challenges than ever. Because few studies exist regarding how to modify machine learning techniques to accommodate big data environments, we provide a comprehensive overview of the history of the evolution of big data, the foundations of machine learning, and the bottlenecks and trends of machine learning in the big data era. More specifically, based on learning principals, we discuss regularization to enhance generalization. The challenges of quality in big data are reduced to the curse of dimensionality, class imbalances, concept drift and label noise, and the underlying reasons and mainstream methodologies to address these challenges are introduced. Learning model development has been driven by domain specifics, dataset complexities, and the presence or absence of human involvement. In this paper, we propose a robust learning paradigm by aggregating the aforementioned factors. Over the next few decades, we believe that these perspectives will lead to novel ideas and encourage more studies aimed at incorporating knowledge and establishing data-driven learning systems that involve both data quality considerations and human interactions.