{"id":"https://openalex.org/W4402435281","doi":"https://doi.org/10.1109/access.2024.3457957","title":"Robot Path Planning Based on Generative Learning Particle Swarm Optimization","display_name":"Robot Path Planning Based on Generative Learning Particle Swarm Optimization","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4402435281","doi":"https://doi.org/10.1109/access.2024.3457957"},"language":"en","primary_location":{"id":"doi:10.1109/access.2024.3457957","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3457957","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2024.3457957","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lu Wang","orcid":"https://orcid.org/0009-0005-3362-8472"},"institutions":[{"id":"https://openalex.org/I132586189","display_name":"Zhongyuan University of Technology","ror":"https://ror.org/0360zcg91","country_code":"CN","type":"education","lineage":["https://openalex.org/I132586189"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lu Wang","raw_affiliation_strings":["Department of Computer Science, Zhongyuan University of Technology, Zhengzhou, China"],"raw_orcid":"https://orcid.org/0009-0005-3362-8472","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Zhongyuan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I132586189"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049533204","display_name":"L. Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I132586189","display_name":"Zhongyuan University of Technology","ror":"https://ror.org/0360zcg91","country_code":"CN","type":"education","lineage":["https://openalex.org/I132586189"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lulu Liu","raw_affiliation_strings":["Department of Computer Science, Zhongyuan University of Technology, Zhengzhou, China"],"raw_orcid":"https://orcid.org/0009-0000-4737-0816","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Zhongyuan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I132586189"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100815238","display_name":"Xiaoxia Lu","orcid":null},"institutions":[{"id":"https://openalex.org/I132586189","display_name":"Zhongyuan University of Technology","ror":"https://ror.org/0360zcg91","country_code":"CN","type":"education","lineage":["https://openalex.org/I132586189"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoxia Lu","raw_affiliation_strings":["Department of Computer Science, Zhongyuan University of Technology, Zhengzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Zhongyuan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I132586189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I132586189"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":2.1464,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.88708278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"12","issue":null,"first_page":"130063","last_page":"130072"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9948999881744385,"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.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7107884883880615},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6718930602073669},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6296133995056152},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.508394181728363},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47077319025993347},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.46641409397125244},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.44190162420272827},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.4350321888923645},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4175122082233429},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.37986353039741516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1242091953754425}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7107884883880615},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6718930602073669},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6296133995056152},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.508394181728363},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47077319025993347},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.46641409397125244},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.44190162420272827},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.4350321888923645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4175122082233429},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.37986353039741516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1242091953754425},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2024.3457957","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3457957","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:74d164c944c54f45b0eca72cc9293e30","is_oa":true,"landing_page_url":"https://doaj.org/article/74d164c944c54f45b0eca72cc9293e30","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 12, Pp 130063-130072 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2024.3457957","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3457957","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6066515717","display_name":null,"funder_award_id":"23A520022","funder_id":"https://openalex.org/F4320329543","funder_display_name":"Zhongyuan University of Technology"}],"funders":[{"id":"https://openalex.org/F4320329543","display_name":"Zhongyuan University of Technology","ror":"https://ror.org/0360zcg91"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W1657705490","https://openalex.org/W1969483458","https://openalex.org/W1980767372","https://openalex.org/W2109364787","https://openalex.org/W2117211893","https://openalex.org/W2117595234","https://openalex.org/W2124058244","https://openalex.org/W2128990851","https://openalex.org/W2136349505","https://openalex.org/W2152195021","https://openalex.org/W2177274602","https://openalex.org/W2373559259","https://openalex.org/W2753014192","https://openalex.org/W2770649262","https://openalex.org/W2781786131","https://openalex.org/W2942307437","https://openalex.org/W2954066513","https://openalex.org/W3092927864","https://openalex.org/W3094704314","https://openalex.org/W3123478987","https://openalex.org/W3123538634","https://openalex.org/W3126728486","https://openalex.org/W3128607711","https://openalex.org/W3134992866","https://openalex.org/W3151306683","https://openalex.org/W3160013055","https://openalex.org/W3183334199","https://openalex.org/W3199732739","https://openalex.org/W3208245500","https://openalex.org/W3208956781","https://openalex.org/W3209869755","https://openalex.org/W4200335470","https://openalex.org/W4224300633","https://openalex.org/W4360951493"],"related_works":["https://openalex.org/W2006324351","https://openalex.org/W2965421953","https://openalex.org/W2349895019","https://openalex.org/W2116074880","https://openalex.org/W2950423922","https://openalex.org/W2121780490","https://openalex.org/W2137136732","https://openalex.org/W1904098742","https://openalex.org/W2132113279","https://openalex.org/W2368795850"],"abstract_inverted_index":{"Path":[0],"planning":[1,42,105,225],"refers":[2],"to":[3,12,66,73,136,152,159,162],"finding":[4],"the":[5,9,13,23,59,62,70,98,108,111,116,122,132,139,145,150,181,184,195,206,211,215],"optimal":[6,124],"path":[7,34,41,104,126,228],"from":[8],"starting":[10],"point":[11],"endpoint":[14],"in":[15,29,33,115,138,171],"a":[16,39,54,75,187,219],"given":[17],"environment,":[18,214],"avoiding":[19],"obstacles.":[20],"To":[21,179],"solve":[22],"problem":[24],"of":[25,88,141,183,189],"slow":[26],"convergence":[27,221],"speed":[28,222],"particle":[30,89,125,128],"swarm":[31,129],"optimization":[32],"planning,":[35],"this":[36,166],"paper":[37],"proposes":[38],"robot":[40,151],"based":[43],"on":[44],"generative":[45,55],"learning":[46],"Particle":[47],"Swarm":[48],"Optimization":[49],"(LPSO).":[50],"This":[51,81],"algorithm":[52,200,217],"constructs":[53],"double-adversarial":[56],"network.":[57],"In":[58,107,157],"first":[60,117],"stage,":[61,110],"generator":[63],"was":[64],"used":[65,84,120],"analyze":[67],"and":[68,101,131,202,205,223,227],"process":[69],"initial":[71],"map":[72,213],"obtain":[74],"foreground":[76,112],"area":[77,82],"with":[78,194],"feasible":[79],"paths.":[80],"is":[83,119],"for":[85,95,127],"heuristic":[86],"search":[87],"swarms,":[90],"reducing":[91],"unnecessary":[92],"exploration":[93],"areas":[94],"particles":[96,133],"throughout":[97],"state":[99],"space,":[100],"quickly":[102],"achieving":[103],"goals.":[106],"second":[109],"region":[113],"obtained":[114],"stage":[118],"as":[121],"global":[123],"optimization,":[130],"are":[134,192],"guided":[135],"move":[137],"direction":[140],"high-density":[142],"pheromones.":[143],"Finally,":[144],"obstacle":[146],"avoidance":[147],"strategy":[148],"enables":[149],"avoid":[153],"moving":[154],"obstacles":[155],"safely.":[156],"addition":[158],"being":[160],"adapted":[161],"simple":[163],"raster":[164],"maps,":[165,174],"method":[167],"also":[168],"performs":[169],"well":[170],"actual":[172],"environment":[173],"showing":[175],"superior":[176],"generalization":[177],"ability.":[178],"verify":[180],"effectiveness":[182],"proposed":[185],"algorithm,":[186],"series":[188],"simulation":[190],"experiments":[191],"compared":[193],"traditional":[196],"PSO,":[197],"ant":[198],"colony":[199],"(ACO),":[201],"improved":[203],"algorithms,":[204],"results":[207],"show":[208],"that":[209],"under":[210],"same":[212],"LPSO":[216],"has":[218],"faster":[220],"shorter":[224],"time":[226],"length.":[229]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":8}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}