研究報告書 Automatic Verification of Distributed Mobile Robot Algorithms

Bonnet, Francois

内容記述
二年目も、ツールの開発を行い、このツールによってロボットのgathering問題のアルゴリズムの正しさの確認ができました。Workshop on Distributed Robotics Swarms (WDRS'15)で発表し、さらにAdHoc-Now'16の国際会議に採択され、発表する予定です。 : 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.
若手研究(B)
研究期間:2014~2015
課題番号:26870228
研究者番号:60700185
研究分野:Distributed Computing
本文を読む

https://dspace.jaist.ac.jp/dspace/bitstream/10119/13680/1/26870228seika.pdf

このアイテムのアクセス数:  回

その他の情報