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

SRH-Net: Stacked Recurrent Hourglass Network for Stereo Matching

IEEE robotics AND automation LETTERS 2021年第4期6卷 8005-8012页

作者： Du, Hongzhi Li, Yanyan Sun, Yanbiao Zhu, Jigui Tombari, Federico Tianjin Univ State Key Lab Precis Measuring Technol & Instrume Tianjin 300072 Peoples R China Tech Univ Munich Dept Informat D-80333 Munich Germany Google Inc Mountain View CA USA

The cost aggregation strategy shows a crucialrole in learning-based stereo matching tasks, where 3D convolutional filters obtain state of the art but require intensive computation resources, while 2D operations need less GPU memory but are sensitive to domain shift. In this letter, we decouple the 4D cubic cost volume used by 3D convolutional filters into sequential cost maps along the direction of disparity instead of dealing with it at once by exploiting a recurrent cost aggregation strategy. Furthermore, a novel recurrent module, Stacked Recurrent Hourglass (SRH), is proposed to process each cost map. Our hourglass network is constructed based on Gated Recurrent Units (GRUs) and down/upsampling layers, which provides GRUs larger receptive fields. Then two hourglass networks are stacked together, while multi-scale information is processed by skip connections to enhance the performance of the pipeline in textureless areas. The proposed architecture is implemented in an end-to-end pipeline and evaluated on public datasets, which reduces GPU memory consumption by up to 56.1% compared with PSMNet using stacked hourglass 3D CNNs without the degradation of accuracy. Then, we further demonstrate the scalability of the proposed method on several high-resolution pairs, while previously learned approaches often fail due to the memory constraint. The code is released at https://***/hongzhidu/SRHNet.

关键词： Computer vision for automation deep learning in robotics and automation

来源：评论

学校读者我要写书评

暂无评论

Motion Planning Networks: Bridging the Gap Between learning-Based and Classical Motion Planners

引用

IEEE TRANSACTIONS ON robotics 2021年第1期37卷 48-66页

作者： Qureshi, Ahmed Hussain Miao, Yinglong Simeonov, Anthony Yip, Michael C. Univ Calif San Diego La Jolla CA 92093 USA MIT 77 Massachusetts Ave Cambridge MA 02139 USA

This article describes motion planning networks (MPNet), a computationally efficient, learning-based neural planner for solving motion planning *** uses neural networks to learn general near-optimal heuristics for path planning in seen and unseen environments. It takes environment information such as raw point cloud from depth sensors, as well as a robot's initial and desired goal configurations and recursively calls itself to bidirectionally generate connectable paths. In addition to finding directly connectable and near-optimal paths in a single pass, we show that worst-case theoretical guarantees can be proven if we merge this neural network strategy with classical sample-based planners in a hybrid approach while still retaining significant computational and optimality improvements. To train the MPNet models, we present an active continual learning approach that enables MPNet to learn from streaming data and actively ask for expert demonstrations when needed, drastically reducing data for training. We validate MPNet against gold-standard and state-of-the-art planning methods in a variety of problems from two-dimensional to seven-dimensional robot configuration spaces in challenging and cluttered environments, with results showing significant and consistently stronger performance metrics, and motivating neural planning in general as a modern strategy for solving motion planning problems efficiently.

关键词： Planning Robots Neural networks Path planning Search methods Training data Probabilistic logic deep learning in robotics and automation learning and adaptive systems learning from demonstration motion and path planning

来源：评论

学校读者我要写书评

暂无评论

Exploiting Object Similarity for Robotic Visual Recognition

引用

IEEE TRANSACTIONS ON robotics 2021年第1期37卷 16-33页

作者： Cai, Hong Mostofi, Yasamin Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

