{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T14:55:08Z","timestamp":1770044108630,"version":"3.49.0"},"reference-count":13,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,9,15]]},"abstract":"<jats:p>Path planning is the basis and prerequisite for unmanned aerial vehicle (UAV) to perform tasks, and it is important to achieve precise location in path planning. This paper focuses on solving the UAV path planning problem under the constraint of system positioning error. Some nodes can re-initiate the accumulated flight error to zero and this type of scenario can be modeled as the resource-constrained shortest path problem with re-initialization (RCSPP-R). The additional re-initiation conditions expand the set of viable paths for the original constrained shortest path problem and increasing the search cost. To solve the problem, an effective preprocessing method is proposed to reduce the network nodes. At the same time, a relaxed pruning strategy is introduced into the traditional Pulse algorithm to reduce the search space and avoid more redundant calculations on unfavorable scalable nodes by the proposed heuristic search strategy. To evaluate the accuracy and effectiveness of the proposed algorithm, some numerical experiments were carried out. The results indicate that the three strategies can reduce the search space by 99%, 97% and 80%, respectively, and in the case of a large network, the heuristic algorithm combining the three strategies can improve the efficiency by an average of 80% compared to some classical solution.<\/jats:p>","DOI":"10.3233\/jifs-210901","type":"journal-article","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T13:48:23Z","timestamp":1627998503000},"page":"3541-3553","source":"Crossref","is-referenced-by-count":5,"title":["A heuristics pulse algorithm with relaxation pruning strategy for resources re-initialized UAV path planing"],"prefix":"10.1177","volume":"41","author":[{"given":"Xinghao","family":"Chen","sequence":"first","affiliation":[{"name":"School of Sciences, Southwest Petroleum University, Chengdu, China"}]},{"given":"Bin","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Sciences, Southwest Petroleum University, Chengdu, China"},{"name":"State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation, Southwest Petroleum University, Chengdu, China"}]}],"member":"179","reference":[{"issue":"7","key":"10.3233\/JIFS-210901_ref1","doi-asserted-by":"crossref","first-page":"1880","DOI":"10.3390\/s20071880","article-title":"Grid-basedmobile robot path planning using aging-based ant colony optimizationalgorithm in static and dynamic environments","volume":"20","author":"Ajeil","year":"2020","journal-title":"Sensors"},{"issue":"1","key":"10.3233\/JIFS-210901_ref3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556788.2018.1548015","article-title":"An efficient exact approachfor the constrained shortest path tour problem","volume":"35","author":"Ferone","year":"2020","journal-title":"OptimizationMethods and Software"},{"issue":"1","key":"10.3233\/JIFS-210901_ref5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.cor.2010.04.010","article-title":"Minimumcost path problems withrelays","volume":"38","author":"Laporte","year":"2011","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.3233\/JIFS-210901_ref6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1287\/trsc.2014.0582","article-title":"An exact algorithmfor theelementary shortest path problem with resource constraints","volume":"50","author":"Lozano","year":"2016","journal-title":"Transportation Science"},{"issue":"1","key":"10.3233\/JIFS-210901_ref8","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.cor.2012.07.008","article-title":"On an exact method for the constrainedshortest path problem","volume":"40","author":"Lozano","year":"2013","journal-title":"Computers and Operations Research"},{"key":"10.3233\/JIFS-210901_ref9","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2019.03.010","article-title":"The resourceconstrained shortest path problem with uncertain data: A robustformulation and optimal solution approach","volume":"107","author":"Di","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.3233\/JIFS-210901_ref10","doi-asserted-by":"crossref","first-page":"105530","DOI":"10.1016\/j.knosys.2020.105530","article-title":"A novel hybrid grey wolfoptimizer algorithm for unmanned aerial vehicle (uav) path planning","volume":"194","author":"Qu","year":"2020","journal-title":"Knowledge-Based Systems"},{"issue":"1","key":"10.3233\/JIFS-210901_ref11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/TWC.2019.2940447","article-title":"Uav trajectory planning for data collection from time-constrainediot devices","volume":"19","author":"Samir","year":"2019","journal-title":"IEEE Transactions onWireless Communications"},{"issue":"5","key":"10.3233\/JIFS-210901_ref12","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1016\/j.cor.2011.07.017","article-title":"Solving shortest path problemswith a weight constraint and replenishment arcs","volume":"39","author":"Smith","year":"2012","journal-title":"Computers andOperations Research"},{"issue":"1","key":"10.3233\/JIFS-210901_ref13","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MCS.2013.2287568","article-title":"Unmanned aerial vehiclepath following: A survey and analysis of algorithms for fixed-wingunmanned aerial vehicless","volume":"34","author":"Sujit","year":"2014","journal-title":"IEEE Control Systems Magazine"},{"key":"10.3233\/JIFS-210901_ref15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.advengsoft.2016.05.015","article-title":"Grey wolf optimizer forunmanned combat aerial vehicle path planning","volume":"99","author":"Zhang","year":"2016","journal-title":"Advances inEngineering Software"},{"issue":"4","key":"10.3233\/JIFS-210901_ref16","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1109\/TITS.2017.2709798","article-title":"Robust shortest pathproblem with distributional uncertainty","volume":"19","author":"Zhang","year":"2017","journal-title":"IEEE Transactions onIntelligent Transportation Systems"},{"key":"10.3233\/JIFS-210901_ref17","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.knosys.2018.05.033","article-title":"Survey oncomputational-intelligence-based uav path planning","volume":"158","author":"Zhao","year":"2018","journal-title":"Knowledge-Based Systems"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T03:19:30Z","timestamp":1770002370000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,15]]},"references-count":13,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210901","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,15]]}}}