Papers

Pinching antennas enable radiation points to be created and reconfigured along extended waveguides, making the physical locations of wireless transmission and reception controllable after infrastructure deployment. This capability introduces a spatial degree of freedom beyond conventional beamforming and resource allocation, with implications that extend from individual links to network-wide operation. This tutorial develops a network-oriented perspective on pinching-antenna systems. We first review their system architecture, channel characteristics, and fundamental design opportunities. We then examine how radiation-location reconfigurability can support environment-division multiple access by strengthening desired links and suppressing cross-links, and discuss its roles in multi-cell transmission, traffic offloading, and inter-cell cooperation. Moving from instantaneous users to entire service regions, we introduce traffic-aware and geometry-aware designs under a cell-free-inspired multi-waveguide architecture. Representative system models, optimization problems, analytical illustrations, and numerical results are provided to explain the main design tradeoffs and network-level insights. We further discuss generalized physical realizations and representative deployment modes, including standalone, conventional base-station-integrated, and distributed deployments, together with their main implementation considerations. Finally, we identify future research directions involving mobility management, programmable and virtualized radio access, environment knowledge acquisition, AI-native control, low-altitude networks, space-air-ground integration, and integrated sensing and communication. Overall, this tutorial presents radiation locations as configurable network resources and provides a framework for understanding how pinching antennas may reshape future wireless network.

This work introduces quantum-inspired tensor-network circuits as trainable transforms for image inpainting. Among the proposed architectures, the diagonal quantum Fourier transform (QFT) relaxation is invertible with $O(N^2 \log N)$ computational cost for $N\times N$ images, inherently preserving minimum coherence throughout training via its circuit structure and eliminating the need for explicit coherence penalties. Unconstrained gradient-based phase optimization (Riemannian-optimization free) enables efficient learning from randomly sampled training data, allowing the learned transform to generalize to test images observed through fixed sampling masks. Numerical tests show that the learned models outperform fixed transforms and per-image optimization while matching the performance of much larger unitary architectures, yet with far fewer parameters.

Efficient physical resource block (PRB) allocation in 5G networks requires accurate demand forecasting. Conventional methods minimize symmetric error metrics (MAE, RMSE), ignoring the operational cost asymmetry where under-provisioning (service degradation) is far costlier than over-provisioning (wasted capacity). We propose a goal-oriented probabilistic forecasting framework that aligns model training with the operator's decision-making objectives. Specifically, we train DeepAR and Temporal Fusion Transformer (TFT) models using the Pinball Loss function and derive the optimal allocation quantile from the operator's cost matrix. Evaluation on a real beam-level 5G traffic dataset shows that the proposed approach reduces operational cost compared to MSE-trained baselines while maintaining calibrated uncertainty estimates. The framework enables dynamic PRB allocation that explicitly balances service reliability against resource efficiency.

Recently, dynamic state feedback controllers that are based on dynamic extensions have been presented for heterodirectional hyperbolic systems. In this paper, a similar concept for the control of coupled diffusion-reaction systems is suggested. The introduction of a specific controller dynamics leads to homogenized diffusion coefficients for the extended system. Then, a backstepping-based static state feedback for the dynamically extended system is designed, which, overall, results in a dynamic state feedback. Such a design allows stabilizing a more general class of parabolic systems as well as assigning arbitrary closed-loop dynamics. This can be used, e.g., to achieve a decoupled input-output behavior, which is, in general, not possible with a static state feedback. A simulation example illustrates the results.

