基于GIS的機(jī)場場面路徑優(yōu)化算法的研究

1、基于GIS的機(jī)場場面路徑優(yōu)化算法的研究Mar.2005TransactionsofNanjingUniversityofAeronautics8LAstronauticsVo1.22No.1RoUTEoPTIMIZINGALGoRITHMoFAIRPoRTSURFACEBASEDoNGISJIRong.HANSongchen(CollegeofCivilAviation,NUAA,29YudaoStreet,Nanjing,210016,P.R.China)Abstract:TheGIStechniqueisusedforairportsurfacemanagementtostudytheop

2、timizationofairplanetaxiwayforarrivalanddepartureflights.Theshortestpathsaredesignedforjustarrivedandreadyfordepartingflightsoftheairport.Additionally,whethertheflightscouldconfronteachotherheadtoheadonthetaxiwayisjudged.Inregardtotheairportssecurityandefficiency,airplanesmustcontinuouslytaxialongth

3、eshortestrouteandtheheadtoheadconfrontationshouldnotOccur.Twoschemesaredesigned:Oneistochangethetaxiingvelocityofarrivalflights,theotheristodelaythestartingtimeofdepartureflights.Thisalgorithmisapprovedbyapracticalexample.Keywords:aviationtransportationmanagement;routeoptimizingGIS;arrival8Ldepartur

4、eflightsCLCnnmher:V351Documentcode:AArticleID:10051120(2005)01007107INTRoDUCTIoNWiththerapiddevelopmentoftheglobalaviationtransportationindustryandthesignificantlyincreasedamountofflights,theairportsurfacemanagementbecomesoneofthebottlenecksthatrestrainedtheindustrysdevelopment.Thehistoryhasshownman

5、ytrafficaccidentsonairports,forexample:onSep.41983,theairplaneTrident264fromthe6thFlightBrigadeofGuangzhouCivilAviationAdministrationcollidedwithanotherairplanewhenittookaturnattheconnectingtaxiwayatGuilinAirport,11diedand22wounded,andtheairplanewasdiscarded.Thesignificanceofairporttrafficsecurityha

6、sbroughtaboutanumberofsophisticatedsystemsforthesupervisionandmanagementofairportsurface.Nowadays,thesurfacesurveillanceradarandthetechnologyautomaticdependentsurveillancebroadcast(ADSB)areusedatsomeairportsinsteadoftheconventionaltowercontrolling引.Therouteoptimizingoftheairporttaxiwayisthekeyinthea

7、irportsurfacemanagement.Currentlyinthecitytraffictransportation,vehiclerouteplanningmainlyadoptstheDijkstraalgorithm.withoutconsiderationoftheproblemofvehiclescollisions.Astheaspectoftheairportsurfacemanagement,H.G.Visser,etalradoptedthemixedintegerlinearprogrammethodtoestablishtheflightsschedule.Fi

8、rstly,itcreatestheidealtaxiingroutesforallflights,thendetermineswhethertheflightswillconfrontonceatimeevery10s.whentheconfrontationoccurs.thetaxiingschemeshavetobeadjustedforallflights,ofwhichthealgorithmiscomplicatedincomputation.Ref.E53hasbroughtupasolutionwhichdeterminestheoptimalpathbetweentwopo

9、intsstaticallyinairportsurfacemanagement,yetnoaccountwastakenofthepotentialconfrontationwhenflightstaxi.InthispapertheGIStechnologyisappliedinthemanagementofairportsurface.BymeansofDijkstraalgorithmandtheattributedataofGIS,theshortesttaxiingrouteforairplaneissodetermined.Accordingtothecurrentregulat

10、ionsofairtrafficcontrol引,itsnotpermittedforairplanestotaxiheadtohead.Forthisreason.thispaperwilldynamicallyjudgeonthetaxiingtimeandtheroutesofarrivalanddepartureflightstodeterminewhethertheflightsontheairportwillconReceiveddate:20040804revisionreceiveddate:20041202E-mail:jirong126 72TransactionsofNa

