Keyword : gathering problem


Byzantine-Tolerant Gathering of Mobile Agents in Asynchronous Arbitrary Networks with Authenticated Whiteboards
Masashi TSUCHIDA Fukuhito OOSHITA Michiko INOUE 
Publication:   
Publication Date: 2020/07/01
Vol. E103-D  No. 7 ; pp. 1672-1682
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
mobile agentgathering problemByzantine fault
 Summary | Full Text:PDF(339.8KB)

Partial Gathering of Mobile Agents in Arbitrary Networks
Masahiro SHIBATA Daisuke NAKAMURA Fukuhito OOSHITA Hirotsugu KAKUGAWA Toshimitsu MASUZAWA 
Publication:   
Publication Date: 2019/03/01
Vol. E102-D  No. 3 ; pp. 444-453
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science — Algorithm, Theory of Computation, and their Applications —)
Category: 
Keyword: 
distributed systemmobile agentgathering problempartial gathering problem
 Summary | Full Text:PDF(769.9KB)

Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards
Masashi TSUCHIDA Fukuhito OOSHITA Michiko INOUE 
Publication:   
Publication Date: 2018/03/01
Vol. E101-D  No. 3 ; pp. 602-610
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science — Frontiers of Theoretical Computer Science —)
Category: 
Keyword: 
mobile agentgathering problemByzantine fault
 Summary | Full Text:PDF(378.4KB)

Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings
Tomoko IZUMI Taisuke IZUMI Sayaka KAMEI Fukuhito OOSHITA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/06/01
Vol. E96-A  No. 6 ; pp. 1072-1080
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
mobile robotsgathering problemring graphsmultiplicity detection
 Summary | Full Text:PDF(1.1MB)