In this report the control of continuous linear plants where the state sensor is connected to a linear controller/actuator via a network is addressed. The work focuses on reducing the network usage using knowledge of the plant dynamics. Specifically, the controller uses an explicit model of the plant that approximates the plant dynamics and makes possible stabilization of the plant even under s...

We apply retrospective cost adaptive control (RCAC) to a broadband disturbance rejection problem under limited modeling information and assuming that the performance variable is measured. The goal is to compare the asymptotic performance (that is, after convergence of the controller) of the adaptive controller with the performance of discrete-time LQG controller, which uses complete modeling in...

There has been a recent surge of studies in plant biology that combine experimental data with computational modeling. Here, we categorize a diversity of theoretical models and emphasize the need to tailor modeling approaches to the questions at hand. Models can start from biophysical or purely heuristic basic principles, and can focus at several levels of biological organization. Recent example...

The geometries and topologies of leaves, flowers, roots, shoots, and their arrangements have fascinated plant biologists and mathematicians alike. As such, plant morphology is inherently mathematical in that it describes plant form and architecture with geometrical and topological techniques. Gaining an understanding of how to modify plant morphology, through molecular biology and breeding, aid...

In this paper we address the problem of scheduling and synthesizing distributed control programs for a batch production plant. We use a timed automata model of the batch plant and the verification tool Uppaal to solve the scheduling problem. In modeling the plant, we aim at a level of abstraction which is sufficiently accurate in order that synthesis of control programs from generated timed tra...

This article introduces a new problem called the Capacity and Distance Constrained Plant Location Problem. It is an extension of the discrete capacitated plant location problem, where the customers assigned to each plant have to be packed in groups that will be served by one vehicle each. The paper addresses different modeling aspects of the problem. It describes a tabu search algorithm for its...