In this article, we are interested in robotic visual object classification using a deep convolutional neural network (DCNN) classifier. We show that the correlation coefficient of the automatically learned DCNN features of two object images carries robust information on their similarity, and can be utilized to significantly improve the robot's classification accuracy, without additional training. More specifically, we first probabilistically analyze how the feature correlation carries vital similarity information and build a correlation-based Markov random field (CoMRF) for joint object labeling. Given query and motion budgets, we then propose an optimization framework to plan the robot's query and path based on our CoMRF. This gives the robot a new way to optimally decide which object sites to move close to for better sensing and for which objects to ask a remote human for help with classification, which considerably improves the overall classification. We extensively evaluate our proposed approach on two large datasets (e.g., drone imagery and indoor scenes) and several real-world robotic experiments. The results show that our proposed approach significantly outperforms the benchmarks.

关键词： Robot sensing systems Visualization Labeling Correlation Training Measurement Artificial intelligence (AI)-based methods co-optimization of robotic path planning deep learning in robotics and automation object detection querying and visual recognition segmentation and categorization

来源：评论

学校读者我要写书评

暂无评论

Safe deep learning-based global path planning using a fast collision-free path generator

引用

robotics AND AUTONOMOUS SYSTEMS 2023年 163卷

作者： Chehelgami, Shirin Ashtari, Erfan Basiri, Mohammad Amin Masouleh, Mehdi Tale Kalhor, Ahmad Univ Tehran Sch Elect & Comp Engn Human & Robot Interact Lab Tehran Iran

In this research, a global path planning method based on recurrent neural networks by means of a new Loss function is presented, which regardless of the complexity of the configuration space, generates the path in a relatively constant time. The new Loss function is defined in such a way that in addition to learning the input data of the network, it creates an adjustable safety margin around the obstacles and ultimately creates a safe path. Moreover, a new global path planning method is also introduced, which is used to create the dataset required to train the proposed neural network. The convergence of this method is mathematically proven and it is shown that this method can also produce a suboptimal path in a much shorter time than the common methods of global path planning reported in the literature. In short, the main purpose of this research consists in providing a method which can create a suboptimal, fast and safe path for a mobile robot from any random starting point to any random destination in a known environment. First, the proposed methods will be implemented for different two-dimensional environments consisting of convex and non-convex obstacles, considering the robot as a point-mass, and then it will be implemented in a simulation environment, AI2THOR. Compared to classical global path planning algorithms, such as RRT and A*, the proposed approach demonstrates better performance in complex and challenging environments. (c) 2023 Elsevier B.V. All rights reserved.

关键词： Mobile robots deep learning in robotics and automation Recurrent neural network Fast global path planner Safe path generator

来源：评论

学校读者我要写书评

暂无评论

deep Neural Network Based Electrical Impedance Tomographic Sensing Methodology for Large-Area Robotic Tactile Sensing

引用

IEEE TRANSACTIONS ON robotics 2021年第5期37卷 1570-1583页

作者： Park, Hyunkyu Park, Kyungseo Mo, Sangwoo Kim, Jung Korea Adv Inst Sci & Technol Dept Mech Engn Daejeon 34141 South Korea Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon 34141 South Korea

Electrical impedance tomography (EIT) based tactile sensor offers significant benefits on practical deployment because of its sparse electrode allocation, including durability, large-area scalability, and low fabrication cost, but the degradation of a tactile spatial resolution has remained challenging. This article describes a deep neural network based EIT reconstruction framework, the EIT neural network (EIT-NN), alleviating this tradeoff between tactile sensing performance and hardware simplicity. EIT-NN learns a computationally efficient, nonlinear reconstruction attribute, achieving high-resolution tactile sensation and well-generalized reconstruction capability to address arbitrary complex touch modalities. We train EIT-NN by presenting a sim-to-real dataset synthesis strategy for computationally efficient generalizability. Furthermore, we propose a spatial sensitivity aware mean-squared error loss function, which uses an intrinsic spatial sensitivity of the sensor to guarantee a well-posed EIT operation. We validate an outperformance of EIT-NN against conventional EIT sensing methods by conducting a simulation study, a single-touch indentation test, and a two-point discrimination test. The results show improved spatial resolution, sensitivity, and localization accuracy. The beneficial features of the generalized sensing of EIT-NN were demonstrated by examining touch modality discrimination performance.

