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

Spatiotemporal distance embedded hybrid ant colony algorithm for a kind of vehicle routing problem with constraints

Frontiers of Information Technology & Electronic Engineering 2023年第7期24卷 1062-1079页

作者： Zhenhui FENG Renbin XIAO School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074China Institute of Artificial Intelligence Huazhong University of Science and TechnologyWuhan 430074China Key Laboratory of Image Information Processing and Intelligent Control Ministry of EducationWuhan 430074China

We investigate a kind of vehicle routing problem with constraints(VRPC)in the car-sharing mobility environment,where the problem is based on user orders,and each order has a reservation time limit and two location point transitions,origin and *** is a typical extended vehicle routing problem(VRP)with both time and space *** consider the VRPC problem characteristics and establish a vehicle scheduling model to minimize operating costs and maximize user(or passenger)*** solve the scheduling model more accurately,a spatiotemporal distance representation function is defined based on the temporal and spatial properties of the customer,and a spatiotemporal distance embedded hybrid ant colony algorithm(HACA-ST)is *** algorithm can be divided into two ***,through spatiotemporal clustering,the spatiotemporal distance between users is the main measure used to classify customers in categories,which helps provide heuristic information for problem ***,an improved ant colony algorithm(ACO)is proposed to optimize the solution by combining a labor division strategy and the spatiotemporal distance function to obtain the final scheduling *** analysis is carried out based on existing data sets and simulated urban *** with other heuristic algorithms,HACA-ST reduces the length of the shortest route by 2%–14%in benchmark *** VRPC testing instances,concerning the combined cost,HACA-ST has competitive cost compared to existing VRP-related ***,we provide two actual urban scenarios to further verify the effectiveness of the proposed algorithm.

关键词： Vehicle routing problem with constraints(VRPC) Spatiotemporal distance function Labor division strategy Ant colony algorithm(ACO)

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Path Finding and Moving Stability-Focused Trajectory Planning for Mobile Robots

Towards Efficient Path Finding and Moving Stability-Focused ...

引用

2024 IEEE International Conference on Robotics and Biomimetics, ROBIO 2024

作者： Hou, Muyang Lei, Zhenya Hu, Haidong Wang, Zhong Wang, Yong Xie, Le Wang, Hesheng Shanghai Jiao Tong University Department of Automation Shanghai200240 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Beijing Institute of Control Engineering Beijing100190 China Institute of Medical Robotics Shanghai Jiao Tong University Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Department of Automation Shanghai200240 China

ISBN: (纸本)9781665481090

Nowadays, mobile robots play an important role in a variety of service scenarios. They need to plan and track trajectories to accomplish tasks such as delivery or guided tours. In such tasks, there are two remaining challenges: on one hand, the time and memory consumption of present path planners are still significant;on the other hand, service robots, which have a higher center of gravity, demand greater moving stability than that of current trajectory planners provide. To address these two challenges. Firstly, we propose a safety boundary first A∗ which fully utilizes environmental obstacle information to create a safety boundary and searches in it to quickly find an initial path. Secondly, we formulate the trajectory optimization problem as a nonlinear optimization problem, where the smoothness, safety, feasibility, and moving stability of the robot are taken into account. Furthermore, to constrain the robot's lateral acceleration, we design a time allocation algorithm based on non-uniform B-spline, enhancing the quality of the resulting trajectory. Simulations and real-world experiments demonstrate that our algorithms significantly improve path search efficiency, enhance moving stability, reduce the difficulty of tracking, and improve the quality of task completion. © 2024 IEEE.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Expanding Hyperspherical Space for Few-Shot Class-Incremental Learning

Expanding Hyperspherical Space for Few-Shot Class-Incrementa...

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Yao Deng Xiang Xiang Key Lab of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

In today’s ever-changing world, the ability of machine learning models to continually learn new data without forgetting previous knowledge is of utmost importance. However, in the scenario of few-shot class-incremental learning (FSCIL), where models have limited access to new instances, this task becomes even more challenging. Current methods use prototypes as a replacement for classifiers, where the cosine similarity of instances to these prototypes is used for prediction. However, we have identified that the embedding space created by using the relu activation function is incomplete and crowded for future classes. To address this issue, we propose the Expanding Hyperspherical Space (EHS) method for FSCIL. In EHS, we utilize an odd-symmetric activation function to ensure the completeness and symmetry of embedding space. Additionally, we specify a region for base classes and reserve space for unseen future classes, which increases the distance between class distributions. Pseudo instances are also used to enable the model to anticipate possible upcoming samples. During inference, we provide rectification to the confidence to prevent bias towards base classes. We conducted experiments on benchmark datasets such as CIFAR100 and miniimageNet, which demonstrate that our proposed method achieves state-of-the-art performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross-Domain Few-Shot Incremental Learning for Point-Cloud Recognition

Cross-Domain Few-Shot Incremental Learning for Point-Cloud R...

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Yuwen Tan Xiang Xiang Key Lab of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

