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

Relative Localizability and Localization for Multirobot systems

IEEE Transactions on robotics 2025年 41卷 2931-2949页

作者： Chen, Liangming Liang, Chenyang Yuan, Shenghai Cao, Muqing Xie, Lihua Southern University of Science and Technology School of System Design and Intelligent Manufacturing Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology Shenzhen518055 China Harbin Institute of Technology School of Mechanical Engineering and Automation Shenzhen518055 China Southern University of Science and Technology School of System Design and Intelligent Manufacturing Shenzhen518055 China Nanyang Technological University School of Electrical and Electronic Engineering 639798 Singapore Carnegie Mellon University Robotics Institute PittsburghPA15213 United States

Inter-robot relative positions are crucial for executing various multirobot missions, such as formation maneuvering and collaborative inspection. However, the current sensing technology usually provides part of relative position information, such as inter-robot distances, bearings and angles. This prompts the study of determining inter-robot relative positions, i.e., relative localization, from these partial measurements. Based on the existing results of static networks' localizability and mobile robots' relative localization, we propose a novel concept, relative localizability to describe whether a multirobot system is relatively localizable. Given each robot's self-displacement measurements and inter-robot partial measurements in d (d ≤ 4) sampling instants, we show that a multirobot system's relative localization can be achieved in a purely algebraic and distributed manner, in which the multirobot system is said to be d-step relatively localizable. To make the results more general, we consider that the multirobot system consists of landmarks, leaders, and followers, and that the inter-robot measurements can be distances, bearings or angles. When robots' coordinate frames have different orientations, we show that the given local measurements can be used to determine robots' relative positions and their coordinate frames' relative orientations simultaneously. Simulations and experiments of relative localization for ground robots are conducted to validate the obtained results. © 2004-2012 IEEE.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Electric Vehicle Routing Problem with Capacitated Charging Stations and Dynamic Electricity Prices

引用

IEEE Internet of Things Journal 2025年

作者： He, Zhiye Tian, Yuning Miao, Haoyu Yao, Canqi Yang, Zaiyue Shenzhen Key Laboratory of Control Theory and Intelligent Systems Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology Guangdong Provincial Key Laboratory of Human-Augmentation and Rehabilitation Robotics in Universities School of System Design and Intelligent Manufacturing Shenzhen518055 China The Hong Kong Polytechnic University Department of Logistics and Maritime Studies Hong Kong Hong Kong

With rapid electrification of transportation systems in recent years, the electric vehicle routing problem (EVRP) has received increasing attention. In order to serve a set of valuable transportation tasks using a fleet of electric vehicles, EVRP intends to jointly determine their routes and the charging schedules, with the aim of optimizing service reward and charging cost under state of charge (SOC) constraints of battery. EVRP is a difficult nonlinear integer program, and due to its intrinsic NP-hardness early EVRP studies often oversimplify the charging process and assume unlimited capacity of charging stations and constant electricity price. The contribution of this paper lies in twofold. First, to better characterize the practical charging process, this paper introduces a new graph model that can take the charging station capacity and dynamic electricity price into full consideration. Second, we design a series of transformation techniques, including reformulation SOC dynamics, Lagrangian relaxation, exact linear programming relaxation, etc, which eventually convert the original EVRP into an approximate linear program. Extensive simulations across 14 instances demonstrate that, the proposed approach is capable of solving large-scale instances over 500 nodes, and is 100 times faster than traditional analytic methods while achieving very close optimality. While comparing with the popular heuristic method ALNS (Adaptive Large Neighborhood Search), our method is several times faster and obtains much better optimality. © 2014 IEEE.

关键词： Charging stations

来源：评论

学校读者我要写书评

暂无评论

Deep reinforcement learning-based trajectory planning for double pendulum cranes: Design and experiments

引用

Mechanical systems and Signal Processing 2025年 234卷

