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

Clustering Interval and Triangular Granular Data: Modeling, Execution, and Assessment

IEEE Transactions on Neural Networks and Learning systems 2024年第6期36卷 10000-10014页

作者： Yiming Tang Wenbin Wu Witold Pedrycz Jianwei Gao Xianghui Hu Zhaohong Deng Rui Chen Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Hefei China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada School of Computer and Information Hefei University of Technology Hefei China Faculty of Automatic Control Electronics and Computer Science Silesian University of Tecghnology Gliwice Poland Research Center of Performance and Productivity Analysis Istinye University Istanbul TÃrkiye School of Computer Science and Engineering Southeast University Nanjing China School of Artificial Intelligence and Computer Jiangnan University Wuxi Jiangsu China

In current granular clustering algorithms, numeric representatives were selected by users or an ordinary strategy, which seemed simple; meanwhile, weight settings for granular data could not adequately express their structural characteristics. Aiming at these problems, in this study, a new scheme called a granular weighted kernel fuzzy clustering (GWKFC) algorithm is put forward. We propose the representative selection and granularity generation (RSGG) algorithm enlightened by the density peak clustering (DPC) algorithm. We build interval and triangular granular data on the strength of numeric representatives obtained by RSGG under the principle of justifiable granularity (PJG), in which we establish some combinations of functions and boundary constraints and prove their properties. Furthermore, we present a novel distance formula via the kernel function for granular data and design new weights to affect the coverage and specificity of granular data. In addition, based upon these factors, we come up with the GWKFC algorithm of granular clustering, and its performance with different granularity is assessed. To sum up, a macro framework involving granular modeling, granular clustering, and assessment has been set up. Lastly, the GWKFC algorithm and ten other granular clustering algorithms are compared by experiments on some artificial and UCI datasets together with datasets with large data or those of high dimensionality. It is found that the GWKFC algorithm can provide better granular clustering results by contrast with other algorithms. The originality is embodied as follows. First, we improve the previous density radius and present the RSGG algorithm to acquire numeric representatives. Second, we propose a new strategy to determine granular data boundaries and further obtain novel weights enlightened by the idea of volume. Lastly, we employ the kernel function to calculate the distance between granular data, which has a stronger spatial division ability than the pr

关键词： Clustering algorithms Data models Computational modeling Numerical models Kernel Phase change materials Granular computing Uncertainty Fuzzy sets Noise

来源：评论

学校读者我要写书评

暂无评论

Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Hong, Yiguang Fidan, Baris Parisini, Thomas Johansson, Karl H. Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor nodes and relative measurements among all nodes, determine the locations of all non-anchor nodes. The solution to the SNL problem is challenging due to its inherent non-convexity. In this paper, the problem takes on the form of a multi-player nonconvex potential game in which canonical duality theory is used to define a complementary dual potential function. After showing the Nash equilibrium (NE) correspondent to the SNL solution, we provide a necessary and sufficient condition for a stationary point to coincide with the NE. An algorithm is proposed_ to reach the NE and shown to have convergence rate O(1/√k). With the aim of reducing the information exchange within a network, a distributed algorithm for NE seeking is implemented and its global convergence analysis is provided. Extensive simulations show the validity and effectiveness of the proposed approach to solve the SNL problem. Copyright © 2024, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

A Review of RPL Based Routing Protocols in Vehicular Ad Hoc Networks (VANET)

A Review of RPL Based Routing Protocols in Vehicular Ad Hoc ...

引用

Mechatronic systems Supervision (IW_MSS), IEEE International Workshop on

作者： Wafa Akermi Nouha Alyaoui Awatef Benfradj Guiloufi Karim Chabir Automatic Industrial Systems Department Higher Institute of Applied Sciences and Technology Gafsa University Gafsa Tunisia Laboratory of Modeling Analysis and Control of Systems (MACS) National Engineering School of Gabes (ENIG) Gabes University Gabes Tunisia Computer Science and Telecommunications Department Higher Institute of Applied Sciences and Technology Gafsa University Gafsa Tunisia Preparatory Institute for Engineering Studies of Gabes Laboratory of Modeling Analysis and Control of Systems (MACS) National Engineering School of Gabes (ENIG) Gabes University Gabes Tunisia

