Design of a Computer Aided Tele-Operation Plan in the Presence of Uncertainties

Abstract Most of the time, a particular Computer Aided Teleoperation (CAT) mission can be performed by several routings. The problem is then to choose the best one available. The choice is linked with routing quantification difficulties due to the presence of uncertainties. This paper aims at modeling and evaluating the various routings of a pre-established mission. To reach this goal, the Generalized Stochastic Petri Nets (GSPN) are used. Some numerical results, illustrating the measurable performances by the GSPN-model, are also presented.