Enhanced Ant Colony Algorithm Based on Islands for Mobile Robot Path Planning Article Swipe
Qian Li
,
Qipeng Li
,
Baoling Cui
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.3390/app15137023
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.3390/app15137023
Path planning in complex environments presents a substantial research challenge for mobile robots. This study introduces an enhanced ant colony algorithm based on islands (EACI) for mobile robot path planning. First, the original map’s grid cells—which could potentially cause ants to become trapped in deadlocks—are transformed into obstacles. This process generates an auxiliary map, where a specified number of islands are evenly distributed between the starting and end grids. Second, an irregular pheromone initialization strategy is employed to enhance the information transmission between neighboring islands. Concurrently, the heuristic function is refined, and an adaptive evaporation coefficient is incorporated to facilitate dynamic adjustments in pheromone updates. These modifications effectively reduce the number of iterations required and decrease the incidence of deadlock among the ants. Third, the performance and advantages of the EACI are validated in various grid maps. Simulation results demonstrate that, compared to other optimization algorithms, the EACI method provides superior path solutions, achieves faster convergence, and reduces the number of lost ants. In 20 × 20, 30 × 30, 40 × 40, and 50 × 50 environments, the average numbers of iterations are 1, 1.4, 6.2, and 7.1, respectively, while the average numbers of lost ants are 9.85, 27.5, 47.6, and 99.2, respectively—demonstrating strong stability and adaptability. Finally, real-world experiments validate the algorithm’s effectiveness.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3390/app15137023
- https://www.mdpi.com/2076-3417/15/13/7023/pdf?version=1750671680
- OA Status
- gold
- References
- 43
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4411607173
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4411607173Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3390/app15137023Digital Object Identifier
- Title
-
Enhanced Ant Colony Algorithm Based on Islands for Mobile Robot Path PlanningWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-06-22Full publication date if available
- Authors
-
Qian Li, Qipeng Li, Baoling CuiList of authors in order
- Landing page
-
https://doi.org/10.3390/app15137023Publisher landing page
- PDF URL
-
https://www.mdpi.com/2076-3417/15/13/7023/pdf?version=1750671680Direct 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/2076-3417/15/13/7023/pdf?version=1750671680Direct OA link when available
- Concepts
-
Ant colony optimization algorithms, Computer science, Path (computing), Mobile robot, Artificial intelligence, Geography, Robot, Computer networkTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
43Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4411607173 |
|---|---|
| doi | https://doi.org/10.3390/app15137023 |
| ids.doi | https://doi.org/10.3390/app15137023 |
| ids.openalex | https://openalex.org/W4411607173 |
| fwci | 0.0 |
| type | article |
| title | Enhanced Ant Colony Algorithm Based on Islands for Mobile Robot Path Planning |
| biblio.issue | 13 |
| biblio.volume | 15 |
| biblio.last_page | 7023 |
| biblio.first_page | 7023 |
| topics[0].id | https://openalex.org/T10586 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1707 |
| topics[0].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[0].display_name | Robotic Path Planning Algorithms |
| topics[1].id | https://openalex.org/T12288 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9800000190734863 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Optimization and Search Problems |
| topics[2].id | https://openalex.org/T10191 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9797999858856201 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2202 |
| topics[2].subfield.display_name | Aerospace Engineering |
| topics[2].display_name | Robotics and Sensor-Based Localization |
| is_xpac | False |
| apc_list.value | 2300 |
| apc_list.currency | CHF |
| apc_list.value_usd | 2490 |
| apc_paid.value | 2300 |
| apc_paid.currency | CHF |
| apc_paid.value_usd | 2490 |
| concepts[0].id | https://openalex.org/C40128228 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6136890649795532 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q460851 |
| concepts[0].display_name | Ant colony optimization algorithms |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.5724074244499207 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C2777735758 |
| concepts[2].level | 2 |
| concepts[2].score | 0.46456801891326904 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q817765 |
| concepts[2].display_name | Path (computing) |
| concepts[3].id | https://openalex.org/C19966478 |
| concepts[3].level | 3 |
| concepts[3].score | 0.4285152554512024 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q4810574 |
| concepts[3].display_name | Mobile robot |
| concepts[4].id | https://openalex.org/C154945302 |
| concepts[4].level | 1 |
| concepts[4].score | 0.42543739080429077 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[4].display_name | Artificial intelligence |
| concepts[5].id | https://openalex.org/C205649164 |
| concepts[5].level | 0 |
| concepts[5].score | 0.3714095950126648 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1071 |
| concepts[5].display_name | Geography |
| concepts[6].id | https://openalex.org/C90509273 |
| concepts[6].level | 2 |
| concepts[6].score | 0.21887898445129395 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q11012 |
| concepts[6].display_name | Robot |
| concepts[7].id | https://openalex.org/C31258907 |
| concepts[7].level | 1 |
| concepts[7].score | 0.1139010488986969 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[7].display_name | Computer network |
| keywords[0].id | https://openalex.org/keywords/ant-colony-optimization-algorithms |
| keywords[0].score | 0.6136890649795532 |
| keywords[0].display_name | Ant colony optimization algorithms |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.5724074244499207 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/path |
| keywords[2].score | 0.46456801891326904 |
| keywords[2].display_name | Path (computing) |
| keywords[3].id | https://openalex.org/keywords/mobile-robot |
| keywords[3].score | 0.4285152554512024 |
| keywords[3].display_name | Mobile robot |
| keywords[4].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[4].score | 0.42543739080429077 |
| keywords[4].display_name | Artificial intelligence |
| keywords[5].id | https://openalex.org/keywords/geography |
| keywords[5].score | 0.3714095950126648 |
| keywords[5].display_name | Geography |
| keywords[6].id | https://openalex.org/keywords/robot |
| keywords[6].score | 0.21887898445129395 |
| keywords[6].display_name | Robot |
| keywords[7].id | https://openalex.org/keywords/computer-network |
| keywords[7].score | 0.1139010488986969 |
| keywords[7].display_name | Computer network |
| language | en |
| locations[0].id | doi:10.3390/app15137023 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210205812 |
| locations[0].source.issn | 2076-3417 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2076-3417 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Applied Sciences |
| 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/2076-3417/15/13/7023/pdf?version=1750671680 |
| 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 | Applied Sciences |
| locations[0].landing_page_url | https://doi.org/10.3390/app15137023 |
| locations[1].id | pmh:oai:doaj.org/article:9d8e30f1dc9c4f91be7cc8f24ea723d2 |
| 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 | Applied Sciences, Vol 15, Iss 13, p 7023 (2025) |
| locations[1].landing_page_url | https://doaj.org/article/9d8e30f1dc9c4f91be7cc8f24ea723d2 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5103274952 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-1020-0765 |
| authorships[0].author.display_name | Qian Li |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I168879160 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Mechanical & Energy Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China |
| authorships[0].affiliations[1].institution_ids | https://openalex.org/I1328775524 |
| authorships[0].affiliations[1].raw_affiliation_string | Zhejiang Key Laboratory of Multiflow and Fluid Machinery, Zhejiang Sci-Tech University, Hangzhou 310018, China |
| authorships[0].institutions[0].id | https://openalex.org/I1328775524 |
| authorships[0].institutions[0].ror | https://ror.org/03893we55 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I1328775524 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Zhejiang Sci-Tech University |
| authorships[0].institutions[1].id | https://openalex.org/I168879160 |
| authorships[0].institutions[1].ror | https://ror.org/05mx0wr29 |
| authorships[0].institutions[1].type | education |
| authorships[0].institutions[1].lineage | https://openalex.org/I168879160 |
| authorships[0].institutions[1].country_code | CN |
| authorships[0].institutions[1].display_name | Zhejiang University of Science and Technology |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Qian Li |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Mechanical & Energy Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China, Zhejiang Key Laboratory of Multiflow and Fluid Machinery, Zhejiang Sci-Tech University, Hangzhou 310018, China |
| authorships[1].author.id | https://openalex.org/A5080730492 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-8792-0592 |
| authorships[1].author.display_name | Qipeng Li |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I168879160 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Mechanical & Energy Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China |
| authorships[1].institutions[0].id | https://openalex.org/I168879160 |
| authorships[1].institutions[0].ror | https://ror.org/05mx0wr29 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I168879160 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Zhejiang University of Science and Technology |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Qipeng Li |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | School of Mechanical & Energy Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China |
| authorships[2].author.id | https://openalex.org/A5037208735 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-2418-6631 |
| authorships[2].author.display_name | Baoling Cui |
| authorships[2].countries | CN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I1328775524 |
| authorships[2].affiliations[0].raw_affiliation_string | Zhejiang Key Laboratory of Multiflow and Fluid Machinery, Zhejiang Sci-Tech University, Hangzhou 310018, China |
| authorships[2].institutions[0].id | https://openalex.org/I1328775524 |
| authorships[2].institutions[0].ror | https://ror.org/03893we55 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I1328775524 |
| authorships[2].institutions[0].country_code | CN |
| authorships[2].institutions[0].display_name | Zhejiang Sci-Tech University |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Baoling Cui |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Zhejiang Key Laboratory of Multiflow and Fluid Machinery, Zhejiang Sci-Tech University, Hangzhou 310018, China |
| 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/2076-3417/15/13/7023/pdf?version=1750671680 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Enhanced Ant Colony Algorithm Based on Islands for Mobile Robot Path Planning |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10586 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1707 |
| primary_topic.subfield.display_name | Computer Vision and Pattern Recognition |
| primary_topic.display_name | Robotic Path Planning Algorithms |
| related_works | https://openalex.org/W2748952813, https://openalex.org/W2727311809, https://openalex.org/W2182624400, https://openalex.org/W2767428579, https://openalex.org/W2365800168, https://openalex.org/W1992807692, https://openalex.org/W2078492738, https://openalex.org/W3014549013, https://openalex.org/W2366876790, https://openalex.org/W4285338599 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | doi:10.3390/app15137023 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210205812 |
| best_oa_location.source.issn | 2076-3417 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2076-3417 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Applied Sciences |
| 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/2076-3417/15/13/7023/pdf?version=1750671680 |
| 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 | Applied Sciences |
| best_oa_location.landing_page_url | https://doi.org/10.3390/app15137023 |
| primary_location.id | doi:10.3390/app15137023 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210205812 |
| primary_location.source.issn | 2076-3417 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2076-3417 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Applied Sciences |
| 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/2076-3417/15/13/7023/pdf?version=1750671680 |
| 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 | Applied Sciences |
| primary_location.landing_page_url | https://doi.org/10.3390/app15137023 |
| publication_date | 2025-06-22 |
| publication_year | 2025 |
| referenced_works | https://openalex.org/W2895647709, https://openalex.org/W2799726513, https://openalex.org/W3158550831, https://openalex.org/W3177136949, https://openalex.org/W3003498136, https://openalex.org/W3147150730, https://openalex.org/W3047012046, https://openalex.org/W2911283711, https://openalex.org/W4290717612, https://openalex.org/W2943779163, https://openalex.org/W2945963656, https://openalex.org/W3032655467, https://openalex.org/W4250863246, https://openalex.org/W2791860092, https://openalex.org/W2770649262, https://openalex.org/W2732762428, https://openalex.org/W3155070735, https://openalex.org/W4229082946, https://openalex.org/W2154929945, https://openalex.org/W2101956213, https://openalex.org/W4214551305, https://openalex.org/W4404733235, https://openalex.org/W6878737378, https://openalex.org/W4405997836, https://openalex.org/W4410895936, https://openalex.org/W4409916754, https://openalex.org/W4405133506, https://openalex.org/W2417637069, https://openalex.org/W2939018330, https://openalex.org/W2906415336, https://openalex.org/W2523202702, https://openalex.org/W2223727688, https://openalex.org/W3135798356, https://openalex.org/W2801126074, https://openalex.org/W2947741813, https://openalex.org/W2793579702, https://openalex.org/W3166267102, https://openalex.org/W4200570189, https://openalex.org/W2585225797, https://openalex.org/W4285303526, https://openalex.org/W4200100885, https://openalex.org/W4311757964, https://openalex.org/W4408952392 |
| referenced_works_count | 43 |
| abstract_inverted_index.a | 6, 55 |
| abstract_inverted_index.1, | 184 |
| abstract_inverted_index.20 | 164 |
| abstract_inverted_index.30 | 167 |
| abstract_inverted_index.40 | 170 |
| abstract_inverted_index.50 | 174, 176 |
| abstract_inverted_index.In | 163 |
| abstract_inverted_index.an | 16, 51, 70, 92 |
| abstract_inverted_index.in | 2, 43, 102, 133 |
| abstract_inverted_index.is | 75, 89, 96 |
| abstract_inverted_index.of | 58, 111, 118, 128, 160, 181, 194 |
| abstract_inverted_index.on | 22 |
| abstract_inverted_index.to | 40, 77, 98, 142 |
| abstract_inverted_index.× | 165, 168, 171, 175 |
| abstract_inverted_index.20, | 166 |
| abstract_inverted_index.30, | 169 |
| abstract_inverted_index.40, | 172 |
| abstract_inverted_index.and | 66, 91, 114, 126, 156, 173, 187, 201, 206 |
| abstract_inverted_index.ant | 18 |
| abstract_inverted_index.are | 60, 131, 183, 197 |
| abstract_inverted_index.end | 67 |
| abstract_inverted_index.for | 10, 25 |
| abstract_inverted_index.the | 31, 64, 79, 86, 109, 116, 121, 124, 129, 146, 158, 178, 191, 212 |
| abstract_inverted_index.1.4, | 185 |
| abstract_inverted_index.6.2, | 186 |
| abstract_inverted_index.7.1, | 188 |
| abstract_inverted_index.EACI | 130, 147 |
| abstract_inverted_index.Path | 0 |
| abstract_inverted_index.This | 13, 48 |
| abstract_inverted_index.ants | 39, 196 |
| abstract_inverted_index.grid | 34, 135 |
| abstract_inverted_index.into | 46 |
| abstract_inverted_index.lost | 161, 195 |
| abstract_inverted_index.map, | 53 |
| abstract_inverted_index.path | 28, 151 |
| abstract_inverted_index.27.5, | 199 |
| abstract_inverted_index.47.6, | 200 |
| abstract_inverted_index.9.85, | 198 |
| abstract_inverted_index.99.2, | 202 |
| abstract_inverted_index.These | 105 |
| abstract_inverted_index.among | 120 |
| abstract_inverted_index.ants. | 122, 162 |
| abstract_inverted_index.based | 21 |
| abstract_inverted_index.cause | 38 |
| abstract_inverted_index.could | 36 |
| abstract_inverted_index.maps. | 136 |
| abstract_inverted_index.other | 143 |
| abstract_inverted_index.robot | 27 |
| abstract_inverted_index.study | 14 |
| abstract_inverted_index.that, | 140 |
| abstract_inverted_index.where | 54 |
| abstract_inverted_index.while | 190 |
| abstract_inverted_index.(EACI) | 24 |
| abstract_inverted_index.First, | 30 |
| abstract_inverted_index.Third, | 123 |
| abstract_inverted_index.become | 41 |
| abstract_inverted_index.colony | 19 |
| abstract_inverted_index.evenly | 61 |
| abstract_inverted_index.faster | 154 |
| abstract_inverted_index.grids. | 68 |
| abstract_inverted_index.method | 148 |
| abstract_inverted_index.mobile | 11, 26 |
| abstract_inverted_index.number | 57, 110, 159 |
| abstract_inverted_index.reduce | 108 |
| abstract_inverted_index.strong | 204 |
| abstract_inverted_index.Second, | 69 |
| abstract_inverted_index.average | 179, 192 |
| abstract_inverted_index.between | 63, 82 |
| abstract_inverted_index.complex | 3 |
| abstract_inverted_index.dynamic | 100 |
| abstract_inverted_index.enhance | 78 |
| abstract_inverted_index.islands | 23, 59 |
| abstract_inverted_index.map’s | 33 |
| abstract_inverted_index.numbers | 180, 193 |
| abstract_inverted_index.process | 49 |
| abstract_inverted_index.reduces | 157 |
| abstract_inverted_index.results | 138 |
| abstract_inverted_index.robots. | 12 |
| abstract_inverted_index.trapped | 42 |
| abstract_inverted_index.various | 134 |
| abstract_inverted_index.Finally, | 208 |
| abstract_inverted_index.achieves | 153 |
| abstract_inverted_index.adaptive | 93 |
| abstract_inverted_index.compared | 141 |
| abstract_inverted_index.deadlock | 119 |
| abstract_inverted_index.decrease | 115 |
| abstract_inverted_index.employed | 76 |
| abstract_inverted_index.enhanced | 17 |
| abstract_inverted_index.function | 88 |
| abstract_inverted_index.islands. | 84 |
| abstract_inverted_index.original | 32 |
| abstract_inverted_index.planning | 1 |
| abstract_inverted_index.presents | 5 |
| abstract_inverted_index.provides | 149 |
| abstract_inverted_index.refined, | 90 |
| abstract_inverted_index.required | 113 |
| abstract_inverted_index.research | 8 |
| abstract_inverted_index.starting | 65 |
| abstract_inverted_index.strategy | 74 |
| abstract_inverted_index.superior | 150 |
| abstract_inverted_index.updates. | 104 |
| abstract_inverted_index.validate | 211 |
| abstract_inverted_index.algorithm | 20 |
| abstract_inverted_index.auxiliary | 52 |
| abstract_inverted_index.challenge | 9 |
| abstract_inverted_index.generates | 50 |
| abstract_inverted_index.heuristic | 87 |
| abstract_inverted_index.incidence | 117 |
| abstract_inverted_index.irregular | 71 |
| abstract_inverted_index.pheromone | 72, 103 |
| abstract_inverted_index.planning. | 29 |
| abstract_inverted_index.specified | 56 |
| abstract_inverted_index.stability | 205 |
| abstract_inverted_index.validated | 132 |
| abstract_inverted_index.Simulation | 137 |
| abstract_inverted_index.advantages | 127 |
| abstract_inverted_index.facilitate | 99 |
| abstract_inverted_index.introduces | 15 |
| abstract_inverted_index.iterations | 112, 182 |
| abstract_inverted_index.obstacles. | 47 |
| abstract_inverted_index.real-world | 209 |
| abstract_inverted_index.solutions, | 152 |
| abstract_inverted_index.adjustments | 101 |
| abstract_inverted_index.algorithms, | 145 |
| abstract_inverted_index.coefficient | 95 |
| abstract_inverted_index.demonstrate | 139 |
| abstract_inverted_index.distributed | 62 |
| abstract_inverted_index.effectively | 107 |
| abstract_inverted_index.evaporation | 94 |
| abstract_inverted_index.experiments | 210 |
| abstract_inverted_index.information | 80 |
| abstract_inverted_index.neighboring | 83 |
| abstract_inverted_index.performance | 125 |
| abstract_inverted_index.potentially | 37 |
| abstract_inverted_index.substantial | 7 |
| abstract_inverted_index.transformed | 45 |
| abstract_inverted_index.convergence, | 155 |
| abstract_inverted_index.environments | 4 |
| abstract_inverted_index.incorporated | 97 |
| abstract_inverted_index.optimization | 144 |
| abstract_inverted_index.transmission | 81 |
| abstract_inverted_index.Concurrently, | 85 |
| abstract_inverted_index.adaptability. | 207 |
| abstract_inverted_index.algorithm’s | 213 |
| abstract_inverted_index.cells—which | 35 |
| abstract_inverted_index.environments, | 177 |
| abstract_inverted_index.modifications | 106 |
| abstract_inverted_index.respectively, | 189 |
| abstract_inverted_index.effectiveness. | 214 |
| abstract_inverted_index.initialization | 73 |
| abstract_inverted_index.deadlocks—are | 44 |
| abstract_inverted_index.respectively—demonstrating | 203 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile.value | 0.24086076 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |