Skip to main content
. 2026 Nov 3;26(21):6955. doi: 10.3390/s26216955
Algorithm 1 Binary Omni-Greedy Sensor Placement and Orientation
  • Require: 

    Candidate locations L, orientations B, budget M≤L, weights {wj}j=1J, and precomputed responses Bj,a,k and Oj,a at calibrated radius r

  •   1:

    C←⌀, A←L

  •   2:

    zj←1 for j=1,…,J

  •   3:

    for  t=1,…,M  do

  •   4:

           for all a∈A do

  •   5:

                 ga←∑j=1JwjOj,azj

  •   6:

           end for

  •   7:

           at←argmaxa∈Aga

  •   8:

           for k=1,…,K do

  •   9:

                 hk←∑j=1JwjBj,at,kzj

  •  10:

           end for

  •  11:

           kt←argmaxk=1,…,Khk

  •  12:

           C←C∪{(at,β(kt))}

  •  13:

           zj←zj(1−Bj,at,kt) for j=1,…,J

  •  14:

           A←A∖{at}

  •  15:

    end for

  •  16:

    return  C