This paper gives a novel delay-dependent admissibility condition of discrete-time singular systems with time-varying delays. For convenience, the time-varying delay is assumed to be the sum of delay lower bound and the integral multiples of a constant delay. Specially, if the constant delay is of unit length, the delay is an interval-like time-varying delay. The proposed admissibility condition is presented and expressed in terms of linear matrix inequality (LMI) by Lyapunov approach. Generally, the uncertainty of time-varying delay would lead to conservatism. In this paper, this critical issue is tackled by accurately estimating the time-varying delay. Consequently, the proposed admissibility condition is less conservative than the existing results, which is demonstrated by a numerical example.
Yong-Yun Shao 1,3 Xiao-Dong Liu 1,2 Xin Sun 3 Zhan Su 4 1 Transportation Management College, Dalian Maritime University, Dalian 116026, China 2 Department of Mathematics, Dalian Maritime University, Dalian 116026, China 3 Department of Computer and Mathematics Teaching, Shenyang Normal University, Shenyang 110034, China 4 Institute of Systems Science, Northeastern University, Shenyang 110004, China
Path planning for space vehicles is still a challenging problem although considerable progress has been made over the past decades.The major difficulties are that most of existing methods only adapt to static environment instead of dynamic one,and also can not solve the inherent constraints arising from the robot body and the exterior environment.To address these difficulties,this research aims to provide a feasible trajectory based on quadratic programming（QP） for path planning in three-dimensional space where an autonomous vehicle is requested to pursue a target while avoiding static or dynamic obstacles.First,the objective function is derived from the pursuit task which is defined in terms of the relative distance to the target,as well as the angle between the velocity and the position in the relative velocity coordinates（RVCs）.The optimization is in quadratic polynomial form according to QP formulation.Then,the avoidance task is modeled with linear constraints in RVCs.Some other constraints,such as kinematics,dynamics,and sensor range,are included.Last,simulations with typical multiple obstacles are carried out,including in static and dynamic environments and one of human-in-the-loop.The results indicate that the optimal trajectories of the autonomous robot in three-dimensional space satisfy the required performances.Therefore,the QP model proposed in this paper not only adapts to dynamic environment with uncertainty,but also can satisfy all kinds of constraints,and it provides an efficient approach to solve the problems of path planning in three-dimensional space.
