Abstract

AbstractIn this paper we consider a natural extension of the minimum time problem in optimal control theory which we refer to as the minimum trapping time problem. The minimum trapping time problem requires a fixed time interval [0, T], where T is finite. The aim is to determine a control for which the system trajectory not only reaches a specified target in minimum time but also remains trapped within the target until time T. Our aim is to devise a computational procedure for solving the minimum trapping time problem. The computational procedure we adopt uses control parametrisation in which the class of controls is approximated by a class of piecewise constant functions. The problem we are solving is therefore an approximation to the original minimum trapping time problem. Some properties for the approximate problem are then established. These lead to an extremely efficient iterative procedure for calculating the minimum trapping time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call