Finite-dimensional Koopman models enable efficient linear prediction and control of nonlinear robotic systems. However, models learned purely from trajectory data may violate the energetic structure of the underlying mechanics, producing predictions that exhibit artificial energy growth and diverge under recursive propagation. This work presents a structure-preserving Koopman framework for Euler-Lagrange systems built on generalized-momentum coordinates. The momentum transformation exposes the mechanical actuation as a known, state-independent port, which is preserved explicitly in the lifted dynamics. A structure-constrained neural architecture is developed to jointly learn the lifting functions and a port-Hamiltonian Koopman generator, rendering the learned dynamics passive by construction rather than through penalty terms or post-hoc projection. A Cayley-midpoint discretization further preserves the corresponding storage-dissipation balance exactly in discrete time. These properties are established analytically by deriving the discrete storage balance and associated stability guarantees of the learned predictor. Simulation and experimental studies demonstrate improved prediction accuracy, data efficiency, and closed-loop tracking over Koopman baselines, with increasing gains for higher-dimensional systems.

Reliable estimation of vehicle orientation, centroid, and footprint is important for representing road-user occupancy during vehicle turns at intersections and other common road maneuvers. During a turn, the vehicle orientation and direction of motion may differ, and coupling the orientation with the axial scales can degrade both orientation and extent estimates. This paper proposes a trajectory cardinalized probability hypothesis density filter with a Decoupled Orientation and Axial-Scale Estimation (DOAM) model for multiple-vehicle tracking. The model represents the kinematic, orientation, and squared semi-axis-length states separately within each trajectory component, reducing the mutual interference between orientation variation and scale estimation without introducing an additional interacting multiple-model structure. A structured coordinate-ascent variational inference recursion jointly updates these state sequences and the measurement-source variables. The trajectory-component likelihood and weight update associated with the decoupled representation are derived while retaining the standard cardinality recursion. A fixed-lag trajectory implementation further uses current measurements to correct historical states within the smoothing window. Evaluation with signalized-intersection simulations and real onboard LiDAR measurements shows improved estimation of vehicle orientation, centroid, and extent, particularly during turns. The resulting vehicle-state and footprint estimates provide information for road-user occupancy perception and subsequent collision-risk assessment and motion planning.

In geometrical acoustics, room impulse responses (RIRs) can be represented by a set of image sources in free space. For a fixed source position, the image sources allow for computing RIRs at arbitrary receiver positions. However, for a moving physical source, the image sources also move, making interpolation more difficult. In this paper we develop an interpolation method for image source positions of a moving source, given image source positions at the start and end of the trajectory. The method exploits the fact that each image source moves the same distance as the physical source. A statistical model is developed to derive cost functions and an appropriate dummy cost used in the proposed partial optimal transport (POT) approach. Through simulated experiments, POT using the proposed cost functions is shown to be effective compared to the alternatives.

Text-to-speech that reads raw text has no lexicon: a rare word is read as guessed, and a native Japanese listener accepts a word only if its reading and pitch accent are both right. A known remedy installs a reading-and-accent channel into a released model, but it needs many recordings. This paper removes the recordings: the frozen backbone reads a sentence containing a common word it already says correctly, and that output serves as the teacher for the same sentence with the word replaced by an annotated reading with its pitch accent. Screened raters judged the tag right on 0.80 to 0.93 of unseen difficult words on four backbones spanning autoregressive, diffusion, and encoder-decoder synthesis; plain kana, which cannot express an accent, got 0.38 to 0.60. On words needing no edit, naturalness is non-inferior on one backbone; on the other three, listeners prefer the unedited rendition by 0.19 to 0.26.

Wavelets and frames that provide strong guarantees for signal representations are a cornerstone in signal processing theory, but have long been restricted to non-causal settings. Recent work extended wavelet analysis to time-causal systems that operate on streaming signals, with exact reconstruction and time-recursive implementations. However, the frame guarantees that make such representations reliable under noise and quantization are uncharacterized. We derive closed-form frame bounds and conditioning on band-limited domains, together with peak frequencies, constant-Q bandwidth tiling, and spectral decay rates for time-causal bandpass wavelets. Our work provides design rules for the scale ratio and channel count, which we validate numerically against discrete implementations of the causal wavelets in terms of recursive filters.

