The paper is concerned with selection of the algorithm of path planning for a skid-steered mobile robot operating on heterogeneous terrain. Methods of path searching were reviewed and their applicability to particular kinematic structure of a robot was assessed. The Theta* graph search algorithm was selected, because of its property of returning any-angle paths. Because in this method variable terrain type is not considered, necessary changes in algorithm structure were proposed to check homogeneity of the terrain. In order to enable choice of arbitrary optimization criterion, the model of cost dependent on terrain properties was introduced, which includes both longitudinal motion and turning. Operation of the modified algorithm with the introduced cost model was verified by means of simulation against A* reference algorithm often used in path planning tasks.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.