中文
相关论文

相关论文: Capturing a Moving Target by Two Robots in the F2F…

200 篇论文

Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the…

分布式、并行与集群计算 · 计算机科学 2017-10-03 Huda Chuangpishit , Jurek Czyzowicz , Leszek Gasieniec , Konstantinos Georgiou , Tomasz Jurdzinski , Evangelos Kranakis

Autonomous navigation in dynamic environment heavily depends on the environment and its topology. Prior knowledge of the environment is not usually accurate as the environment keeps evolving in time. Since robot is continuously evaluating…

机器人学 · 计算机科学 2020-07-21 Xihan Ma , Honglin Sun , Enwei Xu , Song Cui , Boqun Yin , Mariam Faied

Imitation learning for mobile manipulation is a key challenge in the field of robotic manipulation. However, current mobile manipulation frameworks typically decouple navigation and manipulation, executing manipulation only after reaching a…

机器人学 · 计算机科学 2025-07-16 Wang Zhicheng , Satoshi Yagi , Satoshi Yamamori , Jun Morimoto

We study the problem of assigning robots with actions to track targets. The objective is to optimize the robot team's tracking quality which can be defined as the reduction in the uncertainty of the targets' states. Specifically, we…

机器人学 · 计算机科学 2025-02-13 Peihan Li , Lifeng Zhou

This work addresses the coordination problem of multiple robots with the goal of finding specific hazardous targets in an unknown area and dealing with them cooperatively. The desired behaviour for the robotic system entails multiple…

机器人学 · 计算机科学 2019-03-29 Nunzia Palmieri , Xin-She Yang , Floriano De Rango , Amilcare Francesco Santamaria

Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents are modeled as points, and the route of each of them only…

数据结构与算法 · 计算机科学 2016-11-25 Jurek Czyzowicz , Arnaud Labourel , Andrzej Pelc

Consider a mobile robot tasked with localizing targets at unknown locations by obtaining relative measurements. The observations can be bearing or range measurements. How should the robot move so as to localize the targets and minimize the…

机器人学 · 计算机科学 2020-02-25 Selim Engin , Volkan Isler

This work focuses on the persistent monitoring problem, where a set of targets moving based on an unknown model must be monitored by an autonomous mobile robot with a limited sensing range. To keep each target's position estimate as…

机器人学 · 计算机科学 2023-03-14 Yizhuo Wang , Yutong Wang , Yuhong Cao , Guillaume Sartoretti

The design of distributed gathering and convergence algorithms for tiny robots has recently received much attention. In particular, it has been shown that convergence problems can even be solved for very weak, \emph{oblivious} robots:…

分布式、并行与集群计算 · 计算机科学 2016-08-23 Debasish Pattanayak , Kaushik Mondal , Partha Sarathi Mandal , Stefan Schmid

This paper revisits the widely researched \textit{gathering} problem for two robots in a scenario which allows randomization in the asynchronous scheduling model. The scheduler is considered to be the adversary which determines the…

分布式、并行与集群计算 · 计算机科学 2019-09-24 Debasish Pattanayak , John Augustine , Partha Sarathi Mandal

Mobile grasping enhances manipulation efficiency by utilizing robots' mobility. This study aims to enable a commercial off-the-shelf robot for mobile grasping, requiring precise timing and pose adjustments. Self-supervised learning can…

机器人学 · 计算机科学 2024-11-18 Takuya Kiyokawa , Eiki Nagata , Yoshihisa Tsurumine , Yuhwan Kwon , Takamitsu Matsubara

This paper addresses the problem of mobile robot manipulation using object detection. Our approach uses detection and control as complimentary functions that learn from real-world interactions. We develop an end-to-end manipulation method…

计算机视觉与模式识别 · 计算机科学 2022-10-18 Brent Griffin

Two robots stand at the origin of the infinite line and are tasked with searching collaboratively for an exit at an unknown location on the line. They can travel at maximum speed $b$ and can change speed or direction at any time. The two…

We present a unified formal framework for expressing mobile robots models, protocols, and proofs, and devise a protocol design/proof methodology dedicated to mobile robots that takes advantage of this formal framework. As a case study, we…

分布式、并行与集群计算 · 计算机科学 2016-02-29 Pierre Courtieu , Lionel Rieg , Sébastien Tixeuil , Xavier Urbain

An oblivious mobile robot is a stateless computational entity located in a spatial universe, capable of moving in that universe. When activated, the robot observes the universe and the location of the other robots, chooses a destination,…

分布式、并行与集群计算 · 计算机科学 2016-07-11 Paola Flocchini , Nicola Santoro , Giovanni Viglietta , Masafumi Yamashita

Industrial robotic applications such as spraying, welding, and additive manufacturing frequently require fast, accurate, and uniform motion along a 3D spatial curve. To increase process throughput, some manufacturers propose a dual-robot…

This paper studies the problem of multi-robot pursuit of how to coordinate a group of defending robots to capture a faster attacker before it enters a protected area. Such operation for defending robots is challenging due to the unknown…

机器人学 · 计算机科学 2024-11-01 Jinyong Chen , Rui Zhou , Zhaozong Wang , Yunjie Zhang , Guibin Sun

This study addresses the challenge of manipulation, a prominent issue in robotics. We have devised a novel methodology for swiftly and precisely identifying the optimal grasp point for a robot to manipulate an object. Our approach leverages…

机器人学 · 计算机科学 2023-11-27 Arda Sarp Yenicesu , Berk Cicek , Ozgur S. Oguz

Anonymous mobile robots are often classified into synchronous, semi-synchronous and asynchronous robots when discussing the pattern formation problem. For semi-synchronous robots, all patterns formable with memory are also formable without…

分布式、并行与集群计算 · 计算机科学 2011-11-08 Taisuke Izumi , Samia Souissi , Yoshiaki Katayama , Nobuhiro Inuzuka , Xavier Défago , Koichi Wada , Masafumi Yamashita

This paper aims to solve the coordination of a team of robots traversing a route in the presence of adversaries with random positions. Our goal is to minimize the overall cost of the team, which is determined by (i) the accumulated risk…

机器人学 · 计算机科学 2024-08-22 Zechen Hu , Manshi Limbu , Daigo Shishika , Xuesu Xiao , Xuan Wang