This article investigates data-driven policy iteration (PI) for continuous-time linear systems without requiring an initially stabilizing policy. Standard infinite-horizon PI is not self-starting because its policy-evaluation step is well posed only when the feedback gain is stabilizing. However, verifying this property is difficult when the system matrices are unknown. To remove this requirement, we develop a finite-horizon bootstrap method. The key idea is to perform policy evaluation over a compact interval for a shifted system, where the evaluation equation is well defined for arbitrary bounded time-varying policies. We show that, for a sufficiently long horizon, the initial-time optimal gain of the shifted finite-horizon problem, when applied as a constant feedback gain, achieves a prescribed stability margin for the original system. We then derive a data-driven implementation from an off-policy identity evaluated along trajectories of the original plant. We use basis-function approximations to reconstruct the finite-horizon value matrix and policy, and we characterize the resulting error through a perturbed policy-improvement recursion. A data-driven Lyapunov certificate is further introduced to verify admissibility of the candidate gain before it is used to initialize infinite-horizon PI. Numerical studies of a batch reactor and a two-mass-spring system demonstrate the effectiveness of the proposed bootstrap method.

Low Earth Orbit (LEO) Positioning, Navigation, and Timing (PNT) systems operating in L-band Radionavigation-Satellite Service (RNSS) spectrum are rapidly emerging through both commercial and governmental initiatives. These systems are intended to complement traditional Medium Earth Orbit (MEO) constellations, such as GPS and Galileo, by providing improved satellite geometry, higher received signal power, and greater orbital diversity. As with any new RNSS deployment, ensuring compatibility with existing systems is essential to prevent harmful interference and preserve established services. While compatibility assessments for terrestrial GNSS receivers have been studied extensively, compatibility with spaceborne receivers has received comparatively little attention due to the large separation distances between MEO GNSS constellations and most spacecraft. In contrast, LEO PNT systems operate in close proximity to other satellites in LEO, making spaceborne receiver compatibility an important consideration. This paper extends the established ITU-R compatibility assessment methodology, originally developed for terrestrial receivers, to spaceborne GNSS users. The analysis evaluates the factors affecting carrier-to-noise ratio (C/N0) degradation of legacy GNSS signals in orbital environments. Results show that, although spaceborne receivers may experience higher received power levels from nearby LEO PNT satellites, such as Xona's Pulsar constellation, they can operate compatibly alongside legacy RNSS.

A walking robotic hand must use the same fingers to move its body, support its weight, and interact with the environment. We show how an anthropomorphic hand can learn these skills while retaining its finger design and position controller. Onboard power and computation make the platform self-contained. Our reinforcement learning approach accounts for the hand's unequal fingers, with training in a simulator calibrated from hardware measurements. In simulation, the hand moves faster with our reward formulation than with tuned rewards originally designed for quadrupeds. On hardware, task-specific policies enable untethered crawling, steering, and fall recovery. While supporting its own weight, the hand also executes successive keyboard commands without vision and pushes an object to targets using overhead visual feedback. These results demonstrate a compact mobile manipulator that reuses its fingers for locomotion and interaction, without a separate locomotion mechanism.

We study an optimal intervention problem for linear threshold models. This is a popular class of dynamical network systems whereby a number of agents, identified with the nodes of a graph, strategically change their binary action (0 or 1) according to a threshold rule. Specifically, an agent adopts action 1 if and only if the fraction of its neighbors in the interaction graph that do so is greater than or equal to a prescribed threshold. Assuming that a planner can modify the agents' thresholds at a cost equal to the aggregate threshold increase, we study the minimum intervention cost needed to ensure global convergence to the all-1 configuration. Our main contribution is the introduction of a new graph-theoretic quantity, called oriented path number, that is the minimum number of disjoint paths needed to cover the graph that can be oriented to form a directed acyclic graph. When thresholds are all equal to 1/2, the optimal cost is shown to coincide with the oriented path number, whereas, in the general case, it turns out to be the main ingredient of a bound on the optimal intervention cost.

