Searcharxiv⌕ Search

arXiv subjects

Yue Chen

Publications and source records attributed to Yue Chen.

At least 181 records · Page 10Linked to original sources
arXiv2023

Dual-recycled interference-based weak value metrology

Weak-value-amplification permits small effects to be measured as observable changes at the sacrifice of power due to post-selection. The power recycling scheme has been proven to eliminate this inefficiency of the rare post-selection, thus surpassing the limit of the shot noise and improving the precision of the measurement. However, the improvement is strictly limited by the system setup, especially the system loss. Here we introduce a dual recycling model based on the interferometric weak-value-based deflection measurement. Two mirrors, the power-recycling mirror and signal-recycling mirror, are placed at the bright and dark port of the interferometer respectively, creating a composite resonator. The results show that both the power and the signal-to-noise ratio (SNR) are greatly enhanced in a wider range of experimental parameters compared to the power-recycling scheme. This work considerably loosens the constraint of the system setup and further explores the real advantage of weak measurement over traditional schemes.

physics.optics↗
arXiv2023

Market Power Mitigation in Two-stage Electricity Market with Supply Function and Quantity Bidding

The main goal of a sequential two-stage electricity market -- e.g., day-ahead and real-time markets -- is to operate efficiently. However, the price difference across stages due to inadequate competition and unforeseen circumstances leads to undesirable price manipulation. To mitigate this, some Independent System Operators (ISOs) proposed system-level market power mitigation (MPM) policies in addition to existing local policies. These policies aim to substitute noncompetitive bids with a default bid based on estimated generator costs. However, these policies may lead to unintended consequences when implemented without accounting for the conflicting interest of participants. In this paper, we model the competition between generators (bidding supply functions) and loads (bidding quantity) in a two-stage market with a stage-wise MPM policy. An equilibrium analysis shows that a real-time MPM policy leads to equilibrium loss, meaning no stable market outcome (Nash equilibrium) exists. A day-ahead MPM policy, besides, leads to a Stackelberg-Nash game with loads acting as leaders and generators as followers. In this setting, loads become winners, i.e., their aggregate payment is always less than competitive payments. Moreover, comparison with standard market equilibrium highlights that markets are better off without such policies. Finally, numerical studies highlight the impact of heterogeneity and load size on market equilibrium.

math.OC↗
arXiv2023

Kinetostatic Path Planning for Continuum Robots By Sampling on Implicit Manifold

Continuum robots (CR) offer excellent dexterity and compliance in contrast to rigid-link robots, making them suitable for navigating through, and interacting with, confined environments. However, the study of path planning for CRs while considering external elastic contact is limited. The challenge lies in the fact that CRs can have multiple possible configurations when in contact, rendering the forward kinematics not well-defined, and characterizing the set of feasible robot configurations as non-trivial. In this paper, we propose to solve this problem by performing quasi-static path planning on an implicit manifold. We model elastic obstacles as external potential fields and formulate the robot statics in the potential field as the extremal trajectory of an optimal control problem obtained by the first-order variational principle. We show that the set of stable robot configurations is a smooth manifold diffeomorphic to a submanifold embedded in the product space of the CR actuation and base internal wrench. We then propose to perform path planning on this manifold using AtlasRRT*, a sampling-based planner dedicated to planning on implicit manifolds. Simulations in different operation scenarios were conducted and the results show that the proposed planner outperforms Euclidean space planners in terms of success rate and computational efficiency.

cs.RO↗
arXiv2023

Time-Varying Feedback Optimization for Quadratic Programs with Heterogeneous Gradient Step Sizes

Online feedback-based optimization has become a promising framework for real-time optimization and control of complex engineering systems. This tutorial paper surveys the recent advances in the field as well as provides novel convergence results for primal-dual online algorithms with heterogeneous step sizes for different elements of the gradient. The analysis is performed for quadratic programs and the approach is illustrated on applications for adaptive step-size and model-free online algorithms, in the context of optimal control of modern power systems.

math.OC↗
arXiv2023

Toward Extending Concentric Tube Robot Kinematics for Large Clearance and Impulse Curvature

