中文
相关论文

相关论文: Pattern Formation for Asynchronous Robots without …

200 篇论文

This paper presents a novel feedback method on the motion planning for unicycle robots in environments with static obstacles, along with an extension to the distributed planning and coordination in multi-robot systems. The method employs a…

机器人学 · 计算机科学 2014-10-22 Dimitra Panagou

We study the problem of planning collision-free paths for a group of homogeneous robots. We propose a novel approach for turning the paths that were planned egocentrically by the robots, e.g. without taking other robots' moves into account,…

人工智能 · 计算机科学 2018-07-06 Anton Andreychuk , Konstantin Yakovlev

A group of wheeled robots with nonholonomic constraints is considered to rendezvous at a common specified setpoint with a desired orientation while maintaining network connectivity and ensuring collision avoidance within the robots. Given…

系统与控制 · 计算机科学 2014-02-25 Zhen Kan , Justin Klotz , Eduardo L. Pasiliao , John M. Shea , Warren E. Dixon

Decentralized control of robots has attracted huge research interests. However, some of the research used unrealistic assumptions without collision avoidance. This report focuses on the collision-free control for multiple robots in both…

机器人学 · 计算机科学 2017-09-19 Xiaotian Yang

Mobile robotic applications need precise information about the geometric position of the individual sensors on the platform. This information is given by the extrinsic calibration parameters which define how the sensor is rotated and…

机器人学 · 计算机科学 2022-07-11 Philipp Glira , Christoph Weidinger , Johann Weichselbaum

This paper deals with the classical problem of exploring a ring by a cohort of synchronous robots. We focus on the perpetual version of this problem in which it is required that each node of the ring is visited by a robot infinitely often.…

分布式、并行与集群计算 · 计算机科学 2017-08-08 Marjorie Bournat , Ajoy K. Datta , Swan Dubois

In this paper we present a method for automatically planning robust optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition…

机器人学 · 计算机科学 2015-03-13 Alphan Ulusoy , Stephen L. Smith , Xu Chu Ding , Calin Belta

This work deals with the Maximum Independent Set ($\mathcal{MIS}$) formation problem in a finite rectangular grid by autonomous robots. Suppose we are given a set of identical robots, where each robot is placed on a node of a finite…

分布式、并行与集群计算 · 计算机科学 2022-07-28 Raja Das , Avisek Sharma , Buddhadeb Sau

We are given $N$ autonomous mobile robots inside a bounded region. The robots are opaque which means that three collinear robots are unable to see each other as one of the robots acts as an obstruction for the other two. They operate in…

分布式、并行与集群计算 · 计算机科学 2024-05-02 Subhajit Pramanick , Saswata Jana , Adri Bhattacharya , Partha Sarathi Mandal

Accurate prediction of battery state of charge is needed for autonomous robots to plan movements without using up all available power. This work develops a physics and data-informed model from a simulation that predicts SOC depletion as a…

机器人学 · 计算机科学 2026-03-03 Vidyut Pradeep , Shirantha Welikala

Contemporary robots have become exceptionally skilled at achieving specific tasks in structured environments. However, they often fail when faced with the limitless permutations of real-world unstructured environments. This motivates…

机器人学 · 计算机科学 2024-07-16 Weiming Zhi

We study the problem of coordinating multiple robots along fixed geometric paths. Our contribution is threefold. First we formalize the intuitive concept of priorities as a binary relation induced by a feasible coordination solution,…

机器人学 · 计算机科学 2015-08-05 Jean Gregoire , Silvère Bonnabel , Arnaud de La Fortelle

We investigate ways for the exchange of information (explicit communication) among deaf and dumb mobile robots scattered in the plane. We introduce the use of movement-signals (analogously to flight signals and bees waggle) as a mean to…

多智能体系统 · 计算机科学 2009-02-24 Yoann Dieudonné , Shlomi Dolev , Franck Petit , Michael Segal

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

Aquatic creatures exhibit remarkable adaptations of their body to efficiently interact with the surrounding fluid. The tight coupling between their morphology, motion, and the environment are highly complex but serves as a valuable example…

机器人学 · 计算机科学 2022-11-28 Nana Obayashi , Andrea Vicari , Kai Junge , Kamran Shakir , Josie Hughes

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

Arbitrary pattern formation (\textsc{Apf}) is a well-studied problem in swarm robotics. To the best of our knowledge, the problem has been considered in two different settings: one in a euclidean plane and another in an infinite grid. This…

分布式、并行与集群计算 · 计算机科学 2023-08-29 Avisek Sharma , Satakshi Ghosh , Pritam Goswami , Buddhadeb Sau

Applying micro-patterns to surfaces has been shown to impart useful physical properties such as drag reduction and hydrophobicity. However, current manufacturing techniques cannot produce micro-patterned surfaces at scale due to high-cost…

机器人学 · 计算机科学 2026-03-20 Annalisa T. Taylor , Malachi Landis , Ping Guo , Todd D. Murphey

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

We study the problem of determining coordinated motions, of minimum total length, for two arbitrary convex centrally-symmetric (CCS) robots in an otherwise obstacle-free plane. Using the total path length traced by the two robot centres as…

计算几何 · 计算机科学 2025-03-05 David Kirkpatrick , Paul Liu