Integrated guidance and control of guided projectile with multiple constraints based on fuzzy adaptive and dynamic surface

Based on fuzzy adaptive and dynamic surface(FADS),an integrated guidance and control(IGC)approach was proposed for large caliber naval gun guided projectile,which was robust to target maneuver,canard dynamic characteristics,and multiple constraints,such as impact angle,limited measurement of line of sight(LOS)angle rate and nonlinear saturation of canard deflection.Initially,a strict feedback cascade model of IGC in longitudinal plane was established,and extended state observer(ESO)was designed to estimate LOS angle rate and uncertain disturbances with unknown boundary inside and outside of system,including aerodynamic parameters perturbation,target maneuver and model errors.Secondly,aiming at zeroing LOS angle tracking error and LOS angle rate in finite time,a nonsingular terminal sliding mode(NTSM)was designed with adaptive exponential reaching law.Furthermore,combining with dynamic surface,which prevented the complex differential of virtual control laws,the fuzzy adaptive systems were designed to approximate observation errors of uncertain disturbances and to reduce chatter of control law.Finally,the adaptive Nussbaum gain function was introduced to compensate nonlinear saturation of canard deflection.The LOS angle tracking error and LOS angle rate were convergent in finite time and whole system states were uniform ultimately bounded,rigorously proven by Lyapunov stability theory.Hardware-in-the-loop simulation(HILS)and digital simulation experiments both showed FADS provided guided projectile with good guidance performance while striking targets with different maneuvering forms.

Multiple constraints-based QoS multicast routing: model and algorithms

Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a NP-complete problem that can not be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based QoS multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.

Fail-Safe Topology Optimization of Continuum Structures with Multiple Constraints Based on ICM Method

Traditional topology optimization methods may lead to a great reduction in the redundancy of the optimized structure due to unexpected material removal at the critical components.The local failure in critical components can instantly cause the overall failure in the structure.More and more scholars have taken the fail-safe design into consideration when conducting topology optimization.A lot of good designs have been obtained in their research,though limited regarding minimizing structural compliance(maximizing stiffness)with given amount of material.In terms of practical engineering applications considering fail-safe design,it is more meaningful to seek for the lightweight structure with enough stiffness to resist various component failures and/or to meet multiple design requirements,than the stiffest structure only.Thus,this paper presents a fail-safe topology optimization model for minimizing structural weight with respect to stress and displacement constraints.The optimization problem is solved by utilizing the independent continuous mapping(ICM)method combined with the dual sequence quadratic programming(DSQP)algorithm.Special treatments are applied to the constraints,including converting local stress constraints into a global structural strain energy constraint and expressing the displacement constraint explicitly with approximations.All of the constraints are nondimensionalized to avoid numerical instability caused by great differences in constraint magnitudes.The optimized results exhibit more complex topological configurations and higher redundancy to resist local failures than the traditional optimization designs.This paper also shows how to find the worst failure region,which can be a good reference for designers in engineering.

Robust spline-line energy management guidance algorithm with multiple constraints and uncertainties for solid rocket ascending

For the solid rocket with depletion shutdown system,effective energy management is significant to meet terminal constraints by exhausting excess energy.Several traditional energy management algorithms cannot satisfy the altitude constraint and path constraints are not sufficiently considered.The velocity adjustment capability of these algorithms is limited and the uncertainties are not considered.Based on the on-line programming of velocity capability curve,Spline-Line Energy Management(SLEM)guidance algorithm is proposed.It introduces lateral maneuvers to further consume the available velocity on the basis of longitudinal energy management.After expressing the constraints as several algebraic equations,the closed-loop guidance problem is converted to solving a system of nonlinear equations about the curve parameters in real time.The advantage is that the altitude constraint can be satisfied theoretically.The overload and control variable change rate and amplitude constraints are also considered during the flight by constructing the feasible boundary of velocity capability curve.To improve the robustness,it is further extended by estimating the actual uncertainties.The effectiveness and advantages of SLEM are demonstrated by simulations and comparisons with other energy management algorithms.Simulation results show that the proposed approach can satisfy multiple constraints with high precision under the condition of uncertainties.

