Skip to content

Robot ​

  • 6 state
  • 3 control
  • 1 variable
  • Mayer cost
  • free final time
  • 3 state box
  • 3 control box
  • 1 variable box
  • 12 boundary
  • OptimalControl valid
  • OptimalControl, scalarized valid
  • JuMP valid

The robot arm motion problem is a benchmark in time-optimal control. It models a robotic arm moving between two points in space, represented as a rigid bar of total length pivoting at the origin of a spherical coordinate system. The system includes six state variables: the radial position and its velocity , the horizontal angle and its angular velocity , and the vertical angle and its angular velocity . The control variables are , , and , representing the forces or torques applied along the radial and angular directions. The objective is to minimise the total transfer time while satisfying state and control constraints BOCOP Robot Arm Example.

Mathematical formulation ​

The problem can be stated as

The horizon is free, as the total transfer time is optimised.

Qualitative behaviour ​

The optimal solution exploits the degrees of freedom of the spherical coordinate system to minimise the motion time. Control inputs , , and typically follow bang–bang profiles, alternating between maximum and minimum values to reach the target efficiently. The dynamics are nonlinear due to the dependence of the moments of inertia and on the radial and angular positions, which affects the acceleration of the arm.

Characteristics ​

  • Nonlinear, second-order dynamics in spherical coordinates.

  • Bang–bang control structure in the time-optimal solution.

  • Serves as a benchmark for direct transcription and NLP solvers in robotic motion planning.

References ​

  • Mössner-Beigel, M. (1989). Thesis, Heidelberg University. Introduces the time-optimal robotic arm problem and its theoretical formulation.

  • Vanderbei, R. J. (2001). Case studies in trajectory optimization: Trains, Planes, and Other Pastimes. Provides numerical strategies for robotic motion planning and discusses control substitution techniques for time-optimal trajectories.

  • BOCOP examples: Robot arm problem. BOCOP Robot Arm Example Demonstrates the practical implementation using direct transcription and NLP solvers for robotic motion problems.

Parameters ​

ParameterDefault valueUnitMeaning
t00–initial time
L5–length of the arm, and upper bound of ρ
uρ_l-1–lower bound of the control uρ
uρ_u1–upper bound of the control uρ
uθ_l-1–lower bound of the control uθ
uθ_u1–upper bound of the control uθ
uϕ_l-1–lower bound of the control uϕ
uϕ_u1–upper bound of the control uϕ
ρ_t04.5–initial length ρ
θ_t00radinitial horizontal angle θ
ϕ_t00.7853981633974483radinitial vertical angle ϕ
dρ_t00–initial derivative of ρ
dθ_t00radinitial derivative of θ, per unit of time
dϕ_t00radinitial derivative of ϕ, per unit of time
ρ_tf4.5–final length ρ
θ_tf2.0943951023931953radfinal horizontal angle θ
ϕ_tf0.7853981633974483radfinal vertical angle ϕ
dρ_tf0–final derivative of ρ
dθ_tf0radfinal derivative of θ, per unit of time
dϕ_tf0radfinal derivative of ϕ, per unit of time
ρ_l0–lower bound of the length ρ
θ_l-3.141592653589793radlower bound of the angle θ
θ_uπradupper bound of the angle θ
ϕ_l0radlower bound of the angle ϕ
ϕ_uπradupper bound of the angle ϕ
tf_l0.1–lower bound of the final time

Every modeling takes other values with the keyword parameters, merged with these: robot(backend; parameters=(t0=…,)).

Reference objective ​

The best objective among the solves that converged, in each modeling, on the default grid of the modeling: the modelings are independent, each has its own reference. See how the references are computed.

ModelingSchemeGridReference objectiveSolvesDistinct solutionsConfigurations agree
JuMP:trapeze2509.14112698981yes, within 1.6e-07
OptimalControl:trapeze2509.141126989181yes, within 2.0e-07
OptimalControl, scalarized:trapeze2509.14112698931yes, within 0