In the present day, the Internet of Things is becoming more and more popular. Enabling continuous connectivity and packet routing in this kind of network is difficult because of the resource limitations that are a feature of IoT. Reduce end-to-end latency, conserve energy, and balance network load are the three basic objectives of lightweight routing protocol. In this paper, we give a quick review of the IPv6 Routing Protocol for Low-Power and Lossy Networks-based routing protocols of VANET already in use and discuss their advantages and disadvantages. More specifically, we examine a few chosen VANET routing protocols and contrast their performance based on metrics like packet delivery ratio, Throughput, End to end delay, Routing- Cost, etc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hand Gesture Recognition from an Open-Set Perspective

引用

IEEE Transactions on Multimedia 2025年

作者： Zhou, Jun Xu, Chi Cheng, Li China University of Geosciences School of Automation Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems China Ministry of Education Engineering Research Center of Intelligent Technology for Geo-Exploration Wuhan430074 China University of Alberta Vision and Learning Laboratory Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada

Existing hand gesture recognition methods predominantly rely on a close-set assumption, which in essence limits the viewpoints, gesture categories, and hand shapes at test time to closely resemble those seen during training. This requirement is however rarely met in practice, as images are often captured from unconstrained viewpoints, with novel gestures and unseen hand shapes that can differ significantly from the training data. This motivates us to investigate an open-set hand gesture recognition problem, where hand gestures are still recognizable from unconstrained viewpoints, and novel gesture classes and hand shapes can be incrementally learned with just a few examples. To address this, we propose a viewpoint influence elimination network that extracts view-independent features, significantly improving performance in scenarios with unconstrained viewpoints. Moreover, a joint-weighted classification scheme is introduced to augment the cosine similarity metric for evaluating few-shot incremental learning of novel gestures and shapes. Finally, as existing hand gesture recognition datasets primarily adhere to the close-set assumption, a new hand gesture recognition dataset, OHG, is introduced in this paper, that includes a wide range of viewpoints, diverse gesture classes, and distinct hand shapes. Experimental hand gesture recognition results demonstrate the superior performance of our approach in both unconstrained viewpoint and few-shot incremental learning scenarios. The source code and the OHG dataset are to be made available at https://***/zhoujun-7/OSHGR. © 1999-2012 IEEE.

关键词： Palmprint recognition

来源：评论

学校读者我要写书评

暂无评论

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

引用

IFAC-PapersOnLine 2023年第2期56卷 270-275页

作者： Zishuo Li Muhammad Umar B. Niazi Changxin Liu Yilin Mo Karl H. Johansson Department of Automation Tsinghua University Beijing 100084 China Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm SE-100 44 Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts Avenue Cambridge MA 02139 USA

This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. At each time, the attacker has the freedom to choose an arbitrary set of no more than p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error irrespective of the attack signals subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observers for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. We show that our proposed scheme can effectively tolerate sparse attacks on an unknown set of sensors, ensuring a bounded estimation error and effectively detecting and resetting the attacked sensors.

关键词： Estimation and filtering Design of fault tolerant/reliable systems Estimation and fault detection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Sensor Fault Detection and Isolation in Autonomous Nonlinear systems Using Neural Network-Based Observers

arXiv

引用

arXiv 2023年

作者： Cao, John Niazi, M. Umar B. Barreau, Matthieu Johansson, Karl Henrik Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information & Decision Systems Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States

This paper presents a novel observer-based approach to detect and isolate faulty sensors in nonlinear systems. The proposed sensor fault detection and isolation (s-FDI) method applies to a general class of nonlinear systems. Our focus is on s-FDI for two types of faults: complete failure and sensor degradation. The key aspect of this approach lies in the utilization of a neural network-based Kazantzis- Kravaris/Luenberger (KKL) observer. The neural network is trained to learn the dynamics of the observer, enabling accurate output predictions of the system. Sensor faults are detected by comparing the actual output measurements with the predicted values. If the difference surpasses a theoretical threshold, a sensor fault is detected. To identify and isolate which sensor is faulty, we compare the numerical difference of each sensor meassurement with an empirically derived threshold. We derive both theoretical and empirical thresholds for detection and isolation, respectively. Notably, the proposed approach is robust to measurement noise and system uncertainties. Its effectiveness is demonstrated through numerical simulations of sensor faults in a network of Kuramoto oscillators. © 2023, CC BY.

