Evidence map›Paper›PMID 39753686›Full record

ArticleScientific reports2025

Determining optimum assembly zone for modular reconfigurable robots using multi-objective genetic algorithm.

Ravikiran Pasumarthi, S M Bhagya P Samarakoon, Mohan Rajesh Elara, Bing J Sheu

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Ravikiran PasumarthiEngineering Product Development Pillar, Singapore University of Technology and Design, Singapore, 487372, Singapore.
S M Bhagya P SamarakoonEngineering Product Development Pillar, Singapore University of Technology and Design, Singapore, 487372, Singapore. bhagya_samarakoon@sutd.edu.sg.
Mohan Rajesh ElaraEngineering Product Development Pillar, Singapore University of Technology and Design, Singapore, 487372, Singapore.
Bing J SheuDepartment of Electronics Engineering, College of Engineering, Chang Gung University, Taoyuan City, 330, Taiwan.

Funding

Agency for Science, Technology and Research M21K1a0104National Robotics Programme M22NBK0054
6 · The paper itself

Abstract

Reconfigurable modular robots can be used in application domains such as exploration, logistics, and outer space. The robots should be able to assemble and work as a single entity to perform a task that requires high throughput. Selecting an optimum assembly position with minimum distance traveled by robots in an obstacle surrounding the environment is challenging. Therefore, this paper proposes a novel approach for optimizing the assembly zone of modular robots in heterogeneous obstacle environments. The method uses a multi-objective Genetic Algorithm (GA) to minimize total travel distance and individual distance disparities. Utilizing the A* algorithm for path planning ensures efficient navigation. A generic kinematic model enabling holonomic locomotion with any reconfiguration and a new modular robot design are also introduced. Hardware experiments have been conducted to validate the kinematic model's applicability for holonomic navigation across different robot configurations. Simulations and physical experiments demonstrated the effectiveness of the proposed method in determining assembly zones, with GA outperforming multi-objective pattern search and random selection in terms of total distance and individual distances traveled by the robots.

Identifiers

PMID39753686
PMCPMC11698720

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.