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, Mingzhu¹ 2646332762@qq.com, Yang, Yonghui¹ 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

Description
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]
ISSN:	1819656X