关键词： Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

Environment-Driven Online LiDAR-Camera Extrinsic Calibration

arXiv

引用

arXiv 2025年

作者： Huang, Zhiwei Li, Jiaqi Zhong, Ping Fan, Rui The Department of Control Science & Engineering The College of Electronics & Information Engineering Tongji University Shanghai201804 China The School of Computer Science and Engineering Central South University Hunan Changsha410083 China The National Key Laboratory of Science and Technology on Automatic Target Recognition National University of Defense Technology Hunan Changsha410073 China The Department of Control Science & Engineering The College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China The National Key Laboratory of Human-Machine Hybrid Augmented Intelligence Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Shaanxi Xi’an710049 China

LiDAR-camera extrinsic calibration (LCEC) is the core for data fusion in computer vision. Existing methods typically rely on customized calibration targets or fixed scene types, lacking the flexibility to handle variations in sensor data and environmental contexts. This paper introduces EdO-LCEC, the first environment-driven, online calibration approach that achieves human-like adaptability. Inspired by the human perceptual system, EdO-LCEC incorporates a generalizable scene discriminator to actively interpret environmental conditions, creating multiple virtual cameras that capture detailed spatial and textural information. To overcome cross-modal feature matching challenges between LiDAR and camera, we propose dual-path correspondence matching (DPCM), which leverages both structural and textural consistency to achieve reliable 3D-2D correspondences. Our approach formulates the calibration process as a spatial-temporal joint optimization problem, utilizing global constraints from multiple views and scenes to improve accuracy, particularly in sparse or partially overlapping sensor views. Extensive experiments on real-world datasets demonstrate that EdO-LCEC achieves state-of-the-art performance, providing reliable and precise calibration across diverse, challenging environments. Copyright © 2025, The Authors. All rights reserved.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Real-Time Object Detection and Robotic Manipulation for Agriculture Using a YOLO-Based Learning Approach

Real-Time Object Detection and Robotic Manipulation for Agri...

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Hongyu Zhao Zezhi Tang Zhenhong Li Yi Dong Yuancheng Si Mingyang Lu George Panoutsos The Department of Physics Imperial College London United Kingdom The Department of Automatic Control and Systems Engineering University of Sheffield Sheffield United Kingdom The Department of Electrical and Electronic Engineering University of Manchester Manchester United Kingdom The Department of Electronics and Computer Science University of Southampton Southampton United Kingdom The Department of Economics Fudan University Shanghai China The Center for Nondestructive Evaluation (CNDE) Iowa State University Ames IA United States

ISBN: (数字)9798350340266

ISBN: (纸本)9798350340273

The optimization of crop harvesting processes for commonly cultivated crops is of great importance in the aim of agricultural industrialization. Nowadays, the utilization of machine vision has enabled the automated identification of crops, leading to the enhancement of harvesting efficiency, but challenges still exist. This study presents a new framework that combines two separate architectures of Convolutional Neural Networks (CNNs) in order to simultaneously accomplish the tasks of crop detection and harvesting (robotic manipulation) inside a simulated environment. Crop images in the simulated environment are subjected to random rotations, cropping, brightness, and contrast adjustments to create augmented images for dataset generation. The You Only Look Once(YOLO) algorithmic framework is employed with traditional Rectangular Bounding Boxes (R-Bbox) for crop localization. The proposed method subsequently utilises the acquired image data via a visual geometry group model in order to reveal the grasping positions for the robotic manipulation.

关键词： YOLO Visualization Crops Grasping Production Robustness Real-time systems

来源：评论

学校读者我要写书评

暂无评论

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

Green Routing Game: Strategic Logistical Planning using Mixe...

引用

IEEE Conference on Decision and control

作者： Hampei Sasahara György Dán Saurabh Amin Henrik Sandberg Department of Systems and Control Engineering School of Engineering Tokyo Institute of Technology Tokyo Japan Division of Network and Systems Engineering School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA USA Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

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 reduce inefficiency of equilibria.

关键词： Costs Pollution Green products Internal combustion engines Games Routing Planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：