Jump to content

Hanging chain problem: Difference between revisions

From mintOC
No edit summary
Line 1: Line 1:
{{Dimensions
{{Dimensions
|nd        = 1
|nd        = 1
|nx        = 2
|nx        = 3
|nw       = 1
|nu       = 1
|nre      = 2
|nre      = 5
}}<!-- Do not insert line break here or Dimensions Box moves up in the layout...
}}<!-- Do not insert line break here or Dimensions Box moves up in the layout...


Line 52: Line 52:
[[Category:MIOCP]]
[[Category:MIOCP]]
[[Category:ODE model]]
[[Category:ODE model]]
[[Category: Tracking objective]]
[[Category:Minimum energy]]

Revision as of 22:11, 27 June 2016

Hanging chain problem
State dimension: 1
Differential states: 3
Continuous control functions: 1
Interior point equalities: 5

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)=(1,3),Lp=4.

Source Code

Model descriptions are available in