Jump to content

Hanging chain problem: Difference between revisions

From mintOC
Line 33: Line 33:


In this model the parameters used are
In this model the parameters used are
<math>
\begin{array}{rcl}
\begin{array}{rcl}
[t_0, t_f] &=& [0, 1],\\
[t_0, t_f] &=& [0, 1],\\
Line 38: Line 39:
Lp &=& 4.
Lp &=& 4.
\end{array}
\end{array}
</math>


== Source Code ==
== Source Code ==

Revision as of 17:42, 5 May 2016

Hanging chain problem
State dimension: 1
Differential states: 2
Discrete control functions: 1
Interior point equalities: 2

The Hanging chain problem is concerned with finding a chain (of uniform density) of length L suspendend between two points a,b with minimal potential energy. (Problem taken from the COPS library)


Mathematical formulation

The problem is given by

minx,ux2(tf)s.t.x˙1=u,x˙2=x1(1+u2)1/2,x˙3=(1+u2)1/2,x(t0)=(a,0,0)T,x1(tf)=b,x3(tf)=Lp,x(t)[0,10],u(t)[10,20].

Parameters

In this model the parameters used are [t0,tf]=[0,1],(a,b)=(0.4,0.2),Lp=4.

Source Code

Model descriptions are available in