Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem Article Swipe
Ash Yaw Sang Wan
,
Zhenyuan Yang
,
Lim Yi
,
Chee Gen Moo
,
Mohan Rajesh Elara
,
Anh Vu Le
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.3390/math12060902
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.3390/math12060902
Recent advancements in autonomous mobile robots have led to significant progress in area coverage tasks. However, challenges persist in optimizing the efficiency and computational complexity of complete coverage path planner (CCPP) algorithms for multi-robot systems, particularly in scenarios requiring revisiting or a double pass in specific locations, such as cleaning robots addressing spilled consumables. This paper presents an innovative approach to tackling the double-pass complete coverage problem using an autonomous inter-reconfigurable robot path planner. Our solution leverages a modified Glasius bio-inspired neural network (GBNN) to facilitate double-pass coverage through inter-reconfiguration between two robots. We compare our proposed algorithm with traditional multi-robot path planning in a centralized system, demonstrating a reduction in algorithm iterations and computation time. Our experimental results underscore the efficacy of the proposed solution in enhancing the efficiency of area coverage tasks. Furthermore, we discuss the implementation details and limitations of our study, providing insights for future research directions in autonomous robotics.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3390/math12060902
- https://www.mdpi.com/2227-7390/12/6/902/pdf?version=1710847961
- OA Status
- gold
- Cited By
- 1
- References
- 32
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4392949839
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4392949839Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3390/math12060902Digital Object Identifier
- Title
-
Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage ProblemWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-03-19Full publication date if available
- Authors
-
Ash Yaw Sang Wan, Zhenyuan Yang, Lim Yi, Chee Gen Moo, Mohan Rajesh Elara, Anh Vu LeList of authors in order
- Landing page
-
https://doi.org/10.3390/math12060902Publisher landing page
- PDF URL
-
https://www.mdpi.com/2227-7390/12/6/902/pdf?version=1710847961Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.mdpi.com/2227-7390/12/6/902/pdf?version=1710847961Direct OA link when available
- Concepts
-
Path (computing), Planner, Computer science, Robot, Motion planning, Mathematical optimization, Mathematics, Artificial intelligence, Computer networkTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1Per-year citation counts (last 5 years)
- References (count)
-
32Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4392949839 |
|---|---|
| doi | https://doi.org/10.3390/math12060902 |
| ids.doi | https://doi.org/10.3390/math12060902 |
| ids.openalex | https://openalex.org/W4392949839 |
| fwci | 0.8368661 |
| type | article |
| title | Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem |
| biblio.issue | 6 |
| biblio.volume | 12 |
| biblio.last_page | 902 |
| biblio.first_page | 902 |
| topics[0].id | https://openalex.org/T12288 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9987999796867371 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Optimization and Search Problems |
| topics[1].id | https://openalex.org/T11814 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9983999729156494 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Advanced Manufacturing and Logistics Optimization |
| topics[2].id | https://openalex.org/T10586 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9961000084877014 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1707 |
| topics[2].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[2].display_name | Robotic Path Planning Algorithms |
| is_xpac | False |
| apc_list.value | 1800 |
| apc_list.currency | CHF |
| apc_list.value_usd | 1949 |
| apc_paid.value | 1800 |
| apc_paid.currency | CHF |
| apc_paid.value_usd | 1949 |
| concepts[0].id | https://openalex.org/C2777735758 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7149076461791992 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q817765 |
| concepts[0].display_name | Path (computing) |
| concepts[1].id | https://openalex.org/C2776999362 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6870003342628479 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q2349274 |
| concepts[1].display_name | Planner |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.5198279023170471 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C90509273 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5126463770866394 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q11012 |
| concepts[3].display_name | Robot |
| concepts[4].id | https://openalex.org/C81074085 |
| concepts[4].level | 3 |
| concepts[4].score | 0.4223594665527344 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q366872 |
| concepts[4].display_name | Motion planning |
| concepts[5].id | https://openalex.org/C126255220 |
| concepts[5].level | 1 |
| concepts[5].score | 0.32238805294036865 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[5].display_name | Mathematical optimization |
| concepts[6].id | https://openalex.org/C33923547 |
| concepts[6].level | 0 |
| concepts[6].score | 0.31243661046028137 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[6].display_name | Mathematics |
| concepts[7].id | https://openalex.org/C154945302 |
| concepts[7].level | 1 |
| concepts[7].score | 0.23730245232582092 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[7].display_name | Artificial intelligence |
| concepts[8].id | https://openalex.org/C31258907 |
| concepts[8].level | 1 |
| concepts[8].score | 0.11221730709075928 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[8].display_name | Computer network |
| keywords[0].id | https://openalex.org/keywords/path |
| keywords[0].score | 0.7149076461791992 |
| keywords[0].display_name | Path (computing) |
| keywords[1].id | https://openalex.org/keywords/planner |
| keywords[1].score | 0.6870003342628479 |
| keywords[1].display_name | Planner |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.5198279023170471 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/robot |
| keywords[3].score | 0.5126463770866394 |
| keywords[3].display_name | Robot |
| keywords[4].id | https://openalex.org/keywords/motion-planning |
| keywords[4].score | 0.4223594665527344 |
| keywords[4].display_name | Motion planning |
| keywords[5].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[5].score | 0.32238805294036865 |
| keywords[5].display_name | Mathematical optimization |
| keywords[6].id | https://openalex.org/keywords/mathematics |
| keywords[6].score | 0.31243661046028137 |
| keywords[6].display_name | Mathematics |
| keywords[7].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[7].score | 0.23730245232582092 |
| keywords[7].display_name | Artificial intelligence |
| keywords[8].id | https://openalex.org/keywords/computer-network |
| keywords[8].score | 0.11221730709075928 |
| keywords[8].display_name | Computer network |
| language | en |
| locations[0].id | doi:10.3390/math12060902 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210192031 |
| locations[0].source.issn | 2227-7390 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2227-7390 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Mathematics |
| locations[0].source.host_organization | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.mdpi.com/2227-7390/12/6/902/pdf?version=1710847961 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Mathematics |
| locations[0].landing_page_url | https://doi.org/10.3390/math12060902 |
| locations[1].id | pmh:oai:doaj.org/article:3b563c90d7224d1d9aaa00de175d6846 |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | Mathematics, Vol 12, Iss 6, p 902 (2024) |
| locations[1].landing_page_url | https://doaj.org/article/3b563c90d7224d1d9aaa00de175d6846 |
| locations[2].id | pmh:oai:mdpi.com:/2227-7390/12/6/902/ |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306400947 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | True |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | MDPI (MDPI AG) |
| locations[2].source.host_organization | https://openalex.org/I4210097602 |
| locations[2].source.host_organization_name | Multidisciplinary Digital Publishing Institute (Switzerland) |
| locations[2].source.host_organization_lineage | https://openalex.org/I4210097602 |
| locations[2].license | cc-by |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | Text |
| locations[2].license_id | https://openalex.org/licenses/cc-by |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | Mathematics |
| locations[2].landing_page_url | https://dx.doi.org/10.3390/math12060902 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5013005483 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-1471-5221 |
| authorships[0].author.display_name | Ash Yaw Sang Wan |
| authorships[0].countries | SG |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I152815399 |
| authorships[0].affiliations[0].raw_affiliation_string | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[0].institutions[0].id | https://openalex.org/I152815399 |
| authorships[0].institutions[0].ror | https://ror.org/05j6fvn87 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I152815399 |
| authorships[0].institutions[0].country_code | SG |
| authorships[0].institutions[0].display_name | Singapore University of Technology and Design |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Ash Wan Yaw Sang |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[1].author.id | https://openalex.org/A5028342635 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-1819-2701 |
| authorships[1].author.display_name | Zhenyuan Yang |
| authorships[1].countries | SG |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I152815399 |
| authorships[1].affiliations[0].raw_affiliation_string | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[1].institutions[0].id | https://openalex.org/I152815399 |
| authorships[1].institutions[0].ror | https://ror.org/05j6fvn87 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I152815399 |
| authorships[1].institutions[0].country_code | SG |
| authorships[1].institutions[0].display_name | Singapore University of Technology and Design |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Zhenyuan Yang |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[2].author.id | https://openalex.org/A5023875296 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-2997-6667 |
| authorships[2].author.display_name | Lim Yi |
| authorships[2].countries | SG |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I152815399 |
| authorships[2].affiliations[0].raw_affiliation_string | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[2].institutions[0].id | https://openalex.org/I152815399 |
| authorships[2].institutions[0].ror | https://ror.org/05j6fvn87 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I152815399 |
| authorships[2].institutions[0].country_code | SG |
| authorships[2].institutions[0].display_name | Singapore University of Technology and Design |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Lim Yi |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[3].author.id | https://openalex.org/A5015513205 |
| authorships[3].author.orcid | |
| authorships[3].author.display_name | Chee Gen Moo |
| authorships[3].countries | SG |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I152815399 |
| authorships[3].affiliations[0].raw_affiliation_string | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[3].institutions[0].id | https://openalex.org/I152815399 |
| authorships[3].institutions[0].ror | https://ror.org/05j6fvn87 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I152815399 |
| authorships[3].institutions[0].country_code | SG |
| authorships[3].institutions[0].display_name | Singapore University of Technology and Design |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Chee Gen Moo |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[4].author.id | https://openalex.org/A5041057723 |
| authorships[4].author.orcid | https://orcid.org/0000-0001-6504-1530 |
| authorships[4].author.display_name | Mohan Rajesh Elara |
| authorships[4].countries | SG |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I152815399 |
| authorships[4].affiliations[0].raw_affiliation_string | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[4].institutions[0].id | https://openalex.org/I152815399 |
| authorships[4].institutions[0].ror | https://ror.org/05j6fvn87 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I152815399 |
| authorships[4].institutions[0].country_code | SG |
| authorships[4].institutions[0].display_name | Singapore University of Technology and Design |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Rajesh Elara Mohan |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore |
| authorships[5].author.id | https://openalex.org/A5073647327 |
| authorships[5].author.orcid | https://orcid.org/0000-0002-4804-7540 |
| authorships[5].author.display_name | Anh Vu Le |
| authorships[5].countries | VN |
| authorships[5].affiliations[0].institution_ids | https://openalex.org/I141445968 |
| authorships[5].affiliations[0].raw_affiliation_string | Communication and Signal Processing Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam |
| authorships[5].institutions[0].id | https://openalex.org/I141445968 |
| authorships[5].institutions[0].ror | https://ror.org/01drq0835 |
| authorships[5].institutions[0].type | education |
| authorships[5].institutions[0].lineage | https://openalex.org/I141445968 |
| authorships[5].institutions[0].country_code | VN |
| authorships[5].institutions[0].display_name | Ton Duc Thang University |
| authorships[5].author_position | last |
| authorships[5].raw_author_name | Anh Vu Le |
| authorships[5].is_corresponding | True |
| authorships[5].raw_affiliation_strings | Communication and Signal Processing Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.mdpi.com/2227-7390/12/6/902/pdf?version=1710847961 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T12288 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9987999796867371 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Optimization and Search Problems |
| related_works | https://openalex.org/W2155467318, https://openalex.org/W122632647, https://openalex.org/W2060743914, https://openalex.org/W2359600231, https://openalex.org/W187779371, https://openalex.org/W2380019117, https://openalex.org/W3138952546, https://openalex.org/W1987886368, https://openalex.org/W1660309994, https://openalex.org/W2369187583 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 3 |
| best_oa_location.id | doi:10.3390/math12060902 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210192031 |
| best_oa_location.source.issn | 2227-7390 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2227-7390 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Mathematics |
| best_oa_location.source.host_organization | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.mdpi.com/2227-7390/12/6/902/pdf?version=1710847961 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Mathematics |
| best_oa_location.landing_page_url | https://doi.org/10.3390/math12060902 |
| primary_location.id | doi:10.3390/math12060902 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210192031 |
| primary_location.source.issn | 2227-7390 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2227-7390 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Mathematics |
| primary_location.source.host_organization | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.mdpi.com/2227-7390/12/6/902/pdf?version=1710847961 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Mathematics |
| primary_location.landing_page_url | https://doi.org/10.3390/math12060902 |
| publication_date | 2024-03-19 |
| publication_year | 2024 |
| referenced_works | https://openalex.org/W3131753876, https://openalex.org/W4312634855, https://openalex.org/W3130631955, https://openalex.org/W4293526127, https://openalex.org/W3199533695, https://openalex.org/W4285102557, https://openalex.org/W4312241382, https://openalex.org/W2968388457, https://openalex.org/W1538912178, https://openalex.org/W3168319222, https://openalex.org/W2534928993, https://openalex.org/W3199087809, https://openalex.org/W2902991149, https://openalex.org/W4206447188, https://openalex.org/W3216275608, https://openalex.org/W3204840434, https://openalex.org/W4220715825, https://openalex.org/W2949870573, https://openalex.org/W3040442776, https://openalex.org/W2997649476, https://openalex.org/W3207644545, https://openalex.org/W3018311626, https://openalex.org/W2899318310, https://openalex.org/W2118379053, https://openalex.org/W2790458093, https://openalex.org/W3144376613, https://openalex.org/W2966167467, https://openalex.org/W4312777451, https://openalex.org/W3175865716, https://openalex.org/W3188409531, https://openalex.org/W3002866353, https://openalex.org/W2724806769 |
| referenced_works_count | 32 |
| abstract_inverted_index.a | 41, 77, 104, 108 |
| abstract_inverted_index.We | 93 |
| abstract_inverted_index.an | 57, 68 |
| abstract_inverted_index.as | 48 |
| abstract_inverted_index.in | 2, 11, 18, 36, 44, 103, 110, 126, 151 |
| abstract_inverted_index.of | 25, 122, 130, 142 |
| abstract_inverted_index.or | 40 |
| abstract_inverted_index.to | 8, 60, 84 |
| abstract_inverted_index.we | 135 |
| abstract_inverted_index.Our | 74, 116 |
| abstract_inverted_index.and | 22, 113, 140 |
| abstract_inverted_index.for | 32, 147 |
| abstract_inverted_index.led | 7 |
| abstract_inverted_index.our | 95, 143 |
| abstract_inverted_index.the | 20, 62, 120, 123, 128, 137 |
| abstract_inverted_index.two | 91 |
| abstract_inverted_index.This | 54 |
| abstract_inverted_index.area | 12, 131 |
| abstract_inverted_index.have | 6 |
| abstract_inverted_index.pass | 43 |
| abstract_inverted_index.path | 28, 72, 101 |
| abstract_inverted_index.such | 47 |
| abstract_inverted_index.with | 98 |
| abstract_inverted_index.paper | 55 |
| abstract_inverted_index.robot | 71 |
| abstract_inverted_index.time. | 115 |
| abstract_inverted_index.using | 67 |
| abstract_inverted_index.(CCPP) | 30 |
| abstract_inverted_index.(GBNN) | 83 |
| abstract_inverted_index.Recent | 0 |
| abstract_inverted_index.double | 42 |
| abstract_inverted_index.future | 148 |
| abstract_inverted_index.mobile | 4 |
| abstract_inverted_index.neural | 81 |
| abstract_inverted_index.robots | 5, 50 |
| abstract_inverted_index.study, | 144 |
| abstract_inverted_index.tasks. | 14, 133 |
| abstract_inverted_index.Glasius | 79 |
| abstract_inverted_index.between | 90 |
| abstract_inverted_index.compare | 94 |
| abstract_inverted_index.details | 139 |
| abstract_inverted_index.discuss | 136 |
| abstract_inverted_index.network | 82 |
| abstract_inverted_index.persist | 17 |
| abstract_inverted_index.planner | 29 |
| abstract_inverted_index.problem | 66 |
| abstract_inverted_index.results | 118 |
| abstract_inverted_index.robots. | 92 |
| abstract_inverted_index.spilled | 52 |
| abstract_inverted_index.system, | 106 |
| abstract_inverted_index.through | 88 |
| abstract_inverted_index.However, | 15 |
| abstract_inverted_index.approach | 59 |
| abstract_inverted_index.cleaning | 49 |
| abstract_inverted_index.complete | 26, 64 |
| abstract_inverted_index.coverage | 13, 27, 65, 87, 132 |
| abstract_inverted_index.efficacy | 121 |
| abstract_inverted_index.insights | 146 |
| abstract_inverted_index.modified | 78 |
| abstract_inverted_index.planner. | 73 |
| abstract_inverted_index.planning | 102 |
| abstract_inverted_index.presents | 56 |
| abstract_inverted_index.progress | 10 |
| abstract_inverted_index.proposed | 96, 124 |
| abstract_inverted_index.research | 149 |
| abstract_inverted_index.solution | 75, 125 |
| abstract_inverted_index.specific | 45 |
| abstract_inverted_index.systems, | 34 |
| abstract_inverted_index.tackling | 61 |
| abstract_inverted_index.algorithm | 97, 111 |
| abstract_inverted_index.enhancing | 127 |
| abstract_inverted_index.leverages | 76 |
| abstract_inverted_index.providing | 145 |
| abstract_inverted_index.reduction | 109 |
| abstract_inverted_index.requiring | 38 |
| abstract_inverted_index.robotics. | 153 |
| abstract_inverted_index.scenarios | 37 |
| abstract_inverted_index.addressing | 51 |
| abstract_inverted_index.algorithms | 31 |
| abstract_inverted_index.autonomous | 3, 69, 152 |
| abstract_inverted_index.challenges | 16 |
| abstract_inverted_index.complexity | 24 |
| abstract_inverted_index.directions | 150 |
| abstract_inverted_index.efficiency | 21, 129 |
| abstract_inverted_index.facilitate | 85 |
| abstract_inverted_index.innovative | 58 |
| abstract_inverted_index.iterations | 112 |
| abstract_inverted_index.locations, | 46 |
| abstract_inverted_index.optimizing | 19 |
| abstract_inverted_index.revisiting | 39 |
| abstract_inverted_index.underscore | 119 |
| abstract_inverted_index.centralized | 105 |
| abstract_inverted_index.computation | 114 |
| abstract_inverted_index.double-pass | 63, 86 |
| abstract_inverted_index.limitations | 141 |
| abstract_inverted_index.multi-robot | 33, 100 |
| abstract_inverted_index.significant | 9 |
| abstract_inverted_index.traditional | 99 |
| abstract_inverted_index.Furthermore, | 134 |
| abstract_inverted_index.advancements | 1 |
| abstract_inverted_index.bio-inspired | 80 |
| abstract_inverted_index.consumables. | 53 |
| abstract_inverted_index.experimental | 117 |
| abstract_inverted_index.particularly | 35 |
| abstract_inverted_index.computational | 23 |
| abstract_inverted_index.demonstrating | 107 |
| abstract_inverted_index.implementation | 138 |
| abstract_inverted_index.inter-reconfigurable | 70 |
| abstract_inverted_index.inter-reconfiguration | 89 |
| cited_by_percentile_year.max | 94 |
| cited_by_percentile_year.min | 90 |
| corresponding_author_ids | https://openalex.org/A5073647327 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 6 |
| corresponding_institution_ids | https://openalex.org/I141445968 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/9 |
| sustainable_development_goals[0].score | 0.46000000834465027 |
| sustainable_development_goals[0].display_name | Industry, innovation and infrastructure |
| citation_normalized_percentile.value | 0.59866371 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |