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

Semi-Autonomous Navigation Based on Local Semantic Map for Mobile Robot

Journal of Shanghai Jiaotong university(Science) 2025年第1期30卷 27-33页

作者： ZHAO Yanfei XIAO Peng WANG Jingchuan GUO Rui Department of Automation Institute of Medical RoboticsShanghai Jiao Tong UniversityShanghai200240China State Key Laboratory of System Control and Information Processing Ministry of Education of ChinaShanghai200240China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240China State Grid Intelligence Technology Co. Ltd.Jinan250013China

Mobile robots represented by smart wheelchairs can assist elderly people with mobility *** paper proposes a multi-mode semi-autonomous navigation system based on a local semantic map for mobile robots,which can assist users to implement accurate navigation(e.g.,docking)in the environment without prior *** order to overcome the problem of repeated oscillations during the docking of traditional local path planning algorithms,this paper adopts a mode-switching method and uses feedback control to perform docking when approaching semantic *** last,comparative experiments were carried out in the real *** show that our method is superior in terms of safety,comfort and docking accuracy.

关键词： semi-autonomous navigation mobile robot semantic map voice interaction

来源：评论

学校读者我要写书评

暂无评论

UAV-Assisted IRS System in 5 G and Beyond: Improving Reliability and Enhancing the Network Life Span

引用

IEEE Transactions on Mobile Computing 2025年

作者： Kumar, Pankaj Goel, Nikita Tolani, Manoj Manipal Institute of Technology Department of Information and Communication Technology Manipal576104 India Manipal Institute of Technology Department of Instrumentation and Control Engineering Manipal576104 India

This paper proposes an unmanned aerial vehicle (UAV)-assisted intelligent reflecting surface (IRS) for device-to-device (D2D) communication in infrastructure-less scenarios. The aim of this paper is to enhance the reliability among D2D ground users (GUs) and extend the lifespan of 5 G and beyond 5 G (B5G) wireless communication system. This work may be applicable for packet delivery in bustling urban areas, especially where ground-to-ground (G2G) links are in deep fade. For modeling air-to-ground (A2G) links among GUs to IRS/UAV and IRS/UAV to GUs, we consider a height-dependent Nakagami-m channel model for small-scale fading and height-dependent path-loss exponent for modeling large-scale fading. The lifespan of the network is improved by proposing height-dependent energy harvesting (EH) at UAV. We derive the cumulative distribution function (CDF) of the signal-to-noise ratio (SNR) whenever the signal reaches the receiving node, either via UAV or via IRS. We also develop the expression of spectral efficiency and derive a closed-form expression of an outage probability by taking the combined effect of the signal for the proposed scenario using decode-and-forward (DF) and amplify-and-forward (AF) relaying at the UAV. Additionally, the statistical parameters such as mean, variance, and probability density function (PDF) of total noise are derived, which is useful at the receiver node for estimating the bit error rate (BER). The analytical result is validated with simulation results, and the work is compared with the existing state-of-the-art. © 2002-2012 IEEE.

关键词： Distribution functions

来源：评论

学校读者我要写书评

暂无评论

Dynamic Regret for Distributed Online Composite Optimization

引用

IEEE Transactions on Automatic control 2025年第5期70卷 3056-3071页

作者： Hou, Ruijie Yu, Yang Li, Xiuxian Tongji University Department of Control Science and Engineering College of Electronics and Information Engineering Shanghai201800 China Tongji University Shanghai Research Institute for Intelligent Autonomous Systems National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai Institute of Intelligent Science and Technology Shanghai201210 China

This article focuses on online composite optimization over multiagent networks. In the distributed setting, each agent has its own local loss function, which consists of a convex, strongly convex or strongly convex and smooth function, and a time-varying nonsmooth regularizer. Two distributed online algorithms are proposed and corresponding dynamic regrets are analyzed. Two proposed algorithms are based on signs of relative states. The first algorithm obtains (Formula presented) dynamic regret bound when each local loss is a general convex composite function, where CT is the path variation. If CT can be estimated in advance for convex or strongly convex local loss with a time-varying nonsmooth regularizer, then dynamic regret bounds are, respectively, in the order of (Formula presented) and o (log T(1 + CT)). The second algorithm is based on the first one, especially for handling the local loss composed of a strongly convex and smooth function with a nonsmooth regularizer, and then obtains o (1 + CT) dynamic regret bound. In the end, numerical results are given to support the theoretical findings. © 1963-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Scalable Multi-Agent Reinforcement Learning for Residential Load Scheduling Under Data Governance

IEEE Transactions on Industrial Cyber-Physical Systems

引用

IEEE Transactions on Industrial Cyber-Physical Systems 2025年 3卷 351-361页

