• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2001 Fiscal Year Final Research Report Summary

Algorithm Engineering for Wide Area Distributed Systems

Research Project

Project/Area Number 10205221
Research Category

Grant-in-Aid for Scientific Research on Priority Areas (B)

Allocation TypeSingle-year Grants
Research InstitutionKyushu University

Principal Investigator

YAMASHITA Masafumi  Kyushu Univ., Dept. Comput. Sci. and Commu. Eng., Prof., システム情報科学研究院, 教授 (00135419)

Co-Investigator(Kenkyū-buntansha) ASAHIRO Yuuichi  Kyushu Univ., Dept. Comput. Sci. and Commu. Eng., Research Assoc., システム情報科学研究院, 助手 (40304761)
MIYANO Eiji  Kyushu Inst. Design, Lecturer, 芸術工学部, 講師 (10284548)
FUJITA Satoshi  Hiroshima Univ., Dept. Electrical Engineering, Assoc. Prof., 工学部, 助教授 (40228995)
Project Period (FY) 1998 – 2000
Keywordsdistributed systems / distributed algorithms / autonomous mobile robots / searching for intruders / agreement problem / resource allocation problem / cluster processing
Research Abstract

A distributed system consists of many autonomously working agents like computers, processes, vehicles, and so on. For making the system flexible and extendible, it does not adopt a mechanism to control the whole agents in the master-slave fashion, and hence the agents decide their behaviours in an asynchronous manner depending only on their initial information and local information they obtained by communication with their neighbor agents. In this project, we have results in many fields from autonomous mobile robots to parallelized compilers, some of which results are listed and explained in the following :
(A)Theory of Distributed Algorithms : A difficulty of designing a distributed algorithm comes from a common requirement : it is required to decide a globally consistent behavior, given local information. On the other hand, a goodness measure of distributed algorithms is the amount of information necessary to exchange to solve a problem under consideration. Hence, we investigated the … More amount of information necessary to exchange to solve a particular problem, and an optimal way of information allocation to reduce the amount of necessary information exchange.
(B) Design of Distributed Algorithms : For some problems, we design distributed algorithms. First of all, for the mutual exclusion problem, which is a basic synchronization problem, we design a fault tolerant algorithm that tolerates any number of transient faults called a self-stabilisation algorithm. Next, we investigate the generalized allocation problem. It is a problem that has many practical applications in real-world. However, it is known as a NP complete problem, so we design a cluster processing algorithm which is obtained by parallelize a sequencial heuristic algorithm based on the local search paradigm, the aim of which is to get a sufficiently good solution in a practical time contraint. We then evaluate its performance.
(C) Autonomous Mobile Robot System : We investigated a distributed control problem for autonomous mobile robot systems. In particular, we investigated the problem of carrying an object by a group of robots, designed a distributed control algorithm, and then evaluated it performance. Less

  • Research Products

    (16 results)

All Other

All Publications (16 results)

  • [Publications] T.Nakata, H.Imahayashi, M.Yamashita: "A Probabilistic Local Majority Polling Game on Weighted Directed Graphs with an Application to the Distributed Agreement Problem"Networks. 35・4. 266-273 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Fujita, M.Yamashita, T.Kameda: "A Study on r-Configuration -a Resource Assignment Problem on Graphs"SIAM J.Discrete Mathematics. 13・2. 227-254 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Fujita, M.Yamashita: "Approximation algorithms for multiprocessor scheduling problem(invited survey paper)"IEICE Trans.Information and Systems. E83-D・3. 503-509 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] I.Suzuki, M.Yamashita: "A Theory of Distributed Anonymous Mobile Robots--Formation and Agreement Problems"SIAM J.Computing. 28・4. 1347-1363 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] H.Ando, Y.Oasa, I.Suzuki, M.Yamashita: "A Distributed Memoryless Point Convergence Algorithm for Mobile Robots with Limited Visibility"IEEE Trans.Robotics and Automation. 15・5. 818-828 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] M.Yamashita, T.Kameda: "Leader Election Problem on Networks in which Processor Identity Numbers are not Distinct"IEEE Trans.Parallel and Distributed Systems. 10・9. 878-887 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 杉原厚吉, 茨木俊秀, 浅野孝夫, 山下雅史: "アルゴリズム工学 --計算困難問題への挑戦--"共立出版. 280 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T. Nakata, H. Imahayashi, and M. Yamashita: "A Probabilistic Local Majority Polling Game on Weighted Directed Graphs with an Application to the Distributed Agreement Problem"Networks. 35, 4. 266-273 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S. Fujita, M. Yamashita, and T. Kameda: "A Study on r-Configuration-a Resource Assignment Problem on Graphs"SIAM J. Discrete Mathematics. 13, 2. 227-254 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S. Fujita and M. Yamashita: "Approximation algorithms for multiprocessor scheduling problem (invited survey paper)"IEICE Trans. Information and Systems. E83-D, 3. 503-509 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] I. Suzuki and M. Yamashita: "A Theory of Distributed Anonymous Mobile Robots --Formation and Agreement Problems"SIAM J. Computing. 28, 4. 1347-1363 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita: "A Distributed Memoryless Point Convergence Algorithm for Mobile Robots with Limited Visibility"IEEE Trans. Robotics and Automation. 15, 5. 818-828 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] M. Yamashita and T. Kameda: "Leader Election Problem on Networks in which Processor Identity Numbers are not Distinct"IEEE Trans. Parallel and Distributed System. 10, 9. 878-887 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] M. Yamashita and T. Kameda: "Modeling K-Coteries by Well Covered Graphs,"Networks. 34. 221-228 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T. Harada and M. Yamashita: "Improving the Availability of Mutual Exclusion Systems on Incomplete Networks,"IEEE Trans. Computer. 48, 7. 744-747 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] N. Umemoto, H. Kakugawa, and M. Yamashita: "A Self-stabilizing Ring Orientation with a Smaller Number of Processor States,"IEEE Trans. Parallel and Distributed Systems. 9, 6. 579-584 (1998)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2003-09-17  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi