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

Int-HRL: towards intention-based hierarchical reinforcement learning

Neural Computing and Applications 2024年 1-12页

作者： Penzkofer, Anna Schaefer, Simon Strohm, Florian Bâce, Mihai Leutenegger, Stefan Bulling, Andreas Institute for Visualisation and Interactive Systems University of Stuttgart Pfaffenwaldring 5A Stuttgart70569 Germany Machine Learning for Robotics Technical University of Munich Boltzmannstrasse 3 Munich85748 Germany Department of Computer Science KU Leuven box 2600 Andreas Vesaliusstraat 13 Leuven3000 Belgium

While deep reinforcement learning (RL) agents outperform humans on an increasing number of tasks, training them requires data equivalent to decades of human gameplay. Recent hierarchical RL methods have increased sample efficiency by incorporating information inherent to the structure of the decision problem but at the cost of having to discover or use human-annotated sub-goals that guide the learning process. We show that intentions of human players, i.e. the precursor of goal-oriented decisions, can be robustly predicted from eye gaze even for the long-horizon sparse rewards task of Montezuma’s Revenge–one of the most challenging RL tasks in the Atari2600 game suite. We propose Int-HRL: Hierarchical RL with intention-based sub-goals that are inferred from human eye gaze. Our novel sub-goal extraction pipeline is fully automatic and replaces the need for manual sub-goal annotation by human experts. Our evaluations show that replacing hand-crafted sub-goals with automatically extracted intentions leads to an HRL agent that is significantly more sample efficient than previous methods. © The Author(s) 2024.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Multi-Robot Planning for Filming Groups of Moving Actors Leveraging Submodularity and Pixel Density 63

Multi-Robot Planning for Filming Groups of Moving Actors Lev...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Hughes, Skyler Martin, Rebecca Corah, Micah Scherer, Sebastian Program Carnegie Mellon University Nsf Reu Program United States Robotics Institute Carnegie Mellon University Airlab United States Colorado School of Mines Department of Computer Science United States

ISBN: (纸本)9798350316339

Observing and filming a group of moving actors with a team of aerial robots is a challenging problem that combines elements of multi-robot coordination, coverage, and view planning. A single camera may observe multiple actors at once, and a robot team may observe individual actors from multiple views. As actors move about, groups may split, merge, and reform, and robots filming these actors should be able to adapt smoothly to such changes in actor formations. Rather than adopt an approach based on explicit formations or assignments, we propose an approach based on optimizing views directly. We model actors as moving polyhedra and compute approximate pixel densities for each face and camera view. Then, we propose an objective that exhibits diminishing returns as pixel densities increase from repeated observation. This gives rise to a multi-robot perception planning problem that we solve via a combination of value iteration and greedy submodular maximization. We evaluate our approach on challenging scenarios modeled after various social behaviors and featuring different numbers of robots and actors and observe that robot assignments and formations arise implicitly given the movements of groups of actors. Simulation results demonstrate that our approach consistently outperforms baselines, and in addition to performing well with the planner's approximation of pixel densities our approach also performs comparably for evaluation based on rendered views. Overall, the multi-round variant of the sequential planner we propose meets (within 1%) or exceeds formation and assignment baselines in all scenarios. © 2024 IEEE.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

UniSaT: Unified-Objective Belief Model and Planner to Search for and Track Multiple Objects

UniSaT: Unified-Objective Belief Model and Planner to Search...

引用

AIAA science and Technology Forum and Exposition, AIAA SciTech Forum 2025

作者： Santos, Leonardo Moon, Brady Scherer, Sebastian Nguyen, Hoa Van School of Engineering Federal University of Minas Gerais MG Belo Horizonte Brazil Robotics Institute School of Computer Science Carnegie Mellon University PittsburghPA United States Department of Electrical and Computer Engineering Curtin University BentleyWA6102 Australia

ISBN: (数字)9781624107238

ISBN: (纸本)9781624107238

Path planning for autonomous search and tracking of multiple objects is a critical problem in applications such as reconnaissance, surveillance, and data gathering. Due to the inherent competing objectives of searching for new objects while maintaining tracks for found objects, most current approaches rely on multi-objective planning methods, leaving it up to the user to tune parameters to balance between the two objectives, usually based on heuristics or trial and error. In this paper, we introduce UniSaT (Unified Search and Track), a novel unifiedobjective formulation for the search and track problem based on Random Finite Sets (RFS). Our approach models unknown and known objects using a combined generalized labeled multi-Bernoulli (GLMB) filter. For unseen objects, UniSaT leverages both cardinality and spatial prior distributions, allowing it to operate without prior knowledge of the exact number of objects in the search space. The planner maximizes the mutual information of this unified belief model, creating balanced search and tracking behaviors. We demonstrate our work in a simulated environment, presenting both qualitative results and quantitative improvements over a multi-objective method. © 2025, American institute of Aeronautics and Astronautics Inc, AIAA. All rights reserved.

关键词： Object tracking

来源：评论

学校读者我要写书评

暂无评论

Facial Expression Recognition Model Depending on Optimized Support Vector Machine

引用

computers, Materials & Continua 2023年第7期76卷 499-515页

作者： Amel Ali Alhussan Fatma M.Talaat El-Sayed M.El-kenawy Abdelaziz A.Abdelhamid Abdelhameed Ibrahim Doaa Sami Khafaga Mona Alnaggar Department of Computer Sciences College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Machine Learning&Information Retrieval Department Faculty of Artificial IntelligenceKafrelsheikh UniversityKafrelsheikh33516Egypt Department of Communications and Electronics Delta Higher Institute of Engineering and TechnologyMansoura35111Egypt Department of Computer Science College of Computing and Information TechnologyShaqra University11961Saudi Arabia Department of Computer Science Faculty of Computer and Information SciencesAin Shams UniversityCairo11566Egypt Computer Engineering and Control Systems Department Faculty of EngineeringMansoura UniversityMansoura35516Egypt Robotics and Intelligent Machines Department Faculty of Artificial IntelligenceKafrelsheikh UniversityKafrelsheikh33516Egypt

In computer vision,emotion recognition using facial expression images is considered an important research *** learning advances in recent years have aided in attaining improved results in this *** to recent studies,multiple facial expressions may be included in facial photographs representing a particular type of *** is feasible and useful to convert face photos into collections of visual words and carry out global expression *** main contribution of this paper is to propose a facial expression recognitionmodel(FERM)depending on an optimized Support Vector Machine(SVM).To test the performance of the proposed model(FERM),AffectNet is *** uses 1250 emotion-related keywords in six different languages to search three major search engines and get over 1,000,000 facial photos *** FERM is composed of three main phases:(i)the Data preparation phase,(ii)Applying grid search for optimization,and(iii)the categorization *** discriminant analysis(LDA)is used to categorize the data into eight labels(neutral,happy,sad,surprised,fear,disgust,angry,and contempt).Due to using LDA,the performance of categorization via SVM has been obviously *** search is used to find the optimal values for hyperparameters of SVM(C and gamma).The proposed optimized SVM algorithm has achieved an accuracy of 99%and a 98%F1 score.

关键词： Facial expression recognition machine learning linear dis-criminant analysis(LDA) support vector machine(SVM) grid search

来源：评论

学校读者我要写书评

暂无评论

On the Faithfulness of Vision Transformer Explanations

On the Faithfulness of Vision Transformer Explanations

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Junyi Wu Weitai Kang Hao Tang Yuan Hong Yan Yan Department of Computer Science Illinois Institute of Technology USA Robotics Institute Carnegie Mellon University USA Department of Computer Science University of Connecticut USA

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

To interpret Vision Transformers, post-hoc explanations assign salience scores to input pixels, providing human-understandable heatmaps. However, whether these inter-pretations reflect true rationales behind the model's output is still underexplored. To address this gap, we study the faithfulness criterion of explanations: the assigned salience scores should represent the influence of the corresponding input pixels on the model's predictions. To evaluate faithful-ness, we introduce Salience-guided Faithfulness Coefficient (SaCo), a novel evaluation metric leveraging essential in-formation of salience distribution. Specifically, we con-duct pair-wise comparisons among distinct pixel groups and then aggregate the differences in their salience scores, resulting in a coefficient that indicates the explanation's degree of faithfulness. Our explorations reveal that cur-rent metrics struggle to differentiate between advanced ex-planation methods and Random Attribution, thereby failing to capture the faithfulness property. In contrast, our pro-posed SaCo offers a reliable faithfulness measurement, es-tablishing a robust metric for interpretations. Furthermore, our SaCo demonstrates that the use of gradient and multi-layer aggregation can markedly enhance the faithfulness of attention-based explanation, shedding light on potential paths for advancing Vision Transformer explainability.