Sensing 3D objects is critical when 2D object recognition is not accessible. A robot pre-trained on a large point-cloud dataset will encounter unseen classes of 3D objects after deploying it. Therefore, the robot should be able to learn continuously in real-world scenarios. Few-shot class-incremental learning (FSCIL) requires the model to learn from few-shot new examples continually and not forget past classes. However, there is an implicit but strong assumption in the FSCIL that the distribution of the base and incremental classes is the same. In this paper, we focus on cross-domain FSCIL for point-cloud recognition. We decompose the catastrophic forgetting into base class forgetting and incremental class forgetting and alleviate them separately. We utilize the base model to discriminate base samples and new samples by treating base samples as in-distribution samples, and new objects as out-of-distribution samples. We retain the base model to avoid catastrophic forgetting of base classes and train an extra domain-specific module for all new samples to adapt to new classes. At inference, we first discriminate whether the sample belongs to the base class or the new class. Once classified at the model level, test samples are then passed to the corresponding model for class-level classification. To better mitigate the forgetting of new classes, we adopt the soft label and hard label replay together. Extensive experiments on synthetic-to-real incremental 3D datasets show that our proposed method can balance the performance between the base and new objects and outperforms the previous state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Process Monitoring Based on Temporal Feature Agglomeration and Enhancement

引用

IEEE/CAA Journal of Automatica Sinica 2023年第3期10卷 825-827页

作者： Xiao Liang Weiwu Yan Yusun Fu Huihe Shao Department of Automation the School of Electronic Information and Electrical EngineeringShanghai Jiao Tong UniversityShanghai 200240China Department of Automation the School of Electronic Information and Electrical EngineeringShanghai Jiao Tong UniversityShanghai 200240 Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai 200240China

Dear Editor,This letter proposes a process-monitoring method based on temporal feature agglomeration and enhancement,in which a novel feature extractor called contrastive feature extractor(CFE)extracts the temporal and relational features among process *** the feature representations are enhanced by maximizing the separation among different classes while minimizing the scatter within each class.

关键词： among while letter

来源：评论

学校读者我要写书评

暂无评论

Global Convergence Guarantees of (A)GIST for a Family of Nonconvex Sparse Learning Problems

引用

IEEE Transactions on Cybernetics 2022年第5期52卷 3276-3288页

作者： Zhang, Hengmin Qian, Feng Shang, Fanhua Du, Wenli Qian, Jianjun Yang, Jian East China University of Science and Technology Key Laboratory of Advanced Control and Optimization for Chemical Processes of Ministry of Education School of Information Science and Engineering Shanghai200237 China Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China Xidian University Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Artificial Intelligence Xi'an710071 China Peng Cheng Laboratory Shenzhen518066 China Nanjing University of Science and Technology Pca Laboratory Key Lab. of Intelligent Percept. and Syst. for High-Dimensional Information of Ministry of Education Nanjing210094 China Nanjing University of Science and Technology Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing210094 China

In recent years, most of the studies have shown that the generalized iterated shrinkage thresholdings (GISTs) have become the commonly used first-order optimization algorithms in sparse learning problems. The nonconvex relaxations of the \ell _{0} -norm usually achieve better performance than the convex case (e.g., \ell _{1} -norm) since the former can achieve a nearly unbiased solver. To increase the calculation efficiency, this work further provides an accelerated GIST version, that is, AGIST, through the extrapolation-based acceleration technique, which can contribute to reduce the number of iterations when solving a family of nonconvex sparse learning problems. Besides, we present the algorithmic analysis, including both local and global convergence guarantees, as well as other intermediate results for the GIST and AGIST, denoted as (A)GIST, by virtue of the Kurdyka-Lojasiewica (KL) property and some milder assumptions. Numerical experiments on both synthetic data and real-world databases can demonstrate that the convergence results of objective function accord to the theoretical properties and nonconvex sparse learning methods can achieve superior performance over some convex ones. © 2013 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Safety Protection Analysis with Formal Verification for Process control System Under Cyberattacks

Safety Protection Analysis with Formal Verification for Proc...

引用

第35届中国过程控制会议

作者： Xuqing Liang Chunjie Zhou Yu-Chu Tian Xin Du Peihang Xu School of Artificial Intelligence and Automation Huazhong University of Science and Technology The Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Computer Science Queensland University of Technology

The safety protection of process control systems plays a crucial role in the overall safety of critical *** have increased the complexity of existing safety protection analysis. Traditional safety analysis methods fall short in accounting for cyberattack factors, making it challenging to conduct safety protection analysis under cyberattacks. To address this issue, this paper presents a new safety protection analysis method that considers multiple safety factors explicitly including cyberattacks using formal verification. The method consists of three main components: exhaustive system safety specifications,formal models, and system safety validation. The system safety specification component adds a cyberattack factor to system safety requirements based on the system theory process analysis(STPA) method. The formal model component considers the system's dynamic operation process, and safety protection behaviors under typical attack behaviors. The system safety validation component validates the effectiveness of system safety protection under cyberattacks by the UPPAAL tool, from the perspective of whether system safety constraints are triggered and whether the change curve of process variables is compliant. Finally, the effectiveness of the presented approach is carried out for a simplified fluid catalytic cracking(FCC) fractionating system.

