2014
DOI: 10.1016/j.protcy.2014.10.226
|View full text |Cite
|
Sign up to set email alerts
|

Time–mesh Refinement in Optimal Control Problems for Nonholonomic Vehicles

Abstract: Direct methods are becoming the most used technique to solve nonlinear optimal control problems. Regular time meshes having equidistant spacing are most frequently used. However, in some cases, these meshes cannot cope accurately with nonlinear behaviour unless a very large number of mesh nodes is used. One way to improve the solution involves adaptive mesh refinement algorithms which allow a non uniform node collocation. In the method presented in this paper, a time mesh refinement strategy based on the local… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
2
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 12 publications
1
2
0
Order By: Relevance
“…One of such techniques is reported in [190], which proposed an adaptive time-mesh algorithm based on refinement criteria. The criteria use the information of the adjoint multipliers and involve multi-level refinement unlike earlier works [191], [192] and validates the results by applying the Maximum Principle of Pontryagin.…”
Section: Figure 24supporting
confidence: 59%
“…One of such techniques is reported in [190], which proposed an adaptive time-mesh algorithm based on refinement criteria. The criteria use the information of the adjoint multipliers and involve multi-level refinement unlike earlier works [191], [192] and validates the results by applying the Maximum Principle of Pontryagin.…”
Section: Figure 24supporting
confidence: 59%
“…This problem was addressed in many studies using different formulations. For example, but not limited to, Paiva and Fontes (2014) presented a mesh-refinement strategy based on a block-structured adaptive mesh refinement method that is modified by Nikiforakis (2009) for solving continuous time nonlinear openloop. Bartl et al (2011) proposed a time derivative analysis within the quasi-sequential approach and derived a finite element placement strategy.…”
Section: Introductionmentioning
confidence: 99%
“…Liu et al used a novel penalty method to deal with nonlinear dynamic optimization problems with inequality path constraints [2]. Paiva and Fontes studied the adaptive mesh refinement algorithms which allow a nonuniform node collocation and apply a time mesh refinement strategy based on the local error into practical problems [3]. Zhao and Tsiotras introduced an efficient and simple method based on density (or monitor) functions, which have been used extensively for grid refinement.…”
Section: Introductionmentioning
confidence: 99%