In this study, the problem of time-optimal reconnaissance trajectory design for aeroassisted vehicle is considered. Different from most works reported previously, we explore feasibility applying a high-order dynamic model to plan optimal flight such that gap between simulated and real system can be narrowed. A highly-constrained control containing six-degree-of-freedom dynamics established. To ...

Different discretization and trust-region methods are compared for the low-thrust fuel-optimal trajectory optimization problem using successive convex programming. In particular, differential integral formulations of adaptive pseudospectral Legendre–Gauss–Radau method, an arbitrary-order Legendre–Gauss–Lobatto technique based on Hermite interpolation, a first-order-hold considered. The number p...

<abstract><p>We present a novel direct integral pseudospectral (PS) method (a IPS method) for solving class of continuous-time infinite-horizon optimal control problems (IHOCs). The transforms the IHOCs into finite-horizon in their forms by means certain parametric mappings, which are then approximated finite-dimensional nonlinear programming (NLPs) through rational collocations bas...

This research introduces an innovative strategy to impede and lessen lateral rear-end vehicular collisions by consolidating braking systems with active emergency steering controls. study puts forward a T-type method, designed circumvent both at intersections. To secure stability condense the time required for during process, this formulates nonlinear dynamic model vehicle, in addition tire mode...

Recently, the Legendre pseudospectral (PS) method migrated from theory to flight application onboard the International Space Station for performing a finite-horizon, zeropropellant maneuver. A small technical modification to the Legendre PS method is necessary to manage the limiting conditions at infinity for infinite-horizon optimal control problems. Motivated by these technicalities, the conc...

Pseudospectral methods are investigated for singularly perturbed boundary value problems for ordinary diierential equations which possess boundary layers. It is well known that if the boundary layer is very small then a very large number of spectral collocation points is required to obtain accurate solutions. We introduce here a new eeective procedure, based on coordinate stretching and the Che...

Analysis and development of restarted Krylov subspace methods for computing f(A)b have proliferated in recent years. We present an acceleration technique for such methods when applied to Stieltjes functions f and Hermitian positive definite matrices A. This technique is based on a rank-one modification of the Lanczos matrix derived from a connection between the Lanczos process and Gauss–Radau q...