{"id":"https://openalex.org/W4391096306","doi":"https://doi.org/10.1109/iciscae59047.2023.10392347","title":"Path Study of Robot Obstacle Avoidance Based on Heuristic Algorithm","display_name":"Path Study of Robot Obstacle Avoidance Based on Heuristic Algorithm","publication_year":2023,"publication_date":"2023-09-23","ids":{"openalex":"https://openalex.org/W4391096306","doi":"https://doi.org/10.1109/iciscae59047.2023.10392347"},"language":"en","primary_location":{"id":"doi:10.1109/iciscae59047.2023.10392347","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iciscae59047.2023.10392347","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 6th International Conference on Information Systems and Computer Aided Education (ICISCAE)","raw_type":"proceedings-article"},"type":"article","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/A5100409581","display_name":"Yuyang Zhang","orcid":"https://orcid.org/0000-0003-4779-8585"},"institutions":[{"id":"https://openalex.org/I25355098","display_name":"Chang'an University","ror":"https://ror.org/05mxya461","country_code":"CN","type":"education","lineage":["https://openalex.org/I25355098"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuyang Zhang","raw_affiliation_strings":["Chang'an University,Xi’an,China"],"affiliations":[{"raw_affiliation_string":"Chang'an University,Xi’an,China","institution_ids":["https://openalex.org/I25355098"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101312747","display_name":"Junliang Feng","orcid":null},"institutions":[{"id":"https://openalex.org/I25355098","display_name":"Chang'an University","ror":"https://ror.org/05mxya461","country_code":"CN","type":"education","lineage":["https://openalex.org/I25355098"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junliang Feng","raw_affiliation_strings":["Chang'an University,Xi’an,China"],"affiliations":[{"raw_affiliation_string":"Chang'an University,Xi’an,China","institution_ids":["https://openalex.org/I25355098"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018221028","display_name":"Jiaxu Liu","orcid":"https://orcid.org/0009-0006-4779-7389"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]},{"id":"https://openalex.org/I4210136497","display_name":"Jilin Medical University","ror":"https://ror.org/03mzw7781","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210136497"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiaxu Liu","raw_affiliation_strings":["Jilin University,Jilin,China","Jilin University, Jilin, China"],"affiliations":[{"raw_affiliation_string":"Jilin University,Jilin,China","institution_ids":["https://openalex.org/I4210136497","https://openalex.org/I194450716"]},{"raw_affiliation_string":"Jilin University, Jilin, China","institution_ids":["https://openalex.org/I4210136497","https://openalex.org/I194450716"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102617919","display_name":"Wenxuan Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I25355098","display_name":"Chang'an University","ror":"https://ror.org/05mxya461","country_code":"CN","type":"education","lineage":["https://openalex.org/I25355098"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenxuan Fu","raw_affiliation_strings":["Chang'an University,Xi’an,China"],"affiliations":[{"raw_affiliation_string":"Chang'an University,Xi’an,China","institution_ids":["https://openalex.org/I25355098"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100390697","display_name":"Xinyu Zhang","orcid":"https://orcid.org/0000-0002-4986-4649"},"institutions":[{"id":"https://openalex.org/I25355098","display_name":"Chang'an University","ror":"https://ror.org/05mxya461","country_code":"CN","type":"education","lineage":["https://openalex.org/I25355098"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinyu Zhang","raw_affiliation_strings":["Chang'an University,Xi’an,China"],"affiliations":[{"raw_affiliation_string":"Chang'an University,Xi’an,China","institution_ids":["https://openalex.org/I25355098"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043486930","display_name":"Bowen Zhou","orcid":"https://orcid.org/0000-0002-7400-6603"},"institutions":[{"id":"https://openalex.org/I25355098","display_name":"Chang'an University","ror":"https://ror.org/05mxya461","country_code":"CN","type":"education","lineage":["https://openalex.org/I25355098"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bowen Zhou","raw_affiliation_strings":["Chang'an University,Xi’an,China"],"affiliations":[{"raw_affiliation_string":"Chang'an University,Xi’an,China","institution_ids":["https://openalex.org/I25355098"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111116139","display_name":"Luyao She","orcid":"https://orcid.org/0009-0009-0276-151X"},"institutions":[{"id":"https://openalex.org/I47689461","display_name":"Northeast Forestry University","ror":"https://ror.org/02yxnh564","country_code":"CN","type":"education","lineage":["https://openalex.org/I47689461"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luyao She","raw_affiliation_strings":["Northeast Forestry University,Harbin,China","Northeast Forestry University, Harbin, China"],"affiliations":[{"raw_affiliation_string":"Northeast Forestry University,Harbin,China","institution_ids":["https://openalex.org/I47689461"]},{"raw_affiliation_string":"Northeast Forestry University, Harbin, China","institution_ids":["https://openalex.org/I47689461"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5100409581"],"corresponding_institution_ids":["https://openalex.org/I25355098"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18629702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":null,"first_page":"657","last_page":"660"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8114354610443115},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7358142733573914},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.7289741039276123},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6245478391647339},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6231242418289185},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6133109331130981},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5542652606964111},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5402955412864685},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.533492386341095},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5328189730644226},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5325013399124146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5251659750938416},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.47605013847351074},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4658789038658142},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.45288020372390747},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4386536777019501},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.39598357677459717},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3884811997413635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36535918712615967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3420506715774536},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29400649666786194},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14153698086738586},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11081969738006592},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.09666410088539124}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8114354610443115},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7358142733573914},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.7289741039276123},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6245478391647339},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6231242418289185},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6133109331130981},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5542652606964111},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5402955412864685},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.533492386341095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5328189730644226},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5325013399124146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5251659750938416},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.47605013847351074},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4658789038658142},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.45288020372390747},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4386536777019501},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.39598357677459717},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3884811997413635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36535918712615967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3420506715774536},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29400649666786194},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14153698086738586},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11081969738006592},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.09666410088539124},{"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iciscae59047.2023.10392347","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iciscae59047.2023.10392347","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 6th International Conference on Information Systems and Computer Aided Education (ICISCAE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2156431668","https://openalex.org/W2347245430","https://openalex.org/W2375775343","https://openalex.org/W2112429204","https://openalex.org/W2562562750","https://openalex.org/W2161960576","https://openalex.org/W2198982833","https://openalex.org/W2383519316","https://openalex.org/W2357176080"],"abstract_inverted_index":{"Aiming":[0],"at":[1],"the":[2,10,17,21,26,35,50,66,77,84],"robot":[3,27],"obstacle":[4],"avoidance":[5],"problem,":[6],"this":[7,42],"paper":[8,43],"establishes":[9],"nonlinear":[11,51],"0-1":[12,52],"integer":[13,53],"planning":[14,54],"models":[15],"of":[16,69,81,87,90],"shortest":[18,22,67,78,85],"path":[19,24,80],"and":[20,59,74,83],"time":[23,79],"for":[25,49],"to":[28,37,64],"avoid":[29],"obstacles":[30],"from":[31],"one":[32],"point":[33],"in":[34],"region":[36],"another":[38],"point,":[39],"respectively.":[40],"Meanwhile,":[41],"constructs":[44],"an":[45],"effective":[46],"heuristic":[47],"algorithm":[48],"model":[55],"with":[56],"NP":[57],"attribute,":[58],"uses":[60],"MATLAB":[61],"software":[62],"programming":[63],"find":[65],"paths":[68,86,91],"O\u2192A,":[70,82],"O\u2192B,":[71],"O\u2192C,":[72],"O\u2192A\u2192B\u2192A\u2192C,":[73],"also":[75],"obtains":[76],"all":[88,94],"types":[89],"obtained":[92],"are":[93],"globally":[95],"optimal.":[96]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}