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

Multi-Unit Floor Plan Recognition and Reconstruction Using Improved Semantic Segmentation of Raster-Wise Floor Plans

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Kratochvila, Lukas de Jong, Gijs Arkesteijn, Monique Bilík, Šimon Zemčík, Tomáš Horak, Karel Rellermeyer, Jan S. Department of Control and Instrumentation Faculty of Electrical Engineering and Communication Brno University of Technology Brno Czech Republic Department of Software Technology Faculty of Electrical Engineering Mathematics and Computer Science TU Delft Delft Netherlands Department of Management in the Built Environment Faculty of Architecture and the Built Environment TU Delft Delft Netherlands Computer Vision and Pattern Recognition Laboratory Department of Computational Engineering Lappeenranta-Lahti University of Technology LUT Lappeenranta Finland Dependable and Scalable Software Systems Institute of Systems Engineering Faculty of Electrical Engineering and Computer Science Leibniz University Hannover Hannover Germany

Digital twins have a major potential to form a significant part of urban management in emergency planning, as they allow more efficient designing of the escape routes, better orientation in exceptional situations, and faster rescue intervention. Nevertheless, creating the twins still remains a largely manual effort, due to a lack of 3D-representations, which are available only in limited amounts for some new buildings. Thus, in this paper we aim to synthesize 3D information from commonly available 2D architectural floor plans. We propose two novel pixel-wise segmentation methods based on the MDA-Unet and MACU-Net architectures with improved skip connections, an attention mechanism, and a training objective together with a reconstruction part of the pipeline, which vectorizes the segmented plans to create a 3D model. The proposed methods are compared with two other state-of-the-art techniques and several benchmark datasets. On the commonly used CubiCasa benchmark dataset, our methods have achieved the mean F1 score of 0.86 over five examined classes, outperforming the other pixel-wise approaches tested. We have also made our code publicly available to support research in the field. © 2024, CC BY.

关键词： Semantic Segmentation

Geometric theory on large-scale and local determination of density dependence of a recovering large carnivore population

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Shen, Yunyi Olson, Erik R. Van Deelen, Timothy R. Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology United States Department of Environmental Sciences Northland College United States Department of Forest and Wildlife Ecology University of Wisconsin–Madison United States

Density-dependent population growth is a feature of large carnivores like wolves (Canis lupus), with mechanisms typically attributed to resource (e.g. prey) limitation. Such mechanisms are local phenomena and rely on individuals having access to information, such as prey availability at their location. Using over four decades of wolf population and range expansion data from Wisconsin (USA) wolves, we found that the population not only exhibited density dependence locally but also at landscape scale. Superficially, one may consider space as yet another limiting resource to explain landscape-scale density dependence. However, this view poses an information puzzle: most individuals do not have access to global information such as range-wide habitat availability as they would for local prey availability. How would the population "know" when to slow their range expansion? To understand observed large-scale spatial density dependence, we propose a reaction-diffusion model, first introduced by Fisher and Kolmogorov, with a "travelling wave" solution, wherein the population expands from a core range that quickly achieves local carrying capacity. Early-stage acceleration and later-stage deceleration of population growth can be explained by early elongation of an expanding frontier and a later collision of the expanding frontier with a habitat boundary. Such a process does not require individuals to have global density information. We illustrate our proposal with simulations and spatial visualizations of wolf recolonization in the western Great Lakes region over time relative to habitat suitability. We further synthesize previous studies on wolf habitat selection in the western Great Lakes region and argue that the habitat boundary appeared to be driven by spatial variation in mortality, likely associated with human use of the landscape. © 2023, CC BY-SA.

关键词： Lakes

Interpretable Machine Learning Models for Modal Split Prediction in Transportation systems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Brenner, Aron Wu, Manxi Amin, Saurabh Laboratory for Information and Decision Systems The Massachusetts Institute of Technology United States Department of Electrical Engineering and Computer Sciences The University of California at Berkeley United States

