In this article, the importance of considering operability and control criteria in the analysis and design of intensified and modular processes is discussed. We first analyze the impact on operability of key factors including: (i) degrees of freedom, (ii) process constraints, (iii) numbering up vs. scaling up, and (iv) dynamic/periodic operation. Comparative examples are presented to showcase the pros and cons in intensified/modular systems vs. their conventional counterparts from operability and control aspects. Then we look into metrics and tools to address these challenges such as: (i) flexibility analysis, (ii) operability‐based design, and (iii) advanced model‐based control. Considering different conceptual design stages as synthesis intensification, steady‐state design, and dynamic operational optimization, we highlight the need to incorporate different levels of operability considerations. Future research opportunities and perspectives are also identified, particularly emphasizing the importance of a holistic strategy for integrated design, operability, and control of intensified and modular process systems.
Simultaneous evaluation of multiple time scale decisions has been regarded as a promising avenue to increase the process efficiency and profitability through leveraging their synergistic interactions. Feasibility of such an integral approach is essential to establish a guarantee for operability of the derived decisions. In this study, we present a modeling methodology to integrate process design, scheduling, and advanced control decisions with a single mixed‐integer dynamic optimization (MIDO) formulation while providing certificates of operability for the closed‐loop implementation. We use multi‐parametric programming to derive explicit expressions for the model predictive control strategy, which is embedded into the MIDO using the base‐2 numeral system that enhances the computational tractability of the integrated problem by exponentially reducing the required number of binary variables. Moreover, we apply the State Equipment Network representation within the MIDO to systematically evaluate the scheduling decisions. The proposed framework is illustrated with two batch processes with different complexities.
more » « less- Award ID(s):
- 1705423
- NSF-PAR ID:
- 10452652
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- AIChE Journal
- Volume:
- 66
- Issue:
- 10
- ISSN:
- 0001-1541
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract -
more » « less
Abstract AI Communication Technologies (AICTs) make decisions about users’ communication on their behalf. Users’ implementation of AICTs that autonomously act may enable and constrain how they accomplish their work and interact with others. Drawing on interviews with users of two AICTs with differing levels of autonomy designed for work-related scheduling, this study investigated how users enacted AICTs in practice. Users of both tools drew on AICTs’ autonomous capabilities to enact machine agency, a structure that assigns AICTs the power to allocate resources, which helped them increase scheduling efficiency and guide how others interacted with them. Users of the tool that autonomously implemented decisions described a process of enactment in which they used the tool to control their work, perceived the tool was exhibiting too much control, and acted to regain control. I present implications for understanding how people enact machine agency with AICTs that make decisions about their work.
-
more » « less
We study the optimal control problem in stochastic queueing networks with a set of job dispatchers connected to a set of parallel servers with queues. Jobs arrive at the dispatchers and get routed to the servers following some routing policy. The arrival processes of jobs and the service processes of servers are stochastic with unknown arrival rates and service rates. Upon the completion of each job from dispatcher
un at serversm , a random utility whose mean is unknown is obtained. We seek to design a control policy that makes routing decisions at the dispatchers and scheduling decisions at the servers to maximize the total utility obtained by the end of a finite time horizonT . The performance of policies is measured by regret, which is defined as the difference in total expected utility with respect to the optimal dynamic policy that has access to arrival rates, service rates and underlying utilities.We first show that the expected utility of the optimal dynamic policy is upper bounded by
T times the solution to a static linear program, where the optimization variables correspond to rates of jobs from dispatchers to servers and the feasibility region is parameterized by arrival rates and service rates. We next propose a policy for the optimal control problem that is an integration of a learning algorithm and a control policy. The learning algorithm seeks to learn the optimal extreme point solution to the static linear program based on the information available in the optimal control problem. The control policy, a mixture of priority-based and Joint-the-Shortest-Queue routing at the dispatchers and priority-based scheduling at the servers, makes decisions based on the graphical structure induced by the extreme point solutions provided by the learning algorithm. We prove that our policy achieves logarithmic regret whereas application of existing techniques to the optimal control problem would lead to Ω(√T )-regret. The theoretical analysis is further complemented with simulations to evaluate the empirical performance of our policy. -
As a founder of the Process Systems Engineering (PSE) discipline, Professor Roger W.H. Sargent had set ambitious goals for a systematic new generation of a process design paradigm based on optimization techniques with the consideration of future uncertainties and operational decisions. In this paper, we present a historical perspective on the milestones in model-based design optimization techniques and the developed tools to solve the resulting complex problems. We examine the progress spanning more than five decades, from the early flexibility analysis and optimal process design under uncertainty to more recent developments on the simultaneous consideration of process design, scheduling, and control. This formidable target towards the grand unification poses unique challenges due to multiple time scales and conflicting objectives. Here, we review the recent progress and propose future research directions.more » « less
-
null (Ed.)This paper studies a remote sensing system where multiple wireless sensors generate possibly noisy information updates of various surveillance fields and delivering these updates to a control center over a wireless network. The control center needs a sufficient number of recently generated information updates to have an accurate estimate of the current system status, which is critical for the control center to make appropriate control decisions. The goal of this work is then to design the optimal policy for scheduling the transmissions of information updates. Through Brownian approximation, we demonstrate that the control center’s ability to make accurate real-time estimates depends on the averages and temporal variances of the delivery processes. We then formulate a constrained optimization problem to find the optimal means and variances. We also develop a simple online scheduling policy that employs the optimal means and variances to achieve the optimal system-wide performance. Simulation results show that our scheduling policy enjoys fast convergence speed and better performance when compared to other state-of-the-art policies.more » « less
