• Home
  • Search
  • Linear and Competitive Strategies for Continuous Robot Formation Problems
  • Cite Icon16
  • https://doi.org/10.1145/2742341Copy DOI Icon

Linear and Competitive Strategies for Continuous Robot Formation Problems

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We study a scenario in which n mobile robots with a limited viewing range are distributed in the Euclidean plane and have to solve a formation problem. The formation problems we consider are the G athering problem and the C hain-Formation problem. In the G athering problem, the robots have to gather in one (not predefined) point, while in the C hain -F ormation problem they have to form a connected communication chain of minimal length between two stationary base stations. Each robot may base its decisions where to move only on the current relative positions of neighboring robots (that are within its viewing range); that is, besides having a limited viewing range, the robots are oblivious (they do not use information from the past), have none or only very limited identities, and they do not have a common sense of direction. Variants of these problems (especially for the G athering problem) have been studied extensively in different discrete time models. In contrast, our work focuses on a continuous time model; that is, the robots continuously sense the positions of other robots within their viewing range and continuously adapt their speed and direction according to some simple, local rules. Hereby, we assume that the robots have a maximum movement speed of one. We show that this idealized idea of continuous sensing allows us to solve the mentioned formation problems in linear time O( n ) (which, given the maximum speed of one, immediately yields a maximum traveled distance of O( n )). Note that in the more classical discrete time models, the best known strategies need at least Θ( n 2 ) or even Θ( n 2 log n ) timesteps to solve these problems. For the G athering problem, our analysis solves a problem left open by Gordon et al. [2004], where the authors could prove that gathering in a continuous model is possible in finite time, but were not able to give runtime bounds. Apart from these linear bounds, we also provide runtime bounds for both formation problems that relate the runtime of our strategies to the runtime of an optimal, global algorithm. Specifically, we show that our strategy for the G athering problem is log OPT-competitive and the strategy for the C hain -F ormation problem is log n -competitive. Here, by c -competitive, we mean that our (local) strategy is asymptotically by at most a factor of c slower than an optimal, global strategy.

Similar Papers
  • Conference Article
  • Citations6

Estimating seasonal drivers in childhood infectious diseases with continuous time and discrete-time models

  • Jun 01, 2010
  • D P Word +3
  • Research Article
  • Citations5

American Option Pricing with Discrete and Continuous Time Models: An Empirical Comparison

  • Sep 29, 2011
  • SSRN Electronic Journal
  • Lars Stentoft
  • Research Article

Assessing The Consistency of Continuous Time Coefficient Parameter Model Using SEM Approach in Irregular Time Data

  • Jan 01, 2014
  • IOSR Journal of Mathematics
  • Erica Fera Juwita +2
  • Research Article
  • Citations4

A SUMMARY OF SOFTWARE RELIABILITY DEMONSTRATION TESTING MODELS

  • Mar 01, 1999
  • International Journal of Reliability, Quality and Safety Engineering
  • Kiyoshi Sawada +1
  • Research Article
  • Citations24

New distribution theory for the estimation of structural break point in mean

  • Mar 26, 2018
  • Journal of Econometrics
  • Liang Jiang +2
  • PDF
  • Research Article
  • Citations2

Single station MILP scheduling in discrete and continuous time

  • Feb 28, 2024
  • Central European Journal of Operations Research
  • María-Luisa Muñoz-Díaz +3
  • Research Article
  • Citations6

Discrete Software Reliability Growth Models with Discrete Test Effort Functions

  • Oct 30, 2011
  • International Journal of Software Engineering & Applications
  • Sk.Md Rafi +1
  • Research Article
  • Citations5

Comment on "Backward-Looking Interest-Rate Rules, Interest-Rate Smoothing, and Macroeconomic Instability"

  • Jan 01, 2003
  • Journal of Money, Credit, and Banking
  • Charles T Carlstrom +1
  • Research Article
  • Citations2

Comment on "Finite-size scaling of survival probability in branching processes".

  • Dec 15, 2016
  • Physical Review E
  • Nanxin Wei +1
  • Research Article
  • Citations15

Planning for Concurrent Action Executions Under Action Duration Uncertainty Using Dynamically Generated Bayesian Networks

  • May 05, 2010
  • Proceedings of the International Conference on Automated Planning and Scheduling
  • Eric Beaudry +2
  • Research Article
  • Citations20

Co-operation of electricity and natural gas systems including electric vehicles and variable renewable energy sources based on a continuous-time model approach

  • Apr 01, 2020
  • Energy
  • Ahmad Nikoobakht +3
  • Research Article
  • Citations14

COSMOS: A simulation language for continuous, discrete and combined models

  • Jan 01, 1992
  • SIMULATION
  • Dirk L Kettenis
  • Research Article
  • Citations97

Random Cantor set models for the elastic-perfectly plastic contact of rough surfaces

  • Aug 01, 1996
  • Wear
  • Thomas L Warren +1
  • Research Article

A Two-stage Estimation Approach of Continuous-time Series Models with Jumps

  • Jul 20, 2014
  • Journal of Information and Computational Science
  • Lianqian Yin
  • Conference Article
  • Citations5

On the stabilization of continuous fuzzy models using their discretized forms

  • Jul 01, 2012
  • A Ellouze +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.