Point Formation and Related Agreement Problems for Synchronous Mobile Robots with Limited Visibility.

Abstract

We discuss fundamental formation and agreement problems for autonomous, synchronous robots with limited visibility. Each robots is a mobile processor that, at each discrete time instant, observes the relative positions of those robots that are within distance V of itself, computes its new position using the given algorithm, and then moves to that position. The main difference between this work and many of the previous ones is that, here, the visibility of the robots is assumed to be limited to within distance V, for some constant V > 0. The problems we discuss include the formation of a single point by the robots and agreement on a common x-y coordinate system and the initial distribution, and we present algorithms for these problems, except for the problem of agreement on direction (a subproblem of agreement on a coordinate system), which is not solvable even for robots with unlimited visibility. (KAR) p. 1

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1995
Accession Number
ADA296911

Entities

People

  • Hideki Ando
  • Ichiro Suzuki
  • Masafumi Yamashita

Organizations

  • Hiroshima University

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Agreements
  • Algorithms
  • Collision Avoidance
  • Computer Science
  • Convergence
  • Coordinate Systems
  • Diameters
  • Electrical Engineering
  • Engineering
  • Numbers
  • Polygons
  • Real Numbers
  • Swarm Intelligence
  • Two Dimensional
  • Universities
  • Visibility

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Operations Research
  • Unmanned Aerial System (UAS) Autonomous Capabilities and Mission Reconnaissance.

Technology Areas

  • AI & ML
  • AI & ML - Autonomous Systems
  • AI & ML - Machine Learning Algorithms
  • Autonomy
  • Autonomy - Autonomous System Control