Team assembling problem for asynchronous heterogeneous mobile robots

DOI10.1016/J.TCS.2018.01.009MaRDI QIDQ1704590zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(4)

• Molecular pattern formation on grids in the \textsc{Moblot} model
• 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

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)