状態を持つ自律分散ロボット群に対する集合問題に関する研究

DOI 機関リポジトリ (HANDLE)

書誌事項

タイトル別名
  • GATHERING OF AUTONOUMOUS MOBILE ROBOTS WITH STATES

この論文をさがす

説明

We study Gathering problem for autonomous mobile robots in semi-synchronous setting and asynchronous setting with persistent memory called light. It is known that Gathering is impossible when robots have no lights in basic common models if the system is even semi-synchronous and thus asynchronous. We show that we can solve Gathering with 3 colors if we consider semi-synchronous setting. In internal-light (robot can recognize only own color) and non-rigid movement, where robots may stop on the way to the destination but move at least δ>0, which is known to robots. Also in this thesis, we define subclass of asynchronous schedulers and we show that we can solve Gathering with optimal number of colors if we consider a restricted class of asynchronous setting in full-light (robots can recognize own colors and other's ones) and rigid movement.

収録刊行物

キーワード

詳細情報 詳細情報について

  • CRID
    1390009224831372032
  • NII論文ID
    120006897023
  • NII書誌ID
    AA12677220
  • DOI
    10.15002/00022884
  • HANDLE
    10114/00022884
  • ISSN
    21879923
  • 本文言語コード
    ja
  • 資料種別
    departmental bulletin paper
  • データソース種別
    • JaLC
    • IRDB
    • CiNii Articles
  • 抄録ライセンスフラグ
    使用可

問題の指摘

ページトップへ