Geospatial foundation models provide reusable representations of satellite imagery that support downstream mapping with limited task-specific modelling. We evaluate whether annual AlphaEarth embeddings support binary cultivated-versus-non-cultivated mapping in Maine, USA, using 192 spatially separated patches and labels derived from the USDA Cropland Data Layer (CDL). Without fine-tuning the foundation model, a lightweight classifier reaches 93.7% overall accuracy and 90.8% balanced accuracy on held-out patches. Logistic regression is within 0.3 percentage points of a gradient-boosted ensemble, while a nearest-class-centroid rule, which uses class centroids but fits no parameters, reaches 90.2%. A balanced sample of 60,000 labelled pixels is within 1.3 percentage points of the full pool of 8.6 million pixels; because pixels are spatially autocorrelated, this result concerns pixel-sample efficiency rather than 60,000 independent annotation sites. In a same-region transfer experiment, classifiers trained in one year remain accurate across 2018 to 2023. Against a blind, two-interpreter consensus at 385 randomly sampled points in one contiguous 2023 block, the AlphaEarth-plus-random-forest map agrees at 95.3% ($\kappa=0.82$), compared with 91.7% for the CDL ($\kappa=0.72$; exact two-sided McNemar $p=0.0161$). This local result is consistent with partial smoothing of CDL label noise, but it does not establish statewide correction of the reference product. On the same points, the difference from a fine-tuned TerraMind segmentation model is not statistically significant (95.3% versus 93.5%; $p=0.14$), and the experiment is not a controlled comparison of computational cost. These results support frozen geospatial embeddings as a low-compute candidate for regional cropland mapping, subject to the limits of a single-state study, a 30 m-derived training reference, and a one-block human validation.

Distributionally robust (DR) optimization seeks decisions that perform best under the most adverse law within a given ambiguity set, enabling the design of data-driven controllers with strong out-of-sample guarantees in the face of uncertainty. In this paper, we study the conservatism introduced by safeguarding against distributional ambiguity. Specifically, we consider the data-driven Wasserstein DR linear quadratic control problem, and we analyze the suboptimality of the corresponding solution relative to the oracle controller computed with foreknowledge of the underlying unknown uncertainty distribution. We present a sample complexity bound that characterizes the number of samples required to ensure that the true cost of the DR solution exceeds that of the oracle controller by at most a user-defined tolerance factor. Our analysis reveals that the suboptimality of the DR solution increases at most linearly with the Wasserstein radius for sufficiently small distributional ambiguity, and at most quadratically away from this local regime. Numerical simulations validate our bounds on the price of distributional robustness.

Three-dimensional (3D) reconstruction of histopathology tissue requires accurate pairwise registration of serial whole-slide images (WSIs). Cross-stain benchmarks have advanced registration of differently stained histology, including structural-to-immunohistochemistry (IHC) pairs, but serial renal biopsy stacks remain difficult: they interleave several structural stains with diverse IHC markers whose expression can be sparse or absent, leaving few shared features to match. We present StainBridge, a stain-aware framework for registering serial renal biopsy WSIs across structural and IHC stains. StainBridge couples three preprocessing components, stain deconvolution, intensity normalization, and tissue-mask injection, with XFeat-based affine initialization and four nonrigid backends (VoxelMorph, ConvexAdam, FireANTs, and DeeperHistReg). We evaluate it on 23 cases comprising 338 WSIs, four structural stains, and ten IHC markers, with functional tissue units annotated on consecutive sections to give 1,468 landmark correspondences across 272 image pairs, and report tissue-mask Dice, functional-unit centroid error in micrometers, and tissue-restricted structural similarity. Nonrigid refinement improves on the affine initialization for three of four backends, VoxelMorph being the exception. DeeperHistReg, which computes its own initialization rather than relying on XFeat, gives the best pooled landmark accuracy and registers the most pairs, including every attempted structural-IHC pair. Preprocessing improves landmark accuracy for ConvexAdam and FireANTs in every stain-pairing category, and FireANTs shows both the largest single preprocessing gain on structural-IHC pairs and the best pooled tissue overlap. These results offer practical guidance for cross-stain registration and a foundation for integrated 3D analysis of renal tissue architecture and molecular expression.

