SearcharxivSearch

arXiv subjects

Baran Alikoc

Publications and source records attributed to Baran Alikoc.

2 recordsLinked to original sources

A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace

This article presents a novel scheduling approach to minimise the energy consumption of a machine during its idle periods. In the scheduling domain, it is common to model the behaviour of the machine by defining a small set of machine modes, e.g. "on", "off" and "stand-by". Then the transitions between the modes are represented by a static transition graph. In this paper, we argue that this type of model might be too restrictive for some types of machines (e.g. the furnaces). For such machines, we propose to employ the complete time-domain dynamics and integrate it into an idle energy function. This way, the scheduling algorithm can exploit the full knowledge about the machine dynamics with minimised energy consumption encapsulated in this function. In this paper, we study a scheduling problem, where the tasks characterised by release times and deadlines are scheduled in the given order such that the idle energy consumption of the machine is minimised. We show that this problem can be solved in polynomial time whenever the idle energy function is concave. To highlight the practical applicability, we analyse a heat-intensive system employing a steel-hardening furnace. We derive an energy optimal control law, and the corresponding idle energy function, for the bilinear system model approximating the dynamics of the furnace (and possibly other heat-intensive systems). Further, we prove that the idle energy function is, indeed, concave in this case. Therefore, the proposed scheduling algorithm can be used. Numerical experiments show that by using our approach, combining both the optimal control and optimal scheduling, higher energy savings can be achieved, compared to the state-of-the-art scheduling approaches.

eess.SP

Robust cooperative synchronization of homogeneous agents with delays on directed communication graphs

This study deals with analysis and control of cooperative synchronization for identical agents interacting on a directed graph topology. The agents are considered to have general continuous linear time-invariant dynamics with homogeneous communication and/or control delays. An LMI approach based on a Lyapunov-Krasovskii functional is proposed, together with the synchronizing region concept, which decouples the single-agent dynamics from the detailed graph topology. Moreover, the conventional notion of synchronizing region is here extended by an LMI relaxation utilizing quasi-convex characteristic of the problem. This leads to less conservative results for the region of graph matrix eigenvalues in the complex domain, where the synchronization is guaranteed. The proposed method to calculate the allowable delay bound for synchronization is also less conservative as compared to the results from the literature. Furthermore, two designs for distributed state-feedback control are suggested. The precise delay value and the detailed graph topology need not be known for their application; it suffices only to know the upper bound on the delay and the approximate region where the Laplacian eigenvalues lie. Specific improvements over the results existing in the literature are demonstrated by a numerical example, which validates the proposed approaches.

eess.SY