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

IEEE Conference on Decision and control

作者： Gehui Xu Guanpu Chen Baris Fidan Yiguang Hong Hongsheng Qi Thomas Parisini Karl H. Johansson Department of Electrical and Electronic Engineering Imperial College London London UK Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Mechanical and Mechatronics Engineering University of Waterloo Waterloo ON Canada Department of Control Science and Engineering Tongji University shanghai China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China Department of Electronic Systems Aalborg University Denmark Department of Engineering and Architecture University of Trieste Italy

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multiplayer non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies.

关键词： Location awareness Noise Games Position measurement Nash equilibrium Distance measurement Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Robustness Metrics for Defense of Machine Learning Systems

Evaluation of Robustness Metrics for Defense of Machine Lear...

引用

International Conference on Military Communications and Information Systems (ICMCIS)

作者： J. DeMarchi R. Rijken J. Melrose B. Madahar G. Fumera F. Roli E. Ledda M. Aktaş F. Kurth P. Baggenstoss B. Pelzer L. Kanestad Collaborative Engineering Systems & Aerospace Systems Information Supremacy Royal Netherlands Aerospace Centre NLR Amsterdam NLD Cyber & Information Systems Division Defence Science and Technology Laboratory Portondown GBR Department of Electrical and Electronic Engineering University of Cagliari Cagliari ITA Department of Informatics Bioengineering Robotics and Systems Engineering University of Genoa Genoa ITA Department of Computer Control and Management Engineering Sapienza University of Rome Rome ITA Defence Systems Technologies Division ASELSAN Ankara TUR Fraunhofer Institute for Communication Information Processing and Ergonomics Bonn DEU Swedish Defence Research Agency Cyber Defence and C2 Technology Division Stockholm SWE

In this paper we explore some of the potential applications of robustness criteria for machine learning (ML) systems by way of tangible “demonstrator” scenarios. In each demonstrator, ML robustness metrics are applied to real-world scenarios with military relevance, indicating how they might be used to help detect and handle possible adversarial attacks on ML systems. We conclude by sketching promising future avenues of research in order to: (1) help establish useful verification methodologies to facilitate ML robustness compliance assessment; (2) support development of ML accountability mechanisms; and (3) reliably detect, repel, and mitigate adversarial attack.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AdaptiveClick: Clicks-aware Transformer with Adaptive Focal Loss for Interactive Image Segmentation

arXiv

引用

arXiv 2023年

作者： Lin, Jiacheng Chen, Jiajun Yang, Kailun Roitberg, Alina Li, Siyu Li, Zhiyong Li, Shutao The College of Computer Science and Electronic Engineering Hunan University Changsha410082 China The School of Robotics The National Engineering Research Center of Robot Visual Perception and Control Technology Hunan University Changsha410082 China The Institute for Artificial Intelligence The University of Stuttgart Stuttgart70569 Germany The College of Electrical and Information Engineering The Key Laboratory of Visual Perception and Artificial Intelligence of Hunan Province Hunan University Changsha410082 China

Interactive Image Segmentation (IIS) has emerged as a promising technique for decreasing annotation time. Substantial progress has been made in pre- and post-processing for IIS, but the critical issue of interaction ambiguity, notably hindering segmentation quality, has been under-researched. To address this, we introduce ADAPTIVECLICK – a click-aware transformer incorporating an adaptive focal loss that tackles annotation inconsistencies with tools for mask- and pixel-level ambiguity resolution. To the best of our knowledge, AdaptiveClick is the first transformer-based, mask-adaptive segmentation framework for IIS. The key ingredient of our method is the Click-Aware Mask-adaptive transformer Decoder (CAMD), which enhances the interaction between click and image features. Additionally, AdaptiveClick enables pixel-adaptive differentiation of hard and easy samples in the decision space, independent of their varying distributions. This is primarily achieved by optimizing a generalized Adaptive Focal Loss (AFL) with a theoretical guarantee, where two adaptive coefficients control the ratio of gradient values for hard and easy pixels. Our analysis reveals that the commonly used Focal and BCE losses can be considered special cases of the proposed AFL. With a plain ViT backbone, extensive experimental results on nine datasets demonstrate the superiority of AdaptiveClick compared to state-of-the-art methods. The source code is publicly available at https://***/lab206/AdaptiveClick. Copyright © 2023, The Authors. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

control of Smart Buildings and Utility-Scale Batteries Enabling 24/7 Carbon-Free Energy*

Control of Smart Buildings and Utility-Scale Batteries Enabl...

引用

European control Conference (ECC)

作者： Faran A. Qureshi Jeff S. Shamma Robotics Intelligent Systems and Control (RISC) Laboratory Computer Electrical and Mathematical Sciences and Engineering (CEMSE) Division King Abdullah University of Science and Technology (KAUST) Thuwal Saudi Arabia University of Illinois at Urbana-Champaign USA