关键词： Safety protection analysis Formal verification Cyberattacks System theory process analysis(STPA)

来源：评论

学校读者我要写书评

暂无评论

Task Allocation and Path Planning for Multiple Destinations Oriented Towards Task Updates

Task Allocation and Path Planning for Multiple Destinations ...

引用

International Conference on Industrial Artificial Intelligence (IAI)

作者： Yong Yang Dingxin He Huantao Mao Hong Chen Hongtao Wu Zhi-Wei Liu School of Artificial Intelligence and Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798350356618

ISBN: (纸本)9798350356625

This study addresses the complexities of orchestrating multi-target transportation tasks within multi-agent systems, constrained by load capacity. The primary objective is to engineer an advanced path planning framework that assures collision avoidance and optimal load distribution. Diverging from conventional single-path strategies, this research incorporates load factors and requires continuous dynamic multi-target point and path planning to ensure agents can efficiently navigate through a series of predetermined key points. To address this complex requirement, a two-stage multi-agent task allocation and path planning method is proposed. First, an initial solution is obtained using a suboptimal algorithm, followed by optimization iterations using the large neighborhood search algorithm to improve task allocation. In the second stage, an accelerated algorithm based on priority search is used to plan optimal paths for each agent in a predetermined order. The proposed algorithm's effectiveness is comprehensively evaluated through a series of experimental evaluations and comparisons with the commercial solver Gurobi within a limited time. The results show that the proposed method achieves optimality in both running time and minimum path cost while ensuring the load balance of agents.

关键词： Costs Navigation Heuristic algorithms Transportation Path planning Robustness Planning Resource management Optimization Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Infrastructure-Based Vehicle Localization System for Indoor Parking Lots Using RGB-D Cameras

引用

Journal of Shanghai Jiaotong university(Science) 2023年第1期28卷 61-69页

作者：曹炳全贺越生庄瀚洋杨明 Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai 200240China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai 200240China University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong UniversityShanghai 200240China

Accurate vehicle localization is a key technology for autonomous driving tasks in indoor parking lots,such as automated valet ***,infrastructure-based cooperative driving systems have become a means to realizing intelligent *** this paper,we propose a novel and practical vehicle localization system using infrastructure-based RGB-D cameras for indoor parking *** the proposed system,we design a depth data preprocessing method with both simplicity and efficiency to reduce the computational burden resulting from a large amount of ***,the hardware synchronization for all cameras in the sensor network is not implemented owing to the disadvantage that it is extremely cumbersome and would significantly reduce the scalability of our system in mass ***,to address the problem of data distortion accompanying vehicle motion,we propose a vehicle localization method by performing template point cloud registration in distributed depth ***,a complete hardware system was built to verify the feasibility of our solution in a real-world *** in an indoor parking lot demonstrated the effectiveness and accuracy of the proposed vehicle localization system,with a maximum root mean squared error of 5 cm at 15Hz compared with the ground truth.

关键词： infrastructure-based RGB-D camera vehicle localization point cloud registration

来源：评论

学校读者我要写书评

暂无评论

Dynamic Event-Triggered Consensus on Matrix-Weighted Networks: Leadless Case 42

Dynamic Event-Triggered Consensus on Matrix-Weighted Network...

引用

42nd Chinese control Conference, CCC 2023

作者： Dou, Lintao Wei, Haoyu Huang, Jian Pan, Lulu Shao, Haibin Li, Dewei College of Intelligent Science National University of Defense Technology Changsha410003 China Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Department of Automation Shanghai200240 China

ISBN: (纸本)9789887581543

This paper examines the event-triggered consensus of the multi-agent system on matrix-weighted networks, where the interdependencies among higher-dimensional states of neighboring agents are characterized by matrix-weighted edges in the network. Specifically, a novel distributed dynamic event-triggered coordination strategy is proposed for this category of generalized networks, in which an auxiliary system is employed for each agent to dynamically adjust the triggering threshold, which plays an essential role in guaranteeing that the triggering time sequence does not exhibit Zeno behavior. Distributed event-triggered control protocols are proposed to guarantee leaderless consensus for multi-agent systems on matrix-weighted networks, respectively. Remarkably, the spectrum of matrix-valued weights is crucial in event-triggered mechanism design for matrix-weighted networks, generalizing those results only applicable for scalar-weighted networks. The proposed approach allows each agent to broadcast and receive information only at its triggering instants. Finally, simulation examples are provided to demonstrate the theoretical results. © 2023 Technical Committee on control Theory, Chinese Association of Automation.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：