北京邮电大学研究生英语学术写作作业-分析一篇英文文献

《研究生英语学术写作》期中作业学号：姓名：1.BaicInformationTitle:Multi-UAVRoutingforPersistentIntelligenceSurveillance&ReconnaissanceMissionsAuthor:SatyanarayanaG.Manyam,StevenRasmussen,DavidW.Casbeer,KrishnamoorthyKalyanamandSureshManickamSource:2017InternationalConferenceonUnmannedAircraftSystems(ICUAS)2.KeysentencepatternsineachsectionAbstract:WeconsideraPersistentIntelligence,SurveillanceandReconnaissance(PISR)routingproblem,whichincludescollectingdatafromasetofspecifiedtasklocationsanddeliveringthatdatatoacontrolstation.①Weconsidera…problem，whichincludes…Thealgorithmsaretestedonseveralinstancesandtheirperformanceiscomparedwithrespecttotheoptimalcostandcomputationtime.①Thealgorithmsaretestedon…andtheirperformanceiscomparedwith…I.IntroductionThevariousNPSBNstakeholders,(e.g.,networkplanners,publicsafetyagencies,andequipmentvendors)haveaninterestinbeingabletoquantitativelymeasuretheresiliencyofproposedandfieldednetworks.Weconsiderapersistentmonitoringscenario,whereasetoftasklocationsneedstobevisitedpersistentlybymultipleUAVs.WeassumealltheavailableUAVsarehomogeneous.①Weconsidera…scenario,where….②Weassume….Weareinterestedintwometricsviz.datalatencyordeliverytime(tothecontrolstation)andrevisitrateorrevisitperiod.Wedefinethedatadeliverytime(orlatencytime)asthetimeelapsedfromcollectionofdatafromatasktothetimethedataisdeliveredtothecontrolstation.①Weareinterestedin…②Wedefinethe…as…Inthisarticle,weconsiderapersistentroutingoftasksthatarespatiallydistributed.Alsothedatacollectedatthetasklocationsneedstobedeliveredatacontrolstation(alsoreferredtoasdepot).Intheexistingliteratureconcerningpersistentrouting,theconceptofacontrolstationisnotconsideredanddeliverytimeisnotaddressed.①Inthisarticle,weconsider…defined…②Intheexistingliteratureconcerning…theconceptof…isnotconsideredand…isnotaddressed.Wemodelthispersistentroutingproblemasamultipletravelingsalesmanproblemwithrevisitperiodconstraints,andformulatedasamixedintegerlinearprogramming(MILP)problem.①Wemodelthis…problemasa…problem,andformulatedasa…problem.Thecontributionsofthisarticlearethefollowing:(i)Wepresentanovelformulationaddressingtwoimportantmetrics,deliverytimeandrevisitperiodforthetasksinISRmissionsandmodelitasamultiplevehiclepathplanningproblemwithcyclelengthconstraints.(ii)WepresenttwodifferentMILPmodelstofindoptimalsolutionstothecorrespondingpathplanningproblem.ThetwoMILPmodelsconstitutenovelconstraintstoaddressthecyclelengthlimits,whichcouldbeappliedtoanygeneralroutingprobleminvolvingconstraintsoncyclelength.(iii)Aheuristicviaassignment-treesearchispresentedthatproducesgoodsub-optimalsolutions,anditcouldbeeasilygeneralizedtoaddressdifferentcostfunctionsand/orconstraints.(iv)Wetestthealgorithmsonseveralrandominstancesandcomputationalresultsarepresented.①Thecontributionsofthisarticlearethefollowing:(i)…(ii)…(iii)…②Wepresentanovelformulationaddressingtwoimportantmetrics…③Wepresent…modeltofindoptimalsolutionsto…problem.④Wetestthealgorithmson…II.PRELIMINARIESANDASSUMPTIONSSomeoftheadvantagesofthisclassofsolutionsarethefollowing:wedonotneedtohavecommunicationbetweenUAVstoupdatethescheduledtasksateachplanningtimeinterval.①Someoftheadvantagesofthisclassofsolutionsarethefollowing:…TherearetwoimportantmetricsthatneedstobeaddressedinPISRmissions.Thefirstoneisthedatadeliverytimeordatalatency(iD)foreachtaskit.Theothermetricthatweconsideristherevisitperiodofeachtask.①Therearetwoimportantmetricsthatneedstobeaddressedin…missions.Thefirstoneis…TheothermetricthatweconsiderisIII.PROBLEMFORMULATIONWemodeltheMILPusingnodebasedandarcbasedformulations;thesemodelsareakintothemodelsin[14]and[12]usedtosolvethetravelingsalesmanproblemwithtimewindowsandthedistanceconstrainedvehicleroutingproblem.Similarformulationswerealsousedtosolvefuelconstrainedmultiplevehicleroutingproblemin[13].Inthesearticles,theconstraintsonthelengthofatourstartingfromadepotareconstrained.Intheformulationpresentedhere,thelengthofatourstartingfromadepottoeachtaskandthelengthstartingfromthetaskreturningtothedepottogetherareconstrained.①Wemodelthe…using…②Similarformulationswerealsousedtosolve…problemin…③Inthesearticles,…areconstrained.Theproblemcanbestatedasthefollowing:findatmostvncyclesthatminimizesthemaximumdeliverytimesuchthat,()ieachtaskTiscoveredbyonecycle,and()iiifataskitassignedtooneoftheUAVs,v,withcyclelengthvL,then,viLRiT.①Theproblemcanbestatedasthefollowing:…()i…()ii…Intheaboveformulation,thebigMintheconstraints(4),(6)isknowntocausecomputationalproblems[14],[17],andhencemaketheMILPmodelcomputationallylessefficient.WeproposeasecondformulationwithoutbigMconstraintsandcomparethecomputationalperformanceofthesetwoformulations.①Intheaboveformulation,…isknowntocausecomputationalproblems②Weproposeasecondformulation…andcomparethecomputationalperformanceofthesetwoformulations.IV.ASSIGNMENTTREESEARCHHEURISTICInthissection,wepresentaheuristictosolvethePISRroutingproblem.Theheuristicisagreedyassignmenttreesearch,basedonthepriorworkin[18],[19],forplanningmissionsinvolvingmultipleUAVs.Here,wepresentasynopsisofthetreesearchalgorithm,