检索结果-内蒙古大学图书馆

Optimal Sensor Placement for Full-Set TDOA Localization Accounting for Sensor Location Errors

IEEE Transactions on Aerospace and Electronic systems 2025年

作者： Zhang, Chengjie Han, Xinyang Kong, He Ho, K.C. Southern University of Science and Technology Shenzhen Key Laboratory of Control Theory and Intelligent Systems Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology Shenzhen518055 China University of Missouri Electrical Engineering and Computer Science Department ColumbiaMO65211 United States

The positioning accuracy of a signal source is influenced by where the sensors are deployed. Studies in the literature for the optimal sensor placement (OSP) of localization often ignore the presence of sensor position errors. In practice, however, it is impossible to place the sensors precisely at the desired locations. This work designs OSP by accounting for the presence of Gaussian sensor position errors that are independent and identically distributed (IID), with the full set of Time Difference of Arrival measurements corrupted by Gaussian IID noise. The criterion is the A-optimality equal to the trace of the source position Cramer-Rao Bound (CRB). We show that the presence of sensor position errors introduces a multiplication factor to the same criterion for the case without sensor position errors. The latter factor is dependent on the ratio of the sensor position error power to the range difference noise power but independent of the sensor positions, implying that the A-optimality OSP in the presence of sensor position errors is the same as in the absence. To our knowledge, this is the first time such results have been derived. Simulation studies validate the derived OSP, show the minimal OSP performance gap with sensor positioning error and without, and illustrate the better source localization accuracy by OSP. © 1965-2011 IEEE.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

Wavelet Convolutional Neural Network for Low-Resolution Brain MRI Images

Wavelet Convolutional Neural Network for Low-Resolution Brai...

引用

IEEE International Symposium on Biomedical Imaging

作者： Soo Min Oh Yifan Li Jo Woon Chong Wireless Information and Network Sciences Laboratory Massachusetts Institute of Technology Cambridge MA USA Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA USA Department of Statistics Texas A&M University College Station TX USA Department of Electrical and Computer Engineering Texas Tech University Lubbock TX USA Department of Electrical and Computer Engineering Sungkyunkwan University Suwon Korea

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

Low-resolution images inherently contain less information, making effective feature extraction more challenging and posing difficulties for training neural networks. However, if neural networks can be trained successfully on low-resolution images, this could significantly reduce memory storage requirements and computational costs. In this study, we address the limitations of low-resolution brain MRI images by enhancing the available information through wavelet transform techniques. Specifically, we leverage the high-frequency coefficients obtained from wavelet transforms and the Hurst exponent to improve feature representation and optimize model training for convolutional neural networks (CNN), which is referred to as the wavelet CNN (WCNN). We demonstrate that WCNN outperforms standard CNNs in multi-class classification tasks, distinguishing among four categories of brain MRI images such as normal, glioma, meningioma, and pituitary tumor images. This approach highlights the potential to achieve high classification accuracy even with low-resolution data, ultimately reducing the memory and computational resources required for data processing and model training.

关键词： Wavelet transforms Training Accuracy Magnetic resonance imaging Computational modeling Brain modeling Feature extraction Data models Convolutional neural networks Tumors

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Adaptive Filter for Head Tracking in Augmented Reality (AR)-based Flight Simulators

引用

IEEE Transactions on computers 2025年

作者： Nwobodo, Onyeka J. Kuaban, Godlove Suila Nkemeni, Valery Wereszczynski, Kamil Cyran, Krzysztof A. Silesian University of Technology Department of Computer Graphics Vision and Digital Systems Faculty of Automatic Control Electronics and Computer Science Gliwice Poland Polish Academy of Sciences Institute of Theoretical and Applied Informatics Poland University of Buea Laboratory of Electrical Engineering and Computing Faculty of Engineering and Technology Buea Cameroon

This paper presents a novel approach for head tracking in augmented reality (AR) flight simulators using an adaptive fusion of Kalman and particle filters. This fusion dynamically balances the strengths of both algorithms, leveraging Kalman filters for computational efficiency and particle filters for handling non-linearities based on real-time factors such as sensor noise and head movement patterns. Our method demonstrates superior tracking precision and reduced latency, making it particularly effective for immersive pilot training in AR-based flight simulations. While focused on flight simulation, our approach holds high potential for broader applications in other AR and virtual reality (VR) environments where precise, real-time head tracking is crucial. These results provide actionable design guidance for developers optimizing tracking systems in environments that require fast response times and high accuracy. Future extensions of this research could explore the generalization of our approach across diverse AR applications, including human-computer interaction (HCI), medical simulations, and gaming. © 1968-2012 IEEE.

关键词： Flight simulators

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Leader-Follower Formation Tracking control of Quadrotor UAVs Using Bearing Measurements

arXiv

引用

