Convex relaxation for efficient sensor layout optimization in large‐scale structures subjected to moving loads

  • Bartłomiej Błachowski
    Institute of Fundamental Technological Research Polish Academy of Sciences Warsaw Poland
  • Andrzej Świercz
    Institute of Fundamental Technological Research Polish Academy of Sciences Warsaw Poland
  • Mariusz Ostrowski
    Institute of Fundamental Technological Research Polish Academy of Sciences Warsaw Poland
  • Piotr Tauzowski
    Institute of Fundamental Technological Research Polish Academy of Sciences Warsaw Poland
  • Piotr Olaszek
    Road and Bridge Research Institute Warsaw Poland
  • Łukasz Jankowski
    Institute of Fundamental Technological Research Polish Academy of Sciences Warsaw Poland

Description

<jats:title>Abstract</jats:title><jats:p>This paper proposes a computationally effective framework for load‐dependent optimal sensor placement in large‐scale civil engineering structures subjected to moving loads. Two common problems are addressed: selection of modes to be monitored and computational effectiveness. Typical sensor placement methods assume that the set of modes to be monitored is known. In practice, determination of such modes of interest is not straightforward. A practical approach is proposed that facilitates the selection of modes in a quasi‐automatic way based on the structural response at the candidate sensor locations to typical operational loads. The criterion used to assess sensor placement is based on Kammer's Effective Independence (EFI). However, in contrast to typical implementations of EFI, which treat the problem as a computationally demanding discrete problem and use greedy optimization, an approach based on convex relaxation is proposed. A notion of sensor density is applied, which converts the original combinatorial problem into a computationally tractable continuous optimization problem. The proposed framework is tested in application to a real tied‐arch railway bridge located in central Poland.</jats:p>

Journal

Citations (1)*help

See more

Report a problem

Back to top