skip to main content


Title: Controlling PDEs with mobile actuators constrained over time-varying reachability sets
The use of mobile actuators for the control of spatially distributed systems governed by PDEs results in both implementational and computational challenges. First it requires the backward-in-time solution to the actuator guidance and the backward-in-time solution to the control operator Riccati equation. A way to address this computational challenge is to consider a continuous-discrete alternative whereby the mobile actuator is repositioned at discrete instances and resides in a specific spatial location for a certain time interval. In order to find optimal paths for a given time interval, a set of feasible locations is derived using the reachability set. These reachability sets are further constrained to take into account the time it takes to travel to any spatial position with a prescribed maximum velocity. The proposed hybrid continuous-discrete control and actuator guidance is demonstrated for a 2D diffusion PDE that uses no constraints and angular constraints on the actuator motion.  more » « less
Award ID(s):
1825546
NSF-PAR ID:
10333831
Author(s) / Creator(s):
Date Published:
Journal Name:
2020 59th IEEE Conference on Decision and Control (CDC)
Page Range / eLocation ID:
4411 to 4416
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Employing mobile actuators and sensors for control and estimation of spatially distributed processes offers a significant advantage over immobile actuators and sensors. In addition to the control performance improvement, one also comes across the economic advantages since fewer devices, if allowed to be repositioned within a spatial domain, must be employed. While simulation studies of mobile actuators report superb controller performance, they are far from reality as the mechanical constraints of the mobile platforms carrying actuators and sensors have to satisfy motional constraints. Terrain platforms cannot behave as point masses without inertia; instead they must satisfy constraints which are adequately represented as path-dependent reachability sets. When the control algorithm commands a mobile platform to reposition itself in a different spatial location within the spatial domain, this does not occur instantaneously and for the most part the motion is not omnidirectional. This constraint is combined with a computationally feasible and suboptimal control policy with mobile actuators to arrive at a numerically viable control and guidance scheme. The feasible control decision comes from a continuous-discrete control policy whereby the mobile platform carrying the actuator is repositioned at discrete times and dwells in a specific position for a certain time interval. Moving to a subsequent spatial location and computing its associated path over a physics-imposed time interval, a set of candidate positions and paths is derived using a path-dependent reachability set. Embedded into the path-dependent reachability sets that dictate the mobile actuator repositioning, a scheme is proposed to integrate collocated sensing measurements in order to minimize costly state estimation schemes. The proposed scheme is demonstrated with a 2D PDE having two sets of collocated actuator-sensor pairs onboard mobile platforms. 
    more » « less
  2. This paper considers a class of distributed parameter systems that can be controlled by an actuator onboard a mobile platform. In order to avoid computational costs and control architecture complexity associated with a joint optimization of actuator guidance and control law, a suboptimal policy is proposed that significantly reduces the computational costs. By utilizing a continuous-discrete optimal control design, a mobile actuator moves to a new position at the beginning of a new time interval and resides for a prescribed time. Using the cost to go with variable lower limit, the optimization simplifies to solving algebraic Riccati equations instead of differential Riccati equations. Adding a hardware feature whereby the mobile sensors are constrained to stay within the proximity of the mobile actuator, a feedback kernel decomposition scheme is proposed to approximate a full state feedback controller by the weighted sum of sensor measurements. 
    more » « less
  3. We design a practical mobile actuator guidance policy for linear parabolic equations in 2D: the guidance is chosen so that H2-measure of uncertainty is minimized provided the system is subject to a distributed disturbance. We first present a guidance policy where the mobile actuator location to be selected will be fixed over a certain time interval of interest. Further we add extra complexity by taking into account the dynamics of the mobile actuator over the 2D domain of interest under reachability constraints. The proposed approach is illustrated through numerical studies. 
    more » « less
  4. Backward reachability analysis is essential to synthesizing controllers that ensure the correctness of closed-loop systems. This paper is concerned with developing scalable algorithms that under-approximate the backward reachable sets, for discrete-time uncertain linear and nonlinear systems. Our algorithm sequentially linearizes the dynamics, and uses constrained zonotopes for set representation and computation. The main technical ingredient of our algorithm is an efficient way to under-approximate the Minkowski difference between a constrained zonotopic minuend and a zonotopic subtrahend, which consists of all possible values of the uncertainties and the linearization error. This Minkowski difference needs to be represented as a constrained zonotope to enable subsequent computation, but, as we show, it is impossible to find a polynomial-size representation for it in polynomial time. Our algorithm finds a polynomial-size under-approximation in polynomial time. We further analyze the conservatism of this under-approximation technique, and show that it is exact under some conditions. Based on the developed Minkowski difference technique, we detail two backward reachable set computation algorithms to control the linearization error and incorporate nonconvex state constraints. Several examples illustrate the effectiveness of our algorithms. 
    more » « less
  5. This work considers the replacement of a full-state feedback controller by a static output feedback controller employing a finite number of point sensors. This is achieved by the approximation of the feedback kernel associated with the full state feedback operator. The feedback kernel is partitioned into equiareal cells and an appropriately selected centroid within each cell serves as the sensor location. This allows one to approximate the inner product of the feedback kernel and the full state by the finite weighted sum of static output feedback measurements. By equating the feedback kernel with the density of a hypothetical sensor network, the problem of approximating the sensor density becomes that of partitioning the sensor density using the proposed computational-geometry based decomposition that is based on a modification of Centroidal Voronoi Tessellations. When the control is considered over a finite horizon and/or the actuator itself is repositioned within the spatial domain, the resulting feedback kernel is rendered time-varying. This requires its partitioning at each time leading to mobile sensors within the spatial domain. Two guidance policies are proposed: one uses the partitioning of the kernel method at each time to find the optimal sensors thus resulting in moving sensors. The other method uses the kernel partitioning only at the initial time and subsequently uses the sensor density as the initial condition for an advection PDE that represents the evolution of the sensor density. This advection PDE is solved for the velocity thereby providing the velocity of the density of the sensor network. Projecting the sensor density velocity onto the same partitioning used for the kernel provides the sensor velocities. A numerical example of an advection diffusion PDE is presented to provide an understanding of this computational geometry based partitioning of feedback kernels. 
    more » « less