View in EDS PDF Full Text

Research on Solutions for Heterogeneous Configurations of Modular Robots.

Saved in:
Bibliographic Details
Title: Research on Solutions for Heterogeneous Configurations of Modular Robots.
Authors: Yuan, Mingzhu1 2646332762@qq.com, Yang, Yonghui1 16650239176@163.com
Source: IAENG International Journal of Computer Science. May2026, Vol. 53 Issue 5, p1954-1969. 16p.
Subjects: Robots, Robotic path planning, Graph theory, Algorithms
Abstract: To address the issue of prolonged pathfinding during reconfiguration planning for modular robots, this paper introduces three methods for solving configuration non-equivalence classes. These methods are characterized by ease of implementation, rapid computation, and high visualization capabilities, thereby mitigating the complexity of reconfiguration tasks to a certain extent. First, the 3D configuration problem is reduced to a 2D grid. Subsequently, three methods -- the string method, the bitmask method, and the graph theory method -- are applied to resolve non-equivalence classes. The results obtained through these distinct methods are then compared, demonstrating their validity and highlighting the characteristics of each approach. [ABSTRACT FROM AUTHOR]
Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193482047
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Research on Solutions for Heterogeneous Configurations of Modular Robots.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Yuan%2C+Mingzhu%22">Yuan, Mingzhu</searchLink><relatesTo>1</relatesTo><i> 2646332762@qq.com</i><br /><searchLink fieldCode="AR" term="%22Yang%2C+Yonghui%22">Yang, Yonghui</searchLink><relatesTo>1</relatesTo><i> 16650239176@163.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Computer+Science%22">IAENG International Journal of Computer Science</searchLink>. May2026, Vol. 53 Issue 5, p1954-1969. 16p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Robots%22">Robots</searchLink><br /><searchLink fieldCode="DE" term="%22Robotic+path+planning%22">Robotic path planning</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: To address the issue of prolonged pathfinding during reconfiguration planning for modular robots, this paper introduces three methods for solving configuration non-equivalence classes. These methods are characterized by ease of implementation, rapid computation, and high visualization capabilities, thereby mitigating the complexity of reconfiguration tasks to a certain extent. First, the 3D configuration problem is reduced to a 2D grid. Subsequently, three methods -- the string method, the bitmask method, and the graph theory method -- are applied to resolve non-equivalence classes. The results obtained through these distinct methods are then compared, demonstrating their validity and highlighting the characteristics of each approach. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193482047
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 16
        StartPage: 1954
    Subjects:
      – SubjectFull: Robots
        Type: general
      – SubjectFull: Robotic path planning
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Research on Solutions for Heterogeneous Configurations of Modular Robots.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Yuan, Mingzhu
      – PersonEntity:
          Name:
            NameFull: Yang, Yonghui
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 1819656X
          Numbering:
            – Type: volume
              Value: 53
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: IAENG International Journal of Computer Science
              Type: main
ResultId 1