The modified graph search algorithm based on the knowledge dedicated for prediction of the state of mechatronic systems

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The modified shortest path algorithm dedicated for a condition prediction of distributed mechatronic systems is shown in this article. From many of available methods the Dijkstra's algorithm has been selected. Assumed restrictions of the proposed method (graph models containing interrelated groups of failures, effects and their causes) forced the need regarding changes of the structure of applied algorithms and their adjusting to the adopted predictive model. The method for identification and transformation of the current condition in the source vertex of the graph of causes and effects has been also presented by the authors.

Cite

CITATION STYLE

APA

Hetmańczyk, M. P., & Świder, J. (2015). The modified graph search algorithm based on the knowledge dedicated for prediction of the state of mechatronic systems. Advances in Intelligent Systems and Computing, 317. https://doi.org/10.1007/978-3-319-10990-9_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free