{"id":1947,"date":"2024-05-17T00:23:55","date_gmt":"2024-05-17T00:23:55","guid":{"rendered":"http:\/\/chino.local\/?post_type=project&amp;p=1947"},"modified":"2024-05-17T00:23:55","modified_gmt":"2024-05-17T00:23:55","slug":"continuous-3d-puzzles","status":"publish","type":"project","link":"https:\/\/c-mng.cwh.hokudai.ac.jp\/iis-lab.ist\/Root\/en\/project\/continuous-3d-puzzles","title":{"rendered":"Continuous 3D puzzles"},"content":{"rendered":"\n<p>The search space of a puzzle ring is a 6 dimensional continuous space. The solving such a puzzle requires an effective path planning algorithm. We have applied Rapidly-exploring Random Trees (RRT) to puzzle rings.<\/p>\n","protected":false},"featured_media":733,"parent":0,"template":"","meta":{"_locale":"en_US","_original_post":"http:\/\/chino.local\/?post_type=project&p=732","vkexunit_cta_each_option":""},"project_category":[10],"acf":[],"_links":{"self":[{"href":"https:\/\/c-mng.cwh.hokudai.ac.jp\/iis-lab.ist\/Root\/wp-json\/wp\/v2\/project\/1947"}],"collection":[{"href":"https:\/\/c-mng.cwh.hokudai.ac.jp\/iis-lab.ist\/Root\/wp-json\/wp\/v2\/project"}],"about":[{"href":"https:\/\/c-mng.cwh.hokudai.ac.jp\/iis-lab.ist\/Root\/wp-json\/wp\/v2\/types\/project"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/c-mng.cwh.hokudai.ac.jp\/iis-lab.ist\/Root\/wp-json\/"}],"wp:attachment":[{"href":"https:\/\/c-mng.cwh.hokudai.ac.jp\/iis-lab.ist\/Root\/wp-json\/wp\/v2\/media?parent=1947"}],"wp:term":[{"taxonomy":"project_category","embeddable":true,"href":"https:\/\/c-mng.cwh.hokudai.ac.jp\/iis-lab.ist\/Root\/wp-json\/wp\/v2\/project_category?post=1947"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}