2018
DOI: 10.1155/2018/3104397
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Path-Following Guidance with Generalized Weighting Functions Based on Indirect Gauss Pseudospectral Method

Abstract: An indirect Gauss pseudospectral method based path-following guidance law is presented in this paper. A virtual target moving along the desired path with explicitly specified speed is introduced to formulate the guidance problem. By establishing a virtual target-fixed coordinate system, the path-following guidance is transformed into a terminal guidance with impact angle constraints, which is then solved by using indirect Gauss pseudospectral method. Meanwhile, the acceleration dynamics are modeled as the firs… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…The terminal state is obtained from the initial state and the integral of the right function, and Gauss integral is used for discretization calculation. After the above transformation, the original optimal control problem is transformed into a parametric optimization problem with a series of algebraic constraints, which is also called Nonlinear Programming problem (NLP) [35][36][37].…”
Section: Principle Of Gauss Pseudospectral Methodsmentioning
confidence: 99%
“…The terminal state is obtained from the initial state and the integral of the right function, and Gauss integral is used for discretization calculation. After the above transformation, the original optimal control problem is transformed into a parametric optimization problem with a series of algebraic constraints, which is also called Nonlinear Programming problem (NLP) [35][36][37].…”
Section: Principle Of Gauss Pseudospectral Methodsmentioning
confidence: 99%
“…The optimization problem defined by ( 23) and ( 24) needs to be converted into a discrete nonlinear programming problem (NLP) to solve [41]. VOLUME 11, 2023 According to the two-point boundary value problem, the required time t 0 ∈ [t 0 , t f ] taken for landing is first scaled to τ ∈ [−1, 1], and the mapping relationship is expressed as:…”
Section: B Discretization Of the Trajectory Optimization Problemmentioning
confidence: 99%
“…It is aimed that the robots follow the shortest distances in the desired path trajectory and the path under the most suitable conditions according to the robot characteristics. Optimum conditions at the path tracking stage includes criteria such as robot velocity, avoidance of obstacles and robot collisions, orbital planning suitable for robot kinematics and dynamics (Chen et al, 2018).…”
Section: Introductionmentioning
confidence: 99%