{"id":"https://openalex.org/W3191797646","doi":"https://doi.org/10.3233/jifs-210901","title":"A heuristics pulse algorithm with relaxation pruning strategy for resources re-initialized UAV path planing","display_name":"A heuristics pulse algorithm with relaxation pruning strategy for resources re-initialized UAV path planing","publication_year":2021,"publication_date":"2021-08-03","ids":{"openalex":"https://openalex.org/W3191797646","doi":"https://doi.org/10.3233/jifs-210901","mag":"3191797646"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-210901","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-210901","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent &amp; Fuzzy Systems","raw_type":"journal-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/A5006817088","display_name":"Xinghao Chen","orcid":"https://orcid.org/0000-0002-2102-8235"},"institutions":[{"id":"https://openalex.org/I165745306","display_name":"Southwest Petroleum University","ror":"https://ror.org/03h17x602","country_code":"CN","type":"education","lineage":["https://openalex.org/I165745306"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xinghao Chen","raw_affiliation_strings":["School of Sciences, Southwest Petroleum University, Chengdu, China"],"affiliations":[{"raw_affiliation_string":"School of Sciences, Southwest Petroleum University, Chengdu, China","institution_ids":["https://openalex.org/I165745306"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083108695","display_name":"Bin Zhou","orcid":"https://orcid.org/0000-0003-3642-2048"},"institutions":[{"id":"https://openalex.org/I165745306","display_name":"Southwest Petroleum University","ror":"https://ror.org/03h17x602","country_code":"CN","type":"education","lineage":["https://openalex.org/I165745306"]},{"id":"https://openalex.org/I4210098205","display_name":"State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation","ror":"https://ror.org/00ftbmy59","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210098205"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Zhou","raw_affiliation_strings":["School of Sciences, Southwest Petroleum University, Chengdu, China","State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation, Southwest Petroleum University, Chengdu, China"],"affiliations":[{"raw_affiliation_string":"School of Sciences, Southwest Petroleum University, Chengdu, China","institution_ids":["https://openalex.org/I165745306"]},{"raw_affiliation_string":"State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation, Southwest Petroleum University, Chengdu, China","institution_ids":["https://openalex.org/I165745306","https://openalex.org/I4210098205"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006817088"],"corresponding_institution_ids":["https://openalex.org/I165745306"],"apc_list":null,"apc_paid":null,"fwci":0.3843,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.60473856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"41","issue":"2","first_page":"3541","last_page":"3553"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11133","display_name":"UAV Applications and Optimization","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/initialization","display_name":"Initialization","score":0.7296546697616577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.701257586479187},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6261449456214905},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5709524154663086},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5705420970916748},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5650859475135803},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.551493763923645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5389135479927063},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5149355530738831},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.47537270188331604},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.434045672416687},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.432415634393692},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25606369972229004},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19216391444206238},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09509223699569702}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7296546697616577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.701257586479187},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6261449456214905},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5709524154663086},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5705420970916748},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5650859475135803},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.551493763923645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5389135479927063},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5149355530738831},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.47537270188331604},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.434045672416687},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.432415634393692},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25606369972229004},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19216391444206238},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09509223699569702},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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.3233/jifs-210901","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-210901","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent &amp; Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1979729479","https://openalex.org/W1982582014","https://openalex.org/W2010619023","https://openalex.org/W2055093681","https://openalex.org/W2069667928","https://openalex.org/W2408790422","https://openalex.org/W2682890765","https://openalex.org/W2808115698","https://openalex.org/W2909366371","https://openalex.org/W2923442889","https://openalex.org/W2973697444","https://openalex.org/W3003498136","https://openalex.org/W3013773102"],"related_works":["https://openalex.org/W2152296133","https://openalex.org/W2116538803","https://openalex.org/W1487981883","https://openalex.org/W2055341608","https://openalex.org/W3146338492","https://openalex.org/W2012229304","https://openalex.org/W2391412785","https://openalex.org/W2965616113","https://openalex.org/W2807855971","https://openalex.org/W2123784360"],"abstract_inverted_index":{"Path":[0],"planning":[1,34],"is":[2,17,100,115],"the":[3,31,37,47,62,75,81,89,94,104,108,118,124,137,144,149,162,167,178,184,188,193],"basis":[4],"and":[5,15,53,87,127,146,173,176],"prerequisite":[6],"for":[7,80],"unmanned":[8],"aerial":[9],"vehicle":[10],"(UAV)":[11],"to":[12,19,51,102,122,201],"perform":[13],"tasks,":[14],"it":[16],"important":[18],"achieve":[20],"precise":[21],"location":[22],"in":[23,177],"path":[24,33,65,85],"planning.":[25],"This":[26],"paper":[27],"focuses":[28],"on":[29,132],"solving":[30],"UAV":[32],"problem":[35,66,86],"under":[36],"constraint":[38],"of":[39,56,77,148,180,198],"system":[40],"positioning":[41],"error.":[42],"Some":[43],"nodes":[44,135],"can":[45,58,165,191],"re-initiate":[46],"accumulated":[48],"flight":[49],"error":[50],"zero":[52],"this":[54],"type":[55],"scenario":[57],"be":[59],"modeled":[60],"as":[61],"resource-constrained":[63],"shortest":[64,84],"with":[67],"re-initialization":[68],"(RCSPP-R).":[69],"The":[70,158],"additional":[71],"re-initiation":[72],"conditions":[73],"expand":[74],"set":[76],"viable":[78],"paths":[79],"original":[82],"constrained":[83],"increasing":[88],"search":[90,125,140,168],"cost.":[91],"To":[92,142],"solve":[93],"problem,":[95],"an":[96,196],"effective":[97],"preprocessing":[98],"method":[99],"proposed":[101,138,150],"reduce":[103,123,166],"network":[105],"nodes.":[106],"At":[107],"same":[109],"time,":[110],"a":[111,181],"relaxed":[112],"pruning":[113],"strategy":[114],"introduced":[116],"into":[117],"traditional":[119],"Pulse":[120],"algorithm":[121,186],"space":[126,169],"avoid":[128],"more":[129],"redundant":[130],"calculations":[131],"unfavorable":[133],"scalable":[134],"by":[136,170,195],"heuristic":[139,185],"strategy.":[141],"evaluate":[143],"accuracy":[145],"effectiveness":[147],"algorithm,":[151],"some":[152,202],"numerical":[153],"experiments":[154],"were":[155],"carried":[156],"out.":[157],"results":[159],"indicate":[160],"that":[161],"three":[163,189],"strategies":[164,190],"99%,":[171],"97%":[172],"80%,":[174],"respectively,":[175],"case":[179],"large":[182],"network,":[183],"combining":[187],"improve":[192],"efficiency":[194],"average":[197],"80%":[199],"compared":[200],"classical":[203],"solution.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
