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.
Sensors (Basel). 2020 Mar 11;20(6):1550. doi: 10.3390/s20061550.
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.
帆船机器人的路径规划是一项具有挑战性的任务,特别是由于这种风力推进船的运动学和动力学建模。该问题分为两个层次。第一个是全局层次,在该层次中规划由航点组成的一般轨迹,可以根据天气条件等变量自动完成,或者使用一些人机接口(地面站)手动定义。在第二个局部层次中,在执行时,帆船应沿着全局路线在每对连续航点之间前进。本文的建议是一种用于 N-Boat(帆船机器人项目)的全局路径生成算法,用于计算从起点到目标点的可行航行路线,同时避免障碍物和边界等危险情况。该算法使用强化学习方法(Q-learning)基于奖励矩阵和一组根据风向变化的动作来计算,以考虑到死区,即帆船无法获得速度的逆风区域。我们的算法生成考虑风向的直线和之字形路径。生成的路径还保证了帆船的安全性和鲁棒性,使其能够在仅依赖于为此全局规划定义的起点和目标点的情况下长时间航行。结果是开发了一种完整的路径规划算法,该算法与之前工作中解决的局部规划器一起使用,可以用于允许 N-Boat 的最终开发,使其成为完全自主的帆船。