Concentric Tube Robots (CTRs) have been proposed to operate within the unstructured environment for minimally invasive surgeries. In this letter, we consider the operation scenario where the tubes travel inside the channels with a large clearance or large curvature, such as aortas or industrial pipes. Accurate kinematic modeling of CTRs is required for the development of advanced control and sensing algorithms. To this end, we extended the conventional CTR kinematics model to a more general case with large tube-to-tube clearance and large centerline curvature. Numerical simulations and experimental validations are conducted to compare our model with respect to the conventional CTR kinematic model. In the physical experiments, our proposed model achieved a tip position error of 1.53 mm in the 2D planer case and 4.36 mm in 3D case, outperforming the state-of-the-art model by 71% and 66%, respectively.

cs.RO↗
arXiv2023

Stochastic Optimization of Coupled Power Distribution-Urban Transportation Network Operations with Autonomous Mobility on Demand Systems

Autonomous mobility on demand systems (AMoDS) will significantly affect the operation of coupled power distribution-urban transportation networks (PTNs) by the optimal dispatch of electric vehicles (EVs). This paper proposes an uncertainty method to analyze the operational states of PTNs with AMoDS. First, a PTN operation framework is designed considering the controllable EVs dispatched by AMoDS as well as the uncontrollable driving behaviors of other vehicle users. Then, a bi-level power-traffic flow (PTF) model is proposed to characterize the interaction of power distribution networks (PDNs) and urban transportation networks (UTNs). In the upper level, a social optimum model is established to minimize the operating cost of PDNs and UTNs embedded with controllable EVs. In the lower level, a stochastic user equilibrium (SUE) model is established to minimize the operating cost of uncontrollable EVs and gasoline vehicles (GVs) in UTNs. Finally, a probabilistic PTF analysis method is developed to evaluate PTN operations under environmental and human uncertainties. A regional sensitivity analysis method is proposed to identify the critical uncertainties and quantify the impacts of their distribution ranges on PTN operations. The effectiveness of the proposed method is verified by the PTN consisting of a 21-bus PDN and a 20-node UTN.

eess.SY↗
arXiv2023

Intercept Function and Quantity Bidding in Two-stage Electricity Market with Market Power Mitigation

Electricity markets typically operate in two stages, day-ahead and real-time. Despite best efforts striving efficiency, evidence of price manipulation has called for system-level market power mitigation (MPM) initiatives that substitute noncompetitive bids with default bids. Implementing these policies with a limited understanding of participant behavior may lead to unintended economic losses. In this paper, we model the competition between generators and inelastic loads in a two-stage market with stage-wise MPM policies. The loss of Nash equilibrium and lack of guarantee of stable market outcome in the case of conventional supply function bidding motivates the use of an alternative market mechanism where generators bid an intercept function. A Nash equilibrium analysis for a day-ahead MPM policy leads to a Stackelberg-Nash game with loads exercising market power at the expense of generators. A comparison of the resulting equilibrium with the standard market (not implementing any MPM policy) shows that a day-ahead policy completely mitigates the market power of generators. On the other hand, the real-time MPM policy increases demand allocation to real-time, contrary to current market practice with most electricity trades in the day-ahead market. Numerical studies illustrate the impact of the slope of the intercept function on the standard market.

math.OC↗
arXiv2023

Persistent spin dynamics in magnetically ordered honeycomb cobalt oxides

In the quest to find quantum spin liquids, layered cobalt oxides Na2Co2TeO6 and Na3Co2SbO6 have been proposed as promising candidates for approximating the Kitaev honeycomb model. Yet, their suitability has been thrown into question due to observed long-range magnetic order at low temperatures and indications of easy-plane, rather than Kitaev-type, spin anisotropy. Here we use muon spin relaxation to reveal an unexpected picture: contrary to the anticipated static nature of the long-range order, the systems show prevalent spin dynamics with spatially uneven distribution and varied correlation times. This underlines that the magnetic ground states cannot be solely described by the long-range order, suggesting a significant role of quantum fluctuations. Our findings not only shed new light on the complex physics of these systems but also underscore the need for a refined approach in the search for realizable quantum spin liquids.

cond-mat.str-el↗
arXiv2023

Robust Generation Dispatch with Purchase of Renewable Power and Load Predictions

The increasing use of renewable energy sources (RESs) and responsive loads has made power systems more uncertain. Meanwhile, thanks to the development of advanced metering and forecasting technologies, predictions by RESs and load owners are now attainable. Many recent studies have revealed that pooling the predictions from RESs and loads can help the operators predict more accurately and make better dispatch decisions. However, how the prediction purchase decisions are made during the dispatch processes needs further investigation. This paper fills the research gap by proposing a novel robust generation dispatch model considering the purchase and use of predictions from RESs and loads. The prediction purchase decisions are made in the first stage, which influence the accuracy of predictions from RESs and loads, and further the uncertainty set and the worst-case second-stage dispatch performance. This two-stage procedure is essentially a robust optimization problem with decision-dependent uncertainty (DDU). A mapping-based column-and-constraint generation (C&CG) algorithm is developed to overcome the potential failures of traditional solution methods in detecting feasibility, guaranteeing convergence, and reaching optimal strategies under DDU. Case studies demonstrate the effectiveness, necessity, and scalability of the proposed model and algorithm.

math.OC↗
arXiv2023

Near-Field Beamforming for STAR-RIS Networks

Recently, simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) have received significant research interest. The employment of large STAR-RIS and high-frequency signaling inevitably make the near-field propagation dominant in wireless communications. In this work, a STAR-RIS aided near-field multiple-input multiple-multiple (MIMO) communication framework is proposed. A weighted sum rate maximization problem for the joint optimization of the active beamforming at the base station (BS) and the transmission/reflection-coefficients (TRCs) at the STAR-RIS is formulated. The non-convex problem is solved by a block coordinate descent (BCD)-based algorithm. In particular, under given STAR-RIS TRCs, the optimal active beamforming matrices are obtained by solving a convex quadratically constrained quadratic program. For given active beamforming matrices, two algorithms are suggested for optimizing the STAR-RIS TRCs: a penalty-based iterative (PEN) algorithm and an element-wise iterative (ELE) algorithm. The latter algorithm is conceived for STAR-RISs with a large number of elements. Numerical results illustrate that: i) near-field beamforming for STAR-RIS aided MIMO communications significantly improves the achieved weighted sum rate compared with far-field beamforming; ii) the near-field channels facilitated by the STAR-RIS provide enhanced degrees-of-freedom and accessibility for the multi-user MIMO system; and iii) the BCD-PEN algorithm achieves better performance than the BCD-ELE algorithm, while the latter has a significantly lower computational complexity.

cs.IT↗
arXiv2023

Sizing Grid-Connected Wind Power Generation and Energy Storage with Wake Effect and Endogenous Uncertainty: A Distributionally Robust Method

Wind power, as a green energy resource, is growing rapidly worldwide, along with energy storage systems (ESSs) to mitigate its volatility. Sizing of wind power generation and ESSs has become an important problem to be addressed. Wake effect in a wind farm can cause wind speed deficits and a drop in downstream wind turbine power generation, which however was rarely considered in the sizing problem in power systems. In this paper, a bi-objective distributionally robust optimization (DRO) model is proposed to determine the capacities of wind power generation and ESSs considering the wake effect. An ambiguity set based on Wasserstein metric is established to characterize the wind power and demand uncertainties. In particular, wind power uncertainty is affected by the wind power generation capacity which is determined in the first stage. Thus, the proposed model is a DRO problem with endogenous uncertainty (or decision-dependent uncertainty). To solve the proposed model, a stochastic programming approximation method based on minimum Lipschitz constants is developed to turn the DRO model into a linear program. Then, an iterative algorithm is built, embedded with methods for evaluating the minimum Lipschitz constants. Case studies demonstrate the necessity of considering wake effect and the effectiveness of the proposed method.

eess.SY↗
arXiv2023

Easy-plane multi-$\mathbf{q}$ magnetic ground state of Na$_3$Co$_2$SbO$_6$

Na$_3$Co$_2$SbO$_6$ is a potential Kitaev magnet with a monoclinic layered crystal structure. Recent investigations of the $C_3$-symmetric sister compound Na$_2$Co$_2$TeO$_6$ have uncovered a unique triple-$\mathbf{q}$ magnetic ground state, as opposed to a single-$\mathbf{q}$ (zigzag) one, prompting us to examine the influence of the reduced structural symmetry of Na$_3$Co$_2$SbO$_6$ on its ground state. Neutron diffraction data obtained on a twin-free crystal reveal that the ground state remains a multi-$\mathbf{q}$ state, despite the system's strong in-plane anisotropy. This robustness of multi-$\mathbf{q}$ orders suggests that they are driven by a common mechanism in the honeycomb cobaltates, such as higher-order magnetic interactions. Spin-polarized neutron diffraction results show that the ordered moments are entirely in-plane, with each staggered component orthogonal to the propagating wave vector. The inferred ground state favors a so-called XXZ easy-plane anisotropic starting point for the microscopic model over a Kitaev one, and features unequal ordered moments reduced by strong quantum fluctuations.

cond-mat.str-el↗
arXiv2023

An Online Algorithm for Combined Computing Workload and Energy Coordination Within A Regional Data Center Cluster

Regional data center clusters have flourished in recent years to serve customers in a major city with low latency. The optimal coordination of data centers in a regional cluster has become a pressing issue because of its rising energy consumption. In this paper, a Lyapunov optimization-based online algorithm is developed for the combined computing workload and energy coordination of data centers in a regional cluster. The proposed online algorithm is prediction-free and easy to implement. We prove that the workload queues and battery energy level will be within their physical limits, though their related time-coupling constraints are not considered explicitly in the proposed algorithm. The previous online algorithms do not have such a guarantee. A theoretical upper bound on the optimality gap between the online and offline results is derived to provide a performance guarantee for the proposed algorithm. To enable distributed implementation, an accelerated ADMM algorithm is developed with iteration truncation and follow-up well-designed adjustments, whereby a nearly optimal solution is attained with much enhanced computational efficiency. Case studies show the effectiveness of the proposed method and its advantages over the existing methods.

math.OC↗
arXiv2023

Constructing a refined model of small bodies in the solar system -- II. The Plutinos

As the second part of our study, in this paper, we proceed to refine the solar system model by incorporating the gravitational influence of Plutinos in Neptune's 2:3 resonance. We aim to develop the arc model to represent the global perturbation of Plutinos by taking into account their asymmetric spatial distribution resulting from the 2:3 resonance, and demonstrate the difference to the commonly employed ring model. The global perturbation of Plutinos is measured by the change in the Sun-Neptune distance. We begin by deriving the number density of the discrete-arc comprised of point masses to accurately represent the continuous-arc. Based on the resonant characteristics of the 2:3 MMR, we then construct three overlapping discrete-arcs to model the Plutinos. The perturbations of these arcs are investigated in detail, considering various azimuthal and radial distributions associated with the resonant amplitudes A and eccentricities e of the Plutinos, respectively. The change in Sun-Neptune distance, i.e. $Δd_{SN}$, caused by Plutinos increases as the range of A widens. At e<=0.1, $Δd_{SN}$ can reach magnitudes on the order of 100 km. However, the effects of Plutinos' A and e can possibly balance each other. As given e>=0.25, we find that $Δd_{SN}$ approaches zero, indicating a negligible contribution from highly eccentric Plutinos to the planetary ephemerides. We finally provide a concise analytic expression, which contains the parameters A, e and the total mass of Plutinos, to estimate $Δd_{SN}$ at any epoch from 2020 to 2120. Furthermore, since the difference in $Δd_{SN}$ between the arc and ring model can be as large as 170 km, we conclude that the ring model is unsuitable for representing the perturbations of Plutinos. The idea of the multiple-arc model designed for Plutinos can be readily generalized to other MMRs heavily populated by small bodies.

astro-ph.EP↗
arXiv2023

Multi-Cluster Aggregative Games: A Linearly Convergent Nash Equilibrium Seeking Algorithm and its Applications in Energy Management

We propose a type of non-cooperative game, termed multi-cluster aggregative game, which is composed of clusters as players, where each cluster consists of collaborative agents with cost functions depending on their own decisions and the aggregate quantity of each participant cluster to modeling large-scale and hierarchical multi-agent systems. This novel game model is motivated by decision-making problems in competitive-cooperative network systems with large-scale nodes, such as the Energy Internet. To address challenges arising in seeking Nash equilibrium for such network systems, we develop an algorithm with a hierarchical communication topology which is a hybrid with distributed and semi-decentralized protocols. The upper level consists of cluster coordinators estimating the aggregate quantities with local communications, while the lower level is cluster subnets composed of its coordinator and agents aiming to track the gradient of the corresponding cluster. In particular, the clusters exchange the aggregate quantities instead of their decisions to relieve the burden of communication. Under strongly monotone and mildly Lipschitz continuous assumptions, we rigorously prove that the algorithm linearly converges to a Nash equilibrium with a fixed step size.We present the applications in the context of the Energy Internet. Furthermore, the numerical results verify the effectiveness of the algorithm.

