Optimal path planning for motion robots based on bees pollen optimization algorithm Article Swipe
Thi-Kien Dao
,
Jeng‐Shyang Pan
,
Tien-Szu Pan
,
Trong-The Nguyen
·
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1080/24751839.2017.1347765
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1080/24751839.2017.1347765
Due to interference phenomena among unnatural dimensions of the motion robots’ operations space, optimal path planning of them has to satisfy not just one criterion, but rather multi-objects. In this paper, we propose a novel multi-object approach for optimal mobile robot path planning, based on bees pollen optimizer (BPO). We consider two objects of distance and smooth path of the special plan for motion robots for constructing a minimization one. In operation environment for action robots, the location of the target and the obstacles are set up for the solution of BPO. The selected sequence of the mobile robot is a set of the chosen global best settlement in each iteration, which updates its archived data throughout the movement for motion robots in order. A series of simulations are executed in some environments for the best pathway once the robot reaches its goal. The results indicate that the proposed approach offered the robot path to its target without touching the obstacles, and the proposed method may be an alternative approach to optimize the motion robot path planning.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1080/24751839.2017.1347765
- https://www.tandfonline.com/doi/pdf/10.1080/24751839.2017.1347765?needAccess=true
- OA Status
- gold
- Cited By
- 18
- References
- 23
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2739852705
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2739852705Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1080/24751839.2017.1347765Digital Object Identifier
- Title
-
Optimal path planning for motion robots based on bees pollen optimization algorithmWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2017Year of publication
- Publication date
-
2017-07-27Full publication date if available
- Authors
-
Thi-Kien Dao, Jeng‐Shyang Pan, Tien-Szu Pan, Trong-The NguyenList of authors in order
- Landing page
-
https://doi.org/10.1080/24751839.2017.1347765Publisher landing page
- PDF URL
-
https://www.tandfonline.com/doi/pdf/10.1080/24751839.2017.1347765?needAccess=trueDirect 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.tandfonline.com/doi/pdf/10.1080/24751839.2017.1347765?needAccess=trueDirect OA link when available
- Concepts
-
Motion planning, Robot, Computer science, Mobile robot, Path (computing), Motion (physics), Artificial intelligence, Set (abstract data type), Computer vision, Algorithm, Mathematical optimization, Mathematics, Programming languageTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
18Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 5, 2024: 4, 2022: 1, 2021: 3, 2020: 1Per-year citation counts (last 5 years)
- References (count)
-
23Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2739852705 |
|---|---|
| doi | https://doi.org/10.1080/24751839.2017.1347765 |
| ids.doi | https://doi.org/10.1080/24751839.2017.1347765 |
| ids.mag | 2739852705 |
| ids.openalex | https://openalex.org/W2739852705 |
| fwci | 0.63555111 |
| type | article |
| title | Optimal path planning for motion robots based on bees pollen optimization algorithm |
| biblio.issue | 4 |
| biblio.volume | 1 |
| biblio.last_page | 366 |
| biblio.first_page | 351 |
| 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 | 1.0 |
| 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/T11615 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9994000196456909 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2207 |
| topics[1].subfield.display_name | Control and Systems Engineering |
| topics[1].display_name | Control and Dynamics of Mobile Robots |
| 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.9955999851226807 |
| 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 |
| funders[0].id | https://openalex.org/F4320325142 |
| funders[0].ror | https://ror.org/03c8fdb16 |
| funders[0].display_name | Fujian University of Technology |
| is_xpac | False |
| apc_list.value | 925 |
| apc_list.currency | GBP |
| apc_list.value_usd | 1134 |
| apc_paid.value | 925 |
| apc_paid.currency | GBP |
| apc_paid.value_usd | 1134 |
| concepts[0].id | https://openalex.org/C81074085 |
| concepts[0].level | 3 |
| concepts[0].score | 0.8157774209976196 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q366872 |
| concepts[0].display_name | Motion planning |
| concepts[1].id | https://openalex.org/C90509273 |
| concepts[1].level | 2 |
| concepts[1].score | 0.7462090849876404 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q11012 |
| concepts[1].display_name | Robot |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6397019624710083 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C19966478 |
| concepts[3].level | 3 |
| concepts[3].score | 0.621159017086029 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q4810574 |
| concepts[3].display_name | Mobile robot |
| concepts[4].id | https://openalex.org/C2777735758 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5836708545684814 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q817765 |
| concepts[4].display_name | Path (computing) |
| concepts[5].id | https://openalex.org/C104114177 |
| concepts[5].level | 2 |
| concepts[5].score | 0.48381346464157104 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q79782 |
| concepts[5].display_name | Motion (physics) |
| concepts[6].id | https://openalex.org/C154945302 |
| concepts[6].level | 1 |
| concepts[6].score | 0.4742409586906433 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[6].display_name | Artificial intelligence |
| concepts[7].id | https://openalex.org/C177264268 |
| concepts[7].level | 2 |
| concepts[7].score | 0.45758429169654846 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1514741 |
| concepts[7].display_name | Set (abstract data type) |
| concepts[8].id | https://openalex.org/C31972630 |
| concepts[8].level | 1 |
| concepts[8].score | 0.45602840185165405 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q844240 |
| concepts[8].display_name | Computer vision |
| concepts[9].id | https://openalex.org/C11413529 |
| concepts[9].level | 1 |
| concepts[9].score | 0.4113551676273346 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[9].display_name | Algorithm |
| concepts[10].id | https://openalex.org/C126255220 |
| concepts[10].level | 1 |
| concepts[10].score | 0.3749960958957672 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[10].display_name | Mathematical optimization |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.2409910261631012 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C199360897 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[12].display_name | Programming language |
| keywords[0].id | https://openalex.org/keywords/motion-planning |
| keywords[0].score | 0.8157774209976196 |
| keywords[0].display_name | Motion planning |
| keywords[1].id | https://openalex.org/keywords/robot |
| keywords[1].score | 0.7462090849876404 |
| keywords[1].display_name | Robot |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6397019624710083 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/mobile-robot |
| keywords[3].score | 0.621159017086029 |
| keywords[3].display_name | Mobile robot |
| keywords[4].id | https://openalex.org/keywords/path |
| keywords[4].score | 0.5836708545684814 |
| keywords[4].display_name | Path (computing) |
| keywords[5].id | https://openalex.org/keywords/motion |
| keywords[5].score | 0.48381346464157104 |
| keywords[5].display_name | Motion (physics) |
| keywords[6].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[6].score | 0.4742409586906433 |
| keywords[6].display_name | Artificial intelligence |
| keywords[7].id | https://openalex.org/keywords/set |
| keywords[7].score | 0.45758429169654846 |
| keywords[7].display_name | Set (abstract data type) |
| keywords[8].id | https://openalex.org/keywords/computer-vision |
| keywords[8].score | 0.45602840185165405 |
| keywords[8].display_name | Computer vision |
| keywords[9].id | https://openalex.org/keywords/algorithm |
| keywords[9].score | 0.4113551676273346 |
| keywords[9].display_name | Algorithm |
| keywords[10].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[10].score | 0.3749960958957672 |
| keywords[10].display_name | Mathematical optimization |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.2409910261631012 |
| keywords[11].display_name | Mathematics |
| language | en |
| locations[0].id | doi:10.1080/24751839.2017.1347765 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210226961 |
| locations[0].source.issn | 2475-1839, 2475-1847 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2475-1839 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Journal of Information and Telecommunication |
| locations[0].source.host_organization | https://openalex.org/P4310320547 |
| locations[0].source.host_organization_name | Taylor & Francis |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310320547 |
| locations[0].source.host_organization_lineage_names | Taylor & Francis |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.tandfonline.com/doi/pdf/10.1080/24751839.2017.1347765?needAccess=true |
| 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 | Journal of Information and Telecommunication |
| locations[0].landing_page_url | https://doi.org/10.1080/24751839.2017.1347765 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5081325977 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-2805-652X |
| authorships[0].author.display_name | Thi-Kien Dao |
| authorships[0].countries | TW |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I89178830 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Electronics Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan |
| authorships[0].institutions[0].id | https://openalex.org/I89178830 |
| authorships[0].institutions[0].ror | https://ror.org/04wydzr61 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I89178830 |
| authorships[0].institutions[0].country_code | TW |
| authorships[0].institutions[0].display_name | National Kaohsiung University of Applied Sciences |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Thi-Kien Dao |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of Electronics Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan |
| authorships[1].author.id | https://openalex.org/A5019810689 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-3128-9025 |
| authorships[1].author.display_name | Jeng‐Shyang Pan |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I83791580 |
| authorships[1].affiliations[0].raw_affiliation_string | Fujian Provincial Key Lab of Big Data Mining and Applications, Fujian University of Technology, Fuzhou, People’s Republic of China |
| authorships[1].institutions[0].id | https://openalex.org/I83791580 |
| authorships[1].institutions[0].ror | https://ror.org/03c8fdb16 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I83791580 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Fujian University of Technology |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Jeng-Shyang Pan |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Fujian Provincial Key Lab of Big Data Mining and Applications, Fujian University of Technology, Fuzhou, People’s Republic of China |
| authorships[2].author.id | https://openalex.org/A5100783703 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-6610-7527 |
| authorships[2].author.display_name | Tien-Szu Pan |
| authorships[2].countries | TW |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I89178830 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Electronics Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan |
| authorships[2].institutions[0].id | https://openalex.org/I89178830 |
| authorships[2].institutions[0].ror | https://ror.org/04wydzr61 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I89178830 |
| authorships[2].institutions[0].country_code | TW |
| authorships[2].institutions[0].display_name | National Kaohsiung University of Applied Sciences |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Tien-Szu Pan |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Department of Electronics Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan |
| authorships[3].author.id | https://openalex.org/A5026845891 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-6963-2626 |
| authorships[3].author.display_name | Trong-The Nguyen |
| authorships[3].countries | VN |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I3132161128 |
| authorships[3].affiliations[0].raw_affiliation_string | Department of Information Technology, Hai Phong Private University, Hai Phong, Vietnam |
| authorships[3].institutions[0].id | https://openalex.org/I3132161128 |
| authorships[3].institutions[0].ror | https://ror.org/0227kwk61 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I3132161128 |
| authorships[3].institutions[0].country_code | VN |
| authorships[3].institutions[0].display_name | Hai Phong University |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Trong-The Nguyen |
| authorships[3].is_corresponding | True |
| authorships[3].raw_affiliation_strings | Department of Information Technology, Hai Phong Private University, Hai Phong, Vietnam |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.tandfonline.com/doi/pdf/10.1080/24751839.2017.1347765?needAccess=true |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Optimal path planning for motion robots based on bees pollen optimization algorithm |
| 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 | 1.0 |
| 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/W2122871747, https://openalex.org/W1904098742, https://openalex.org/W3158921809, https://openalex.org/W1980828932, https://openalex.org/W3114279067, https://openalex.org/W2161428574, https://openalex.org/W2618632915, https://openalex.org/W2077416514, https://openalex.org/W2170661558, https://openalex.org/W2359600231 |
| cited_by_count | 18 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 5 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 4 |
| counts_by_year[2].year | 2022 |
| counts_by_year[2].cited_by_count | 1 |
| counts_by_year[3].year | 2021 |
| counts_by_year[3].cited_by_count | 3 |
| counts_by_year[4].year | 2020 |
| counts_by_year[4].cited_by_count | 1 |
| counts_by_year[5].year | 2019 |
| counts_by_year[5].cited_by_count | 3 |
| counts_by_year[6].year | 2018 |
| counts_by_year[6].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1080/24751839.2017.1347765 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210226961 |
| best_oa_location.source.issn | 2475-1839, 2475-1847 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2475-1839 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Journal of Information and Telecommunication |
| best_oa_location.source.host_organization | https://openalex.org/P4310320547 |
| best_oa_location.source.host_organization_name | Taylor & Francis |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310320547 |
| best_oa_location.source.host_organization_lineage_names | Taylor & Francis |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.tandfonline.com/doi/pdf/10.1080/24751839.2017.1347765?needAccess=true |
| 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 | Journal of Information and Telecommunication |
| best_oa_location.landing_page_url | https://doi.org/10.1080/24751839.2017.1347765 |
| primary_location.id | doi:10.1080/24751839.2017.1347765 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210226961 |
| primary_location.source.issn | 2475-1839, 2475-1847 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2475-1839 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Journal of Information and Telecommunication |
| primary_location.source.host_organization | https://openalex.org/P4310320547 |
| primary_location.source.host_organization_name | Taylor & Francis |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310320547 |
| primary_location.source.host_organization_lineage_names | Taylor & Francis |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.tandfonline.com/doi/pdf/10.1080/24751839.2017.1347765?needAccess=true |
| 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 | Journal of Information and Telecommunication |
| primary_location.landing_page_url | https://doi.org/10.1080/24751839.2017.1347765 |
| publication_date | 2017-07-27 |
| publication_year | 2017 |
| referenced_works | https://openalex.org/W2090582776, https://openalex.org/W1849822259, https://openalex.org/W2032325911, https://openalex.org/W1905847227, https://openalex.org/W2114652055, https://openalex.org/W2461422638, https://openalex.org/W2023629075, https://openalex.org/W2124058244, https://openalex.org/W2125569607, https://openalex.org/W2127988032, https://openalex.org/W2115200209, https://openalex.org/W1985246539, https://openalex.org/W1994219680, https://openalex.org/W2047094503, https://openalex.org/W1606402766, https://openalex.org/W1997600725, https://openalex.org/W2132181343, https://openalex.org/W2144012216, https://openalex.org/W3100933494, https://openalex.org/W1509235676, https://openalex.org/W3046497628, https://openalex.org/W2287814884, https://openalex.org/W1484387568 |
| referenced_works_count | 23 |
| abstract_inverted_index.A | 124 |
| abstract_inverted_index.a | 33, 67, 100 |
| abstract_inverted_index.In | 28, 70 |
| abstract_inverted_index.We | 49 |
| abstract_inverted_index.an | 167 |
| abstract_inverted_index.be | 166 |
| abstract_inverted_index.in | 108, 122, 130 |
| abstract_inverted_index.is | 99 |
| abstract_inverted_index.of | 7, 16, 53, 58, 78, 90, 95, 102, 126 |
| abstract_inverted_index.on | 44 |
| abstract_inverted_index.to | 1, 19, 154, 170 |
| abstract_inverted_index.up | 86 |
| abstract_inverted_index.we | 31 |
| abstract_inverted_index.Due | 0 |
| abstract_inverted_index.The | 92, 143 |
| abstract_inverted_index.and | 55, 81, 161 |
| abstract_inverted_index.are | 84, 128 |
| abstract_inverted_index.but | 25 |
| abstract_inverted_index.for | 37, 62, 65, 73, 87, 119, 133 |
| abstract_inverted_index.has | 18 |
| abstract_inverted_index.its | 113, 141, 155 |
| abstract_inverted_index.may | 165 |
| abstract_inverted_index.not | 21 |
| abstract_inverted_index.one | 23 |
| abstract_inverted_index.set | 85, 101 |
| abstract_inverted_index.the | 8, 59, 76, 79, 82, 88, 96, 103, 117, 134, 138, 147, 151, 159, 162, 172 |
| abstract_inverted_index.two | 51 |
| abstract_inverted_index.BPO. | 91 |
| abstract_inverted_index.bees | 45 |
| abstract_inverted_index.best | 106, 135 |
| abstract_inverted_index.data | 115 |
| abstract_inverted_index.each | 109 |
| abstract_inverted_index.just | 22 |
| abstract_inverted_index.once | 137 |
| abstract_inverted_index.one. | 69 |
| abstract_inverted_index.path | 14, 41, 57, 153, 175 |
| abstract_inverted_index.plan | 61 |
| abstract_inverted_index.some | 131 |
| abstract_inverted_index.that | 146 |
| abstract_inverted_index.them | 17 |
| abstract_inverted_index.this | 29 |
| abstract_inverted_index.among | 4 |
| abstract_inverted_index.based | 43 |
| abstract_inverted_index.goal. | 142 |
| abstract_inverted_index.novel | 34 |
| abstract_inverted_index.robot | 40, 98, 139, 152, 174 |
| abstract_inverted_index.which | 111 |
| abstract_inverted_index.(BPO). | 48 |
| abstract_inverted_index.action | 74 |
| abstract_inverted_index.chosen | 104 |
| abstract_inverted_index.global | 105 |
| abstract_inverted_index.method | 164 |
| abstract_inverted_index.mobile | 39, 97 |
| abstract_inverted_index.motion | 9, 63, 120, 173 |
| abstract_inverted_index.order. | 123 |
| abstract_inverted_index.paper, | 30 |
| abstract_inverted_index.pollen | 46 |
| abstract_inverted_index.rather | 26 |
| abstract_inverted_index.robots | 64, 121 |
| abstract_inverted_index.series | 125 |
| abstract_inverted_index.smooth | 56 |
| abstract_inverted_index.space, | 12 |
| abstract_inverted_index.target | 80, 156 |
| abstract_inverted_index.objects | 52 |
| abstract_inverted_index.offered | 150 |
| abstract_inverted_index.optimal | 13, 38 |
| abstract_inverted_index.pathway | 136 |
| abstract_inverted_index.propose | 32 |
| abstract_inverted_index.reaches | 140 |
| abstract_inverted_index.results | 144 |
| abstract_inverted_index.robots, | 75 |
| abstract_inverted_index.satisfy | 20 |
| abstract_inverted_index.special | 60 |
| abstract_inverted_index.updates | 112 |
| abstract_inverted_index.without | 157 |
| abstract_inverted_index.approach | 36, 149, 169 |
| abstract_inverted_index.archived | 114 |
| abstract_inverted_index.consider | 50 |
| abstract_inverted_index.distance | 54 |
| abstract_inverted_index.executed | 129 |
| abstract_inverted_index.indicate | 145 |
| abstract_inverted_index.location | 77 |
| abstract_inverted_index.movement | 118 |
| abstract_inverted_index.optimize | 171 |
| abstract_inverted_index.planning | 15 |
| abstract_inverted_index.proposed | 148, 163 |
| abstract_inverted_index.selected | 93 |
| abstract_inverted_index.sequence | 94 |
| abstract_inverted_index.solution | 89 |
| abstract_inverted_index.touching | 158 |
| abstract_inverted_index.obstacles | 83 |
| abstract_inverted_index.operation | 71 |
| abstract_inverted_index.optimizer | 47 |
| abstract_inverted_index.phenomena | 3 |
| abstract_inverted_index.planning, | 42 |
| abstract_inverted_index.planning. | 176 |
| abstract_inverted_index.robots’ | 10 |
| abstract_inverted_index.unnatural | 5 |
| abstract_inverted_index.criterion, | 24 |
| abstract_inverted_index.dimensions | 6 |
| abstract_inverted_index.iteration, | 110 |
| abstract_inverted_index.obstacles, | 160 |
| abstract_inverted_index.operations | 11 |
| abstract_inverted_index.settlement | 107 |
| abstract_inverted_index.throughout | 116 |
| abstract_inverted_index.alternative | 168 |
| abstract_inverted_index.environment | 72 |
| abstract_inverted_index.simulations | 127 |
| abstract_inverted_index.constructing | 66 |
| abstract_inverted_index.environments | 132 |
| abstract_inverted_index.interference | 2 |
| abstract_inverted_index.minimization | 68 |
| abstract_inverted_index.multi-object | 35 |
| abstract_inverted_index.multi-objects. | 27 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 89 |
| corresponding_author_ids | https://openalex.org/A5026845891 |
| countries_distinct_count | 3 |
| institutions_distinct_count | 4 |
| corresponding_institution_ids | https://openalex.org/I3132161128 |
| citation_normalized_percentile.value | 0.7291639 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |