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

A Compliant Robot-Assisted Mold Polishing Application Using the Franka Emika Robot

学校读者我要写书评

暂无评论

A Compliant Robot-Assisted Mold Polishing Application Using ...

Annual Conference of Industrial Electronics Society

作者： Michael Christopher Xenya Rui Cortesão Electrical and Computer Engineering Department Institute of Systems and Robotics University of Coimbra Coimbra Portugal FOE GCTU PMB100 Accra Ghana

Metal mold casting for many application areas remains imperfect since this involves the control of numerous factors that affect workpiece quality. Surface roughness which remains one of the many issues related to metal mold cast is often mitigated by means of grinding and polishing. As many attempts are being made to address this challenge through robot-assisted techniques, we focus on rapid mold polishing using the Franka Emika (FE) robot and its programming resources, including a built-in impedance control architecture. To accomplish the objective, mold surface segmentation is necessary. For each segment, the polishing approach is based on surface normals, relative motion, and torque sensor data. Results were obtained with open platform communication-unified architecture (opc-ua) client and server that record torque and force data. Results show that tuning internal impedance control parameters for polishing tasks is feasible.

关键词：

Learnable Data Augmentation for One-Shot Unsupervised Domain Adaptation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Carrazco, Julio Ivan Davila Morerio, Pietro Del Bue, Alessio Murino, Vittorio Italian Institute of Technology Genoa Italy Department of Computer Science University of Verona Verona Italy Department of Computer Science and Technology Bioengineering Robotics and Systems Engineering University of Genova Genoa Italy Department of Marine Electrical Electronic and Telecommunications Engineering Robotics and Systems Engineering University of Genova Genoa Italy

This paper presents a classification framework based on learnable data augmentation to tackle the One-Shot Unsupervised Domain Adaptation (OS-UDA) problem. OS-UDA is the most challenging setting in Domain Adaptation, as only one single unlabeled target sample is assumed to be available for model adaptation. Driven by such single sample, our method LearnAug-UDA learns how to augment source data, making it perceptually similar to the target. As a result, a classifier trained on such augmented data will generalize well for the target domain. To achieve this, we designed an encoder-decoder architecture that exploits a perceptual loss and style transfer strategies to augment the source data. Our method achieves state-of-the-art performance on two well-known Domain Adaptation benchmarks, DomainNet and VisDA. The project code is available at https://***/IIT-PAVIS/LearnAug-UDA. © 2023, CC BY.

关键词： Benchmarking

Distributed Computation of Source, Target, and Mixed Strongly Connected Components in Multi-agent systems 16th

学校读者我要写书评

暂无评论

Distributed Computation of Source, Target, and Mixed Stron...

16th APCA International Conference on Automatic Control and Soft Computing, CONTROLO 2024

作者： Ramos, Guilherme Pequito, Sérgio Department of Computer Science and Engineering Instituto Superior Técnico University of Lisbon Lisbon1049-001 Portugal Instituto de Telecomunicações Lisbon1049-001 Portugal Department of Electrical and Computer Engineering Instituto Superior Técnico University of Lisbon Lisbon1049-001 Portugal Institute for Systems and Robotics Instituto Superior Técnico University of Lisbon Lisbon1049-001 Portugal

ISBN: (纸本)9783031817236

Strongly Connected Components (SCCs) play a crucial role in understanding the structural properties of directed graphs, with a plethora of applications across various domains including engineering, computer science and social sciences. In this paper, we propose a method for computing both the source SCCs and target SCCs in a distributed fashion. Our method leverages the decentralized nature of distributed systems to efficiently identify SCCs within large-scale graphs. We illustrate the proposed methods with examples. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Distributed computer systems

TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sidrane, Chelsea Tumova, Jana The Division of Robotics Perception and Learning Intelligent Systems Department School of Electrical Engineering & Computer Science KTH Royal Institute of Technology Brinellvägen 8 Stockholm114 28 Sweden

Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show that the system is generally functioning as desired, but a formal tool like reachability analysis can provide a guarantee of correctness. For linear systems, reachability analysis is straightforward and fast, but as more complex components are added to the control system such as nonlinear dynamics or a neural network controller, reachability analysis may slow down or become overly conservative. To address these challenges, much literature has focused on spatial refinement, e.g., tuning the discretization of the input sets and intermediate reachable sets. However, this paper addresses a different dimension: temporal refinement. The basic idea of temporal refinement is to automatically choose when along the horizon of the reachability problem to execute slow symbolic queries which incur less approximation error versus fast concrete queries which incur more approximation error. Temporal refinement can be combined with other refinement approaches and offers an additional "tuning knob" with which to trade off tractability and tightness in approximate reachable set computation. Here, we introduce an automatic framework for performing temporal refinement and we demonstrate the effectiveness of this technique on computing approximate reachable sets for nonlinear systems with neural network control policies. We demonstrate the calculation of reachable sets of varying approximation error under varying computational budget and show that our algorithm is able to generate approximate reachable sets with a similar amount of error to the baseline approach in 20-70% less time. © 2024, CC BY.