Optimal two-impulse space interception with multiple constraints

We consider optimal two-impulse space interception problems with multiple constraints.The multiple constraints are imposed on the terminal position of a space interceptor,impulse and impact instants,and the component-wise magnitudes of velocity impulses.These optimization problems are formulated as multi-point boundary value problems and solved by the calculus of variations.Slackness variable methods are used to convert all inequality constraints into equality constraints so that the Lagrange multiplier method can be used.A new dynamic slackness variable method is presented.As a result,an indirect optimization method is developed.Subsequently,our method is used to solve the two-impulse space interception problems of free-flight ballistic missiles.A number of conclusions for local optimal solutions have been drawn based on highly accurate numerical solutions.Specifically,by numerical examples,we show that when time and velocity impulse constraints are imposed,optimal two-impulse solutions may occur;if two-impulse instants are free,then a two-impulse space interception problem with velocity impulse constraints may degenerate to a one-impulse case.

Combat situation suppression of multiple UAVs based on spatiotemporal cooperative path planning

Aiming at the suppression of enemy air defense(SEAD)task under the complex and complicated combat sce-nario,the spatiotemporal cooperative path planning methods are studied in this paper.The major research contents include opti-mal path points generation,path smoothing and cooperative rendezvous.In the path points generation part,the path points availability testing algorithm and the path segments availability testing algorithm are designed,on this foundation,the swarm intelligence-based path point generation algorithm is utilized to generate the optimal path.In the path smoothing part,taking ter-minal attack angle constraint and maneuverability constraint into consideration,the Dubins curve is introduced to smooth the path segments.In cooperative rendezvous part,we take esti-mated time of arrival requirement constraint and flight speed range constraint into consideration,the speed control strategy and flight path control strategy are introduced,further,the decoupling scheme of the circling maneuver and detouring maneuver is designed,in this case,the maneuver ways,maneu-ver point,maneuver times,maneuver path and flight speed are determined.Finally,the simulation experiments are conducted and the acquired results reveal that the time-space cooperation of multiple unmanned aeriel vehicles(UAVs)is effectively real-ized,in this way,the combat situation suppression against the enemy can be realized in SEAD scenarios.

Leader trajectory planning method considering constraints of formation controller

To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm is introduced.Firstly,a formation controller based on prescribed performance theory is designed to control the transient and steady formation configuration,as well as the formation forming time,which not only can form the designated formation configuration but also can guarantee collision avoidance and terrain avoidance theoretically.Next,considering the constraints caused by formation controller on trajectory planning such as the safe distance,turn angle and step length,as well as the constraint of formation shape,a leader trajectory planning method based on sparse A^(*)algorithm is proposed.Simulation results show that the UAV formation can arrive at the destination safely with a short trajectory no matter keeping the formation or encountering formation transformation.

Rheological Behaviour for Polymer Melts and Concentrated Solutions Part Ⅰ:A New Multiple Reptation Model to Predict the Nonlinear Visco-elasticity with Nagai Chain Constraints in Entangled Polymer Melts

An approach of stochastically statistical mechanics and a unified molecular theory of nonlinear viscoelasticity with constraints of Nagai chain entanglement for polymer melts have been proposed. A multimode model structure for a single polymer chain with n tail segments and N reversible entanglement sites on the test polymer chain is developed. Based on the above model structure and the mechanism of molecular flow by the dynamical reorganization of entanglement sites, the probability distribution function of the end-to-end vectr for a single polymer chain at entangled state and the viscoelastic free energy of deformation for polymer melts are calculated by using the method of the stochastically statistical mechanics. The four types of stress-strain relation and the memory function are derived from this thery. The above theoretical relations are verified by the experimentaf data for various polymer melts. These relations are found to be in good agreement with the experimental results

Pushing Multiple Convertible Constrains into Frequent Itemsets Mining

