IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v457y2023ics0096300323003351.html
   My bibliography  Save this article

Optimal reconstruction of constrained janbu method with ADP and non-integral safety factor

Author

Listed:
  • Zhao, Guijie
  • Sun, Jiayue
  • Yan, Ying
  • Xie, Xiangpeng

Abstract

Notwithstanding the rich research on the slicing method, it is still impossible to accomplish the limit equilibrium analysis of all phases before the evaluation of the safety factor. Bearing this dilemma in view, in this paper, the Janbu method is optimized and reformulated by introducing adaptive dynamic programming (ADP). The fractional average safety factor is no longer used; instead, a sequence of safety factors is used. The critical slip state is chosen as the equilibrium point, the nonlinearity of safety coefficients of adjacent blocks is approximated by the neural network, and the remaining variables and constraints of the system are added to assist in transforming the original redundant safety coefficient evaluation-finding optimal solution problem into a Janbu-qualified cost function. The action network and critic network of ADP accomplish the boundary trajectory solving and safety evaluation, respectively. The validity of the method is verified when the optimized and reorganized framework is applied to solve the critical slip surface of a clay slope.

Suggested Citation

  • Zhao, Guijie & Sun, Jiayue & Yan, Ying & Xie, Xiangpeng, 2023. "Optimal reconstruction of constrained janbu method with ADP and non-integral safety factor," Applied Mathematics and Computation, Elsevier, vol. 457(C).
    • Handle: RePEc:eee:apmaco:v:457:y:2023:i:c:s0096300323003351
    DOI: 10.1016/j.amc.2023.128166
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323003351
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128166?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:457:y:2023:i:c:s0096300323003351. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.