Wind power is a clean and sustainable source of electricity, but its intermittent nature creates challenges for its grid integration. Utility-scale batteries are a popular and effective solution to make wind power dispatchable, however, batteries are expensive and increase the overall cost of operation. In this paper, we propose utilizing the flexibility in the consumption of smart buildings to reduce the size of the utility-scale batteries needed for the dispatchability of wind energy. A method based on stochastic optimization is proposed to compute the dispatch plan required to participate in the day-ahead energy market. A stochastic model predictive controller is proposed for the control of the buildings and batteries to track the dispatch plan in real-time. Simulations are carried out with realistic building models and real weather, wind power production, and forecast data. Results demonstrate that utilizing the flexibility of building thermodynamics can significantly reduce the size (and usage) of the required battery for making the wind power production dispatchable.

关键词： Smart buildings Computational modeling Stochastic processes Production Wind power generation Predictive models Data models

来源：评论

学校读者我要写书评

暂无评论

Propagating beams carrying orbital angular momentum through simulated optical turbulence generated by Rayleigh–Bénard natural convection

引用

Waves in Random and Complex Media 2023年

作者： Avramov-Zamurovic, S. Judd, K.P. Matt, S. Handler, R.A. Watnik, A.T. Lindle, J.R. Esposito, J.M. Jarrett, W.A. Weapons Robotics and Control Engineering Department United States Naval Academy AnnapolisMD United States United States Naval Research Laboratory WashingtonDC United States Ocean Sciences Division US Naval Research Laboratory John C. Stennis Space Center MS United States Department of Mechanical Engineering George Mason University FairfaxVA United States DCS Corp AlexandriaVA United States

Numerical simulations of Rayleigh–Bénard (RB) convective flow are performed to determine the optical and mechanical turbulence properties and resulting index of refraction field in order to study the propagation characteristics of a laser beam carrying orbital angular momentum. The simulations are carried out in air using a computational fluid dynamics package which solves the Navier-Stokes equations. The computational domain is 0.1 m × 0.5 m × 0.5 m with a temperature difference of 1°K maintained between the top and bottom plate. The simulated temperature field is then converted into refractive index values. To study light propagation through the turbulent volume the split-step screen method is employed with screens at 0.025 m distance from each other along the propagation path which ranges from 0.5 m to 2.5 m. The structure of the phase screens, their spatio-temporal correlation with respect to up/down drafts, and phase changes across regions of interest are discussed. It was observed as the propagation distance increased, the orbital angular momentum carrying Laguerre–Gaussian beams wandered and the beam phase singularity distorted thus impacting the light intensity distribution. In addition, it was found that higher topological charge and order of Laguerre polynomial result in increased distortion of the beam vortex. © 2023 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Laser beams

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Mathematics Southeast University Nanjing210096 China The Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms require that each agent broadcasts its decision to its neighbors at each iteration. To better utilize the limited communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

MG-SLAM: Structure Gaussian Splatting SLAM with Manhattan World Hypothesis

arXiv

引用

arXiv 2024年

作者： Liu, Shuhong Deng, Tianchen Zhou, Heng Li, Liuzhuozheng Wang, Hongyu Wang, Danwei Li, Mingrui Department of Information Science and Technology Department of Complexity Science and Engineering The University of Tokyo Tokyo113-8654 Japan Institute of Medical Robotics Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China Department of Mechanical Engineering Columbia University New York10027 United States School of Electrical and Electronic Engineering Nanyang Technological University Singapore Department of Computer Science Dalian University of Technology Dalian116024 China

Gaussian Splatting SLAMs have made significant advancements in improving the efficiency and fidelity of real-time reconstructions. However, these systems often encounter incomplete reconstructions in complex indoor environments, characterized by substantial holes due to unobserved geometry caused by obstacles or limited view angles. To address this challenge, we present Manhattan Gaussian SLAM, an RGB-D system that leverages the Manhattan World hypothesis to enhance geometric accuracy and completeness. By seamlessly integrating fused line segments derived from structured scenes, our method ensures robust tracking in textureless indoor areas. Moreover, The extracted lines and planar surface assumption allow strategic interpolation of new Gaussians in regions of missing geometry, enabling efficient scene completion. Extensive experiments conducted on both synthetic and real-world scenes demonstrate that these advancements enable our method to achieve state-of-the-art performance, marking a substantial improvement in the capabilities of Gaussian SLAM systems. © 2024, CC BY.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Eco-driving Incentive Mechanisms for Mitigating Emissions in Urban Transportation

arXiv

引用

arXiv 2024年

作者： Umar Niazi, M.B. Cho, Jung-Hoon Dahleh, Munther A. Dong, Roy Wu, Cathy Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Department of Civil and Environmental Engineering Massachusetts Institute of Technology CambridgeMA02139 United States Department of Industrial and Enterprise Systems Engineering University of Illinois at Urbana-Champaign UrbanaIL61801 United States