The Asset Administration Shell (AAS) is increasingly recognized as a fundamental model for the realization of and data exchange between digital twins in manufacturing. An AAS defines a hierarchical data structure to represent any type of asset throughout its entire lifecycle. In the context of AAS-based systems, comparing different AAS instances constitutes a practical challenge, as neither a widely accepted methodological framework nor a maturity model are available to systematically support such analyses. To address this gap, we propose a novel concept of AAS maturity that characterizes the extent to which established digital twin criteria are met and thus enabling comparability of AAS instances. The concepts are derived from the literature and applied through exemplification. These emerging results enable practitioners and researchers to systematically compare AAS instances and support the identification and assessment of further development steps in the digital twin engineering process.

This supplementary material provides the complete mathematical development for the signal-to-noise ratio loss (SNRL) analysis of pulse-wise spatially randomized encrypted sensing. We first derive a reduced model in which the transmit-side randomization is represented by an independent and identically distributed complex spatial coefficient. Based on this model, we establish the almost-sure and mean asymptotic SNRL, derive the leading bias and variance for a finite coherent processing interval (CPI), and obtain closed-form coefficient moments and asymptotic SNRL for independent Bernoulli element activation. These results complement the concise statements and proof sketches in the associated paper.

Asset Administration Shells (AAS) provide a standardized means of representing assets and their information in manufacturing and increasingly serve as a basis for software services. However, different AAS instances vary in structure, content, and degree of completion, making it difficult to determine whether a given AAS is suitable for a specific application. This paper presents two complementary methods to support the comparison and application-oriented assessment of AAS. First, set-theoretic operations are employed to compare AAS models, enabling the identification of common, missing, and differing submodels and parameters. Second, an AAS suitability model assesses the conformity of an AAS to the requirements of a specific use case. The assessment considers structural conformity, semantic consistency, cardinality, and specification conformity and can be performed either against a reference AAS or a set of required SemanticIDs. A suitability value is derived from the identified deviations and is complemented by a detailed report of missing or non-conforming information. The proposed approach support practitioners and researchers in the comparison of evolving AAS and provide application-specific information on their suitability for manufacturing software services.

DoA estimation often requires not only accurate recovery of source directions, but also reliable characterization of the uncertainty in these estimates. While classical subspace methods such as ESPRIT provide principled uncertainty analyses, their performance and uncertainty quantification rely on restrictive assumptions. Recent deep learning approaches alleviate these limitations and enable robust. DoA estimation in challenging conditions, but generally provide point estimates and lack principled uncertainty characterization. In this work, we develop an AI-aided framework for joint DoA estimation and uncertainty quantification that combines the robustness of model-based deep learning with the analytical foundations of classical subspace methods. Building on AI surrogate covariance recovery, we extend existing ESPRIT uncertainty analyses to characterize the full covariance structure of the DoA estimation error and integrate this characterization into a subspace-oriented deep learning architecture. We further propose a dedicated learning strategy that jointly promotes accurate DoA recovery and faithful uncertainty estimation. The resulting methodology preserves the interpretable processing pipeline of classical subspace methods while enabling reliable operation in regimes where conventional approaches struggle. Our numerical studies demonstrate that the proposed framework consistently achieves accurate DoA estimation together with reliable uncertainty characterization across diverse challenging scenarios, including coherent sources, limited snapshots, and array calibration errors.