关键词： Measurement Heating systems computer vision Correlation Aggregates Predictive models Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

A Metaheuristic Technique for Cluster-Based Feature Selection of DNA Methylation Data for Cancer

引用

computers, Materials & Continua 2023年第2期74卷 2817-2838页

作者： Noureldin Eissa Uswah Khairuddin Rubiyah Yusof Ahmed Madani Centre for Artificial Intelligence&Robotics Malaysia-Japan International Institute of TechnologyUniversiti Teknologi MalaysiaKuala Lumpur54100Malaysia Department of Computer Engineering Arab Academy for ScienceTechnology and Maritime TransportCairo2033Egypt Department of Mechanical Precision Engineering Malaysia-Japan International Institute of TechnologyUniversiti Teknologi MalaysiaKuala Lumpur54100Malaysia

Epigenetics is the study of phenotypic variations that do not alter DNA *** epigenetics has grown rapidly over the past few years as epigenetic alterations exist in all human *** of these alterations is DNA methylation;an epigenetic process that regulates gene expression and often occurs at tumor suppressor gene loci in ***,studying this methylation process may shed light on different gene functions that cannot otherwise be interpreted using the changes that occur in DNA ***,microarray technologies;such as Illumina Infinium BeadChip assays;are used to study DNA methylation at an extremely large number of varying *** each DNA methylation site,a beta value(β)is used to reflect the methylation ***,clustering this data from various types of cancers may lead to the discovery of large partitions that can help objectively classify different types of cancers aswell as identify the relevant loci without user *** study proposed a Nested Big Data Clustering Genetic Algorithm(NBDC-GA);a novel evolutionary metaheuristic technique that can perform cluster-based feature selection based on the DNA methylation *** efficacy of the NBDC-GA was tested using real-world data sets retrieved from The Cancer Genome Atlas(TCGA);a cancer genomics program created by the NationalCancer institute(NCI)and the NationalHuman Genome Research *** performance of the NBDC-GA was then compared with that of a recently developed metaheuristic Immuno-Genetic Algorithm(IGA)that was tested using the same data *** NBDC-GA outperformed the IGA in terms of convergence ***,the NBDC-GA produced a more robust clustering configuration while simultaneously decreasing the dimensionality of features to a maximumof 67%and of 94.5%for individual cancer type and collective cancer,*** proposed NBDC-GA was also able to identify two chromosomes with highly contrastingDNAmethylations activities th

关键词： Cancer clustering DNA methylation feature selection metaheuristic technique the cancer genome atlas

来源：评论

学校读者我要写书评

暂无评论

Adaptive Planning and Control with Time-Varying Tire Models for Autonomous Racing Using Extreme Learning Machine

Adaptive Planning and Control with Time-Varying Tire Models ...

引用

IEEE International Conference on robotics and Automation (ICRA)

作者： Dvij Kalaria Qin Lin John M. Dolan Robotics Institute Carnegie Mellon University Computer Science Department Cleveland State University

ISBN: (数字)9798350384574

ISBN: (纸本)9798350384581

Autonomous racing is a challenging problem, as the vehicle needs to operate at the friction or handling limits in order to achieve minimum lap times. Autonomous race cars require highly accurate perception, state estimation, planning, and control. Adding to this complexity is the need to accurately identify vehicle model parameters governing lateral tire slip effects, which can evolve over time due to factors such as tire wear and tear. Current approaches to this problem typically either propose offline model identification methods or rely on initial parameters within a narrow range (typically within 15-20% of the actual values). However, these approaches fall short in accounting for significant changes in tire models that can occur during actual races, particularly when pushing the vehicle to its handling limits. We present a unified framework that not only learns the tire model in real time from collected data but also adapts the model to environmental changes, even when the model parameters exhibit substantial deviations. The friction estimation, obtained as a byproduct from the learning results, facilitates the selection of the optimal racing line from a library for adaptive speed planning. We validate our approach through testing in simulators, encompassing a 1:43 scale race car and a full-size car, and also through experiments with a physical F1/10 autonomous race car.

关键词： Adaptation models Friction Tires Data models Real-time systems Planning Automobiles

来源：评论

学校读者我要写书评

暂无评论

Implementing SLAM for Robot Navigation with Lidar in ROS Platform 4

Implementing SLAM for Robot Navigation with Lidar in ROS Pla...

引用

4th IEEE International Conference on Emerging Frontiers in Electrical and Electronic Technologies, ICEFEET 2024

