Automatic Verification of Distributed Mobile Robot Algorithms

2015 Fiscal Year Final Research Report

• Project/Area Number: 26870228
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Theory of informatics; Software
• Research Institution: Japan Advanced Institute of Science and Technology
• Principal Investigator: BONNET Francois 北陸先端科学技術大学院大学, 情報科学研究科, 助教 (60700185)
• Project Period (FY): 2014-04-01 – 2016-03-31
• Keywords: Algorithm / Distributed Computing / Robot / Verification

Outline of Final Research Achievements

In this second year of funding, we continued the development of the tool and obtained some new results.
(1) We had a paper accepted in AdHoc-Now'16 (to be published in July), which is an extension of our previous work: With the help of our verification tool, we could design and check new algorithms to solve the gathering problem in rings with four robots. More precisely, we studied the class of configurations SP4 which is the single class left open in this context. Same results were also presented in the Workshop on Distributed Robotic Swarms (WDRS'15).
(2) While being on a totally different topic, namely Game Theory, we would like to mention another accepted paper (in CG'16, to be published in July). Indeed to obtain this result, we used techniques similar to the ones we introduced in our verification tool. Hence our Kakenhi funding indirectly contributed to that paper. We developed a tool that compute Nash Equilibrium (NE) and used it to find NE of the famous Mastermind game.

Free Research Field

Distributed Computing