Linearly constrained minimum variance (LCMV) beamforming is a fundamental technique for controlling the array response toward multiple desired signals while suppressing interference and noise. In practical systems, however, the steering vectors involved in the response constraints are often affected by direction-of-arrival errors, calibration imperfections, and other array uncertainties. Such mismatches may cause constraint violations and substantial performance degradation. This paper investigates multi-signal LCMV beamforming under steering-vector mismatch and develops probabilistic constraints to guarantee a prescribed reliability level for each desired signal. Several uncertainty-information settings are considered. When the exact mismatch distribution is known and belongs to the class of complex elliptically symmetric distributions (CES), a distribution-informed convex safe reformulation is derived using exact CES quantiles. When the mismatch distribution is unknown, and only partial statistical information or empirical data is available, robust probabilistic reformulations are developed under moment-based ambiguity, support-based uncertainty, and Wasserstein data-driven ambiguity, and the resulting deterministic formulations can be expressed as convex second-order cone programs. Numerical experiments show that the proposed designs improve out-of-sample reliability and reduce beam-gain sensitivity to steering-vector mismatch, while maintaining competitive output signal-to-interference-plus-noise (SINR) ratio and robust beampatterns.

Channel state information (CSI) prediction has emerged as a promising approach for mitigating channel aging in wireless communication systems. Recently, generative models have been employed to develop CSI prediction frameworks capable of modeling the uncertainty in future channel realizations. However, the high computational complexity and inference latency of these models remain major obstacles to their practical deployment. To address these challenges, this paper focuses on a class of one-step generative models, namely MeanFlow models, in which inference requires only a single neural function evaluation (NFE), significantly reducing computational cost and latency. To alleviate the difficulty of generating CSI directly from noise, we introduce a channel-informed prior that initializes the generation process from an informative estimate of the future channel rather than pure Gaussian noise. Incorporating this channel-informed prior substantially improves both point prediction accuracy and uncertainty calibration. Furthermore, we compare the proposed MeanFlow-based CSI prediction framework with a recent diffusion-based approach. The results demonstrate that MeanFlow achieves comparable point prediction accuracy while producing better-calibrated CSI predictions with only a single NFE.

Social networks in which algorithms actively influence humans through personal recommendations are ubiquitous. While opinion dynamics is an established tool to analyze these systems, existing models typically do not capture how individual agents process personal recommendations. In this work, we introduce a model for personal recommendations that is analytically tractable and consistent with the confirmation bias phenomenon from behavioral psychology. We describe how individuals process recommendations based on prior beliefs and a sensitivity parameter using a Gaussian influence function. Using this model, we analyze the effect of different recommendation policies. For broadcast policies, where recommendations are homogeneous across the agents, a bifurcation analysis shows that the system exhibits bistability, which may result in unintended consequences. For personally targeted policies, we first derive optimal personal recommendations and then extend to robust convergence when the agents' sensitivity to personal recommendations is uncertain. The collective behavior of the proposed model and the derived policies are illustrated and evaluated through numerical simulations.

The coexistence of terrestrial networks (TNs) with high-altitude platform station (HAPS)-based non-terrestrial networks (NTNs) is a promising approach for extending 6G connectivity, but the resulting cross-network interference can significantly affect TN reliability. This paper investigates an rate-splitting multiple access (RSMA)-based TN operating under interference from a multibeam HAPS-NTN system. The desired TN links are modeled using Nakagami-m fading, while the aggregate HAPS interference is characterized by shadowed-Rician fading. Closed-form outage probability expressions are derived by characterizing the aggregate interference and accounting for both perfect and imperfect successive interference cancellation (SIC). Monte Carlo simulations are used to verify the analytical results and to examine the effects of HAPS transmit power, the number of interfering beams, and SIC imperfections. The results demonstrate that the interference-to-signal power scaling is a key factor determining TN outage behavior, with jointly scaled HAPS interference leading to interference-limited performance. Moreover, RSMA provides improved outage performance compared with non-orthogonal multiple access (NOMA), particularly in the presence of HAPS interference

