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

2024 China Automation Congress, CAC 2024

作者： Zhang, Haozhe Ma, Liyan Ying, Shihui Institute of Artificial Intelligence Shanghai University Shanghai200444 China School of Computer Engineering and Science School of Mechatronic Engineering and Automation Shanghai Key Laboratory of Intelligent Manufacturing and Robotics Shanghai University Shanghai200444 China Department of Mathematics School of Science Shanghai University Shanghai200444 China

ISBN: (纸本)9798350368604

Traditional fully annotated closed set 3D object detection methods improve model performance but are impractical in real-world settings due to the emergence of new categories and the complexity of 3D annotations. Open-World Object Detection (OWOD) addresses these issues but relies heavily on manual labeling, which is costly. This paper focuses on open world active learning and proposes an entropy-guided reinforced open world active 3D object detection (EROA). EROA regards active learning as a reinforcement learning problem tailored for open driving scenarios. We use entropy as a reward metric for efficient reinforcement learning. We also leverage knowledge from the 2D domain using object-level large-scale vision-language models to enhance sample selection. Extensive experiments evidence that the proposed EROA meets the dynamic and cost-sensitive requirements of autonomous driving, enabling real-time detection of both known and unknown objects. © 2024 IEEE.

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

Toward a Low-Cost Perception System in Autonomous Vehicles: A Spectrum Learning Approach

arXiv

引用

arXiv 2025年

作者： Alsakabi, Mohammed Erickson, Aidan Dolan, John M. Tonguz, Ozan K. Department of Electrical and Computer Engineering College of Engineering The Robotics Institute School of Computer Science Carnegie Mellon University PittsburghPA United States

We present a cost-effective new approach for generating denser depth maps for Autonomous Driving (AD) and Autonomous Vehicles (AVs) by integrating the images obtained from deep neural network (DNN) 4D radar detectors with conventional camera RGB images. Our approach introduces a novel pixel positional encoding algorithm inspired by Bartlett’s spatial spectrum estimation technique. This algorithm transforms both radar depth maps and RGB images into a unified pixel image subspace called the Spatial Spectrum, facilitating effective learning based on their similarities and differences. Our method effectively leverages high-resolution camera images to train radar depth map generative models, addressing the limitations of conventional radar detectors in complex vehicular environments, thus sharpening the radar output. We develop spectrum estimation algorithms tailored for radar depth maps and RGB images, a comprehensive training framework for data-driven generative models, and a camera-radar deployment scheme for AV operation. Our results demonstrate that our approach also outperforms the state-of-the-art (SOTA) by 27.95% in terms of Unidirectional Chamfer Distance (UCD). © 2025, CC BY-NC-ND.

关键词： Radar imaging

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning Technique for Detection of Diabetes Mellitus 5

A Machine Learning Technique for Detection of Diabetes Melli...

引用

5th International Conference on Information Technology for Education and Development, ITED 2022

作者： Awoniran, O.M. Oyelami, M.O. Ikono, R.N. Famutimi, R.F. Famutimi, T.I. Bowen University Computer Science Program Iwo Nigeria Obafemi Awolowo University Department of Computer Science and Engineering Ile-Ife Nigeria

ISBN: (纸本)9781509064229

The need for early detection of diabetes mellitus has led to the development of various intelligent systems using machine learning and artificial intelligence for the recognition of the presence of the disease. However, most of the techniques have yielded a comparatively lower accuracy. This research applied data science techniques to a dataset of diabetes mellitus to improve the accuracy of the prediction of the disease. This was achieved by pre-processing the data with dummy categories and applying principal components analysis for reduced dimensionality. Support vector machine, random forest classifier, and deep neural networks were then used to train the system. Support vector machine, random forest classifier, and deep neural networks yielded accuracies of 0.76, 0.77, and 0.89 respectively. Correspondingly, deep neural networks yielded the highest accuracy. The study concluded that better pre-processing will improve the accuracy of machine learning algorithms in the prediction of diabetes mellitus. © 2022 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Graph Neural Network Multi-Task Learning-Based Approach for Detection and Localization of Cyberattacks in Smart Grids 48

A Graph Neural Network Multi-Task Learning-Based Approach fo...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Takiddin, Abdulrahman Atat, Rachad Ismail, Muhammad Davis, Katherine Serpedin, Erchin Texas A and M University Department of Electrical and Computer Engineering College StationTX United States Texas A and M University at Qatar Electrical and Computer Engineering Program Doha Qatar Tennessee Technological University Department of Computer Science CookevilleTN United States

ISBN: (纸本)9781728163277

