| Project/Area Number |
20K11998
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Review Section |
Basic Section 61040:Soft computing-related
|
|---|
| Research Institution | Waseda University |
|---|
Principal Investigator |
Parque Victor 早稲田大学, 理工学術院, 准教授(任期付) (50745221)
|
|---|
| Project Period (FY) |
2020-04-01 – 2024-03-31
|
| Project Status |
Completed (Fiscal Year 2023)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2022: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
Fiscal Year 2021: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2020: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Keywords | graph learning / optimization / networks / design / planning / robotics / succinct representation / succint representation |
|---|
| Outline of Research at the Start |
This research aims at developing the state of the art algorithms for learning graph structures by enumerative queries on the succinct combinatorial search space of graphs, and at developing its practical applications in graph architecture search and network planning problems in robotics.
|
| Outline of Final Research Achievements |
In this research, learning graph structures via enumerative queries and their applications were conducted. In one hand, the efficient algorithms to design structures of directed networks, undirected networks, modular networks, and variable-size networks achieving the state-of-the-art efficiency were made possible. And the applications in path planning and graph design and optimization problems have shown the desirable performance, efficiency, and versatility of the proposed algorithms.
|
| Academic Significance and Societal Importance of the Research Achievements |
Learning graphs via enumerative queries bring the unique benefits of succinctness (theoretical bounds) and efficiency to sample richer knowledge structures (parallelization), rendering the improved approaches to tackle complex problems in graph design/optimization in robotics and engineering.
|
