{"id":"https://openalex.org/W4225290373","doi":"https://doi.org/10.1145/3523111.3523130","title":"Research on Path Planning Method of Mobile Robot Based on Improved Spider Swarm Algorithm","display_name":"Research on Path Planning Method of Mobile Robot Based on Improved Spider Swarm Algorithm","publication_year":2022,"publication_date":"2022-02-18","ids":{"openalex":"https://openalex.org/W4225290373","doi":"https://doi.org/10.1145/3523111.3523130"},"language":"en","primary_location":{"id":"doi:10.1145/3523111.3523130","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3523111.3523130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 the 5th International Conference on Machine Vision and Applications (ICMVA)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chen Yanhua","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121573","display_name":"Wuchang University of Technology","ror":"https://ror.org/02mqsna37","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210121573"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chen Yanhua","raw_affiliation_strings":["School of Artificial Intelligence, Wuchang University of Technology, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence, Wuchang University of Technology, China","institution_ids":["https://openalex.org/I4210121573"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040830419","display_name":"Fenggang Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121573","display_name":"Wuchang University of Technology","ror":"https://ror.org/02mqsna37","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210121573"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liu Fenggang","raw_affiliation_strings":["School of Artificial Intelligence, Wuchang University of Technology, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence, Wuchang University of Technology, China","institution_ids":["https://openalex.org/I4210121573"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022100124","display_name":"Yang Bei","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121573","display_name":"Wuchang University of Technology","ror":"https://ror.org/02mqsna37","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210121573"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yang Bei","raw_affiliation_strings":["School of Artificial Intelligence, Wuchang University of Technology, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence, Wuchang University of Technology, China","institution_ids":["https://openalex.org/I4210121573"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210121573"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"123","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9602000117301941,"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.9602000117301941,"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/motion-planning","display_name":"Motion planning","score":0.7960516214370728},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6450721025466919},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6070829629898071},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5941879749298096},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5886238217353821},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5482282638549805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5372583270072937},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5179797410964966},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.48153048753738403},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.46660611033439636},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.4500555992126465},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.42188626527786255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36386388540267944},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29221606254577637},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.20463961362838745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1923786997795105},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1204100251197815}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7960516214370728},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6450721025466919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6070829629898071},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5941879749298096},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5886238217353821},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5482282638549805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5372583270072937},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5179797410964966},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.48153048753738403},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.46660611033439636},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.4500555992126465},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.42188626527786255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36386388540267944},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29221606254577637},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.20463961362838745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1923786997795105},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1204100251197815},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3523111.3523130","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3523111.3523130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 the 5th International Conference on Machine Vision and Applications (ICMVA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1542929215","https://openalex.org/W4229630319"],"related_works":["https://openalex.org/W4288714711","https://openalex.org/W3200708550","https://openalex.org/W2736680465","https://openalex.org/W2771637876","https://openalex.org/W4294093918","https://openalex.org/W4240853094","https://openalex.org/W2810496283","https://openalex.org/W2170656329","https://openalex.org/W3131977017","https://openalex.org/W2133833450"],"abstract_inverted_index":{"Path":[0],"planning":[1,33,99],"is":[2],"one":[3],"of":[4,8,57,79,100,116],"the":[5,18,22,25,54,77,84,90,97,114,129],"important":[6],"fields":[7],"mobile":[9,101],"robot":[10,23],"research.":[11],"Its":[12],"advantages":[13],"and":[14,24,44,71,81,107,124,133],"disadvantages":[15],"directly":[16],"affect":[17],"interaction":[19],"ability":[20],"between":[21],"surrounding":[26],"environment.":[27],"The":[28],"commonly":[29],"used":[30],"global":[31],"path":[32,98,117,132,135],"methods":[34],"are":[35,136],"prone":[36],"to":[37,63],"problems":[38],"such":[39],"as":[40],"decision-making":[41],"speed":[42],"decline":[43],"deadlock":[45],"when":[46],"expanding":[47],"space.":[48],"During":[49],"iterative":[50],"optimization,":[51],"we":[52],"simulate":[53],"motion":[55],"law":[56],"spider":[58,92,121],"population,":[59],"that":[60,89],"is,":[61],"according":[62],"female":[64],"Male":[65],"spiders":[66],"cooperate,":[67],"attract":[68],"each":[69,74],"other":[70,75],"interact":[72],"with":[73,120],"in":[76,113],"process":[78,115],"marriage,":[80],"finally":[82],"get":[83],"optimal":[85],"solution.":[86],"Experiments":[87],"show":[88],"improved":[91],"colony":[93,122],"algorithm":[94,123],"can":[95],"realize":[96],"robot,":[102],"improve":[103],"its":[104],"search":[105],"ability,":[106],"avoid":[108],"falling":[109],"into":[110],"local":[111],"optimization":[112,127],"planning.":[118],"Compared":[119],"particle":[125],"swarm":[126],"algorithm,":[128],"optimized":[130],"shortest":[131],"actual":[134],"better.":[137]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}