Team assembling problem for asynchronous heterogeneous mobile robots

DOI10.1016/J.TCS.2018.01.009zbMATH Open1388.68275OpenAlexW2792496511MaRDI QIDQ1704590FDOQ1704590

Authors: Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita, Zhiqiang Liu 

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.01.009

Recommendations

• Distributed computing by mobile robots: gathering
• scientific article; zbMATH DE number 2038783
• Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
• Pattern formation by oblivious asynchronous mobile robots
• Distributed algorithms for partitioning a swarm of autonomous mobile robots

zbMATH Keywords

heterogeneityself-organizationmobile robotsformationteam assembling

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Distributed systems (68M14)

Cites Work

• Distributed algorithms for partitioning a swarm of autonomous mobile robots
• Distributed computing by mobile robots: gathering
• Self-stabilizing systems in spite of distributed control
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Gathering few fat mobile robots in the plane
• Title not available (Why is that?)
• Coordination without communication: the case of the flocking problem
• A distributed algorithm for gathering many fat mobile robots in the plane
• Forming sequences of geometric patterns with oblivious mobile robots
• Rendezvous of two robots with constant memory
• Pattern formation by oblivious asynchronous mobile robots
• Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional Euclidean space
• Pattern formation by mobile robots with limited visibility

Cited In (4)

• The dynamic team forming problem: throughput and delay for unbiased policies
• Search by a metamorphic robotic system in a finite 2D square grid
• \(k\)-circle formation by disoriented asynchronous robots
• Molecular pattern formation on grids in the \textsc{Moblot} model

This page was built for publication: Team assembling problem for asynchronous heterogeneous mobile robots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704590)