In this paper,we investigate the peaking issue of extended state observers and the anti-disturbance control problem of tethered aircraft systems subject to the unstable flight of the main aircraft,airflow disturbances...In this paper,we investigate the peaking issue of extended state observers and the anti-disturbance control problem of tethered aircraft systems subject to the unstable flight of the main aircraft,airflow disturbances and deferred output constraints.Independent of exact initial values,a modified extended state observer is constructed from a shifting function such that not only the peaking issue inherently in the observer is circumvented completely but also the accurate estimation of the lumped disturbance is guaranteed.Meanwhile,to deal with deferred output constraints,an improved output constrained controller is employed by integrating the shifting function into the barrier Lyapunov function.Then,by combining the modified observer and the improved controller,an anti-disturbance control scheme is presented,which ensures that the outputs with any bounded initial conditions satisfy the constraints after a pre-specified finite time,and the tethered aircraft tracks the desired trajectory accurately.Finally,both a theoretical proof and simulation results verify the effectiveness of the proposed control scheme.展开更多
A modified shifting bottleneck algorithm was proposed to solve scheduling problems of a large-scale job shop.Firstly,a new structured algorithm was employed for sub-problems so as to reduce the computational burden an...A modified shifting bottleneck algorithm was proposed to solve scheduling problems of a large-scale job shop.Firstly,a new structured algorithm was employed for sub-problems so as to reduce the computational burden and suit for large-scale instances more effectively.The modified cycle avoidance method,incorporating with the disjunctive graph model and topological sort algorithm,was applied to guaranteeing the feasibility of solutions with considering delayed precedence constraints.Finally,simulation experiments were carried out to verify the feasibility and effectiveness of the modified method.The results demonstrate that the proposed algorithm can solve the large-scale job shop scheduling problems(JSSPs) within a reasonable period of time and obtaining satisfactory solutions simultaneously.展开更多
基金supported by the National Natural Science Foundation of China(61725303,91848205)。
文摘In this paper,we investigate the peaking issue of extended state observers and the anti-disturbance control problem of tethered aircraft systems subject to the unstable flight of the main aircraft,airflow disturbances and deferred output constraints.Independent of exact initial values,a modified extended state observer is constructed from a shifting function such that not only the peaking issue inherently in the observer is circumvented completely but also the accurate estimation of the lumped disturbance is guaranteed.Meanwhile,to deal with deferred output constraints,an improved output constrained controller is employed by integrating the shifting function into the barrier Lyapunov function.Then,by combining the modified observer and the improved controller,an anti-disturbance control scheme is presented,which ensures that the outputs with any bounded initial conditions satisfy the constraints after a pre-specified finite time,and the tethered aircraft tracks the desired trajectory accurately.Finally,both a theoretical proof and simulation results verify the effectiveness of the proposed control scheme.
基金National Natural Science Foundations of China(Nos.71471135,61273035)
文摘A modified shifting bottleneck algorithm was proposed to solve scheduling problems of a large-scale job shop.Firstly,a new structured algorithm was employed for sub-problems so as to reduce the computational burden and suit for large-scale instances more effectively.The modified cycle avoidance method,incorporating with the disjunctive graph model and topological sort algorithm,was applied to guaranteeing the feasibility of solutions with considering delayed precedence constraints.Finally,simulation experiments were carried out to verify the feasibility and effectiveness of the modified method.The results demonstrate that the proposed algorithm can solve the large-scale job shop scheduling problems(JSSPs) within a reasonable period of time and obtaining satisfactory solutions simultaneously.