arXiv 2025年

作者： Doodeman, Sander Tang, Zhiqi Jacinto, Marcelo Cunha, Rita Silvestre, Carlos Department of Mechanical Engineering TU/e Eindhoven University of Technology Eindhoven Netherlands Division of Decision and Control Systems KTH Royal Institute of Technology Sweden Instituto Superior Técnico University of Lisbon Portugal Department of Electrical and Computer Engineering Faculty of Science and Technology University of Macau China

This work addresses the practical problem of distributed formation tracking control of a group of quadrotor vehicles in a relaxed sensing graph topology with a very limited sensor set, where only one leader vehicle can access the global position. Other vehicles in the formation are assumed to only have access to inter-agent bearing (direction) measurements and relative velocities with respect to their neighbor agents. A hierarchical control architecture is adopted for each quadrotor, combining a high-gain attitude inner-loop and an outer-loop bearing-based formation controller with collision avoidance augmentation. The proposed method enables a group of quadrotors to track arbitrary bearing persistently exciting desired formations, including time-varying shapes and rotational maneuvers, such that each quadrotor only requires relative measurements to at least one neighboring quadrotor. The effective performance of the control strategy is validated by numerical simulations in MATLAB and real-world experiments with three quadrotors. © 2025, CC BY-NC-ND.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Improved Synthesis of Nondeterministic Publicly-Known Edit Functions for Opacity Enforcement

引用

IEEE Transactions on Automatic control 2025年

作者： Liu, Rongjian Hadjicostis, Christoforos N. Chongqing Normal University National Center for Applied Mathematics in Chongqing Chongqing401331 China Southeast University Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Nanjing210096 China University of Cyprus Department of Electrical and Computer Engineering Nicosia Cyprus

In this paper, we investigate the synthesis problem of edit functions for opacity enforcement in systems modelled as partially-observed finite-state automata. For better plausible deniability for the edit functions, in cases where the intruder may learn/know their existence, a synthesis problem for nondeterministic edit functions under a publicly-known setting was introduced in the literature, but not yet fully solved. In light of this, we revisit the publicly-known edit mechanism by proposing a sound and complete approach for solving the synthesis problem of nondeterministic publicly-known edit functions. For practical applications, the edit function is assumed to have limited erasure and insertion ability. Our approach is based on a new labelled finite-state structure, and results in wider applicability than previously-proposed in the literature. © 1963-2012 IEEE.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

System Level Synthesis for Affine control Policies: Model Based and Data-Driven Settings

arXiv

引用

arXiv 2025年

作者： Schüepp, Lukas De Pasquale, Giulia Dörfler, Florian Alonso, Carmen Amo Automatic Control Laboratory Department of Electrical Engineering and Information Technology ETH Zurich Physikstrasse 3 Zurich8092 Switzerland Computer Science Department of Stanford University Palo AltoCA United States Control Systems Group Department of Electrical Engineering TU Eindhoven Flux Groene Loper 19 Eindhoven5612AP Netherlands

There is an increasing need for effective control of systems with complex dynamics, particularly through data-driven approaches. System Level Synthesis (SLS) has emerged as a powerful framework that facilitates the control of large-scale systems while accounting for model uncertainties. SLS approaches are currently limited to linear systems and time-varying linear control policies, thus limiting the class of achievable control strategies. We introduce a novel closed-loop parameterization for time-varying affine control policies, extending the SLS framework to a broader class of systems and policies. We show that the closed-loop behavior under affine policies can be equivalently characterized using past system trajectories, enabling a fully data-driven formulation. This parameterization seamlessly integrates affine policies into optimal control problems, allowing for a closed-loop formulation of general Model Predictive control (MPC) problems. To the best of our knowledge, this is the first work to extend SLS to affine policies in both model-based and data-driven settings, enabling an equivalent formulation of MPC problems using closed-loop maps. We validate our approach through numerical experiments, demonstrating that our model-based and data-driven affine SLS formulations achieve performance on par with traditional model-based MPC. © 2025, CC BY.

关键词： Distributed parameter control systems

来源：评论

学校读者我要写书评

暂无评论

Explainable Application Intent for Zero-Touch Networking: An Incorporation of Hypergraph and Transformer

引用

IEEE Transactions on Communications 2025年

作者： Wu, Bing Zou, Sai Liwang, Minghui Ni, Wei Wang, Xianbin Guizhou University College of Big Data and Information Engineering China National Key Laboratory of Autonomous Intelligent Unmanned Systems Department of Control Science and Engineering China Tongji University Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai China Data61 CSIRO Australia Department of Electrical and Computer Engineering Western University Canada

