Development of an optimal state transition graph for trajectory optimisation of dynamic systems by application of Dijkstra's algorithm

2019 ◽  
Vol 125 ◽  
pp. 569-586 ◽  
Author(s):  
Philani Biyela ◽  
Randhir Rawatlal
2011 ◽  
Vol 2011 (0) ◽  
pp. _1A1-L10_1-_1A1-L10_3
Author(s):  
Kensuke HARADA ◽  
Hiromu ONDA ◽  
Natsuki YAMANOBE ◽  
Eiichi YOSHIDA ◽  
Tokuo TSUJI ◽  
...  

2011 ◽  
Vol 48-49 ◽  
pp. 71-78 ◽  
Author(s):  
Min Hu ◽  
Fang Fang Wu ◽  
Bo Zhu ◽  
Bo Lu ◽  
Jing Lei Pu

It is important and difficult to identify the Hazard before a disaster happen because disaster often happens suddenly. This paper proposes a new method – State Transition Graph, which based on visual data space reconstruction, to identify hazard. The change process of the system state movement from one state to another in a certain period is described by some state transition graphs. The system state, which is safe or hazard, could be distinguished by its state transition graphs. This paper conducted experiments on single-dimension and multi-dimension benchmark data to prove the new method is effectiveness. Especially the result of stimulation experiments, based on the Yangtze River tunnel engineering data, showed that state transition graph identifies hazard easily and has better performances than other method. The State transition graph method is worth further researching.


Sign in / Sign up

Export Citation Format

Share Document