摘要
Unmannedaerialvehicles(UAVs)mayplayanimportantroleindatacollectionandoffloadinginvastareasdeployingwirelesssensornetworks,andtheUAV’sactionstrategyhasavitalinfluenceonachievingapplicabilityandcomputationalcomplexity.Dynamicprogramming(DP)hasagoodapplicationinthepathplanningofUAV,butthereareproblemsintheapplicabilityofspecialterrainenvironmentandthecomplexityofthealgorithm.BasedontheanalysisofDP,thispaperproposesahierarchicaldirectionalDP(DDP)algorithmbasedondirectiondeterminationandhierarchicalmodel.WecompareourmethodswithQ-learningandDPalgorithmbyexperiments,andtheresultsshowthatourmethodcanimprovetheterrainapplicability,meanwhilegreatlyreducethecomputationalcomplexity.
出版日期
2018年06月16日（中国期刊网平台首次上网日期，不代表论文的发表时间）