The autonomous interpretation of application intent (APPI) represents the primary step towards achieving closed-loop autonomy in zero-touch networking (ZTN) and also a prerequisite for intent-based networking (IBN). However, understanding APPIs and invoking the corresponding network resources require network professionals with extensive technical expertise to customize network service requests (NSRs), which presents significant challenges for the large-scale deployment of ZTN. This paper investigates an interesting problem of autonomous interpretation of APPIs for ZTN, where a novel mechanism integrating hypergraph and transformer with completeness assurance (HyperTrans-CA) is proposed. In particular, we first involve the Bayesian theory to model APPIs interpretability as maximizing the correct transition probability, where hypergraph is used to describe the complex relationship between application characteristics (e.g., scenario function, and performance) and NSRs, including network devices, virtual network functions (VNFs), and resources. Then, the hypergraph is integrated into the encoder, decoder, and attention mechanisms of Transformer, and a completeness assurance mechanism is designed to improve the prediction accuracy. The convergence of HyperTrans-CA and the corresponding convergence speed of the hypergraph-boosted Transformer in the graph search process are also analyzed. Comprehensive simulations and empirical measurements regarding industrial internet demonstrate that HyperTrans-CA can effectively explain/understand APPIs. Compared to the state-of-the-art Transformer and ChatGPT3.5 models, HyperTrans-CA improves the prediction accuracy of APPIs mapped to VNFs by 23% and 46%, respectively, while raising the prediction accuracy of VNF locations by 8.6 and 17.3 times. © 2025 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Innate Cyber-Immunity and Acquired Cyber-Immunity across Multi-Area Power systems

引用

IEEE Transactions on Power systems 2025年

作者： Hou, Jiazuo Song, Yue Hou, Yunhe Peng, Jimmy Chih-Hsien National University of Singapore Department of Electrical and Computer Engineering Singapore Tongji University Department of Control Science and Engineering National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology Shanghai201804 China The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong University of Hong Kong Shenzhen Institute of Research and Innovation Shenzhen518057 China

Organisms have evolved innate and acquired immune systems to defend against pathogens like coronaviruses. Similarly, power networks, threatened by cyber-attacks, desire cyber-immunity. Inspired by the immunology research, this study develops a cyber-immune strategy-characterizing innate cyber-immunity and establishing acquired cyber-immunity-for any selected portion of a power network (termed as power subnetwork) against stealthy false data injection (FDI) cyberattacks. Therein, without extrinsic protection and information asymmetry, this paper for the first time confirms the existence and provides closed-form conditions for power subnetworks that are innately immune to FDI cyber-attacks despite all measurements being compromised. Single-leader-multi-follower bi-level optimization models are then developed to strategically allocate measurement protection, leading to the acquired cyber-immunity, whose conditions for existence and the least cost are explicitly formulated. More importantly, a bi-directional cyber-immunity propagation mechanism is presented to provide the optimal spatial allocation of defense resources across adjacent subnetworks. It also explicitly determines the temporal allocation sequence, revealing its sequential and cumulative impacts on establishing cyber-immunity. This is achieved by designing recursive traversal algorithms, one of which is modelled as a post-order depth-first-search problem of a multi-fork tree. The proposed subnetwork-specific cyber-immune strategy is verified in a modified Australian National Electricity Market. © 1969-2012 IEEE.

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

Constrained Optimization with decision-Dependent Distributions

引用

IEEE Transactions on Automatic control 2025年

作者： Wang, Zifan Liu, Changxin Parisini, Thomas Zavlanos, Michael M. Johansson, Karl H. KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures StockholmSE-10044 Sweden East China University of Science and Technology Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education Shanghai200237 China Imperial College London Department of Electrical and Electronic Engineering LondonSW7 2AZ United Kingdom Aalborg University Department of Electronic Systems Denmark University of Trieste Department of Engineering and Architecture Italy Duke University Department of Mechanical Engineering and Materials Science DurhamNC United States

In this paper we deal with stochastic optimization problems where the data distributions change in response to the decision variables. Traditionally, the study of optimization problems with decision-dependent distributions has assumed either the absence of constraints or fixed constraints. This work considers a more general setting where the constraints can also dynamically adjust in response to changes in the decision variables. Specifically, we consider linear constraints and analyze the effect of decision-dependent distributions in both the objective function and constraints. Firstly, we establish a sufficient condition for the existence of a constrained equilibrium point, at which the distributions remain invariant under retraining. Moreover, we propose and analyze two algorithms: repeated constrained optimization and repeated dual ascent. For each algorithm, we provide sufficient conditions for convergence to the constrained equilibrium point. Furthermore, we explore the relationship between the equilibrium point and the optimal point for the constrained decision-dependent optimization problem. Notably, our results encompass previous findings as special cases when the constraints remain fixed. To show the effectiveness of our theoretical analysis, we provide numerical experiments on both a market problem and a dynamic pricing problem for parking based on real-world data. © 1963-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：