cs.MA↗
arXiv2023

Concentric Tube Robot Redundancy Resolution via Velocity/Compliance Manipulability Optimization

Concentric Tube Robots (CTR) have the potential to enable effective minimally invasive surgeries. While extensive modeling and control schemes have been proposed in the past decade, limited efforts have been made to improve the trajectory tracking performance from the perspective of manipulability , which can be critical to generate safe motion and feasible actuator commands. In this paper, we propose a gradient-based redundancy resolution framework that optimizes velocity/compliance manipulability-based performance indices during trajectory tracking for a kinematically redundant CTR. We efficiently calculate the gradients of manipulabilities by propagating the first- and second-order derivatives of state variables of the Cosserat rod model along the CTR arc length, reducing the gradient computation time by 68\% compared to finite difference method. Task-specific performance indices are optimized by projecting the gradient into the null-space of trajectory tracking. The proposed method is validated in three exemplary scenarios that involve trajectory tracking, obstacle avoidance, and external load compensation, respectively. Simulation results show that the proposed method is able to accomplish the required tasks while commonly used redundancy resolution approaches underperform or even fail.

cs.RO↗
arXiv2023

Latent Semantic Diffusion-based Channel Adaptive De-Noising SemCom for Future 6G Systems

Compared with the current Shannon's Classical Information Theory (CIT) paradigm, semantic communication (SemCom) has recently attracted more attention, since it aims to transmit the meaning of information rather than bit-by-bit transmission, thus enhancing data transmission efficiency and supporting future human-centric, data-, and resource-intensive intelligent services in 6G systems. Nevertheless, channel noises are common and even serious in 6G-empowered scenarios, limiting the communication performance of SemCom, especially when Signal-to-Noise (SNR) levels during training and deployment stages are different, but training multi-networks to cover the scenario with a broad range of SNRs is computationally inefficient. Hence, we develop a novel De-Noising SemCom (DNSC) framework, where the designed de-noiser module can eliminate noise interference from semantic vectors. Upon the designed DNSC architecture, we further combine adversarial learning, variational autoencoder, and diffusion model to propose the Latent Diffusion DNSC (Latent-Diff DNSC) scheme to realize intelligent online de-noising. During the offline training phase, noises are added to latent semantic vectors in a forward Markov diffusion manner and then are eliminated in a reverse diffusion manner through the posterior distribution approximated by the U-shaped Network (U-Net), where the semantic de-noiser is optimized by maximizing evidence lower bound (ELBO). Such design can model real noisy channel environments with various SNRs and enable to adaptively remove noises from noisy semantic vectors during the online transmission phase. The simulations on open-source image datasets demonstrate the superiority of the proposed Latent-Diff DNSC scheme in PSNR and SSIM over different SNRs than the state-of-the-art schemes, including JPEG, Deep JSCC, and ADJSCC.

eess.IV↗
arXiv2023

Study on Soft Robotic Pinniped Locomotion

Legged locomotion is a highly promising but under-researched subfield within the field of soft robotics. The compliant limbs of soft-limbed robots offer numerous benefits, including the ability to regulate impacts, tolerate falls, and navigate through tight spaces. These robots have the potential to be used for various applications, such as search and rescue, inspection, surveillance, and more. The state-of-the-art still faces many challenges, including limited degrees of freedom, a lack of diversity in gait trajectories, insufficient limb dexterity, and limited payload capabilities. To address these challenges, we develop a modular soft-limbed robot that can mimic the locomotion of pinnipeds. By using a modular design approach, we aim to create a robot that has improved degrees of freedom, gait trajectory diversity, limb dexterity, and payload capabilities. We derive a complete floating-base kinematic model of the proposed robot and use it to generate and experimentally validate a variety of locomotion gaits. Results show that the proposed robot is capable of replicating these gaits effectively. We compare the locomotion trajectories under different gait parameters against our modeling results to demonstrate the validity of our proposed gait models.

cs.RO↗