关键词： Robot sensing systems Tomography Sensors Conductivity Electrodes Image reconstruction Voltage measurement Artificial intelligence (AI) based methods deep learning in robotics and automation force and tactile sensing image reconstruction

来源：评论

学校读者我要写书评

暂无评论

PRIMAL₂: Pathfinding Via Reinforcement and Imitation Multi-Agent learning-Lifelong

引用

IEEE robotics AND automation LETTERS 2021年第2期6卷 2666-2673页

作者： Damani, Mehul Luo, Zhiyao Wenzel, Emerson Sartoretti, Guillaume Natl Univ Singapore Dept Mech Engn Singapore 117575 Singapore

Multi-agent path finding (MAPF) is an indispensable component of large-scale robot deployments in numerous domains ranging from airport management to warehouse automation. In particular, this work addresses lifelong MAPF (LMAPF) - an online variant of the problem where agents are immediately assigned a new goal upon reaching their current one - in dense and highly structured environments, typical of real-world warehouse operations. Effectively solving LMAPF in such environments requires expensive coordination between agents as well as frequent replanning abilities, a daunting task for existing coupled and decoupled approaches alike. With the purpose of achieving considerable agent coordination without any compromise on reactivity and scalability, we introduce PRIMAL(2), a distributed reinforcement learning framework for LMAPF where agents learn fully decentralized policies to reactively plan paths online in a partially observable world. We extend our previous work, which was effective in low-density sparsely occupied worlds, to highly structured and constrained worlds by identifying behaviors and conventions which improve implicit agent coordination, and enable their learning through the construction of a novel local agent observation and various training aids. We present extensive results of PRIMAL(2) in both MAPF and LMAPF environments and compare its performance to state-of-the-art planners in terms of makespan and throughput. We show that PRIMAL(2) significantly surpasses our previous work and performs comparably to these baselines, while allowing real-time re-planning and scaling up to 2048 agents.

关键词： deep learning in robotics and automation distributed robot systems multi-robot systems

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Path Finding Method Based on Evolutionary Reinforcement learning

Multi-Agent Path Finding Method Based on Evolutionary Reinfo...

引用

第43届中国控制会议

作者： Qinru Shi Meiqin Liu Senlin Zhang Ronghao Zheng Xuguang Lan College of Electrical Engineering Zhejiang University

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

The multi-agent path finding(MAPF) problem is crucial to improve the efficiency of warehouse systems. Compared with traditional centralized methods, which encounter escalating computational complexities with increasing scale,reinforcement learning-based methods has been proven to be an effective method for solving MAPF problem. Nevertheless, in the complex and large-scale scenarios, the policies learned by existing reinforcement learning-based methods are generally inadequate to address the challenges effectively. By leveraging the concepts of policy evaluation and policy evolution, this paper aims to improve performance and sample efficiency. Consequently, we introduce an MAPF method based on evolutionary reinforcement learning. In particular, we design a collaborative policy network model based on reinforcement ***, a novel evolutionary reinforcement learning training framework is constructed. Through the quantitative evaluation mechanism, policy evaluation is carried out, and evolutionary algorithm is used for policy evolution, so that the collaborative policy could better guide the agent to complete the path finding task. We test on high-density warehouse environment instances of various map sizes, and the experimental results show that our method has high success rate and low average steps.

关键词： Multi-agent systems multi-agent path finding reinforcement learning evolutionary algorithm deep learning in robotics and automation

来源：评论

学校读者我要写书评

暂无评论

Seeing Through Uncertainty: Robot Pose Estimation Based on Imperfect Prior Kinematic Knowledge

引用

IEEE Transactions on robotics 2025年

作者： Klupfel, Leonard Burkhard, Lukas Reichert, Anne Elisabeth Durner, Maximilian Triebel, Rudolph German Aerospace Center Institute of Robotics and Mechatronics Wessling 82234 Germany Karlsruhe Institute of Technology (KIT) Institute for Anthropomatics and Robotics Intelligent Robot Perception Karlsruhe 76131 Germany

