Research on Learning Graphs via Enumerative Queries and its Applications
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 |
Granted (Fiscal Year 2022)
|
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 / robotics / planning / 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 Annual Research Achievements |
The algorithmic foundations and applications of learning and optimization of graphs via enumerative queries in computer-aided design and robotics were proposed: (1) the generation of obstacle-avoiding paths in grid maps by enumerative encoding scheme, the bijection to tree structures, and its rigorous evaluations/comparisons with gradient-free heuristics; (2) the sampling of robot locomotion gaits by enumerative representation schemes and its through evaluations by gradient-free optimization heuristics, enabling the efficient sampling and generation of adaptive gaits for legged robots; (3) the representation of curvature in edges of graph-based membrane folding applications, allowing the efficient folding/unfolding of network-based structures; (4) the generation of robot manipulator trajectories by using graph-based representation and extreme learning schemes, enabling the planning of robot manipulator trajectories with utmost efficiency, in the order of milliseconds; (5) the learning/optimization of cable-driven robot mechanisms by graph-based representations and gradient-free optimization schemes, enabling the possibility to devise new configurations of cable-driven robot structures; and (6) the study on the visualization of resource distribution networks on the plane, enabling the possibility to design optimal networks interactively.
|
Current Status of Research Progress |
Current Status of Research Progress
1: Research has progressed more than it was originally planned.
Reason
The relevant algorithmic foundations and application benchmarks to represente, learn and optimize graph structures via enumerative queries for design and robotics problems were established.
|
Strategy for Future Research Activity |
In 2023, the research on minimal enumerative representation of graphs and hypergraphs, and the applications of Learning Graphs with Enumerative Queries is to be conducted. The research on learning optimal bayesian and convolutional networks, and the further applications to computer-aided desin/optimization and robotics are to be conducted.
|
Report
(3 results)
Research Products
(32 results)