作者： Verma, Gaurav Kumar Ray, Ranjit Swar, Surya Narayan Meena, Gagan Deep Dept. of Electrical Engineering National Institute of Technology Patna India Underwater Robotics & Autonomous Group CSIR-Central Mechanical Engineering Research Institute Durgapur India Department of Computer Science & Engineering Gandhi Institute of Engineering and Technology University Gunupur India

ISBN: (纸本)9798331528614

This research covers the implementation of SLAM (Simultaneous Localization and Mapping) with Ouster OS0 LiDAR (Light Detection and Ranging) sensor in the Robot Operating System (ROS1) Noetic. Using the high-frequency capabilities of the ouster, this method works towards mapping and localization in structured and unstructured environments. The paper explains the Ouster sensor integration in the ROS1 Noetic environment, providing information on the sensor calibration, data acquisition, and pre-processing. The ROS ecosystem in Ubuntu 20.04 is set to process the data streams coming from the ouster LiDAR sensor which is further utilised to create map and localize the robot. The Ouster LiDAR sensor scans every object in its field of view (in 3D), the data is then used for the SLAM. SLAM is executed using the Direct Lidar Odometry (DLO) algorithm for mapping and simultaneously helping the robot with localization and enabling it to navigate through the environment smoothly and precisely. © 2024 IEEE.

关键词： SLAM robotics

来源：评论

学校读者我要写书评

暂无评论

RL-VLM-F: reinforcement learning from vision language foundation model feedback 24

RL-VLM-F: reinforcement learning from vision language founda...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Yufei Wang Zhanyi Sun Jesse Zhang Zhou Xian Erdem Biyik David Held Zackory Erickson Robotics Institute Carnegie Mellon University Department of Computer Science University of Southern California

Reward engineering has long been a challenge in Reinforcement Learning (RL) research, as it often requires extensive human effort and iterative processes of trial-and-error to design effective reward functions. In this paper, we propose RL-VLM-F, a method that automatically generates reward functions for agents to learn new tasks, using only a text description of the task goal and the agent's visual observations, by leveraging feedbacks from vision language foundation models (VLMs). The key to our approach is to query these models to give preferences over pairs of the agent's image observations based on the text description of the task goal, and then learn a reward function from the preference labels, rather than directly prompting these models to output a raw reward score, which can be noisy and inconsistent. We demonstrate that RL-VLM-F successfully produces effective rewards and policies across various domains -- including classic control, as well as manipulation of rigid, articulated, and deformable objects -- without the need for human supervision, outperforming prior methods that use large pretrained models for reward generation under the same assumptions. Videos can be found on our project website: https://***/.

关键词：

来源：评论

学校读者我要写书评

暂无评论

D3GU: Multi-target Active Domain Adaptation via Enhancing Domain Alignment

D3GU: Multi-target Active Domain Adaptation via Enhancing Do...

引用

IEEE Workshop on Applications of computer Vision (WACV)

作者： Lin Zhang Linghan Xu Saman Motamed Shayok Chakraborty Fernando De la Torre Robotics Institute Carnegie Mellon University Department of Computer Science Florida State University

Unsupervised domain adaptation (UDA) for image classification has made remarkable progress in transferring classification knowledge from a labeled source domain to an unlabeled target domain, thanks to effective domain alignment techniques. Recently, in order to further improve performance on a target domain, many Single-Target Active Domain Adaptation (ST-ADA) methods have been proposed to identify and annotate the salient and exemplar target samples. However, it requires one model to be trained and deployed for each target domain and the domain label associated with each test sample. This largely restricts its application in the ubiquitous scenarios with multiple target domains. Therefore, we propose a Multi-Target Active Domain Adaptation (MT-ADA) framework for image classification, named D 3 GU, to simultaneously align different domains and actively select samples from them for annotation. This is the first research effort in this field to our best knowledge. D 3 GU applies Decomposed Domain Discrimination (D 3 ) during training to achieve both source-target and target-target domain alignments. Then during active sampling, a Gradient Utility (GU) score is designed to weight every unlabeled target image by its contribution towards classification and domain alignment tasks, and is further combined with KMeans clustering to form GU-KMeans for diverse image sampling. Extensive experiments on three benchmark datasets, Office31, OfficeHome, and DomainNet, have been conducted to validate consistently superior performance of D 3 GU for MT-ADA 1 .

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：