## Abstract

In this paper an inverse optimal control problem in the form of a mathematical program with complementarity constraints (MPCC) is considered and numerical experiences are discussed. The inverse optimal control problem arises in the context of human navigation where the body is modelled as a dynamical system and it is assumed that the motions are optimally controlled with respect to an unknown cost function. The goal of the inversion is now to find a cost function within a given parametrized family of candidate cost functions such that the corresponding optimal motion minimizes the deviation from given data. MPCCs are known to be a challenging class of optimization problems typically violating all standard constraint qualifications (CQs). We show that under certain assumptions the resulting MPCC fulfills CQs for MPCCs being the basis for theory on MPCC optimality conditions and consequently for numerical solution techniques. Finally, numerical results are presented for the discretized inverse optimal control problem of locomotion using different solution techniques based on relaxation and lifting.

Original language | English |
---|---|

Pages (from-to) | 670-698 |

Number of pages | 29 |

Journal | Optimization Methods and Software |

Volume | 32 |

Issue number | 4 |

DOIs | |

State | Published - 2 Sep 2017 |

## Keywords

- Constant positive-linear dependence
- Constraint qualification
- Inverse optimal control
- Locomotion
- Mathematical program with complementarity constraints