关键词： Linear systems

Wildfire Spread Prediction Model Calibration Using Metaheuristic Algorithms 48

学校读者我要写书评

暂无评论

Wildfire Spread Prediction Model Calibration Using Metaheuri...

48th Annual Conference of the IEEE Industrial Electronics Society, IECON 2022

作者： Pereira, Jorge Mendes, Jerome Junior, Jorge S. S. Viegas, Carlos Paulo, Joao Ruivo University of Coimbra Institute of Systems and Robotics Department of Electrical and Computer Engineering Pólo Ii CoimbraPT-3030-290 Portugal University of Coimbra Association for the Development of Industrial Aerodynamics CoimbraPT-3030-289 Portugal

ISBN: (数字)9781665480253

ISBN: (纸本)9781665480253

Every year, wildfires cause significant losses and destruction around the globe. In order to attempt to reduce their damages, resources have been put into developing fire propagation prediction systems. In a real wildfire event, these systems provide the authorities with information about the fire propagation in the near future, thus allowing them to make better decisions. Wildfire spread prediction systems are based on fire propagation models, from which the most used and accepted model is the Rothermel model. However, given the complexity of the wildfire phenomena and the uncertainty of some of its input parameter values, the Rothermel model can produce misleading results of fire propagation. This paper uses 3 metaheuristic algorithms, genetic algorithm (GA), differential evolution (DE) and simulated annealing (SA), for calibration of input parameters from the Rothermel model. These algorithms were validated using 37 datasets containing data from controlled experimental fires. Results have shown that these algorithms provide a precise wildfire spread prediction accounting for the uncertainties in the model's selected parameters. © 2022 IEEE.

关键词： Forecasting

MCTS-Judge: Test-Time Scaling in LLM-as-a-Judge for Code Correctness Evaluation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wang, Yutong Ji, Pengliang Yang, Chaoqun Li, Kaixin Hu, Ming Li, Jiaoyang Sartoretti, Guillaume Department of Mechanical Engineering National University of Singapore Singapore Robotics Institute Carnegie Mellon University United States School of Computing National University of Singapore Singapore Department of Electrical and Computer Systems Monash University Australia

The LLM-as-a-Judge paradigm shows promise for evaluating generative content but lacks reliability in reasoning-intensive scenarios, such as programming. Inspired by recent advances in reasoning models and shifts in scaling laws, we pioneer bringing test-time computation into LLM-as-a-Judge, proposing MCTS-Judge, a resource-efficient, System-2 thinking framework for code correctness evaluation. MCTS-Judge leverages Monte Carlo Tree Search (MCTS) to decompose problems into simpler, multi-perspective evaluations. Through a node-selection strategy that combines self-assessment based on historical actions in the current trajectory and the Upper Confidence Bound for Trees based on prior rollouts, MCTS-Judge balances global optimization and refinement of the current trajectory. We further designed a high-precision, unit-test-level reward mechanism to encourage the Large Language Model (LLM) to perform line-by-line analysis. Extensive experiments on three benchmarks and five LLMs demonstrate the effectiveness of MCTS-Judge, which improves the base model’s accuracy from 41.0% to 80.0%, surpassing the o1-series models with 3× fewer tokens. Further evaluations validate the superiority of its reasoning trajectory in logic, analytics, thoroughness, and overall quality, while revealing the test-time scaling law of the LLM-as-a-Judge paradigm. Copyright © 2025, The Authors. All rights reserved.

关键词： Scaling laws

Spiking neural networks: Towards bio-inspired multimodal perception in robotics

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Oikonomou, Katerina Maria Balaska, Vasiliki Tsintotas, Konstantinos A. Mavridis, Christos N. Kansizoglou, Ioannis Gasteratos, Antonios The Department of Production and Management Engineering Laboratory of Robotics and Automation Democritus University of Thrace Xanthi Greece The Department of Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

