During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive...During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.展开更多
The problem of strong uniqueness of best approximation from an RS set in a Banach space is considered. For a fixed RS set G and an element x∈X , we proved that the best approximation g * to x from ...The problem of strong uniqueness of best approximation from an RS set in a Banach space is considered. For a fixed RS set G and an element x∈X , we proved that the best approximation g * to x from G is strongly unique.展开更多
The paper gives a new way of constructing Hermite Fejer and Hermite interpolatory polynomials with the nodes of the roots of first kind of Chebyshev polynomials and gives the approximation order of these two kinds of...The paper gives a new way of constructing Hermite Fejer and Hermite interpolatory polynomials with the nodes of the roots of first kind of Chebyshev polynomials and gives the approximation order of these two kinds of operators. The approximation orders are described with the best rate of approximation of f by polynomials of degree N=(q+1)n 1 in L p w spaces.展开更多
基金supported by the National Natural Sci‐ence Foundation of China(Grant No.62306325)。
文摘During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.
文摘The problem of strong uniqueness of best approximation from an RS set in a Banach space is considered. For a fixed RS set G and an element x∈X , we proved that the best approximation g * to x from G is strongly unique.
文摘The paper gives a new way of constructing Hermite Fejer and Hermite interpolatory polynomials with the nodes of the roots of first kind of Chebyshev polynomials and gives the approximation order of these two kinds of operators. The approximation orders are described with the best rate of approximation of f by polynomials of degree N=(q+1)n 1 in L p w spaces.