11、njingUniversityofAeronautics&AstronauticsVo1.22frontwitheachother.Meanwhile,toensurethattheflightscantaxicontinuouslyandtaketheshortesttaxiingroutes,differentsolutionsareadoptedforarrivalanddepartureflightstoavoidconfrontingheadtoheadintheirtaxiing.RoUTEoPTIMIZINGALGoRITHMWhenplanningthetaxi

12、ingroutesforarrivalanddepartureflights,wemusttakeintoaccountofthesequestions:Whenwillthearrivalflightsgetintothetaxiingway?Whetherwillarrivalanddepartureflightsconfrontheadto-headandhowtosolvewhenitoccurs?BasedonDijkstraalgorithm,thecorrespondingoneforoptimizingroutesisgiveninthispaper.Itsflowcharti

13、sshowninFig.1.Fig.1Flowchartofrouteoptimizing1.1ImplementationofDijkstraalgorithmDijkstraalgorithmiswidelyusedbecauseofitssimpleandeasyinsearchingfortheshortestroute.Thispaperusesitinselectingtheoptimalroutes.WhenusingDijkstraalgorithm,theroutecalculationwiththedataoftheelectronicmapismade.IntheMapl

14、nfosystem,thespatialdataandtheattributedataareseparatelystored.Theattributedataaresavedasasheetinthestructureofdatabase,andthespatialdataaresavedinafileintheformatdefinedbyMaplnfoitself.Botharerelatedthroughflcertainindexingmechanism.Theroadnetworkisdenotedasarcsandnodesintheelectronicmap,withtheira

15、ttributedatadescribedasfollows:structArcNollArcstructureintArcNo;/ArcNStartpoino;/StartingnodeintEndpoino;/EndingnodefloatLenth;/ArclengthstructPoint/NodestructureintPointNo;/NodeNo.floatx,Y;/GeographicalcoordinatesintNearArcNum;/humbleofassociated/arcsint*NearArcNo:/No.ofassociatedarcsintPrepo

16、int;/NodepreviousSincetherearemanypapersavailableonthedetailedprocedureofDijkstraalgorithm,itwillnotbediscussedanymoreinthispaper.1.2SelectionofstartingpointandendingpointinrouteoptimizingWhenchoosingthetaxiingroutesfortheflights,thestartingpointandtheendingpointshouldbefirstlydetermined.Becausethef

17、lightisnowrequiredtotakeoffbyfullrunway,thestartingpointandtheendingpointofthetaxiingroutecouldbefixeddirectlyforthedepartureflights.Thestartingpointisthegatepositionoftheimmediatedepartingflights,andtheendingpointisthewaitingsectionatthefarendoftherunway.Theendingpointforthelandingflightistheparkin

18、gapronpresetedintheflightschedule,whilethestartingpointhastobeconfirmedinrealtime.ThroughtheGPSreceiver,wecandeterminetheairplanesrealtimepositionaswellastheirvelocityvectors.Supposingthatatthemomentoft,thevalueoftheairplanesvelocityaccordswiththatofenteringintothetaxiway,thenselectthefirstnodewhich

19、isinfrontoftheairplaneontherunwayasthestartingpointoftherouteoptimization.Firstly,accordingtothenodesattributes,selectthenodeswhichfireassociatedNo.1jiRong,eta1.RouteOptimizingAlgorithmofAirportSurfaceBased73withtherunway,thenamongthesenodesfindtheonefromwhichtheairplaneswilltaxioutoftherunway,thefo

20、undednodeisjustthestartingpointoftherouteoptimization.Theairplanetaxiingontherunwaycanberegardedasrunningstratightlyinthedirectionoftherunway,andthedirectioninwhichtheairplanetakesofforlandsatanymomentisalsoknown,therebytheequationoftaxiingtrackoftheairplaneisfz(f)一z(0)+vtcosO)一(0)+佻in0Theequationfo

