A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots

@inproceedings{Degener2010ACL,
  title={A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots},
  author={Bastian Degener and Barbara Kempkes and Peter Kling and Friedhelm Meyer auf der Heide},
  booktitle={SIROCCO},
  year={2010}
}
  • Bastian Degener, Barbara Kempkes, +1 author Friedhelm Meyer auf der Heide
  • Published in SIROCCO 2010
  • Mathematics, Computer Science
  • We are given an arbitrarily shaped chain of n robots with fixed end points in the plane. We assume that each robot can only see its two neighbors in the chain, which have to be within its viewing range. The goal is to move the robots to the straight line between the end points. Each robot has to base the decision where to move on the relative positions of its neighbors only. Such local strategies considered until now are based on discrete rounds, where a round consists of a movement of each… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 12 CITATIONS

    An Asymmetric Distributed Method for Sorting a Robot Swarm

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Collision avoiding decentralized sorting of robotic swarm

    VIEW 1 EXCERPT
    CITES BACKGROUND

    A parallel distributed strategy for arraying a scattered robot swarm

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Collaboration in distributed systems: robots, ants, and matchings

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Tight analysis of a collisionless robot gathering algorithm

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Collisionless Gathering of Robots with an Extent

    VIEW 2 EXCERPTS
    CITES BACKGROUND