False data injection attacks (FDIAs) on smart power grids' measurement data present a threat to system stability. When malicious entities launch cyberattacks to manipulate the measurement data, different grid components will be affected, which leads to failures. For effective attack mitigation, two tasks are required: determining the status of the system (normal operation/under attack) and localizing the attacked bus/power substation. Existing mitigation techniques carry out these tasks separately and offer limited detection performance. In this paper, we propose a multi-Task learning-based approach that performs both tasks simultaneously using a graph neural network (GNN) with stacked convolutional Chebyshev graph layers. Our results show that the proposed model presents superior system status identification and attack localization abilities with detection rates of 98.5-100% and 99-100%, respectively, presenting improvements of 5-30% compared to benchmarks. © 2023 IEEE.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Path Finding Using Conflict-Based Search and Structural-Semantic Topometric Maps

arXiv

引用

arXiv 2025年

作者： Fredriksson, Scott Bai, Yifan Saradagi, Akshit Nikolakopoulos, George Robotics and AI group Department of Computer Science Electrical and Space Engineering Luleå University of Technology Sweden

As industries increasingly adopt large robotic fleets, there is a pressing need for computationally efficient, practical, and optimal conflict-free path planning for multiple robots. Conflict-Based Search (CBS) is a popular method for multi-agent path finding (MAPF) due to its completeness and optimality;however, it is often impractical for real-world applications, as it is computationally intensive to solve and relies on assumptions about agents and operating environments that are difficult to realize. This article proposes a solution to overcome computational challenges and practicality issues of CBS by utilizing structural-semantic topometric maps. Instead of running CBS over large grid-based maps, the proposed solution runs CBS over a sparse topometric map containing structural-semantic cells representing intersections, pathways, and dead ends. This approach significantly accelerates the MAPF process and reduces the number of conflict resolutions handled by CBS while operating in continuous time. In the proposed method, robots are assigned time ranges to move between topometric regions, departing from the traditional CBS assumption that a robot can move to any connected cell in a single time step. The approach is validated through real-world multi-robot path-finding experiments and benchmarking simulations. The results demonstrate that the proposed MAPF method can be applied to real-world non-holonomic robots and yields significant improvement in computational efficiency compared to traditional CBS methods while improving conflict detection and resolution in cases of corridor symmetries. Copyright © 2025, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Applying ant colony optimization algorithm to solve flying probe inspection problem

Applying ant colony optimization algorithm to solve flying p...

引用

2023 International Conference on Consumer Electronics - Taiwan, ICCE-Taiwan 2023

作者： Chen, Chih-Yung Chang, Yu-Ming National Pingtung University of Science and Technology Program in Artificial Intelligence and Mechatronics Pingtung Taiwan Shu-Te University Department of Computer Science and Information Engineering Kaohsiung Taiwan

ISBN: (纸本)9798350324174

This paper applies ant colony optimization (ACO) algorithm for the dual-pin flying probe circuit board inspection optimal path searching problem. First, the proposed approach creates a representation for circuit inspection path, which groups and encodes the measurement endpoints into a sequence. Moreover, the ant colony algorithm with the sequence can be used to solve the complex circuit optimal problem. The experimental results show that the best solutions of ACO are performed better than other algorithms. © 2023 IEEE.

关键词： Inspection

来源：评论

学校读者我要写书评

暂无评论

Convergent effects of peptides on the initiation of feeding motor programs in the mollusk Aplysia

引用

Journal of Neurophysiology 2025年第5期133卷 1368-1379页

作者： Evans, Colin G. Barry, Michael A. Reaver, Carrie N. Patel, Paras R. Chestek, Cynthia A. Perkins, Matthew H. Jing, Jian Cropper, Elizabeth C. Department of Neuroscience Friedman Brain Institute Icahn School of Medicine at Mount Sinai New York NY United States Department of Biomedical Engineering Biointerfaces Institute University of Michigan Ann Arbor MI United States Department of Electrical Engineering and Computer Science Neurosciences Program Robotics Program University of Michigan Ann Arbor MI United States State Key Laboratory of Pharmaceutical Biotechnology Institute for Brain Sciences Chemistry and Biomedicine Innovation Center Jiangsu Engineering Research Center for MicroRNA Biology and Biotechnology Advanced Institute for Life Sciences School of Life Sciences Nanjing University Nanjing China

Neuropeptides configure the feeding network of Aplysia. For example, egestive activity is promoted by small cardioactive peptide (SCP), and ingestive activity is promoted by a combination of feeding circuit activating peptide (FCAP) and cerebral peptide 2 (CP-2). In addition, SCP and FCAP/CP-2 have a common network effect that does not contribute to motor program specification. They increase the excitability of an interneuron, B63. In this report, we further characterized the effects of peptides on B63. We performed voltage-clamp experiments and used a step protocol to look at steady-state currents. We found that SCP and FCAP/CP-2 both induced an inward current that was virtually absent in low-sodium saline. Previous work has established that B63 is unusual in the feeding circuit in that subthreshold depolarizations are autonomously generated that can trigger motor programs. Here, we show that this autonomous activity is more frequent in the presence of peptides. Previous studies have also shown that activity of the feeding central pattern generator (CPG) can be initiated by neurons that excite B63, e.g., by cerebral buccal interneuron 2 (CBI-2), a projection neuron that triggers biting-like motor programs. Here, we show that the latency of CBI-2-induced activity is decreased by stimulation of the esophageal nerve (EN) (which releases endogenous SCP). These results, taken together with previous results, indicate that peptides that act divergently to configure network activity additionally act convergently to promote motor program induction. We present data that suggest that this arrangement facilitates brief switches between ingestive and egestive motor activity. © 2025 The Authors.

