University of Cambridge > Talks.cam > Engineering Department Structures Research Seminars > Crack-based assessment and retrofit of concrete members

Crack-based assessment and retrofit of concrete members

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mishael Nuh.

The main indicator of damage in concrete structures are existing cracks. In this regard, modern wireless sensing networks can be used to provide continuous measurements of crack displacements, strains, corrosion indicators, temperature and other quantities. In addition, drones equipped with high-resolution cameras and coupled with artificial intelligence (AI) algorithms can provide accurate maps of the cracks and damage in the structure. However, despite the advances in modern technology, a key question remains: how to transform the monitoring data from existing cracks into useful knowledge about the safety of the structure?

To address this question, a kinematic modelling approach has been developed at the University of Liege for various concrete members and regions. This approach is based on an explicit kinematic modelling of the critical cracks (crack widths and slip), and also includes equilibrium conditions and constitutive relationships for the load-bearing mechanisms in the member. The seminar will discuss how this approach can use crack data as an input to predict the complete behaviour and residual load-bearing capacity of cracked members. Furthermore, for members with inadequate residual capacity, a retrofit solution using ultra-high performance fiber reinforced concretes (UHPFRC) will be discussed. It will be shown that the crack-based modelling approach is also well suited for evaluation of the effect of UHPFRC strengthening.

This talk is part of the Engineering Department Structures Research Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity