{"id":"https://openalex.org/W3135546114","doi":"https://doi.org/10.1145/3439133.3439145","title":"Robot Path Planning Algorithm Based on Particle Swarm Optimization and Feedforward Neural Network in Network Environment","display_name":"Robot Path Planning Algorithm Based on Particle Swarm Optimization and Feedforward Neural Network in Network Environment","publication_year":2020,"publication_date":"2020-10-23","ids":{"openalex":"https://openalex.org/W3135546114","doi":"https://doi.org/10.1145/3439133.3439145","mag":"3135546114"},"language":"en","primary_location":{"id":"doi:10.1145/3439133.3439145","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3439133.3439145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 4th International Conference on Artificial Intelligence and Virtual Reality","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":"https://openalex.org/A5070710188","display_name":"Shiwei Li","orcid":"https://orcid.org/0000-0003-0712-0059"},"institutions":[{"id":"https://openalex.org/I55022517","display_name":"Heilongjiang University","ror":"https://ror.org/04zyhq975","country_code":"CN","type":"education","lineage":["https://openalex.org/I55022517"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"ShiWei Li","raw_affiliation_strings":["Heilongjiang University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heilongjiang University, China","institution_ids":["https://openalex.org/I55022517"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070710188"],"corresponding_institution_ids":["https://openalex.org/I55022517"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"66","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T13382","display_name":"Robotics and Automated Systems","score":0.9771999716758728,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8298391699790955},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6885970830917358},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6372792720794678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6362074613571167},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5855993032455444},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5439770221710205},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5245875716209412},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5067256093025208},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45525798201560974},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4335376024246216},{"id":"https://openalex.org/keywords/mobile-robot-navigation","display_name":"Mobile robot navigation","score":0.43039003014564514},{"id":"https://openalex.org/keywords/start-point","display_name":"Start point","score":0.412087619304657},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38368213176727295},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3548215925693512},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3281414210796356},{"id":"https://openalex.org/keywords/robot-control","display_name":"Robot control","score":0.30015408992767334},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2884833514690399},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10486894845962524}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8298391699790955},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6885970830917358},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6372792720794678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6362074613571167},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5855993032455444},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5439770221710205},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5245875716209412},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5067256093025208},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45525798201560974},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4335376024246216},{"id":"https://openalex.org/C26990112","wikidata":"https://www.wikidata.org/wiki/Q6887224","display_name":"Mobile robot navigation","level":5,"score":0.43039003014564514},{"id":"https://openalex.org/C2779859299","wikidata":"https://www.wikidata.org/wiki/Q7602527","display_name":"Start point","level":3,"score":0.412087619304657},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38368213176727295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3548215925693512},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3281414210796356},{"id":"https://openalex.org/C65401140","wikidata":"https://www.wikidata.org/wiki/Q7353385","display_name":"Robot control","level":4,"score":0.30015408992767334},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2884833514690399},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10486894845962524},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C2987804222","wikidata":"https://www.wikidata.org/wiki/Q5376582","display_name":"End point","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3439133.3439145","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3439133.3439145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 4th International Conference on Artificial Intelligence and Virtual Reality","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1991976017","https://openalex.org/W1999482631","https://openalex.org/W2008719012","https://openalex.org/W2058626008","https://openalex.org/W2099054986","https://openalex.org/W2120769101","https://openalex.org/W2143712427","https://openalex.org/W2963261262"],"related_works":["https://openalex.org/W1931898074","https://openalex.org/W2920827855","https://openalex.org/W2132660247","https://openalex.org/W3194634940","https://openalex.org/W3119736302","https://openalex.org/W1986528036","https://openalex.org/W2122735287","https://openalex.org/W2493438666","https://openalex.org/W2124341319","https://openalex.org/W2239658598"],"abstract_inverted_index":{"The":[0,101],"main":[1],"task":[2],"of":[3,57,86,118,215,221],"mobile":[4,15,87,222],"robot":[5,16,74,216],"path":[6,43,61,83,104,113,129,157,180,219],"planning":[7,84,105,114,130,158,181,220],"is:":[8],"according":[9,96],"to":[10,40,67,75,97,208,212],"the":[11,14,27,31,35,45,55,59,63,68,73,77,82,116,126,128,134,186],"environment":[12,135],"model,":[13],"is":[17,103,155,204],"based":[18,106,132,160],"on":[19,107,133,161],"one":[20],"or":[21],"some":[22],"optimization":[23],"criteria:":[24],"such":[25,143,192],"as":[26,144,193],"minimum":[28],"work":[29],"cost,":[30],"shortest":[32,36],"walking":[33,37],"route,":[34],"time,":[38],"etc.,":[39],"find":[41],"a":[42],"in":[44],"motion":[46],"space":[47],"that":[48,202],"does":[49],"not":[50,138],"occur":[51],"with":[52],"obstacles.":[53],"Under":[54],"premise":[56],"collision,":[58],"collision-free":[60],"from":[62],"starting":[64],"coordinate":[65,70],"point":[66,71],"target":[69,197],"allows":[72],"reach":[76],"destination":[78],"safely.":[79],"At":[80],"present,":[81],"methods":[85,142,165],"robots":[88],"can":[89,111],"be":[90,139],"roughly":[91],"divided":[92],"into":[93,189],"three":[94],"categories":[95],"their":[98],"working":[99],"methods.":[100],"first":[102],"environmental":[108],"models.":[109],"It":[110],"handle":[112],"under":[115],"condition":[117],"fully":[119],"known":[120],"obstacle":[121],"positions":[122],"and":[123,196,218],"shapes.":[124],"In":[125],"environment,":[127],"method":[131,150,159,170,174,182,207],"model":[136],"will":[137],"applicable.":[140],"Specific":[141],"A":[145],"*":[146],"[1],":[147],"topological":[148],"graph":[149],"[2],":[151],"etc":[152,176],".;":[153,177],"second":[154],"local":[156],"sensor":[162],"information,":[163],"typical":[164],"are:":[166],"artificial":[167],"potential":[168],"field":[169],"[3],":[171],"fuzzy":[172],"logic":[173],"[4],":[175],"third":[178],"Behavior-based":[179],"[5],":[183],"which":[184],"decomposes":[185],"navigation":[187],"problem":[188],"independent":[190],"modules":[191],"collision":[194],"avoidance":[195],"guidance":[198],"[6].":[199],"Practice":[200],"shows":[201],"it":[203],"an":[205],"effective":[206],"apply":[209],"neural":[210],"network":[211],"automatic":[213],"generation":[214],"trajectory":[217],"robot.":[223]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}