作者： Ding, Weili Zhang, Heng Hua, Changchun Lu, Biao Engineering Research Center of Intelligent Control System and Intelligent Equipment Ministry of Education Laboratory of Intelligent Rehabilitation and Neuromodulation of Hebei Province Institute of Electrical Engineering Yanshan University Qinhuangdao066004 China Institute of Robotics and Automatic Information System College of Artificial Intelligence Nankai University Tianjin300353 China Institute of Intelligence Technology and Robotic Systems Shenzhen Research Institute of Nankai University Shenzhen518083 China

Since cranes usually possess double pendulum dynamics, the mass of the payload often changes and there are frequently lifting/lowering operations simultaneously. Moreover, most crane systems are driven by motors, whose velocities and accelerations are often limited. To solve the above problems, this paper proposes a deep reinforcement learning (DRL) reference trajectory generation method based on virtual–physical joint training. Firstly, a DRL module based on deep deterministic policy gradient (DDPG), along with a double pendulum crane dynamic model and an adaptive controller, are established within the virtual environment for training the reference trajectory. When the reward reaches the threshold, the training is switched to the physical environment to further optimize the reference trajectory, realizing the swing suppression of the hook and the payload. In addition, to satisfy the performance of the drive motors, velocity and acceleration thresholds are set to constrain the performance of the drive motors. Finally, in view of the fact that the operation process of the double pendulum crane is divided into payload transportation and payload loading/unloading, an event-triggering mechanism is designed to switch different control policies in accordance with different operation processes, thus reducing the consumption of computing resources. Through experiments on the actual double pendulum crane and comparison with the existing reference trajectories and input shapers, the superiority of this method is demonstrated. © 2025 Elsevier Ltd

关键词： Model reference adaptive control

来源：评论

学校读者我要写书评

暂无评论

Practical Applicability of PLA for Industrial Wireless Networks: Gaps and Directions

引用

IEEE Network 2025年

作者： Liang, Wei Wei, Fuyou Wang, Qi Zhan, Ming Wang, Ke Chinese Academy of Sciences State Key Laboratory of Robotics Shenyang Institute of Automation Shenyang110016 China Chinese Academy of Sciences Key Laboratory of Networked Control System Shenyang Institute of Automation Shenyang110016 China Chinese Academy of Sciences Institutes for Robotics and Intelligent Manufacturing Shenyang110169 China University of Chinese Academy of Sciences Beijing100049 China Shandong Normal University Jinan250014 China Taizhou University School of Electronics and Information Engineering Zhejiang Taizhou China

The rapid transformation of Industrial Cyber-Physical system (ICPS) has introduced significant cyber security challenges, particularly in the context of ICPS. Wireless networks are a critical component of these systems, but their open nature makes them vulnerable to security threats. Physical Layer Authentication (PLA) algorithms based on Channel State Information (CSI) are essential complements to existing security technologies in wireless networks. However, their practical application faces challenges such as restricted sampling rates and uneven sampling interval, which result in low-precision CSI, significant random phase offsets, and signal distortion. This study aims to explore the feasibility of deploying and applying existing representative algorithms on industrial wireless commercial devices. According to characteristics of authentication algorithms and the adopted authentication features, we selected five of the latest physical layer authentication algorithms including supervised, semi-supervised, and unsupervised algorithms and deployed them on commercial devices that comply with the WIA-FA standard. We conducted systematic experiments focusing on the motion parameters of devices, the CSI data sampling frequency, the interference caused by worker movement, the surface materials of the devices, and the types of attacks. This study explores the ability of these algorithms to resist attacks and environmental interference in commercial devices and industrial scenarios. Extensive experimental data were collected, and the results indicate that existing authentication algorithms still need improvement to meet the requirements of industrial applications. The experiment findings and the summarized application challenges of these algorithms provide significant guidance for future research and practical industrial implementations. © 1986-2012 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Polytope Volume Monitoring Problem: Formulation and Solution via Parametric Linear Program Based control Barrier Function

