938521.fig.0010a
(a) ( 𝑡 = 2 4 . 2 sec) 
938521.fig.0010b
(b) ( 𝑡 = 2 5 . 3 sec)
938521.fig.0010c
(c) ( 𝑡 = 2 9 . 7 sec)
938521.fig.0010d
(d) ( 𝑡 = 2 4 . 2 sec)
938521.fig.0010e
(e) ( 𝑡 = 2 5 . 3 sec)
938521.fig.0010f
(f) ( 𝑡 = 2 9 . 7 sec)
Figure 10: (a)–(c) Snapshots from the experiment of crossing tracks, proceeding left to right. We are looking at the grid of nodes from the bottom right corner. (d)–(f) Corresponding tracks found by the MCMCDA algorithm at each time step. Reporting sensor nodes are circled in red, postulated tracks are represented by dashed lines, while established tracks are represented by red solid lines. Note that the algorithm makes a bad association at 𝑡 = 2 5 . 3  sec, but corrects for it by 𝑡 = 2 9 . 7  sec.