{"id":"https://openalex.org/W4381660829","doi":"https://doi.org/10.3390/a16060307","title":"Multi-Objective PSO with Variable Number of Dimensions for Space Robot Path Optimization","display_name":"Multi-Objective PSO with Variable Number of Dimensions for Space Robot Path Optimization","publication_year":2023,"publication_date":"2023-06-20","ids":{"openalex":"https://openalex.org/W4381660829","doi":"https://doi.org/10.3390/a16060307"},"language":"en","primary_location":{"id":"doi:10.3390/a16060307","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16060307","pdf_url":"https://www.mdpi.com/1999-4893/16/6/307/pdf?version=1687401102","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/16/6/307/pdf?version=1687401102","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049686346","display_name":"Petr Kadlec","orcid":"https://orcid.org/0000-0002-0878-5442"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petr Kadlec","raw_affiliation_strings":["Lerch Laboratory of EM Research, Department of Radio Electronics, Faculty of Electrical Engineering and Communication, Brno University of Technology, Technick\u00e1 3082/12, 616 00 Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Lerch Laboratory of EM Research, Department of Radio Electronics, Faculty of Electrical Engineering and Communication, Brno University of Technology, Technick\u00e1 3082/12, 616 00 Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049686346"],"corresponding_institution_ids":["https://openalex.org/I60587646"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.3582,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58386406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"16","issue":"6","first_page":"307","last_page":"307"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.7125307321548462},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6924582123756409},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6318665146827698},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.596745491027832},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5440404415130615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5266882181167603},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48727262020111084},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4848831593990326},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4758574366569519},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4685830771923065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4319068491458893},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.42032143473625183},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41411539912223816},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21931087970733643},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.13536059856414795},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08260276913642883}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.7125307321548462},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6924582123756409},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6318665146827698},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.596745491027832},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5440404415130615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5266882181167603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48727262020111084},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4848831593990326},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4758574366569519},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4685830771923065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4319068491458893},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.42032143473625183},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41411539912223816},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21931087970733643},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.13536059856414795},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08260276913642883},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a16060307","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16060307","pdf_url":"https://www.mdpi.com/1999-4893/16/6/307/pdf?version=1687401102","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:dspace.vut.cz:11012/213599","is_oa":true,"landing_page_url":"http://hdl.handle.net/11012/213599","pdf_url":"https://dspace.vut.cz/bitstreams/f4475e31-5f47-4a4d-b3f2-e263ec435979/download","source":{"id":"https://openalex.org/S4306400317","display_name":"Brno University of Technology Digital Library (Brno University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I60587646","host_organization_name":"Brno University of Technology","host_organization_lineage":["https://openalex.org/I60587646"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:doaj.org/article:6b8f252e30dd471181c8b04e67b44e4d","is_oa":true,"landing_page_url":"https://doaj.org/article/6b8f252e30dd471181c8b04e67b44e4d","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 16, Iss 6, p 307 (2023)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/16/6/307/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a16060307","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 16; Issue 6; Pages: 307","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a16060307","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16060307","pdf_url":"https://www.mdpi.com/1999-4893/16/6/307/pdf?version=1687401102","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7300000190734863,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G1279846725","display_name":null,"funder_award_id":"FEKT-S-23-8191","funder_id":"https://openalex.org/F4320322748","funder_display_name":"Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Brn\u011b"}],"funders":[{"id":"https://openalex.org/F4320322748","display_name":"Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Brn\u011b","ror":"https://ror.org/03613d656"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4381660829.pdf"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W1488578987","https://openalex.org/W1544309315","https://openalex.org/W1595159159","https://openalex.org/W1846834309","https://openalex.org/W1969483458","https://openalex.org/W2032908535","https://openalex.org/W2033630480","https://openalex.org/W2042757155","https://openalex.org/W2050914643","https://openalex.org/W2052665504","https://openalex.org/W2096871036","https://openalex.org/W2098693123","https://openalex.org/W2100983440","https://openalex.org/W2126105956","https://openalex.org/W2150046657","https://openalex.org/W2155648630","https://openalex.org/W2241606427","https://openalex.org/W2588805994","https://openalex.org/W2607670677","https://openalex.org/W2729504296","https://openalex.org/W2890843359","https://openalex.org/W2891098510","https://openalex.org/W2899267989","https://openalex.org/W2951021318","https://openalex.org/W2963946985","https://openalex.org/W2982545951","https://openalex.org/W2998786991","https://openalex.org/W3013773102","https://openalex.org/W3027611935","https://openalex.org/W3109818790","https://openalex.org/W3112151658","https://openalex.org/W3123538634","https://openalex.org/W3139204283","https://openalex.org/W3168796526","https://openalex.org/W3181997525","https://openalex.org/W3198138968","https://openalex.org/W3204071497","https://openalex.org/W3217245168","https://openalex.org/W4313414609","https://openalex.org/W6629395819","https://openalex.org/W6658513590","https://openalex.org/W6682642761"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W2240526870","https://openalex.org/W3100156731","https://openalex.org/W2623016776","https://openalex.org/W1967962134","https://openalex.org/W3101047024","https://openalex.org/W3128311703","https://openalex.org/W131718761","https://openalex.org/W2387449920"],"abstract_inverted_index":{"This":[0,24],"paper":[1],"aims":[2],"to":[3,95],"solve":[4,96],"the":[5,27,50,101,118,122,127,133,147,156],"space":[6,102],"robot":[7,103],"pathfinding":[8,104,158],"problem,":[9],"formulated":[10,106],"as":[11,107,132],"a":[12,18,39,72,108],"multi-objective":[13],"(MO)":[14],"optimization":[15,41,54],"problem":[16,105,111],"with":[17,34,78,84,161],"variable":[19],"number":[20,134],"of":[21,31,74,100,121,135],"dimensions":[22],"(VND).":[23],"formulation":[25],"enables":[26],"search":[28],"and":[29,59,82,125,150],"comparison":[30],"potential":[32],"solutions":[33],"different":[35,79,98],"model":[36],"complexities":[37],"within":[38],"single":[40],"run.":[42],"A":[43],"novel":[44,66],"VND":[45,88,109,157,163],"MO":[46,89,110,164],"algorithm":[47,56,68],"based":[48],"on":[49,71,146,155],"well-known":[51],"particle":[52],"swarm":[53],"(PSO)":[55],"is":[57,69,93],"introduced":[58],"thoroughly":[60],"described":[61],"in":[62],"this":[63],"paper.":[64],"The":[65],"VNDMOPSO":[67,138],"validated":[70],"set":[73],"21":[75],"benchmark":[76,148],"problems":[77,149,159],"dimensionality":[80],"settings":[81],"compared":[83,160],"two":[85,113],"other":[86,162],"state-of-the-art":[87],"algorithms.":[90,165],"Then,":[91],"it":[92],"applied":[94],"five":[97],"instances":[99],"where":[112],"objectives":[114],"are":[115],"considered:":[116],"(1)":[117],"minimal":[119,128],"distance":[120],"selected":[123],"path,":[124],"(2)":[126],"energy":[129],"cost":[130],"(expressed":[131],"turning":[136],"points).":[137],"shows":[139],"at":[140],"least":[141],"comparable":[142],"or":[143],"better":[144,152],"convergence":[145,153],"significantly":[151],"properties":[154]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}