arXiv

引用

arXiv 2025年

作者： Wu, Shizhen Dong, Jinyang Fang, Xu Sun, Ning Fang, Yongchun Institute of Robotics and Automatic Information System College of Artificial Intelligence Nankai University Tianjin300353 China The Institute of Intelligence Technology and Robotic Systems Shenzhen Research Institute of Nankai University Shenzhen518083 China Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education Dalian University of Technology Dalian116024 China

Motivated by the latest research on feasible space monitoring of multiple control barrier functions (CBFs) as well as polytopic collision avoidance, this paper studies the Polytope Volume Monitoring (PVM) problem, whose goal is to design a control law for inputs of nonlinear systems to prevent the volume of some state-dependent polytope from decreasing to zero. Recent studies have explored the idea of applying Chebyshev ball method in optimization theory to solve the case study of PVM;however, the underlying difficulties caused by nonsmoothness have not been addressed. This paper continues the study on this topic, where our main contribution is to establish the relationship between nonsmooth CBF and parametric optimization theory through directional derivatives for the first time, so as to solve PVM problems more conveniently. In detail, inspired by Chebyshev ball approach, a parametric linear program (PLP) based nonsmooth barrier function candidate is established for PVM, and then, sufficient conditions for it to be a nonsmooth CBF are proposed, based on which a quadratic program (QP) based safety filter with guaranteed feasibility is proposed to address PVM problems. Finally, a numerical simulation example is given to show the efficiency of the proposed safety filter. © 2025, CC BY.

关键词： Chebyshev filters

来源：评论

学校读者我要写书评

暂无评论

Minimizing Data Collection Latency for Coexisting Time-Critical Wireless Networks with Tree Topologies

引用

IEEE Transactions on Network and Service Management 2025年

作者： Zhang, Jialin Liang, Wei Yang, Bo Shi, Huaguang Liang, Ying-Chang Chinese Academy of Sciences State Key Laboratory of Robotics Shenyang Institute of Automation Shenyang110016 China Chinese Academy of Sciences Key Laboratory of Networked Control System Shenyang Institute of Automation Shenyang110016 China Northwest A and F University College of Information Engineering Yangling712100 China Henan University School of Artificial Intelligence Zhengzhou450046 China University of Electronic Science and Technology of China Center for Intelligent Networking and Communications Chengdu611731 China

Time-Critical Wireless Network (TCWN) is a promising communication technology that can satisfy the low latency, high reliability, and deterministic requirements of mission-critical applications. Multiple TCWNs required by various applications inevitably coexist with each other. Most existing works aim to achieve acceptable latency or consider the simplest topology (i.e., line topology). As latency requirements become more stringent, exploring the minimum data collection latency becomes an interesting problem. In this paper, the coexisting system consists of multiple tree-topology-based TCWNs. We first establish a conversion framework to convert an arbitrary tree topology into multiple analogous line topologies to reduce the analysis complexity. We then propose a Time-Critical wireless network Scheduling (TCS) algorithm to minimize the data collection latency of coexisting TCWNs. The TCS algorithm consists of two phases. In the internetwork scheduling phase, we strictly derive a general expression to characterize the practical network requirements. In the intranetwork scheduling phase, we design two levels of priority assignment algorithms to accurately characterize the critical states and resource requirements of different nodes. We conduct extensive simulations to verify the effectiveness of the TCS algorithm. The evaluation results show that the TCS algorithm can achieve minimum data collection latency in more than 99.956% cases, and the maximum difference compared to the optimal value is one time slot. © 2004-2012 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

When Shannon Meets Nonstochastic Information: Communication and Estimation

引用

IEEE Transactions on Automatic control 2025年

作者： Zhang, Wentao Zuo, Zhiqiang Zhao, Rui Wang, Yijing Hu, Guoqiang Zhang, Hui Wang, Yaonan Hunan University School of Robotics Changsha410082 China Nanyang Technological University Continental-NTU Corporate Lab Singapore639798 Singapore Tianjin University Tianjin Key Laboratory of Intelligent Unmanned Swarm Technology and System School of Electrical and Information Engineering Tianjin300072 China Nanyang Technological University School of Electrical and Electronic Engineering Singapore639798 Singapore National Engineering Research Center for Robot Visual Perception and Control Changsha410082 China Hunan University College of Electrical and Information Engineering Changsha410082 China

This notes focuses on the issue of whether or not the state of a plant can be estimated when the inputs of communication channel involve noise and disturbance simultaneously. It turns out to calculate the maximum capacity of stationary memoryless multiple quasi-access channel under nonstochastic information theory. It is shown that the maximum information rate over such a channel is determined by a convex hull spanned by the zero-error capacities which are specified on the underlying sample spaces. Moreover, the state of a plant could be estimated provided that the maximal information rate is strictly greater than the topology entropy. © 1963-2012 IEEE.

关键词： Communication channels (information theory)

来源：评论

学校读者我要写书评

暂无评论

An Improved Registration Algorithm based on Geometric Feature for the Calibration of Workpiece Coordinate 35

An Improved Registration Algorithm based on Geometric Featur...

引用

第35届中国控制会议

作者： LV Liang SUN Lei Institute of Robotics and Automatic Information System College of Computer and Control engineeringNankai University Tianjin Key Laboratory of Intelligent Robotics

ISBN: (纸本)9781509009107

Since target points could be generated quickly and accurately by off-line programming in the industrial robot machining,it is used widely in industrial *** to installation error and mismachining tolerance which causes the offset of processing paths in the actual machining process,the registration algorithms for path calibration would be *** the traditional approach would converge to local optimal solution,an improved registration algorithm based on geometric properties of point clouds is proposed in the ***,feature point sets are acquired by the curvature of point clouds and matched by traditional PCA algorithm,an initial value for precise registration is ***,the improved ICP algorithm by curvature is utilized to modify the former result and reduce the execution time of precise registration,the path calibration can be *** experimental result of the approach is validated in this paper which is significative for calibration of processing paths.

关键词： Registration Curvature Feature Point Sets Path Calibration

来源：评论

学校读者我要写书评

暂无评论

Enhanced Geometric Map:a 2D&3D Hybrid City Model of Large Scale Urban Environment for Robot Navigation

引用

机器人 2016年第3期38卷 311-321页

作者： LI Haifeng HU Zunhe LIU Jingtai College of Computer Science and Technology Civil Aviation University of China Tianjin 300300 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou 350121 China Institute of Robotics and Information Automatic System Nankai University Tianjin 300071 China Tianjin Key Laboratory of Intelligent Robotics Tianjin 300071 China

To facilitate scene understanding and robot navigation in large scale urban environment, a two-layer enhanced geometric map(EGMap) is designed using videos from a monocular onboard camera. The 2D layer of EGMap consists of a 2D building boundary map from top-down view and a 2D road map, which can support localization and advanced map-matching when compared with standard polyline-based maps. The 3D layer includes features such as 3D road model,and building facades with coplanar 3D vertical and horizontal line segments, which can provide the 3D metric features to localize the vehicles and flying-robots in 3D space. Starting from the 2D building boundary and road map, EGMap is initially constructed using feature fusion with geometric constraints under a line feature-based simultaneous localization and mapping(SLAM) framework iteratively and progressively. Then, a local bundle adjustment algorithm is proposed to jointly refine the camera localizations and EGMap features. Furthermore, the issues of uncertainty, memory use, time efficiency and obstacle effect in EGMap construction are discussed and analyzed. Physical experiments show that EGMap can be successfully constructed in large scale urban environment and the construction method is demonstrated to be very accurate and robust.

关键词：被提高的几何学的地图都市模型机械手航运同时发生的定位而且映射局部的包裹调整

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：