关键词： central pattern generator invertebrate modulation motor program neuropeptide

来源：评论

学校读者我要写书评

暂无评论

Progress Estimation of an Excavation Pit 39

Progress Estimation of an Excavation Pit

引用

39th International Symposium on Automation and robotics in Construction, ISARC 2022

作者： Vierling, A. Groll, T. Meckel, D. Heim, K. Walter, D. Scheidhauer, L. Körkemeyer, K. Berns, K. Department of Computer Science Robotics Research Lab University of Kaiserslautern Germany Department of Civil Engineering Construction Management University of Kaiserslautern Germany

ISBN: (纸本)9789526952420

This paper presents a method for automated excavation speed and progress estimation. First, a measure for the progress speed of an excavation pit is taken from the literature and evaluated regarding the possibility for automation. For each possible parameter, an automated extraction algorithm is presented. The used system is an autonomous excavator arm of a backhoe loader where the used hardware and software system is described. Experimental evaluation of the presented approach has been done with the autonomous system for a small trench, including multiple digging cycles. The resulting measurements seem to include some systematic errors which could be identified and suitable sanity checks could be implemented, removing the erroneous measurements. The remaining measurements were used to determine the excavation speed of the autonomous excavator arm and compared to the values of experienced and amateur operators. © 2022 International Association on Automation and robotics in Construction.

关键词： Excavation

来源：评论

学校读者我要写书评

暂无评论

Swarm Intelligence Path-Planning Pipeline and Algorithms for UAVs: Simulation, Analysis and Recommendation 26

Swarm Intelligence Path-Planning Pipeline and Algorithms for...

引用

26th International Conference on Enterprise Information Systems, ICEIS 2024

作者： Harris, Wyatt Tseng, Sean Viso, Tabatha Weissman, Max Ngan, Chun-Kit Department of Robotics Engineering Worcester Polytechnic Institute 100 Institute Rd. WorcesterMA United States Data Science Program Worcester Polytechnic Institute 100 Institute Rd. WorcesterMA United States

ISBN: (纸本)9789897586927

This research work aims to support domain experts in the selection of proper path planning algorithms for UAVs to solve a domain business problem (i.e., the last mile delivery of goods). In-depth analysis, insight, and recommendations of three promising approaches, including reinforcement learning-based, bio-inspired-based, and physics-based are used to address the multi-agent UAV path planning problem. Specifically, the contributions of this work are fourfold: First, we develop a unified pipeline to implement each approach to conduct this analysis. Second, we build a 2D UAV path planning environment to simulate each approach. Third, using this 2D environment, we run the 450 simulations in three different group sizes of swarm UAV agents (i.e., 3, 5, and 10) within three environments of varying complexity (i.e., Easy, Intermediate, and Hard). We aggregate the simulation data and compare their performance in terms of success rate, run-time, and path length while using the classical A* Search as a baseline. Finally, based upon the performance of each approach and our analytical investigations, we provide informed recommendations for the optimal use case of each UAV path planning approach. The recommendations are presented using parameters for environmental complexity and urgency of goods delivery. Copyright © 2024 by SCITEPRESS – science and Technology Publications, Lda.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Improved IP lookup technology for trie-based data structures

引用

Journal of computer and System sciences 2023年 133卷 41-55页

作者： Lin, Yen-Heng Hsieh, Sun-Yuan Master Degree Program on Artificial Intelligence National Cheng Kung University Tainan701 Taiwan Department of Computer Science and Information Engineering Institute of Manufacturing Information Systems Institute of Medical Informatics National Cheng Kung University Tainan701 Taiwan Department of Computer Science and Information Engineering National Chi Nan University Nantou Puli Township54561 Taiwan

Many Internet protocol (IP) lookup algorithms have been formulated to improve network performance. This study reviewed and experimentally evaluated technologies for trie-based methods that reduce memory access, memory consumption and IP lookup time. Experiments involving binary tries (for simplicity) were conducted on four real-world data sets, two of which were on IPv4 router tables (855,997 and 876,489 active prefixes) and two of which were on IPv6 router tables (155,310 and 157,579 active prefixes). Technologies designed to reduce time taken (at the expense of memory consumption) worked well for IPv4, and those designed to reduce memory consumption worked well for IPv6. Various combinations of these technologies were applied together in the experiments. © 2022 Elsevier Inc.

关键词： Table lookup

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：