Spiking neural networks (SNNs) have captured apparent interest over the recent years, stemming from neuroscience and reaching the field of artificial intelligence. However, due to their nature SNNs remain far behind in achieving the exceptional performance of deep neural networks (DNNs). As a result, many scholars are exploring ways to enhance SNNs by using learning techniques from DNNs. While this approach has been proven to achieve considerable improvements in SNN performance, we propose another perspective: enhancing the biological plausibility of the models to leverage the advantages of SNNs fully. Our approach aims to propose a brain-like combination of audio-visual signal processing for recognition tasks, intended to succeed in more bio-plausible human-robot interaction applications. © 2024, CC BY-NC-SA.

关键词： Adversarial machine learning

Dynamic Environment-based Visual User Interface System for Intuitive Navigation Target Selection for Brain-actuated Wheelchairs

学校读者我要写书评

暂无评论

Dynamic Environment-based Visual User Interface System for I...

IEEE International Workshop on Robot and Human Communication (ROMAN)

作者： Ricardo Pereira Aniana Cruz Luís Garrote Gabriel Pires Ana Lopes Urbano J. Nunes Department of Electrical and Computer Engineering Institute of Systems and Robotics University of Coimbra Portugal Polytechnic Institute of Tomar Portugal

ISBN: (数字)9781728188591

ISBN: (纸本)9781665406802

Visual user interface paradigms are one of the key modules for brain-actuated wheelchairs, which are a class of promising assistive devices that can increase the autonomy and mobility of people suffering from severe motor impairments. This work proposes a Dynamic Environment-based Visual Interface System (DEVIS) for intuitive navigation target selection for brain-actuated wheelchairs. It is composed of a novel Dynamic Visual Interface (DVI), an RGB image-based perception module (indoor scene classification, object detection and classification, and object tracking), and a P300-based BCI. The DVI displays potential navigation goals in three forms of visual cues: an RGB camera image streaming with object bounding boxes overlaid on objects detected and tracked, three global points of interest (indoor places), and two static commands. Hence, the DVI allows a user to select, through the P300-based BCI, navigation targets/commands that are flashing independently and randomly to create an oddball paradigm. Experimental evaluations were carried out in a dynamic setting with 5 participants, who were asked to select targets displayed in the DVI. The dynamic setting was obtained using RGB image sequences of the isr-RGB-D Dataset, which represents a mission performed by a mobile robotic platform. The target selection was performed through a P300-based BCI, using non-self-paced and self-paced modalities. The obtained results show that the proposed DEVIS can run in real-time and that users are able to correctly select targets with high BCI accuracy rates.

关键词： Visualization Target tracking Navigation Wheelchairs User interfaces Streaming media Real-time systems

Neural-iLQR: A Learning-Aided Shooting Method for Trajectory Optimization

学校读者我要写书评

暂无评论

Neural-iLQR: A Learning-Aided Shooting Method for Trajectory...

2023 IEEE International Conference on robotics and Biomimetics, ROBIO 2023

作者： Cheng, Zilong Li, Yulin Chen, Kai Duan, Jianghua Ma, Jun Lee, Tong Heng National University of Singapore Department of Electrical and Computer Engineering Singapore The Hong Kong University of Science and Technology Department of Mechanical and Aerospace Engineering Hong Kong The Hong Kong University of Science and Technology Division of Emerging Interdisciplinary Areas Hong Kong Robotics and Autonomous Systems Thrust Guangzhou China Hkust Shenzhen-Hong Kong Collaborative Innovation Research Institute Shenzhen China

ISBN: (纸本)9798350325706

Iterative linear quadratic regulator (iLQR) has gained wide popularity in addressing trajectory optimization problems with nonlinear system models. However, as a model-based shooting method, it relies heavily on an accurate system model to update the optimal control actions and the trajectory determined with forward integration, thus becoming vulnerable to inevitable model inaccuracies. Recently, substantial research efforts in learning-based methods for optimal control problems have been progressing significantly in addressing unknown system models, particularly when the system has complex interactions with the environment. Yet an incremental machine learning method or a deep neural network is normally required to fit a substantial scale of sampling motion data. Existing works mainly focus on capturing the whole picture of the motion pattern from trial data (which is essentially noisy and hard to identify with any simple predefined structures) for complex robot systems. Instead, we present Neural-iLQR, a learning-aided shooting method over the unconstrained control space, in which a neural network with a simple structure is used to drive the optimization process towards optimal direction. Through comprehensive evaluations on two illustrative control tasks using three different kinds of lightweight network structures, the proposed method is shown to outperform the conventional iLQR significantly with fast and continuous cost convergence in the presence of inaccuracies in system models, which demonstrates the generalizability and robustness of the proposed learning-aided method. © 2023 IEEE.

关键词：