IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v47y2018i7p1641-1652.html
   My bibliography  Save this article

Modified branching process for the reliability analysis of complex systems: Multiple-robot systems

Author

Listed:
  • Hamed Fazlollahtabar
  • Seyed Taghi Akhavan Niaki

Abstract

Current design practice is usually to produce a safety system which meets a target level of performance that is deemed acceptable by the regulators. Safety systems are designed to prevent or alleviate the consequences of potentially hazardous events. In many modern industries the failure of such systems can lead to whole system breakdown. In reliability analysis of complex systems involving multiple components, it is assumed that the components have different failure rates with certain probabilities. This leads into extensive computational efforts involved in using the commonly employed generating function (GF) and the recursive algorithm to obtain reliability of systems consisting of a large number of components. Moreover, when the system failure results in fatalities it is desirable for the system to achieve an optimal rather than adequate level of performance given the limitations placed on available resources. This paper concerns with developing a modified branching process joint with generating function to handle reliability evaluation of a multi-robot complex system. The availability of the system is modeled to compute the failure probability of the whole system as a performance measure. The results help decision-makers in maintenance departments to analyze critical components of the system in different time periods to prevent system breakdowns.

Suggested Citation

  • Hamed Fazlollahtabar & Seyed Taghi Akhavan Niaki, 2018. "Modified branching process for the reliability analysis of complex systems: Multiple-robot systems," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 47(7), pages 1641-1652, April.
  • Handle: RePEc:taf:lstaxx:v:47:y:2018:i:7:p:1641-1652
    DOI: 10.1080/03610926.2017.1324985
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2017.1324985
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2017.1324985?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:47:y:2018:i:7:p:1641-1652. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.