| Autor: |
Silva Junior AGD; Universidade Federal do Rio Grande do Norte, DCA-CT-UFRN, Campus Universitario, Lagoa Nova, Natal, RN 59078-970, Brazil.; Instituto Federal do Rio Grande do Norte, Av. Sen. Salgado Filho, 1559 - Tirol, Natal - RN 59015-000, Brazil., Santos DHD; Universidade Federal do Rio Grande do Norte, DCA-CT-UFRN, Campus Universitario, Lagoa Nova, Natal, RN 59078-970, Brazil., Negreiros APF; Universidade Federal do Rio Grande do Norte, DCA-CT-UFRN, Campus Universitario, Lagoa Nova, Natal, RN 59078-970, Brazil., Silva JMVBS; Instituto Federal do Rio Grande do Norte, Av. Sen. Salgado Filho, 1559 - Tirol, Natal - RN 59015-000, Brazil., Gonçalves LMG; Universidade Federal do Rio Grande do Norte, DCA-CT-UFRN, Campus Universitario, Lagoa Nova, Natal, RN 59078-970, Brazil. |
| Abstrakt: |
Path planning for sailboat robots is a challenging task particularly due to the kinematics and dynamics modelling of such kinds of wind propelled boats. The problem is divided into two layers. The first one is global were a general trajectory composed of waypoints is planned, which can be done automatically based on some variables such as weather conditions or defined by hand using some human-robot interface (a ground-station). In the second local layer, at execution time, the global route should be followed by making the sailboat proceed between each pair of consecutive waypoints. Our proposal in this paper is an algorithm for the global, path generation layer, which has been developed for the N-Boat (The Sailboat Robot project), in order to compute feasible sailing routes between a start and a target point while avoiding dangerous situations such as obstacles and borders. A reinforcement learning approach (Q-Learning) is used based on a reward matrix and a set of actions that changes according to wind directions to account for the dead zone, which is the region against the wind where the sailboat can not gain velocity. Our algorithm generates straight and zigzag paths accounting for wind direction. The path generated also guarantees the sailboat safety and robustness, enabling it to sail for long periods of time, depending only on the start and target points defined for this global planning. The result is the development of a complete path planner algorithm that, together with the local planner solved in previous work, can be used to allow the final developments of an N-Boat making it a fully autonomous sailboat. |