作者： Qin, Zhaoming Dong, Nanqing Liu, Di Wang, Zhefan Cao, Junwei EPFL Automatic Control Laboratory Lausanne1015 Switzerland Shanghai Artificial Intelligence Laboratory Shanghai200232 China Tsinghua University Department of Electrical Engineering Beijing100084 China Tsinghua University Beijing National Research Center for Information Science and Technology Beijing100084 China

As a data-driven approach, multi-agent reinforcement learning (MARL) has made remarkable advances in solving cooperative residential load scheduling problems. However, centralized training, the most common paradigm for MARL, limits large-scale deployment in communication-constrained cloud-edge environments. As a remedy, distributed training shows unparalleled advantages in real-world applications but still faces challenge with system scalability, e.g., the high cost of communication overhead during coordinating individual agents, and needs to comply with data governance in terms of privacy. In this work, we propose a novel MARL solution to address these two practical issues. Our proposed approach is based on actor-critic methods, where the global critic is a learned function of individual critics computed solely based on local observations of households. This scheme preserves household privacy completely and significantly reduces communication cost. Simulation experiments demonstrate that the proposed framework achieves comparable performance to the state-of-the-art actor-critic framework without data governance and communication constraints. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Mixtures of ensembles: System separation and identification via optimal transport

arXiv

引用

arXiv 2025年

作者： Elvander, Filip Haasler, Isabel Department of Information and Communications Engineering Aalto University Finland Division of Systems and Control Department of Information Technology Uppsala University Sweden

Crowd dynamics and many large biological systems can be described as populations of agents or particles, which can only be observed on aggregate population level. Identifying the dynamics of agents is crucial for understanding these large systems. However, the population of agents is typically not homogeneous, and thus the aggregate observations consist of the superposition of multiple ensembles each governed by individual dynamics. In this work, we propose an optimal transport framework to jointly separate the population into several ensembles and identify each ensemble’s dynamical system, based on aggregate observations of the population. We propose a bi-convex optimization problem, which we solve using a block coordinate descent with convergence guarantees. In numerical experiments, we demonstrate that the proposed approach exhibits close-to-oracle performance also in noisy settings, yielding accurate estimates of both the ensembles and the parameters governing their dynamics. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Estimation and Motion control in Multi-Agent Systems Under Multiple Attacks

引用

IEEE Transactions on Automation Science and engineering 2025年 22卷 12548-12559页

作者： Jenabzadeh, Ahmadreza Shu, Zhan Huang, Tingwen Zhu, Quanmin Shang, Yilun Cui, Yukang Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Peng Cheng Laboratory Shenzhen518000 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Shenzhen University of Advanced Technology Faculty of Computer Science and Control Engineering Shenzhen518055 China University of the West of England School of Engineering BristolBS16 1QY United Kingdom Northumbria University Faculty of Engineering and Environment Department of Computer and Information Sciences Newcastle upon TyneNE1 8ST United Kingdom

This paper addresses the problem of distributed estimation and motion control (DEMC) in multi-agent systems (MASs) with both linear and Lipschitz nonlinear dynamics. Unlike conventional DEMC methods designed for MASs under ideal conditions, this work investigates scenarios where all agents are vulnerable to various forms of attacks. The considered attacks comprise false-data injection (FDI) attacks and denial of service (DoS) attacks that affect the communication channels among agents to destabilize the MAS. Also, the unbounded actuator attacks which exist in practical environments to intentionally degrade the MAS performance is considered. To cope with these kinds of attacks, two novel resilient approaches are established aimed at estimating and following a mobile target under attacks. The proposed distributed attack-resilient control strategies are designed based on a dual-layer structure, guaranteeing effective DEMC with an ultimately bounded error. The results from two simulation examples are provided to validate the presented algorithms. © 2004-2012 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Robust Representation Learning Based on Deep Mutual information for Scene Classification Against Adversarial Perturbations

引用

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 2025年 18卷 11963-11978页

作者： Li, Linjuan Xie, Gang Zhang, Haoxue Xie, Xinlin Li, Heng Taiyuan University of Science and Technology School of Electronic Information Engineering Taiyuan030024 China Shanxi Key Laboratory of Advanced Control and Equipment Intelligence Taiyuan030024 China The Hong Kong Polytechnic University Department of Building and Real Estate Hong Kong

Remote sensing scene classification enables data-driven decisions for various applications, such as environmental monitoring, urban planning, and disaster management. However, deep learning models used for scene classification are highly vulnerable to adversarial samples, resulting in incorrect predictions and posing significant risks. While most current methods focus on improving adversarial robustness, they face a trade-off that compromises accuracy on clean, unperturbed images. To address this challenge, we utilized information theory by incorporating a mutual information (MI) representation (MIR) module, which allows the model to capture high-quality, robust features. Furthermore, a domain adversarial training (AdvT) strategy is applied to promote the learning of domain-invariant features, reducing the effect of distribution differences between clean images and adversarial samples. We propose a novel algorithm that accurately differentiates between clean and adversarial scenes by introducing the MI and domain adaptation-guided network (MIDANet). Extensive experiments demonstrate the effectiveness of our approach against adversarial attacks, revealing a positive correlation between adversarial perturbations and image information entropy, and a negative correlation with robust accuracy (RAcc). © 2008-2012 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

RGB-Based Category-Level Object Pose Estimation via Depth Recovery and Adaptive Refinement

引用

IEEE Robotics and Automation Letters 2025年第6期10卷 5377-5384页

作者： Yang, Hui Sun, Wei Liu, Jian Zheng, Jin Zeng, Zhiwen Mian, Ajmal Hunan University National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering Changsha410082 China Hunan University State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Changsha410082 China Central South University School of Architecture and Art Changsha410082 China University of Western Australia Department of Computer Science and Software Engineering CrawleyWA6009 Australia

Category-level pose estimation methods have received widespread attention as they can be generalized to intra-class unseen objects. Although RGB-D-based category-level methods have made significant progress, reliance on depth image limits practical application. RGB-based methods offer a more practical and cost-effective solution. However, current RGB-based methods struggle with object geometry perception, leading to inaccurate pose estimation. We propose depth recovery and adaptive refinement for category-level object pose estimation from a single RGB image. We leverage DINOv2 to reconstruct the coarse scene-level depth from the input RGB image and propose an adaptive refinement network based on an encoder-decoder architecture to dynamically improve the predicted coarse depth and reduce its gap from the ground truth. We introduce a 2D–3D consistency loss to ensure correspondence between the point cloud obtained from depth projection and the objects in the 2D image. This consistency supervision enables the model to maintain alignment between the depth image and the point cloud. Finally, we extract features from the refined point cloud and feed them into two confidence-aware rotation regression branches and a translation and size prediction residual branch for end-to-end training. Decoupling the rotation matrix provides a more direct representation, which facilitates parameter optimization and gradient propagation. Extensive experiments on the REAL275 and CAMERA25 datasets demonstrate the superior performance of our method. Real-world estimation and robotic grasping experiments demonstrate our model robustness to occlusion, clutter environments, and low-textured objects. Our code and robotic grasping video are available at DA-Pose. © 2016 IEEE.

关键词： Depth perception

来源：评论

学校读者我要写书评

暂无评论

Tissue P Systems with Look-Ahead Mode

引用

Chinese Journal of Electronics 2025年第1期23卷 81-86页

作者： Yun Jiang Tao Song Zheng Zhang School of Computer Science and Information Engineering Chongqing Technology and Business University Chongqing China Department of Control Science and Engineering Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Wuhan China

Tissue P systems are a class of distributed and parallel computing models inspired from inter-cellular communication and cooperation between cells. In this work, a variant of tissue P system, named tissue P system with look-ahead mode, is discussed for decreasing the inherent non-determinism of tissue P systems and helping implementing tissue P systems on computers. Such systems are proved to be universal by simulating register machine, and they are also proved to be able to efficiently solve computationally hard problems by means of a space-time tradeoff, which is illustrated with a polynomial solution to 3-coloring problem.

关键词： Computers Computational modeling Medical services Parallel processing Polynomials Computational efficiency Registers Business

来源：评论

学校读者我要写书评

暂无评论

A Unifying Complexity-Certification Framework for Branch-and-Bound Algorithms for Mixed-Integer Linear and Quadratic Programming

arXiv

引用

arXiv 2025年

作者： Shoja, Shamisa Arnström, Daniel Axehill, Daniel Division of Automatic Control Department of Electrical Engineering Linköping University Sweden Division of Systems and Control Department of Information Technology Uppsala University Sweden

In model predictive control (MPC) for hybrid systems, solving optimization problems efficiently and with guarantees on worst-case computational complexity is critical, particularly in real-time applications. These optimization problems often take the form of mixed-integer linear programs (MILPs) or mixed-integer quadratic programs (MIQPs) that depend on system parameters. A common approach for solving such problems is the branch-and-bound (B&B) method. This paper extends existing complexity certification methods by presenting a unified complexity-certification framework for B&B-based MILP and MIQP solvers, specifically for the family of multi-parametric MILP and MIQP problems that arise in, e.g., hybrid MPC applications. The framework provides guarantees on worst-case computational metrics, including the maximum number of iterations or relaxations B&B algorithms require to reach optimality. It systematically accounts for different branching and node selection strategies, as well as heuristics integrated into B&B, ensuring a comprehensive certification framework. By offering theoretical guarantees and practical insights for solver customization, the proposed framework enhances the reliability of B&B for real-time application. The usefulness of the proposed framework is demonstrated through numerical experiments on both random MILPs and MIQPs, as well as on MIQPs arising from a hybrid MPC problem. © 2025, CC BY.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：