Modal split prediction in transportation networks has the potential to support network operators in managing traffic congestion and improving transit service reliability. We focus on the problem of hourly prediction of the fraction of travelers choosing one mode of transportation over another using high-dimensional travel time data. We use logistic regression as base model and employ various regularization techniques for variable selection to prevent overfitting and resolve multicollinearity issues. Importantly, we interpret the prediction accuracy results with respect to the inherent variability of modal splits and travelers’ aggregate responsiveness to changes in travel time. By visualizing model parameters, we conclude that the subset of segments found important for predictive accuracy changes from hour-to-hour and include segments that are topologically central and/or highly congested. We apply our approach to the San Francisco Bay Area freeway and rapid transit network and demonstrate superior prediction accuracy and interpretability of our method compared to pre-specified variable selection methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

Optimal Linear Deception Attacks on Remote State Estimation with Constrained Alarm Rates: A Low-Dimensional Case

学校读者我要写书评

暂无评论

Optimal Linear Deception Attacks on Remote State Estimation ...

IEEE Conference on decision and control

作者： Jun Shang Hanwen Zhang Jing Zhou Tongwen Chen Department of Control Science and Engineering Shanghai Research Institute for Intelligent Autonomous Systems National Key Laboratory of Autonomous Intelligent Unmanned Systems and Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai China Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This study addresses linear attacks on remote state estimation within the context of a constrained alarm rate. Smart sensors, which are equipped with local Kalman filters, transmit innovations instead of raw measurements through a wireless communication network. This transmission is vulnerable to malicious data interception and manipulation by attackers. The aim of this research is to identify the optimal attack strategy that degrades the system performance while adhering to stealthiness constraints. A notable innovation of this paper is the direct association of the attack’s stealthiness with the alarm rate, diverging from traditional approaches that rely on the covariance of the innovation or the Kullback–Leibler divergence, which are conventional metrics that have been extensively explored in previous studies. Our findings reveal that the optimal attack strategy exhibits some structural characteristics in systems of low dimensions. The performance of the proposed attack strategy is demonstrated through numerical examples.

关键词： Wireless communication Measurement Technological innovation System performance Kalman filters State estimation Intelligent sensors

Distance-based Multiple Non-cooperative Ground Target Encirclement for Complex Environments

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Fen Yuan, Shenghai Cao, Kun Meng, Wei Xie, Lihua School of Electrical and Electronic Engineering Nanyang Technological University Singapore639798 Singapore Department of Control Science and Engineering College of Electronics and Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai200000 China Guangdong Provincial Key Laboratory of Intelligent Decision and Cooperative Control School of Automation Guangdong University of Technology Guangzhou510006 China

This paper proposes a comprehensive strategy for complex multi-target-multi-drone encirclement in an obstacle-rich and GPS-denied environment, motivated by practical scenarios such as pursuing vehicles or humans in urban canyons. The drones have omnidirectional range sensors that can robustly detect ground targets and obtain noisy relative distances. After each drone task is assigned, a novel distance-based target state estimator (DTSE) is proposed by estimating the measurement output noise variance and utilizing the Kalman filter. By integrating anti-synchronization techniques and pseudo-force functions, an acceleration controller enables two tasking drones to cooperatively encircle a target from opposing positions while navigating obstacles. The algorithm’s effectiveness for the discrete-time double-integrator system is established theoretically, particularly regarding observability. Moreover, the versatility of the algorithm is showcased in aerial-to-ground scenarios, supported by compelling simulation results. Experimental validation demonstrates the effectiveness of the proposed approach. © 2024, CC BY.

关键词： Drones

A SINS Error Correction Approach Based on Dual-Threshold ZV Detection and Cubature Kalman Filter

学校读者我要写书评

暂无评论

A SINS Error Correction Approach Based on Dual-Threshold ZV ...

2023 IEEE International Conference on systems, Man, and Cybernetics, SMC 2023