This paper proposes incentive mechanisms that promote eco-driving in transportation networks with the overarching objective of minimizing emissions. The transportation system operator provides the drivers with energy-efficient driving guidance throughout their trips, and their eco-driving levels are measured by how closely they follow this guidance via vehicle telematics. Drivers choose their eco-driving levels to optimize a combination of their travel times and their emissions. To obtain optimal budget allocation and recommendations for the incentive mechanism, the system operator gathers drivers’ preferences, or types, to assess each driver’s trip urgency and natural willingness to eco-drive. In a setting where drivers truthfully report their types, we introduce the first-best incentive mechanism and show that the obedience condition holds (i.e., drivers find it optimal to comply with the system operator’s recommendations) when the recommended eco-driving profile constitutes a Nash equilibrium. Moreover, in a setting where drivers can strategically report their types, we introduce the second-best incentive mechanism and show that the proposed mechanism is incentive-compatible (i.e., drivers find it optimal to be truthful). Under this mechanism, we also show that all equilibrium outcomes are at least as good as the recommended eco-driving profile in terms of the system operator’s objective. Overall, this work offers a framework for designing eco-driving incentive mechanisms while considering both the strategic behavior of individual drivers and the network effects of collective decision-making. © 2024, CC BY.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Classifying Cover Crop Residue from RGB Images: A Simple SVM versus a SVM Ensemble

Classifying Cover Crop Residue from RGB Images: A Simple SVM...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Parth C. Upadhyay Lokesh Karanam John A. Lory Guilherme N. DeSouza Vision-Guided and Intelligent Robotics (ViGIR) Laboratory Department of Electrical Engineering and Computer Science (EECS) Division of Plant Sciences University of Missouri Columbia MO

ISBN: (纸本)9781728190495

Plant-derived crop residue on soil surface provides many important advantages including preventing erosion and conserving soil moisture. In that sense, making accurate determination on the percent of crop residue cover using RGB images can be a fundamental tool in protecting the soil. In our research, we approach the determination of such percentages as a classification problem, and in this paper, we compare two of these approaches. Both approaches relied on support vector machines (SVM) as the classifier of choice, and the same set of features, which were selected in our previous studies on the same topic. In this paper we developed a SVM ensemble with a hierarchical structure and compared it against a single, multi-class SVM classifier. In the SVM ensemble framework, four two-class SVMs and one five-class SVM were combined in sequence to better separate adjacent levels of residue cover. The rationale of the ensemble was to allow each of the two-class SVMs to find the hyperplanes that maximize the margin between the corresponding two consecutive classes. Then, based on the distance of the samples to these hyperplanes, probabilistic estimates of the data-point belonging to the class were computed and added as extra inputs for the last SVM. In order to enhance the performance of the ensemble, other considerations such as the use of Grid Search method for optimizing the hyperparameters were employed in the tuning of the SVMs. Numerical experiments were conducted over a dataset of 4,400 images, which were collected from 88 locations in 40 row crop fields in five Missouri counties between mid-April and early July in 2018 and 2019. The images were collected using a camera mounted on a tripod, with a spatial resolution of 0.014 cm pixel- 1 GSD (Ground Sampling Distance). The experiments highlighted the better performance of the proposed hierarchical ensemble classifier, which achieved a cross-validation accuracy of 86.3 % vs an accuracy of 80.4 % for the single SVM, whil

关键词： Support vector machines Measurement Training Search methods Soil moisture Crops Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Green Routing Game: Strategic Logistical Planning using Mixed Fleets of ICEVs and EVs

arXiv

引用

arXiv 2022年

作者： Sasahara, Hampei Dán, György Amin, Saurabh Sandberg, Henrik The Department of Systems and Control Engineering School of Engineering Tokyo Institute of Technology Tokyo152-8552 Japan The Division of Network and Systems Engineering School of Electrical Engineering and Computer Science Kth Royal Institute of Technology StockholmSE-100 44 Sweden The Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Division of Decision and Control Systems School of Electrical Engineering and Computer Science Kth Royal Institute of Technology StockholmSE-100 44 Sweden

This paper introduces a "green" routing game between multiple logistic operators (players), each owning a mixed fleet of internal combustion engine vehicle (ICEV) and electric vehicle (EV) trucks. Each player faces the cost of delayed delivery (due to charging requirements of EVs) and a pollution cost levied on the ICEVs. This cost structure models: 1) limited battery capacity of EVs and their charging requirement;2) shared nature of charging facilities;3) pollution cost levied by regulatory agency on the use of ICEVs. We characterize Nash equilibria of this game and derive a condition for its uniqueness. We also use the gradient projection method to compute this equilibrium in a distributed manner. Our equilibrium analysis is useful to analyze the trade-off faced by players in incurring higher delay due to congestion at charging locations when the share of EVs increases versus a higher pollution cost when the share of ICEVs increases. A numerical example suggests that to increase marginal pollution cost can dramatically reduce inefficiency of equilibria. © 2022, CC BY-NC-ND.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：