Pages that link to "Item:Q4009940"

The following pages link to Method of orienting curves for solving optimal control problems with state constraints¹ (Q4009940):

Displaying 18 items.

• An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
• Orienting method for obstacle problems (Q1607613) (← links)
• A common regularization for three reservoir optimal control problems (Q1955563) (← links)
• Quicker than Quickhull (Q2354631) (← links)
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (Q2694526) (← links)
• An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (Q2868910) (← links)
• Method of orienting curves for determining the convex hull of a finite set of points in the plane (Q3553761) (← links)
• Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon (Q3578011) (← links)
• The method of orienting curves and its application to manipulator trajectory planning (Q4344647) (← links)
• Extremal solutions of some constrained control problems^∗ (Q4351193) (← links)
• Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (Q4631913) (← links)
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves (Q4639124) (← links)
• Solving a class of linear optimal control problems with several control variables by the method of orienting curves (Q4764872) (← links)
• Some remarks on the method of orienting curves^∗ (Q4845188) (← links)
• An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D (Q5264005) (← links)
• Analyzing a Maximum Principle for Finite Horizon State Constrained Problems via Parametric Examples. Part 2: Problems with Bilateral State Constraints (Q5860731) (← links)
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations (Q6551197) (← links)
• The funnel tree algorithm for finding shortest paths on polyhedral surfaces (Q6655495) (← links)