dtnrg-3----Page:28
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
|
Specifying More Complex Adjacencies KB allows a succinct expression of a rule to deduce a predicted adjacency predictedAdjacency :: spindleAdjacency. S : predictedAdjacency [fromNode -> X, toNode -> Uav , adjType -> “PREDICTED”, adjUpAt -> T1, adjDownAt -> T2 ] :- walltime (Tnow), Uav [ trajectory -> Trj1], X [ trajectory -> Trj2 ], trajectory_xing ( Tnow, Trj1, Trj2, [ T1, T2 ] ), !. Such information can be disseminated and used for routing decisions t = Tnow X Uav t = T1 t = T2 Ground node X can form a Predicted Adjacency with some Uav node at t=Tnow if trajectory information is known beforehand |