A discrete and continuous study of the \textsc{Max-Chain-Formation} problem

DOI10.1016/J.IC.2022.104877zbMath1504.68233arXiv2010.02043OpenAlexW3093688406MaRDI QIDQ2672258

Jannik Castenow, Peter Kling, Friedhelm Meyer auf der Heide, Till Knollmann

Publication date: 8 June 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.02043

zbMATH Keywords

mobile robotscontinuous timeruntimechain formationmax-chain formation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Artificial intelligence for robotics (68T40)

Cites Work

• Unnamed Item
• Energy-efficient strategies for building short chains of mobile robots locally
• Gathering of asynchronous robots with limited visibility
• Book review of: D. A. Levin et al., Markov chains and mixing times. 2nd edition
• Optimal strategies for maintaining a chain of relays between an explorer and a base camp
• On lower bounds for the largest eigenvalue of a symmetric matrix
• Local spreading algorithms for autonomous robot systems
• Eigenvalues and eigenvectors of some tridiagonal matrices
• Forming tile shapes with simple robots
• Gathering a Euclidean closed chain of robots in linear time
• A continuous strategy for collisionless gathering
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
• Universally Optimal Gathering Under Limited Visibility
• Local Gathering of Mobile Robots in Three Dimensions
• Discrete Dynamical Systems
• A Discrete and Continuous Study of the Max-Chain-Formation Problem
• Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots

This page was built for publication: A discrete and continuous study of the \textsc{Max-Chain-Formation} problem