Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximally persistent connections for the periodic type

Published 24 Jan 2014 in cs.SY and math.OC | (1401.6220v1)

Abstract: This paper considers the optimal control problem of connecting two periodic trajectories with maximal persistence. A maximally persistent trajectory is close to the periodic type in the sense that the norm of the image of this trajectory under the operator defining the periodic type is minimal among all trajectories. A solution is obtained in this paper for the case when the two trajectories have the same period but it turns out to be only piecewise continuous and so an alternate norm is employed to obtain a continuous connection. The case when the two trajectories have different but rational periods is also solved. The problem of connecting periodic trajectories is of interest because of the observation that the operating points of many biological and artificial systems are limit cycles and so there is a need for a unified optimal framework of connections between different operating points. This paper is a first step towards that goal.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.