{"id":275,"date":"2017-12-28T16:12:29","date_gmt":"2017-12-28T16:12:29","guid":{"rendered":"https:\/\/selfreconfigurable.com\/N3W\/?p=275"},"modified":"2018-01-02T22:50:33","modified_gmt":"2018-01-02T22:50:33","slug":"generic-decentralized-control-for-a-class-of-self-reconfigurable-robots","status":"publish","type":"post","link":"https:\/\/selfreconfigurable.com\/?p=275","title":{"rendered":"Generic Decentralized Control for a Class of Self-Reconfigurable Robots"},"content":{"rendered":"<h1><span style=\"color: #b4b89e;\"><strong>GENERIC DECENTRALIZED CONTROL FOR A CLASS SELF-RECONFIGURABLE ROBOTS<\/strong><\/span><\/h1>\n<div style=\"float: right; margin-right: 22px;\"><\/div>\n<p><strong>Abstract:\u00a0<\/strong>Previous work on self-reconfiguring modular robots\u00a0has concentrated primarily on hardware and reconfiguration\u00a0we introduce a new type of generic locomotion algorithmfor self-reconfigurable robots. The algorithms\u00a0presented here are inspired by cellular automata, using\u00a0geometric rules to control module actions. The actuation\u00a0model used is a general one, presuming that modules\u00a0can generally move over the surface of a group of\u00a0modules. These algorithms can then be instantiated on\u00a0to a variety of particular systems. Correctness proofs\u00a0of the rule sets are also given for the generic geometry,\u00a0with the intent that this analysis can carry over to\u00a0the instantiated algorithms to provide different systems\u00a0with correct locomotion algorithms.<\/p>\n<p style=\"text-align: center;\"><a href=\"http:\/\/groups.csail.mit.edu\/drl\/wiki\/images\/4\/45\/ca.final.pdf\" target=\"_blank\" rel=\"noopener\"><strong>Read More<\/strong><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>GENERIC DECENTRALIZED CONTROL FOR A CLASS SELF-RECONFIGURABLE ROBOTS Abstract:\u00a0Previous work on self-reconfiguring modular robots\u00a0has concentrated primarily on hardware and reconfiguration\u00a0we introduce a new type of generic locomotion algorithmfor self-reconfigurable robots. The algorithms\u00a0presented here are inspired by cellular automata, using\u00a0geometric rules to control module actions. The actuation\u00a0model used is a general one, presuming that modules\u00a0can generally [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[11],"tags":[],"class_list":["post-275","post","type-post","status-publish","format-standard","hentry","category-pdf-ppt-files"],"_links":{"self":[{"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=\/wp\/v2\/posts\/275","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=275"}],"version-history":[{"count":3,"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=\/wp\/v2\/posts\/275\/revisions"}],"predecessor-version":[{"id":1106,"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=\/wp\/v2\/posts\/275\/revisions\/1106"}],"wp:attachment":[{"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=275"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=275"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/selfreconfigurable.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=275"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}