Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves

MaRDI QIDQ1373054zbMATH OpenFDO

Authors J. Ning

Publication date 8 February 1998

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

linear optimal control problemsmethod of orienting curvesstate constraints

Mathematics Subject Classification ID

Numerical methods based on necessary conditions (49M05)

Recommendations

• Solving a class of linear optimal control problems with several control variables by the method of orienting curves
• Solving a class of regular optimal control problems with state constraints by the method of orienting curves
• Method of orienting curves for solving optimal control problems with state constraints¹

Cited in

(15)

• Orienting method for obstacle problems
• A method for solving a class of optimal control problems which are linear in the control variable
• A common regularization for three reservoir optimal control problems
• Quicker than Quickhull
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
• Method of orienting curves for solving optimal control problems with state constraints¹
• Solving a class of regular optimal control problems with state constraints by the method of orienting curves
• Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
• Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
• Solving a class of linear optimal control problems with several control variables by the method of orienting curves
• Analyzing a maximum principle for finite horizon state constrained problems via parametric examples. II: Problems with bilateral state constraints
• The funnel tree algorithm for finding shortest paths on polyhedral surfaces
• Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity
• An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)

This page was built for publication: Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373054)