作者： Xu, Ruijie Chen, Shichao Sun, Wenqiao Lv, Yisheng Luo, Jialiang Tang, Ying Institute of Automation Chinese Academy of Sciences College of Information Science & Technology Beijing University of Chemical Technology The State Key Laboratory for Management and Control of Complex System State Key Laboratory of Multimodal Artificial Intelligence Systems Beijing China Institute of Automation Chinese Academy of Sciences The Center of National Railway Intelligent Transportation System Engineering and Technology China Academy of Railway Sciences Corporation Limited The State Key Laboratory for Management and Control of Complex System State Key Laboratory of Multimodal Artificial Intelligence Systems Beijing China Transportation and Economics Research Institute The Center of National Railway Intelligent Transportation System Engineering and Technology China Academy of Railway Sciences Corporation Limited Beijing China Institute of Automation Chinese Academy of Sciences The State Key Laboratory for Management and Control of Complex System State Key Laboratory of Multimodal Artificial Intelligence Systems Beijing China Institute of Automation Chinese Academy of Sciences China University of Geosciences Beijing School of Information Engineering The State Key Laboratory for Management and Control of Complex System State Key Laboratory of Multimodal Artificial Intelligence Systems Beijing China Rowan University Department of Electrical and Computer Engineering Glassboro United States

ISBN: (纸本)9798350337020

Global Navigation Satellite systems (GNSS) can provide real-time positioning information for outdoor users, but cannot for indoor scenarios or heavily occluded outdoor scenarios. Strap-down Inertial Navigation System (SINS) are widely used to locate people in complex interior or heavily occluded outdoor scenarios due to its light weight and low power consumption. However, IMU of SINS are noisy, and the sampling data error is large, which is a divergence of the error with time. Therefore, it will generate a positioning accumulation error, which affects the final positioning accuracy. The problem of cumulative IMU errors is usually dealt with by Zero-Velocity Update (ZUPT). The zero-velocity detection part of basic ZUPT method usually uses a single threshold to determine the gait of pedestrian, which often has the problem of gait misjudgment and omission. To address these problems, this paper proposes a composite conditional detection method to solve the problem of misjudgment in the zero-velocity interval. In addition, we redesign the zero-velocity update algorithm and uses the Cubature Kalman filter (CKF) for pedestrian positioning error correction. The experimental results demonstrate that the proposed ZUPT method based on dual-threshold detection can better detect the interval between pedestrian motion and stationery than ones with single threshold. The zero-velocity update algorithm based on CKF has higher performance than conventional EKF and UKF methods, which constrains the cumulative error of SINS to about 0.2% of the whole walking distance. © 2023 IEEE.

关键词： Cubature Kalman Filter Inertial Pedestrian Navigation Zero-Velocity Update

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China 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 studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further 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 among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

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

学校读者我要写书评

暂无评论

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

Federated Cubic Regularized Newton Learning with Sparsification-amplified Differential Privacy

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Huo, Wei Liu, Changxin Ding, Kemi Johansson, Karl Henrik Shi, Ling Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen518055 China

This paper investigates the use of the cubic-regularized Newton method within a federated learning framework while addressing two major concerns that commonly arise in federated learning: privacy leakage and communication bottleneck. We introduce a federated learning algorithm called Differentially Private Federated Cubic Regularized Newton (DP-FCRN). By leveraging second-order techniques, our algorithm achieves lower iteration complexity compared to first-order methods. We also incorporate noise perturbation during local computations to ensure privacy. Furthermore, we employ sparsification in uplink transmission, which not only reduces the communication costs but also amplifies the privacy guarantee. Specifically, this approach reduces the necessary noise intensity without compromising privacy protection. We analyze the convergence properties of our algorithm and establish the privacy guarantee. Finally, we validate the effectiveness of the proposed algorithm through experiments on a benchmark dataset. © 2024, CC BY.

关键词： Federated learning