模块化机器人的旋转变换:3个 + 1个火枪手为所有正交凸形状

IF 0.9 3区 计算机科学 Q1 BUSINESS, FINANCE
Matthew Connor, Othon Michail
{"title":"模块化机器人的旋转变换:3个 + 1个火枪手为所有正交凸形状","authors":"Matthew Connor,&nbsp;Othon Michail","doi":"10.1016/j.jcss.2024.103618","DOIUrl":null,"url":null,"abstract":"<div><div>We study programmable matter systems consisting of modules that perform the minimal mechanical operation of rotating by 90° around each other. We represent the modules as nodes lying on the cells of a two-dimensional square grid. We are interested in characterising families whose shapes can be transformed into each other by a sequence of rotation moves that maintains global connectivity. Shapes can only be transformed into each other by rotation if they are <em>colour-consistent</em>, meaning that their nodes have identical colour cardinalities on a checkered colouring of the grid. We develop a generic centralised transformation and prove that, for any pair <em>A</em>, <em>B</em> of connected, colour-consistent, orthogonally convex shapes, it can transform <em>A</em> into <em>B</em>, using a <em>seed</em> of 3 or 4 nodes to trigger the transformation. The running time of our transformation is an optimal <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> sequential moves, where <span><math><mi>n</mi><mo>=</mo><mo>|</mo><mi>A</mi><mo>|</mo><mo>=</mo><mo>|</mo><mi>B</mi><mo>|</mo></math></span>.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"150 ","pages":"Article 103618"},"PeriodicalIF":0.9000,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes\",\"authors\":\"Matthew Connor,&nbsp;Othon Michail\",\"doi\":\"10.1016/j.jcss.2024.103618\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We study programmable matter systems consisting of modules that perform the minimal mechanical operation of rotating by 90° around each other. We represent the modules as nodes lying on the cells of a two-dimensional square grid. We are interested in characterising families whose shapes can be transformed into each other by a sequence of rotation moves that maintains global connectivity. Shapes can only be transformed into each other by rotation if they are <em>colour-consistent</em>, meaning that their nodes have identical colour cardinalities on a checkered colouring of the grid. We develop a generic centralised transformation and prove that, for any pair <em>A</em>, <em>B</em> of connected, colour-consistent, orthogonally convex shapes, it can transform <em>A</em> into <em>B</em>, using a <em>seed</em> of 3 or 4 nodes to trigger the transformation. The running time of our transformation is an optimal <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> sequential moves, where <span><math><mi>n</mi><mo>=</mo><mo>|</mo><mi>A</mi><mo>|</mo><mo>=</mo><mo>|</mo><mi>B</mi><mo>|</mo></math></span>.</div></div>\",\"PeriodicalId\":50224,\"journal\":{\"name\":\"Journal of Computer and System Sciences\",\"volume\":\"150 \",\"pages\":\"Article 103618\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and System Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022000024001132\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000024001132","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}
引用次数: 0

摘要

我们研究由模块组成的可编程物质系统,这些模块执行相互旋转90°的最小机械操作。我们将模块表示为位于二维方形网格单元上的节点。我们感兴趣的是描述家庭的特征,这些家庭的形状可以通过一系列的旋转运动来相互转换,从而保持全球的连通性。形状只有在颜色一致的情况下才能通过旋转转换成彼此,这意味着它们的节点在网格的方格颜色上具有相同的颜色基数。我们开发了一个通用的集中变换,并证明,对于任何对a, B的连通,颜色一致,正交凸形状,它可以转换成B,使用3或4个节点的种子来触发转换。我们的转换的运行时间是最优的O(n2)次连续移动,其中n=|A|=|B|。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes
We study programmable matter systems consisting of modules that perform the minimal mechanical operation of rotating by 90° around each other. We represent the modules as nodes lying on the cells of a two-dimensional square grid. We are interested in characterising families whose shapes can be transformed into each other by a sequence of rotation moves that maintains global connectivity. Shapes can only be transformed into each other by rotation if they are colour-consistent, meaning that their nodes have identical colour cardinalities on a checkered colouring of the grid. We develop a generic centralised transformation and prove that, for any pair A, B of connected, colour-consistent, orthogonally convex shapes, it can transform A into B, using a seed of 3 or 4 nodes to trigger the transformation. The running time of our transformation is an optimal O(n2) sequential moves, where n=|A|=|B|.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computer and System Sciences
Journal of Computer and System Sciences 工程技术-计算机:理论方法
CiteScore
3.70
自引率
0.00%
发文量
58
审稿时长
68 days
期刊介绍: The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信