23 August 2022 in IEEE Transactions on Transportation Electrification
With the popularization of electric vehicles (EVs), EV charging demand is becoming an important load in the building. Considering the mobility of EVs from building to building and their uncertain charging demand, it is of great practical interest to control the EV charging process in a microgrid of buildings to optimize the total operation cost while ensuring transmission security between the microgrid and the main grid. We consider this important problem in this article and make the following contributions. First, we formulate this problem as a Markov decision process (MDP) to capture the uncertain supply and EV charging demand in the microgrid of buildings. Besides reducing the total operation cost of buildings, the model also considers the power exchange limitation to ensure transmission security. Second, this model is reformulated within an event-based optimization (EBO) framework to mitigate the impact of large state and action space. A randomized parametric event-based control policy is proposed for the microgrid controller to determine the charge ratio for each building. Then, a selecting-to-charging principle is implemented for each building controller to determine the charge control of each EV in the building. Third, a constrained gradient-based policy optimization method is developed to find the optimal event-based control policy. Furthermore, an adjustment mechanism is also introduced to ensure transmission security during optimization. Numerical experiments are conducted to analyze the structure and the performance of the event-based control policy for EV charging in a microgrid of three buildings.
27 May 2022 in IEEE Transactions on Automation Science and Engineering
This paper considers the edge computing system (ECS) in which the tasks with dependencies are offloaded and computed in sequence. Different task-offloading orderings come with different ECS memory-cache execution latency (EMCEL) which is caused by writing and reading (WR) the computed results of earlier offloaded tasks between the ECS memory and cache. Therefore, the optimal ordering to offload all the tasks while leading to the minimum EMCEL arises as an interesting issue in practice. This requires to solve a hard exponential explosion optimization problem. To address this issue, this paper first formulates the tasks and their dependencies as a direct acyclic graph (DAG), then converts the exponential explosion problem into a discrete problem that can be solved in polynomial time, and finally develops some theoretical conditions to guide to determine the optimal task-offloading orderings. A novel algorithm called OTOOA to find the optimal task-offloading orderings in polynomial time is proposed. Field experiments show that OTOOA outperforms the existing algorithms. To our best knowledge, this is the initial work towards this issue.
13 December 2022 in IEEE Transactions on Automation Science and Engineering
This paper studies the edge computing system (ECS) in which caching the frequently reusable service (FRS) at the edge server (ES) is an effective way to reduce delays. The larger cache space available in the ES (we call it ES cache space) might buffer the larger scale of FRS, and subsequently decrease the delays while bringing higher cache storage costs. Meanwhile, the distribution of FRS is not always known in advance. Therefore, how much ES cache space should be supplied to make the optimal tradeoff between the delays and cache storage costs arises as an interesting issue in practice. To address this issue, this paper first formulates the problem of determining the amount of ES cache space supply as a constrained Markov decision process (CMDP), then adopts the Zipf’s distribution to estimate the probability distribution of FRS, and finally proposes an effective cache space control algorithm (CSCA) guiding the ES to determine the amount of ES cache space supply to minimize the cache storage costs while maintaining the delays at the acceptable level. Theoretical analysis, simulations and field experiments document and illustrate its performance. Note to Practitioners —This paper addresses the interesting trade-off between the delays and cache storage costs for the edge computing system that operates with limited cache storage budgets while must satisfy the required real-time performances. It helps to improve the operation efficiency of the systems with edge computing setting in the area of Internet of Things (IoT) or Cyber-Physical Systems (CPS) that employ the edge server to cache the frequently reusable services, arriving at the minimization of the accumulative cache storage costs while maintaining the accumulative delays at the acceptable level. Theoretical analysis, simulation and field experimental investigations jointly show that the solution proposed here outperforms existing solutions.
21 September 2017 in IEEE Transactions on Automation Science and Engineering
In Internet of Things systems, Web services enable interoperable machine-to-machine communication over networks. Polling mechanism is a practical way for a Web service-based control system to enable its actuator to respond to its controller under uncertain environments where the actuator does not know exactly when the controller updates its command. Fast response demands a high polling frequency (polling mechanism handles the event in time-driven mode) which may lead to heavy network traffic. Therefore, how to make the optimal tradeoff between the network traffic and delay in a Web service-based control system becomes an interesting problem. This paper formulates the problem of finding the optimal polling frequency control policy of a Web service-based control system as a constrained Markov decision process (CMDP). The policy is such that the actuator responds to the controller within a tolerable delay threshold while minimizing network traffic. An algorithm called CMDPA is proposed to solve the problem. Simulation and field experiments show our policy performance.
22 June 2022 in IEEE Transactions on Automation Science and Engineering
Wireless powered edge computing system (WPECS) enhances the computing power and extends the lifetime of wireless devices (WDs). This paper studies the WPECS with multiple WDs, in which the access point (AP) provides some transmission channels which differ from each other in the channel gain, and the WD powered through the wireless power transfer (WPT) technology has some indivisible tasks and adopts binary task-offloading actions. More energy harvested strengthens the WDs with more computing power, while corresponding to more energy consumption. Therefore, how to make the optimal tradeoff between computation rate and energy harvested arises as an interesting issue. To address this issue, this paper first formulates the switch process of transmission channel as a constrained Markov decision process (CMDP), and then proposed an effective algorithm to maximize the sum of computation rates of all WDs in terms of task data bits computed, within the required level of accumulative energy harvested. Theoretical analysis, simulations and field experiments jointly document and illustrate its performance. Note to Practitioners—This paper addresses the interesting tradeoff between computation rate and energy harvested in a wireless powered edge computing system that operates in the environments with limited available energy. It helps to improve the operation efficiency of the edge computing systems in the area of Internet of Things (IoT) or Cyber-Physical Systems (CPS) that employ wireless power transfer technology to power the wireless devices through the access point over the air to maximize the sum of computations rates of all WDs in terms of task data bits computed, while keeping the accumulative energy harvested within a range. Simulations and experimental investigations show that the solution proposed here outperforms existing solutions.
29 October 2020 in IEEE Transactions on Automation Science and Engineering
Web services integrate various components in the Internet of Things (IoT). In a Web service-based data-collection system with multiple smart sensor nodes periodically sampling and estimating the same unknown physical parameter of interest, the smart sensor nodes first submit their estimates to the Web server, and then, the server picking the one with the minimum error seems to be a practical way to arrive at a minimum error estimate (MEE). More submissions provide the Web server with more candidates to consider, which can maximize the probability of the server guaranteeing the MEE, while also leading to more network traffic. Therefore, how to make the optimal tradeoff between network traffic and sensing accuracy arises as an interesting problem. This article proposes a network traffic-dependent probability threshold policy within an intended underlying optimization-theoretical framework to address this problem. The policy is such that the smart sensor nodes submit their estimates and corresponding estimation errors (ECEEs) to the Web server within a tolerable network traffic threshold while maximizing the probability of the server delivering the MEE. Theoretical analysis, simulation, and field experiments document and illustrate its performance.