This paper presents a closed form analytical model for semiconductor and capacitor currents in a 5-Level Active Neutral Point Clamped Converter (5L-ANPC) topology. This model enables device selection, performance pred...
详细信息
This paper presents a closed form analytical model for semiconductor and capacitor currents in a 5-Level Active Neutral Point Clamped Converter (5L-ANPC) topology. This model enables device selection, performance prediction, and design optimization of the topology. Models for the switch and FC currents are derived based on the topology's switching states. A model for input capacitor current is derived by analyzing the interaction of three phase legs of the topology. The model is verified using conventional time-domain switching simulation of the topology.
Spiking neural networks (SNNs) have captured apparent interest over the recent years, stemming from neuroscience and reaching the field of artificial intelligence. However, due to their nature SNNs remain far behind i...
详细信息
Since 2013, the PULP (parallel Ultra-Low Power) Platform project has been oneof the most active and successful initiatives in designing research IPs andreleasing them as open-source. Its portfolio now ranges from proc...
详细信息
Available methods for identification of stochastic dynamical systems from input-output data generally impose restricting structural assumptions on either the noise structure in the data-generating system or the possib...
详细信息
Ease of calibration and high-accuracy task-space state-estimation purely based on onboard sensors is a key requirement for enabling easily deployable cable robots in real-world applications. In this work, we incorpora...
Ease of calibration and high-accuracy task-space state-estimation purely based on onboard sensors is a key requirement for enabling easily deployable cable robots in real-world applications. In this work, we incorporate the onboard camera and kinematic sensors to drive a statistical fusion framework that presents a unified localization and calibration system which requires no initial values for the kinematic parameters. This is achieved by formulating a Monte-Carlo algorithm that initializes a factor-graph representation of the calibration and localization problem. With this, we are able to jointly identify both the kinematic parameters and the visual odometry scale alongside their corresponding uncertainties. We demonstrate the practical applicability of the framework using our state-estimation dataset recorded with the ARAS-CAM suspended cable driven parallel robot, and published as part of this manuscript.
We focus on a real-time multi agent decision-making algorithm that combines a centralized algorithm and a distributed algorithm. A network segmentation is unavoidable in a dynamic environment. In such cases, it is nec...
We focus on a real-time multi agent decision-making algorithm that combines a centralized algorithm and a distributed algorithm. A network segmentation is unavoidable in a dynamic environment. In such cases, it is necessary for each agent to continually make the most urgent real-time decisions in both centralized and decentralized ways. In this paper, we present a Hybrid Factored-Value Max-Plus algorithm with cost which has online, anytime, and scalable properties despite network segmentation. We also study the performance of centralized and distributed algorithms to understand the performance characteristics of a hybrid algorithm.
Minimax problems have attracted much attention due to various applications in constrained optimization problems and zero-sum games. Identifying saddle points within these problems is crucial, and saddle flow dynamics ...
详细信息
ISBN:
(数字)9798350316339
ISBN:
(纸本)9798350316346
Minimax problems have attracted much attention due to various applications in constrained optimization problems and zero-sum games. Identifying saddle points within these problems is crucial, and saddle flow dynamics offer a straightforward yet useful approach. This study focuses on a class of bilinearly coupled minimax problems with strongly convex-linear objective functions. We design an accelerated algorithm based on saddle flow dynamics, achieving a convergence rate beyond the stereotype limit (the strong convexity constant). The algorithm is derived from a sequential two-step transformation of a given objective function. First, a change of variables is applied to render the objective function better-conditioned, introducing strong concavity (from linearity) while preserving strong convexity. Second, proximal regularization, when staggered with the first step, further enhances the strong convexity of the objective function by shifting some of the obtained strong concavity. After these transformations, saddle flow dynamics based on the new objective function can be tuned for accelerated exponential convergence. Besides, such an approach can be extended to weakly convex-weakly concave functions and still guarantees exponential convergence to one stationary point. The theory is verified by a numerical test on an affine equality-constrained convex optimization problem.
Robotic wrists play a pivotal role in the functionality of industrial manipulators and humanoid robots, facilitating manipulation and grasping tasks. In recent years, there has been a growing interest in integrating a...
详细信息
To take unit commitment (UC) decisions under uncertain net load, most studies utilize a stochastic UC (SUC) model that adopts a one-size-fits-all representation of uncertainty. Disregarding contextual information such...
详细信息
To take unit commitment (UC) decisions under uncertain net load, most studies utilize a stochastic UC (SUC) model that adopts a one-size-fits-all representation of uncertainty. Disregarding contextual information such as weather forecasts and temporal information, these models are typically plagued by a poor out-of-sample performance. To effectively exploit contextual information, in this paper, we formulate a conditional SUC problem that is solved given a covariate observation. The presented problem relies on the true conditional distribution of net load and so cannot be solved in practice. To approximate its solution, we put forward a predictive prescription framework, which leverages a machine learning model to derive weights that are used in solving a reweighted sample average approximation problem. In contrast with existing predictive prescription frameworks, we manipulate the weights that the learning model delivers based on the specific dataset, present a method to select pertinent covariates, and tune the hyperparameters of the framework based on the out-of-sample cost of its policies. We conduct extensive numerical studies, which lay out the relative merits of the framework vis-à-vis various benchmarks.
暂无评论