Waypoint-Following Guidance Based on Feasibility Algorithms
Unmanned vehicles have become more applicable due to extended research and more advanced technology through the last decades. The vehicles are versatile, hence studying ocean floor and reconnaissance and surveillance are popular areas of application. To perform unmanned operations, waypointfollowing...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
Norges teknisk-naturvitenskapelige universitet, Institutt for teknisk kybernetikk
2011
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-13312 |
id |
ndltd-UPSALLA1-oai-DiVA.org-ntnu-13312 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UPSALLA1-oai-DiVA.org-ntnu-133122013-01-08T13:32:39ZWaypoint-Following Guidance Based on Feasibility AlgorithmsengJensen, Tor MariusNorges teknisk-naturvitenskapelige universitet, Institutt for teknisk kybernetikkInstitutt for teknisk kybernetikk2011ntnudaim:5938MTTK teknisk kybernetikkReguleringsteknikkUnmanned vehicles have become more applicable due to extended research and more advanced technology through the last decades. The vehicles are versatile, hence studying ocean floor and reconnaissance and surveillance are popular areas of application. To perform unmanned operations, waypointfollowing based on guidance, navigation and control systems are used in general. Unfortunately, not every waypoint setup guarantees a feasible trajectory as regards to the vehicle dynamics. Thus, algorithms analyzing the feasibility of the paths and suggesting solutions for infeasible paths have been proposed in this masters thesis. Four different tangent vector calculation methods have been used to develop smooth, parameterized C1-continuous curves as suitable paths between the successive waypoints. The appurtenant path curvature has been calculated and compared against the vehicle dynamics and constraints. Minimum vehicle turning radius is mapped directly to maximum trajectory curvature. When waypoint placement provides infeasible trajectories, three different algorithms of moving, adding or removing waypoints have been suggested tocope with the trajectory curvature. For pure waypoint-following schemes without path generation, adapted velocity and acceptance circle radius have been applied. The adapted reference values are functions of the angle between the neighboring waypoints, and turns out to yield more efficient operations with respect to time and overshooting errors than with constant values. Employing path generation proves that the effect of preturns before approaching waypoints in addition to regulating velocity according to path curvature is beneficial to minimize deviation from waypoints. If, however, the trajectory is infeasible even after velocity adaption, one of the three path altering algorithms may be applied to provide a feasible path.The simulations have been carried out in MATLAB/Simulink on two models; a first order Nomoto autopilot model and a more complex mathematical model of a Viknes 830 unmanned surface vehicle. Despite simulating on boat models in R2, the path planning ideas and trajectory feasibility check can be employed on various types of unmanned vehicles, and -extended to R3. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-13312Local ntnudaim:5938application/pdfinfo:eu-repo/semantics/openAccess |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
ntnudaim:5938 MTTK teknisk kybernetikk Reguleringsteknikk |
spellingShingle |
ntnudaim:5938 MTTK teknisk kybernetikk Reguleringsteknikk Jensen, Tor Marius Waypoint-Following Guidance Based on Feasibility Algorithms |
description |
Unmanned vehicles have become more applicable due to extended research and more advanced technology through the last decades. The vehicles are versatile, hence studying ocean floor and reconnaissance and surveillance are popular areas of application. To perform unmanned operations, waypointfollowing based on guidance, navigation and control systems are used in general. Unfortunately, not every waypoint setup guarantees a feasible trajectory as regards to the vehicle dynamics. Thus, algorithms analyzing the feasibility of the paths and suggesting solutions for infeasible paths have been proposed in this masters thesis. Four different tangent vector calculation methods have been used to develop smooth, parameterized C1-continuous curves as suitable paths between the successive waypoints. The appurtenant path curvature has been calculated and compared against the vehicle dynamics and constraints. Minimum vehicle turning radius is mapped directly to maximum trajectory curvature. When waypoint placement provides infeasible trajectories, three different algorithms of moving, adding or removing waypoints have been suggested tocope with the trajectory curvature. For pure waypoint-following schemes without path generation, adapted velocity and acceptance circle radius have been applied. The adapted reference values are functions of the angle between the neighboring waypoints, and turns out to yield more efficient operations with respect to time and overshooting errors than with constant values. Employing path generation proves that the effect of preturns before approaching waypoints in addition to regulating velocity according to path curvature is beneficial to minimize deviation from waypoints. If, however, the trajectory is infeasible even after velocity adaption, one of the three path altering algorithms may be applied to provide a feasible path.The simulations have been carried out in MATLAB/Simulink on two models; a first order Nomoto autopilot model and a more complex mathematical model of a Viknes 830 unmanned surface vehicle. Despite simulating on boat models in R2, the path planning ideas and trajectory feasibility check can be employed on various types of unmanned vehicles, and -extended to R3. |
author |
Jensen, Tor Marius |
author_facet |
Jensen, Tor Marius |
author_sort |
Jensen, Tor Marius |
title |
Waypoint-Following Guidance Based on Feasibility Algorithms |
title_short |
Waypoint-Following Guidance Based on Feasibility Algorithms |
title_full |
Waypoint-Following Guidance Based on Feasibility Algorithms |
title_fullStr |
Waypoint-Following Guidance Based on Feasibility Algorithms |
title_full_unstemmed |
Waypoint-Following Guidance Based on Feasibility Algorithms |
title_sort |
waypoint-following guidance based on feasibility algorithms |
publisher |
Norges teknisk-naturvitenskapelige universitet, Institutt for teknisk kybernetikk |
publishDate |
2011 |
url |
http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-13312 |
work_keys_str_mv |
AT jensentormarius waypointfollowingguidancebasedonfeasibilityalgorithms |
_version_ |
1716523509843230720 |