{"id":"https://openalex.org/W4399254006","doi":"https://doi.org/10.1145/3660395.3660489","title":"Improved path planning for hexapod robot optimized by A* algorithm","display_name":"Improved path planning for hexapod robot optimized by A* algorithm","publication_year":2023,"publication_date":"2023-09-22","ids":{"openalex":"https://openalex.org/W4399254006","doi":"https://doi.org/10.1145/3660395.3660489"},"language":"en","primary_location":{"id":"doi:10.1145/3660395.3660489","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3660395.3660489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 3rd Guangdong-Hong Kong-Macao Greater Bay Area Artificial Intelligence and Big Data Forum","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/A5109930671","display_name":"H. L. Zou","orcid":"https://orcid.org/0009-0004-5981-0873"},"institutions":[{"id":"https://openalex.org/I15823474","display_name":"Linyi University","ror":"https://ror.org/01knv0402","country_code":"CN","type":"education","lineage":["https://openalex.org/I15823474"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haibin Zou","raw_affiliation_strings":["School of Automation and Electrical Engineering, LinYi Uuniversity, China"],"raw_orcid":"https://orcid.org/0009-0004-5981-0873","affiliations":[{"raw_affiliation_string":"School of Automation and Electrical Engineering, LinYi Uuniversity, China","institution_ids":["https://openalex.org/I15823474"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101869412","display_name":"Ruquan Liang","orcid":"https://orcid.org/0000-0003-4947-9940"},"institutions":[{"id":"https://openalex.org/I15823474","display_name":"Linyi University","ror":"https://ror.org/01knv0402","country_code":"CN","type":"education","lineage":["https://openalex.org/I15823474"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruquan Liang","raw_affiliation_strings":["School of Mechanical and Vehicle Engineering, LinYi Uuniversity, China"],"raw_orcid":"https://orcid.org/0000-0003-4947-9940","affiliations":[{"raw_affiliation_string":"School of Mechanical and Vehicle Engineering, LinYi Uuniversity, China","institution_ids":["https://openalex.org/I15823474"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077710986","display_name":"Yang Liu","orcid":"https://orcid.org/0000-0001-6427-2345"},"institutions":[{"id":"https://openalex.org/I15823474","display_name":"Linyi University","ror":"https://ror.org/01knv0402","country_code":"CN","type":"education","lineage":["https://openalex.org/I15823474"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liu Yang","raw_affiliation_strings":["School of Mechanical and Vehicle Engineering, LinYi Uuniversity, China"],"raw_orcid":"https://orcid.org/0000-0001-6427-2345","affiliations":[{"raw_affiliation_string":"School of Mechanical and Vehicle Engineering, LinYi Uuniversity, China","institution_ids":["https://openalex.org/I15823474"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I15823474"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29628065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"537","last_page":"541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.7175137996673584},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6760520339012146},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6542920470237732},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6516809463500977},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6331803798675537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5802133679389954},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.5586886405944824},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.5308842062950134},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5133997201919556},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5070030689239502},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5022377967834473},{"id":"https://openalex.org/keywords/evaluation-function","display_name":"Evaluation function","score":0.5000312328338623},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4811921715736389},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.47783851623535156},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4653303027153015},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.42589154839515686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3172188699245453},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.31521886587142944},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2426719069480896},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12317121028900146},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.10707840323448181},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.08807197213172913}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7175137996673584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6760520339012146},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6542920470237732},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6516809463500977},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6331803798675537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5802133679389954},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.5586886405944824},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.5308842062950134},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5133997201919556},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5070030689239502},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5022377967834473},{"id":"https://openalex.org/C131806220","wikidata":"https://www.wikidata.org/wiki/Q852705","display_name":"Evaluation function","level":2,"score":0.5000312328338623},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4811921715736389},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.47783851623535156},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4653303027153015},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.42589154839515686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3172188699245453},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.31521886587142944},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2426719069480896},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12317121028900146},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.10707840323448181},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.08807197213172913},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3660395.3660489","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3660395.3660489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 3rd Guangdong-Hong Kong-Macao Greater Bay Area Artificial Intelligence and Big Data Forum","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2202006879","https://openalex.org/W2313634429","https://openalex.org/W2329739548","https://openalex.org/W2555661000","https://openalex.org/W3017223648"],"related_works":["https://openalex.org/W2402589461","https://openalex.org/W2268784641","https://openalex.org/W49831056","https://openalex.org/W2578195970","https://openalex.org/W3111117784","https://openalex.org/W2405282859","https://openalex.org/W2784271373","https://openalex.org/W2038323771","https://openalex.org/W3161537375","https://openalex.org/W2106256378"],"abstract_inverted_index":{"Aiming":[0],"at":[1],"the":[2,7,13,18,25,31,34,39,47,50,53,57,64,69,73,77,93,99,115,125,131,135,138,144,155,162],"traditional":[3,26],"A*":[4,103,127],"algorithm":[5,27,104,128,157],"in":[6,42,72,160],"path":[8,14,40,95,116],"planning":[9,96],"of":[10,52,134,147],"hexapod":[11],"robots,":[12],"is":[15,21,28,60,82,105],"too":[16,22],"tortuous,":[17],"search":[19,74,94,136,148],"efficiency":[20],"low,":[23],"etc.,":[24],"improved":[29,126,156],"from":[30],"heuristic":[32,48],"function,":[33,49],"key":[35,78],"point":[36,79],"selection,":[37],"and":[38,88,113,143],"smoothing":[41,102],"three":[43],"aspects.":[44],"Firstly,":[45],"for":[46,141],"influence":[51],"parent":[54],"node":[55,59],"on":[56],"child":[58],"used":[61,106,140],"to":[62,67,84,91,107],"increase":[63],"h(n)":[65],"weight":[66],"reduce":[68,92],"repeated":[70],"backtracking":[71],"process;":[75],"secondly,":[76],"selection":[80],"strategy":[81],"introduced":[83],"eliminate":[85,108],"redundant":[86],"turns":[87],"unnecessary":[89],"nodes":[90],"distance.":[97],"Finally,":[98],"B-spline":[100],"curve":[101],"paths":[109],"with":[110],"sharp":[111],"corners":[112],"make":[114],"relatively":[117],"smooth.":[118],"The":[119],"MALTAB":[120],"simulation":[121],"experiments":[122],"confirm":[123],"that":[124,154],"effectively":[129],"reduces":[130],"total":[132,145],"length":[133],"path,":[137],"time":[139],"searching,":[142],"number":[146],"nodes.":[149],"It":[150],"can":[151],"be":[152],"seen":[153],"performs":[158],"better":[159],"finding":[161],"optimal":[163],"path.":[164]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}