{"id":"https://openalex.org/W3134032450","doi":"https://doi.org/10.1109/icpeca51329.2021.9362595","title":"Research on path planning method of forging handling robot based on combined strategy","display_name":"Research on path planning method of forging handling robot based on combined strategy","publication_year":2021,"publication_date":"2021-01-22","ids":{"openalex":"https://openalex.org/W3134032450","doi":"https://doi.org/10.1109/icpeca51329.2021.9362595","mag":"3134032450"},"language":"en","primary_location":{"id":"doi:10.1109/icpeca51329.2021.9362595","doi":"https://doi.org/10.1109/icpeca51329.2021.9362595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpeca51329.2021.9362595","pdf_url":null,"source":{"id":"https://openalex.org/S4306498818","display_name":"2021 IEEE International Conference on Power Electronics, Computer Applications (ICPECA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Power Electronics, Computer Applications (ICPECA)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5010920531","display_name":"Kunju Shi","orcid":"https://orcid.org/0000-0002-5956-4551","observed_orcids":["https://orcid.org/0000-0002-5956-4551"]},"institutions":[{"id":"https://openalex.org/I4210156189","display_name":"Shanghai Dianji University","ror":"https://ror.org/055fene14","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210156189"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kunju Shi","raw_affiliation_strings":["School of Mechanical Engineering, Shanghai Dianji University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Shanghai Dianji University, Shanghai, China","institution_ids":["https://openalex.org/I4210156189"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101621115","display_name":"Peng Wu","orcid":"https://orcid.org/0000-0001-8946-3447","observed_orcids":["https://orcid.org/0000-0001-8946-3447","https://orcid.org/0000-0002-2276-5616"]},"institutions":[{"id":"https://openalex.org/I4210153482","display_name":"Changzhou University","ror":"https://ror.org/04ymgwq66","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210153482"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peng Wu","raw_affiliation_strings":["School of Mechanical Engineering & School of Urban Rail Transit, Changzhou University, Changzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering & School of Urban Rail Transit, Changzhou University, Changzhou, China","institution_ids":["https://openalex.org/I4210153482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001777619","display_name":"Mingshuai Liu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210156189","display_name":"Shanghai Dianji University","ror":"https://ror.org/055fene14","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210156189"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingshuai Liu","raw_affiliation_strings":["School of Mechanical Engineering, Shanghai Dianji University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Shanghai Dianji University, Shanghai, China","institution_ids":["https://openalex.org/I4210156189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6426,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.96471615,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"131","issue":null,"first_page":"292","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/robot-path-planning","display_name":"robot path planning","score":0.8619999885559082},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.7960000038146973},{"id":"https://openalex.org/keywords/potential-field-method","display_name":"potential field method","score":0.8019999861717224},{"id":"https://openalex.org/keywords/artificial-potential-field","display_name":"artificial potential field","score":0.6050000190734863},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"premature convergence","score":0.6869999766349792},{"id":"https://openalex.org/keywords/local-minima","display_name":"local minima","score":0.9390000104904175},{"id":"https://openalex.org/keywords/unknown-environment-navigation","display_name":"unknown environment navigation","score":0.7860000133514404},{"id":"https://openalex.org/keywords/robot-navigation","display_name":"robot navigation","score":0.5170000195503235}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8726714849472046},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7823779582977295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6649284362792969},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.652285099029541},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.602956235408783},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5764751434326172},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5625395774841309},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5540388226509094},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.535304605960846},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.46725887060165405},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4564225673675537},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4453519284725189},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.43652960658073425},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3159290552139282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14958873391151428},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/icpeca51329.2021.9362595","doi":"https://doi.org/10.1109/icpeca51329.2021.9362595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpeca51329.2021.9362595","pdf_url":null,"source":{"id":"https://openalex.org/S4306498818","display_name":"2021 IEEE International Conference on Power Electronics, Computer Applications (ICPECA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Power Electronics, Computer Applications (ICPECA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.428600013256073}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2019811733","https://openalex.org/W2053407718","https://openalex.org/W2575210820"],"related_works":["https://openalex.org/W2024211444","https://openalex.org/W3193496667","https://openalex.org/W2894241289","https://openalex.org/W3152993601","https://openalex.org/W1955308247","https://openalex.org/W2357400690","https://openalex.org/W2383258726","https://openalex.org/W2781961503","https://openalex.org/W1880047606","https://openalex.org/W4289656322"],"abstract_inverted_index":{"In":[0,60,143],"the":[1,10,13,19,61,64,73,84,90,99,124,129,138,146,155,159],"robot":[2,23,74],"navigation":[3],"module,":[4],"autonomous":[5],"path":[6,14,24,40,57,82,121],"planning":[7,15,25,41,58,122],"is":[8,18,70,115,150,163],"at":[9],"core,":[11],"and":[12,32,38,55,95,127,134,152,154],"control":[16,161],"strategy":[17,52],"key":[20],"factor.":[21],"Traditional":[22],"algorithms":[26,108],"generally":[27],"have":[28],"some":[29],"inherent":[30],"defects,":[31],"they":[33],"cannot":[34],"seamlessly":[35],"integrate":[36],"local":[37,54,107,132],"global":[39,56,62],"methods,":[42],"resulting":[43],"in":[44,104,137],"low":[45,96],"efficiency.":[46],"This":[47],"paper":[48],"proposes":[49],"a":[50,79],"combination":[51],"of":[53,92,98,106,131],"algorithms.":[59],"algorithm,":[63],"potential":[65,112,140],"field":[66,113,141],"ant":[67,101],"colony":[68,102],"algorithm":[69],"adopted.":[71],"Before":[72],"starts,":[75],"it":[76],"will":[77],"plan":[78],"relatively":[80],"optimal":[81],"on":[83],"specified":[85],"electronic":[86],"map,":[87],"which":[88,117],"solves":[89,128],"problems":[91,130],"premature":[93],"convergence":[94],"efficiency":[97],"traditional":[100,139],"algorithm;":[103],"terms":[105],"The":[109],"improved":[110,148],"artificial":[111],"method":[114,149,162],"adopted,":[116],"carries":[118],"out":[119],"real-time":[120],"for":[123],"unknown":[125],"environment,":[126],"minima":[133],"unreachable":[135],"targets":[136],"method.":[142],"this":[144],"paper,":[145],"proposed":[147,160],"simulated":[151],"analyzed,":[153],"results":[156],"show":[157],"that":[158],"feasible.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2021-03-15T00:00:00"}