This paper analyzes the outage performance of a high-altitude platform station (HAPS)-assisted downlink employing rate-splitting multiple access (RSMA). A realistic link budget accounting for free-space path loss, rain attenuation, and atmospheric absorption is combined with elevation-angle-dependent shadowed Rician fading. Closed-form outage probability and throughput expressions are derived for orthogonal frequency allocation and full frequency reuse, where the aggregate inter-beam interference is approximated by a moment-matched Gamma random variable, yielding a tractable finite-sum expression via its Laplace transform. The analytical expressions are validated through Monte Carlo simulations, showing close agreement. Numerical results show that the optimal common stream power allocation depends on the transmit power, while inter-beam interference under frequency reuse introduces an outage floor absent under orthogonal allocation, providing practical design insights for HAPS-RSMA systems

The modernization of railway systems is being driven by the need for greater efficiency, sustainability, and intelligent operation. In this review, recent advancements in dynamic scheduling, energy management, and energy storage systems (ESSs) integration within electric railway networks are analyzed. Optimization strategies for train scheduling and operation control are reviewed, with a focus on methods that reduce energy consumption and improve overall system performance. The role of energy storage technologies is analyzed in terms of energy management, peak shaving, and voltage and frequency control for practical application. The integration of artificial intelligence and advanced control strategies is also reviewed in electrified railway systems. This review provides a comprehensive overview of current research trends and outlines future directions for the development of resilient, energy efficient, and intelligent railway systems with ESSs integration.

This paper examines Smart Grid cybersecurity, emphasizing the critical distinctions between IT and OT environments. It analyzes grid architecture, substation threats, and key international standards, specifically IEC 62351, IEC 62443, and ISO 27001. Finally, it overviews latest research trends, including AI-driven threat detection.

This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid. Specifically, we first formulate a dynamic optimal control problem for the entire network as a convex quadratic program, whereby the charging power profiles of the individual vehicles and the energy flows between hubs and the grid are subject to optimization. Second, we propose a problem decomposition that allows for a distributed solution via ADMM algorithms that preserves global optimality guarantees and privacy of the individual stations. We showcase our framework on a case-study for the Netherlands considering a two-day ahead deterministic formulation with perfect foresight. Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%. Moreover, we verify our distributed algorithm against a centralized solution, paving the way to the optimal operation of large networks and online implementations.

While indoor Internet of Things (IoT) and sensor networks increasingly rely on Wi-Fi access points (APs) to collect high-bandwidth data streams from multiple devices, conventional APs rely on static antenna deployments, whose fixed orientations are often suboptimal in dynamic propagation environments. To overcome this limitation, this paper proposes a mechanical Wi-Fi antenna control system that adaptively optimizes its 3D antenna orientation for dynamic multi-station scenarios. The proposed system autonomously actuates its physical antennas in response to perceived radio environments by combining state-specific black-box optimizers and capacity-based environment change detection. The evaluation results show that the proposed system improves channel capacity under dynamic station combinations, avoids unnecessary re-optimization under transient blockages, and triggers re-optimization after sustained environmental changes such as continuous blockage and device relocation.

The increasing electrification of railway power supply system (RPSS) intensify the operational and economic challenges at the railway power system interface. Energy storage systems (ESSs) can provide fast and flexible support to mitigate short term power spikes and to improve the energy management. However, achieving coordinated operation is challenged by the tight coupling among electrical railway operation and ESS dispatch under time-varying traction demand and network limits. This paper proposes a two-stage coordinated energy management method for electrified RPSSs that jointly optimizes railway system operation, train trajectories and ESS dispatch while explicitly accounting for traction power flow constraints. First, a day-ahead operation stage determines the train operating profiles and the ESS setting decisions to establish the baseline operating plan. Then, an intra-day rolling optimization stage based on adaptive weight economic-model predictive control (AWC-MPC) updates ESS dispatch under refreshed forecasts of traction demand and renewable output. A real Swedish railway case is utilized to minimize the energy purchase cost and the ESS cost while reducing peak grid power, demonstrating its practical applicability with 35.7% peak grid power demand and 28.8% total system cost reduction.