2023 Fiscal Year Research-status Report
Practical Framework for the Formal Verification of Cooperative Mobile Robots Algorithms
Project/Area Number |
21K11748
|
Research Institution | Tokyo Institute of Technology |
Principal Investigator |
DEFAGO Xavier 東京工業大学, 情報理工学院, 教授 (70333557)
|
Co-Investigator(Kenkyū-buntansha) |
和田 幸一 法政大学, 理工学部, 教授 (90167198)
田村 康将 東京工業大学, 情報理工学院, 特定助教 (50773701)
|
Project Period (FY) |
2021-04-01 – 2025-03-31
|
Keywords | 自律分散ロボット群 / モデル検証 / 分散アルゴリズム / 自己安定 |
Outline of Annual Research Achievements |
The project aims at applying model checking to automatically verify the correctness of multi-robot algorithms and the problem of rendezvous in particular. Based on several important theorems that we have proved, we have developed a verification model that allows us to automatically verify the correctness of a given rendezvous algorithm in a model-checker (SPIN). Our model is designed to be conservative in the sense that, if an algorithm A passes the verification in the model, then this algorithm is correct in the real-world but the reverse is not true (A could be correct in the real-world even if it fails in the model).
During this year, we have progressed on algorithm synthesis; that is, given a model, automatically generate correct algorithms for that model if they exist. The main challenge consists in finding appropriate rules to considerably reduce the search space. This year we found rules that allowed us to tackle model of the classical models. In addition, we have completed the journal publication of the model-checker started last year, and we have also looked at related robot problems in the hope of finding opportunities to adapt our models; a task that remains elusive at this point.
|
Current Status of Research Progress |
Current Status of Research Progress
3: Progress in research has been slightly delayed.
Reason
During this year, Defago was involved as PC chair for the IEEE/IFIP conference DSN 2023. Then, Wada and Defago were both acting as general chair for organizing the conference OPODIS 2023. Due to these activities, our research has not progressed as quickly as anticipated and we have faced some delays as a result.
|
Strategy for Future Research Activity |
We are currently trying to push the limits in order to find via synthesis algorithms for previously unknown cases. This still requires significant work prior to submitting the work on algorithm synthesis to a top-rated journal. This is our main goal during this last research year. Upon publication of the results, the source code of the synthesis algorithm will also be published as open source.
|
Causes of Carryover |
Most of the delayed expenses are travel expenses and publication fees for presenting the results of the research. Because of the research progress having been slower than expected (due to conference organization activities), these expenses are reported to the new fiscal year.
|
Remarks |
The private github repository about algorithm synthesis will be opened after the first formal publication on this topic.
|