Constraint pushing techniques have been developed for mining frequent patterns and association rules. How ever, multiple constraints cannot be handled with existing techniques in frequent pattern mining. In this paper, a new algorithm MCFMC （mining complete set of frequent itemsets with multiple constraints） is introduced. The algorithm takes advantage of the fact that a convertible constraint can be pushed into mining algorithm to reduce mining research spaces. By using a sample database, the algorithm develops techniques which select an optimal method based on a sample database to convert multiple constraints into multiple convert ible constraints, disjoined by conjunction and/or, and then partition these constraints into two parts. One part is pushed deep inside the mining process to reduce the research spaces for frequent itemsets, the other part that cannot be pushed in algorithm is used to filter the complete set of frequent itemsets and get the final result. Results from our detailed experi ment show the feasibility and effectiveness of the algorithm.

Sequential quadratic programming-based non-cooperative target distributed hybrid processing optimization method

The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense anti-missile targets defense problem is abstracted as a nonconvex constrained combinatorial optimization problem with the optimization objective of maximizing the degree of contribution of the processing scheme to non-cooperative targets, and the constraints mainly consider geographical conditions and anti-missile equipment resources. The grid discretization concept is used to partition the defense area into network nodes, and the overall defense strategy scheme is described as a nonlinear programming problem to solve the minimum defense cost within the maximum defense capability of the defense system network. In the solution of the minimum defense cost problem, the processing scheme, equipment coverage capability, constraints and node cost requirements are characterized, then a nonlinear mathematical model of the non-cooperative target distributed hybrid processing optimization problem is established, and a local optimal solution based on the sequential quadratic programming algorithm is constructed, and the optimal firepower processing scheme is given by using the sequential quadratic programming method containing non-convex quadratic equations and inequality constraints. Finally, the effectiveness of the proposed method is verified by simulation examples.

Mixed Self-adapting GA Optimal Scheduling Algorithm for a Multiple Resource Job-shop

With an aim at the job-shop scheduling problem of multiple resource constraints, this paper presents mixed self-adapting Genetic Algorithm （ GA ） , and establishes a job-shop optimal scheduling model of multiple resource constraints based on the effect of priority scheduling rules in the heuristic algorithm upon the scheduling target. New coding regulations or rules are designed. The sinusoidal function is adopted as the self-adapting factor, thus making cross probability and variable probability automatically change with group adaptability in such a way as to overcome the shortcoming in the heuristic algorithm and common GA, so that the operation efficiency is improved. The results from real example simulation and comparison with other algorithms indicate that the mixed self-adapting GA algorithm can well solve the job-shop optimal scheduling problem under the constraints of various kinds of production resources such as machine-tools and cutting tools.

Topology optimization of shear wall structures under seismic loading

A topology optimization formulation is developed to find the stiffest structure with desirable material distribution subjected to seismic loads. Finite element models of the structures are generated and the optimality criteria method is modified using a simple penalty approach and introducing fictitious strain energy to simultaneously consider both material volume and displacement constraints. Different types of shear walls with/without opening are investigated. Additionally, the effects of shear wall-frame interaction for single and coupled shear walls are studied. Gravity and seismic loads are applied to the shear walls so that the definitions provide a practical approach for locating the critical parts of these structures. The results suggest new viewpoints for architectural and structural engineering for placement of openings.

Trajectory optimization of a reentry vehicle based on artificial emotion memory optimization

The trajectory optimization of an unpowered reentry vehicle via artificial emotion memory optimization(AEMO)is discussed.Firstly,reentry dynamics are established based on multiple constraints and parameterized control variables with finite dimensions are designed.If the constraint is not satisfied,a distance measure and an adaptive penalty function are used to address this scenario.Secondly,AEMO is introduced to solve the trajectory optimization problem.Based on the theories of biology and cognition,the trial solutions based on emotional memory are established.Three search strategies are designed for realizing the random search of trial solutions and for avoiding becoming trapped in a local minimum.The states of the trial solutions are determined according to the rules of memory enhancement and forgetting.As the iterations proceed,the trial solutions with poor quality will gradually be forgotten.Therefore,the number of trial solutions is decreased,and the convergence of the algorithm is accelerated.Finally,a numerical simulation is conducted,and the results demonstrate that the path and terminal constraints are satisfied and the method can realize satisfactory performance.

Application-aware routing with QoS support in SDN networks

Software defined networking( SDN) offers programmable interface to effectively control their networks by decoupling control and data plane. The network operators utilize a centralized controller to deploy advanced network management strategies. An architecture for application-aware routing which can support dynamic quality of service( Qo S) in SDN networks is proposed. The applicationaware routing as a multi-constrained optimal path( MCOP) problem is proposed,where applications are treated as Qo S flow and best-effort flows. With the SDN controller applications,it is able to dynamically lead routing decisions based on application characteristics and requirements,leading to a better overall user experience and higher utilization of network resources. The simulation results show that the improvement of application-aware routing framework on discovering appropriate routes,which can provide Qo S guarantees for a specific application in SDN networks.

Dynamic airspace sectorization via improved genetic algorithm

This paper deals with dynamic airspace sectorization （DAS） problem by an improved genetic algorithm （iGA）. A graph model is first constructed that represents the airspace static structure. Then the DAS problem is formulated as a graph-partitioning problem to balance the sector workload under the premise of ensuring safety. In the iGA, multiple populations and hybrid coding are applied to determine the optimal sector number and airspace sectorization. The sector constraints are well satisfied by the improved genetic operators and protect zones. This method is validated by being applied to the airspace of North China in terms of three indexes, which are sector balancing index, coordination workload index and sector average flight time index. The improvement is obvious, as the sector balancing index is reduced by 16.5 %, the coordination workload index is reduced by 11.2 %, and the sector average flight time index is increased by 11.4 % during the peak-hour traffic.

Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.

In silico cell factory design driven by comprehensive genome‑scale metabolic models:development and challenges

Genome-scale metabolic models(GEMs)have been widely used to design cell factories in silico.However,initial flux balance analysis only considers stoichiometry and reaction direction constraints,so it cannot accurately describe the distribution of metabolic flux under the control of various regulatory mechanisms.In the recent years,by introducing enzymology,thermodynamics,and other multiomics-based constraints into GEMs,the metabolic state of cells under different conditions was more accurately simulated and a series of algorithms have been presented for microbial phenotypic analysis.Herein,the development of multiconstrained GEMs was reviewed by taking the constraints of enzyme kinetics,thermodynamics,and transcriptional regulatory mechanisms as examples.This review focused on introducing and summarizing GEMs application tools and cases in cell factory design.The challenges and prospects of GEMs development were also discussed.

Hybrid task priority-based motion control of a redundant free-floating space robot

This paper presents a novel hybrid task priority-based motion planning algorithm of a space robot. The satellite attitude control task is defined as the primary task, while the leastsquares-based non-strict task priority solution of the end-effector plus the multi-constraint task is viewed as the secondary task. Furthermore, a null-space task compensation strategy in the joint space is proposed to derive the combination of non-strict and strict task-priority motion planning,and this novel combination is termed hybrid task priority control. Thus, the secondary task is implemented in the primary task＇s null-space. Besides, the transition of the state of multiple constraints between activeness and inactiveness will only influence the end-effector task without any effect on the primary task. A set of numerical experiments made in a real-time simulation system under Linux/RTAI shows the validity and feasibility of the proposed methodology.

Necessary and sufficient conditions of the rendezvous between a single spacecraft and three non-coplanar Walker constellation satellites

The probability of the rendezvous between a single spacecraft and three non-coplanar constellation satellites is studied,and the necessary and sufficient conditions of the rendezvous without orbital maneuver are deduced.The rendezvous orbit design can be transformed into the patching of two spacecraft orbits,either of which can achieve the rendezvous with two satellites.Firstly,due to the precious quality of spherical geometry,the unique existence of the rendezvous orbit for two constellation satellites is proved.Then,according to the difference between equispaced and non-equispaced orbital planes of three satellites,the necessary and sufficient conditions are given respectively,and the calculating method of the spacecraft orbit is proposed.At last,the constraint conditions between two different rendezvous orbits is derived,while the relative position of two groups of objects are under specific distribution.The results can be applied to the rendezvous between a single spacecraft and multiple constellation satellites without orbital maneuver.