21、rtherangefromthenodetotheairplaneisZ一(zz(0)+(一(0)(2)where(z(0),y(0)arethecoordinatesatwhichtheairplanetakesoff;0istheairplanetaxiingangle,theairplanetaxiingvelocity;(z(),()arethecoordinatesoftheairplaneattimet;(zf.Y)arethecoordinatesofnodei;Zthedistancefromnodeitotheairplaneattheinitialtime.Substitu

22、tethenodescoordinatesoftherunwayintoEq.(1),iftheresulttisgreaterthan0,thenitissurethatthenodeslayaheadoftheairplane,ifitislessthan0,thesenodeswillbedismissed.FurthercalculateZ,'thenselectthenodewiththeminimumdistanceasthenodefromwhichtheairplaneleavesforthetaxiway.1.3SolutionofheadtoheadcOnfrOnt

23、atiOnsWhenselectingtheoptimalroute,wemustconsidertheproblemofthehead.toheadcon.frontationbetweenarrivalflightsanddepartures.1.3.1DeterminationofflightconfrontationWetakethedepartureflightasanexample.Whentheflightisreadytotakeoff,weneedtodeterminewhetherthetaxiingroutehasbeenchosenforthearrivalflight

24、.Ifnot,thedepartureflightwilltakeoffnormally,otherwise,itisnecessarytoseewhethertheywillhaveaheadtoheadconfrontation.Herearethedetailsasfollows:Step1Selecttheshortestroutesfordepartureflights.Gettheshortestroutesbytheabovemethod.therouteisindicatedbythenodesbywhicharrivalanddepartureflightspassedsep

25、arately.Nowthetaxiroutesforarrivalflightshavebeenachieved.Step2Determinewhetherarrivalanddepartureflightshavecommonnodesintheirtaxiingroutes.Ifnot,itmeansthattheywontbeconfrontedeachother;otherwise,gotoStep3tocontinuethejudgment;Step3Selectthesamenodesandjudgewhetherarrivalanddepartureflightswillbec

26、onfrontedateveryidenticalnode.Sortthemintheorderofnodesbywhichthedepartureflightpassinsuccession.Supposethatthereare"identicalnodes,andtheorderofnodesbywhichthedepartureflightpassedis1,2,3,".Itispossibletodeterminewhetherarrivalanddepartureflightswillconfrontbyjudgingthetimedifferentiathat

27、theyreachthesenodes.Thefollowingisthecalculationofthetimedifferencethatarrivalanddepartureflightstaxitonode1:Setthetimef一0tostartjudgment,parameterswithsubscript1standforthatofdepartureflights,andparameterswithsubscript2standforthatofarrivalflights.sisthetaxiingdistanceofflights;tisthetaxiingtimeoff

28、lights;Atisthetimedifferencethatarrivalanddepartureflightstaxitoacertainnode.Wenowchoosethetaxiingroutesforarrivalanddepartureflights.ProvidingthatthestartingpointofonerouteisnodeJ,andtheendingpointisnodek,thenthelinearequationforthisrouteis(Yj)(zlxj)一(z)(一Yj)(3)Thedistancefromthearrivalflighttoanyn

29、odeontheoptimalrouteisZ一(z一z2(0)+(一y2(0)(4)Thetaxiingtrackofthearrivalflightisfz2(f)一z2(0)+v2tcosO12一2(0)+sin0Weneedtodeterminetherouteinwhichthearrivalflightlocatesatt一0,aswellasthenodetobepassed.GPSreceivercanpickupthecoordinatesofinitialpositionofarrivalanddepartureflights.74TransactionsofNanjing

30、UniversityofAeronautics&AstronauticsVoI.22SubstitutethecoordinatesofinitialpositionofarrivalflightsintoEq.(3),theroutessatisfyingtheequationaretheoneswheretheflightsmaybelocate.Nowthetaxiingdirectionoftheflightisknownthatconformstothedirectionofthestraightline.thatistosay,0inEq.(5)isknown.Th

31、ensubstituteXorYcoordinatesofthenodesintoEq.(5),iftheysatisfieEq.(5)andtisgreaterthan0,thenodescanberegardedasthenodesbywhichtheflightwillpass.AgainsubstitutethesenodescoordinatesintoEq.(4)andsortoutthenodeofminimumdistance,anditisjustthenodetobepassedbytheflight.Markitasnodea.Herewehaveworkedoutthe

32、nextnodetobepassedbythearrivalflight,aswellasthetaxiingdistanceZcoveredtothenextnode.Thetaxiingdistancescoveredbyarrivalflightsfromnodeatonode1equalstothesumofthelengthofroutesbetweenthetwonodes(Becausetheoptimalrouteshasbeensettled,sohas5),thetaxiingdistance2coveredbythearrivalflighttonode1is25+l(6

33、)Whencalculatingthetaxiingtime,weshouldconsidertwocases:0neisthesituationthattheflightloeatesontherunwayattheinitialtime.Atthispoint,thevelocityattheinitialtimeisnotthetaxiingvelocityonthetaxiway.Asstipulated,theflightstaxiingvelocityshallnotbegreaterthan50km/h.Wemaytemporarilysetthetaxiingvelocitya

34、saconstant,designatedas(e.g.40m/h);Theotheristhecasethattheflightlocatesonthetaxiway.Atthismoment,thevelocitymeasuredwithGPSisjustthetaxiingspeed.Whentheflightisontherunwayattheinitialtime,theresultingtaxiingtimeisf,:+三(7)2Whentheflightisonthetaxiwayattheinitialtime,theresultingtaxiingtimeisf2=一52(8

35、)2Itiseasiertoacquirethetaxiingtimeofthedepartureflight,sinceitlocatesontheparkingapronattheinitialtime.i.e.ataknownnode.Thetaxiingdistancefromtheflighttonode1justequalstothesumofoptimizedroutesfromthestartingpointtonode1.sl:s(9)f,一(1O)lThetimedifferencethatthearrivalandthedepartureflightstaxitonode

36、1isAtItlt2I(11)Whatiscomputedaboveisthetimedifferenceoftheflightsarrivingatthesamenode,westillhavetotakecareofthesituationthattheyconfrontonthetaxiway.Inalltaxiways,thedistanceofthelongestoneisnomorethan530m.Supposethattheflightsconfrontmidwayoftheroute,thetimedifferencethattheflightsreachbothendsof

37、therouteis20satmost.Therefore,wecantakeitgrantedthatitislikelytoconfrontnearthenodeifAtislessthan20s.Incasethatitisgreaterthan20s,thenthenextidenticalnodeiscomparedinthiswayuntilalltheidenticalnodeshavebeencompared.Asforselectingtheoptimalroutesforarrivalflights,itisnecessarytodecidewhetheritwillcon

38、frontwiththedepartureoneheadtohead.Doitasabove.1.3.2SolutionoftheheadtoheadconfrontationTherearetwofactorsbelowwhichshouldbeconsideredtosolveheadtoheadc0nfrontati0nsforsecurityandefficiency:(1)Makesurethattheflightswilltaxiontheschemedoptimalroutescontinuously;(2)Makesurethatarrivalanddeparturefligh

39、tsshallnotconfronteachother.InthispapertheGISgeographicdataarefullyutilizedtosolvethehead-to-headconfrontationofarrivalanddepartureflights.Whendeterminingthetaxiingroutesforflights,calculatethetimethattheflightsgettoeverypointoftheroutes,andensurethattheflightswontconfronthead-to-headontherunwaybyde

40、layingthede.partingtimeofdepartureflightsandloweringthetaxingspeedofarrivalflights.ItisdoneasfolNo.1JIR0ng,eta1.RouteOptimizingAlgorithmofAirportSurfaceBased75lows.Fordepartureflights,wecandelaytheirdepartingtime.Thetimeisestimatedinthisway:Inthepreviouspassage,wehavefiguredoutthetimet2andtlforarriv

41、alanddepartureflightstaxiingtonode1(whichstandsforthesamenodebywhichthedepartureflightpassesfirst).Werequirethatdepartureflightsshouldntreachnode1untilarrivalflightspassbynode1withflcertainextendedtime(setat5s),whichmaybeachievedbydelayingthedepartingtimeofdepartureflights(2一l+5)s.Forarrivalflights,wecanchangetheirtaxiingvelocity.Thetaxiingvelocityiscomputedasfollows:Inthepreviouspassage,wehavegotthetimetlfordepartureflightstaxiingtonode(whichstandsforthesamenodebywhic