We present PK-ROKED, a learning-based pipeline for probabilistic robot pose estimation relative to a camera, addressing inaccuracies in forward kinematics, particularly in systems with elastic and lightweight modules. Our approach integrates a probabilistic 2D keypoint detection mechanism that leverages prior knowledge derived from the robot's imprecise kinematics. We further improve the detection accuracy and geometric understanding by incorporating segmentation of the robot arm. The method computes reliable uncertainty estimates, enabling a robust 2D-6D fusion for precise robot arm pose estimation from a single detected keypoint. PK-ROKED requires only synthetic training data, effectively exploits imperfect kinematics as valuable prior knowledge, and introduces a novel fusion framework for enhanced robot pose estimation. We validate our method on the Panda-Orb dataset, demonstrating competitive performance against state-of-the-art approaches. Additionally, we evaluate on two other robotic systems in real-world scenarios and show its practicality by using the predictions to initialize a tracking algorithm. Code and pre-trained models are available. © 2004-2012 IEEE.

关键词： Computer vision for other robotic applications deep learning in robotics and automation sensor fusion visual tracking

来源：评论

学校读者我要写书评

暂无评论

SG-Reg: Generalizable and Efficient Scene Graph Registration

引用

IEEE Transactions on robotics 2025年 41卷 3870-3889页

作者： Liu, Chuhao Qiao, Zhijian Shi, Jieqi Wang, Ke Liu, Peize Shen, Shaojie Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Nanjing University School of Intelligence Science and Technology Jiangsu China Chang'an University School of Information Engineering China

This paper addresses the challenges of registering two rigid semantic scene graphs, an essential capability when an autonomous agent needs to register its map against a remote agent, or against a prior map. The hand-crafted descriptors in classical semantic-aided registration, or the ground-truth annotation reliance in learning-based scene graph registration, impede their application in practical real-world environments. To address the challenges, we design a scene graph network to encode multiple modalities of semantic nodes: open-set semantic feature, local topology with spatial awareness, and shape feature. These modalities are fused to create compact semantic node features. The matching layers then search for correspondences in a coarse-to-fine manner. In the back-end, we employ a robust pose estimator to decide transformation according to the correspondences. We manage to maintain a sparse and hierarchical scene representation. Our approach demands fewer GPU resources and fewer communication bandwidth in multi-agent tasks. Moreover, we design a new data generation approach using vision foundation models and a semantic mapping module to reconstruct semantic scene graphs. It differs significantly from previous works, which rely on ground-truth semantic annotations to generate data. We validate our method in a two-agent SLAM benchmark. It significantly outperforms the hand-crafted baseline in terms of registration success rate. Compared to visual loop closure networks, our method achieves a slightly higher registration recall while requiring only 52 KB of communication bandwidth for each query frame. © 2004-2012 IEEE.

关键词： deep learning in robotics and automation multi-robot systems semantic scene understanding SLAM

来源：评论

学校读者我要写书评

暂无评论

MFuseNet: Robust Depth Estimation With Learned Multiscopic Fusion

引用

IEEE robotics AND automation LETTERS 2020年第2期5卷 3113-3120页

作者： Yuan, Weihao Fan, Rui Wang, Michael Yu Chen, Qifeng Hong Kong Univ Sci & Technol Hong Kong Peoples R China Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Peoples R China Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Dept Mech & Aerosp Engn Hong Kong Peoples R China Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Dept Comp Sci & Engn Hong Kong Peoples R China

We design a multiscopic vision system that utilizes a low-cost monocular RGB camera to acquire accurate depth estimation. Unlike multi-view stereo with images captured at unconstrained camera poses, the proposed system controls the motion of a camera to capture a sequence of images in horizontally or vertically aligned positions with the same parallax. In this system, we propose a new heuristic method and a robust learning-based method to fuse multiple cost volumes between the reference image and its surrounding images. To obtain training data, we build a synthetic dataset with multiscopic images. The experiments on the real-world Middlebury dataset and real robot demonstration show that our multiscopic vision system outperforms traditional two-frame stereo matching methods in depth estimation. Our code and dataset are available at https://***/view/multiscopic.

关键词： Visual learning deep learning in robotics and automation computer vision for automation depth estimation multiscopic vision

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：