中文
相关论文

相关论文: Stand Up Indulgent Rendezvous

200 篇论文

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

Satellite dynamics in unknown environments are inherently uncertain due to factors such as varying gravitational fields, atmospheric drag, and unpredictable interactions with space debris or other celestial bodies. Traditional sliding mode…

系统与控制 · 电气工程与系统科学 2025-05-13 Rakesh Kumar Sahoo , Manoranjan Sinha

As robots are being increasingly used in close proximity to humans and objects, it is imperative that robots operate safely and efficiently under real-world conditions. Yet, the environment is seldom known perfectly. Noisy sensors and…

机器人学 · 计算机科学 2021-04-13 Antony Thomas , Fulvio Mastrogiovanni , Marco Baglietto

We investigate two fundamental problems in mobile computing: exploration and rendezvous, with two distinct mobile agents in an unknown graph. The agents may communicate by reading and writing information on whiteboards that are located at…

多智能体系统 · 计算机科学 2024-07-08 Romain Cosson

In this paper, the trajectory planning problem for autonomous rendezvous and docking between a controlled spacecraft and a tumbling target is addressed. The use of a variable planning horizon is proposed in order to construct an appropriate…

系统与控制 · 电气工程与系统科学 2024-09-11 Mirko Leomanni , Renato Quartullo , Gianni Bianchini , Andrea Garulli , Antonio Giannitrapani

Emergent behavior arising in a joint human-robot system cannot be fully predicted based on an understanding of the individual agents. Typically, robot behavior is governed by algorithms that optimize a reward function that should…

人机交互 · 计算机科学 2020-09-07 Timo Melman , Niek Beckers , David Abbink

Robust motion planning is a well-studied problem in the robotics literature, yet current algorithms struggle to operate scalably and safely in the presence of other moving agents, such as humans. This paper introduces a novel framework for…

We present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots, the robots reach in a finite number of steps the…

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

Consensus control of multiagent systems arises in various robotic applications such as rendezvous and formation control. For example, to compute the control inputs of individual agents, the difference in the positions in aligned coordinate…

系统与控制 · 电气工程与系统科学 2024-10-22 Zhonggang Li , Changheng Li , Raj Thilak Rajan

Future multi-spacecraft missions require robust autonomous trajectory optimization capabilities to ensure safe and efficient rendezvous operations. This capability hinges on solving non-convex optimal control problems in real-time, although…

最优化与控制 · 数学 2025-01-28 Yuji Takubo , Tommaso Guffanti , Daniele Gammelli , Marco Pavone , Simone D'Amico

In communication restricted environments, a multi-robot system can be deployed to either: i) maintain constant communication but potentially sacrifice operational efficiency due to proximity constraints or ii) allow disconnections to…

机器人学 · 计算机科学 2023-08-02 Lauren Bramblett , Shijie Gao , Nicola Bezzo

Gracefully degrading algorithms [Biely \etal, TCS 2018] are designed to circumvent impossibility results in dynamic systems by adapting themselves to the dynamics. Indeed, such an algorithm solves a given problem under some dynamics and,…

分布式、并行与集群计算 · 计算机科学 2018-08-03 Marjorie Bournat , Swan Dubois , Franck Petit

In this paper, we study the symmetric rendezvous search problem on the line with n > 2 robots that are unaware of their locations and the initial distances between them. In the symmetric version of this problem, the robots execute the same…

分布式、并行与集群计算 · 计算机科学 2018-05-23 Deniz Ozsoyeller

In-Motion physical coupling of multiple mobile ground robots has the potential to enable new applications like in-motion transfer that improves efficiency in handling and transferring goods, which tackles current challenges in logistics. A…

系统与控制 · 电气工程与系统科学 2026-02-24 Lars Fischer , Daniel Flögel , Sören Hohmann

In this paper, we consider the problem of scattering a swarm of mobile oblivious robots in a continuous space. We consider the fully asynchronous setting where robots may base their computation on past observations, or may be observed by…

多智能体系统 · 计算机科学 2019-05-23 Ulysse Léchine , Sébastien Tixeuil

Approaching a tumbling target safely is a critical challenge in space debris removal missions utilizing robotic manipulators onboard servicing satellites. In this work, we propose a trajectory planning method based on nonlinear optimization…

机器人学 · 计算机科学 2025-12-29 Kenta Iizuka , Akiyoshi Uchida , Kentaro Uno , Kazuya Yoshida

Consider a finite set of identical computational entities that can move freely in the Euclidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity p at time t; entity p can see entity q at time t if at that…

分布式、并行与集群计算 · 计算机科学 2015-07-02 G. A. Di Luna , P. Flocchini , S. Gan Chaudhuri , F. Poloni , N. Santoro , G. Viglietta

Robots are used by humans not only as tools but also to interactively assist and cooperate with humans, thereby forming physical human-robot interactions. In these interactions, there is a risk that a feedback loop causes unstable force…

机器人学 · 计算机科学 2022-07-05 Hisayoshi Muramatsu , Yoshihiro Itaguchi , Seiichiro Katsura

We study a search problem on capturing a moving target on an infinite real line. Two autonomous mobile robots (which can move with a maximum speed of 1) are initially placed at the origin, while an oblivious moving target is initially…

机器人学 · 计算机科学 2025-10-08 Khaled Jawhar , Evangelos Kranakis

In the symmetric rendezvous problem two players follow the same (randomized) strategy to visit one of $n$ locations in each time step $t=0,1,2,\dots$. Their goal is to minimize the expected time until they visit the same location and thus…

最优化与控制 · 数学 2026-04-03 Javier Cembrano , Felix Fischer , Max Klimm