Academic literature on the topic 'Smooth paths'

We present a new and innovative method to generate Contour Parallel tool paths using Clothoidal spirals for 2.5D pocket milling. The tool paths generated by the proposed method are more suitable for High Speed Machining compared to the traditional tool paths. Mechanical parts, such as those in Aerospace industry, Mold and Dies industry, etc require large volumes of milling operations. Modern High Speed CNC Machines are used in making of these parts. Although the High Speed CNC machines can provide very high spindle speed, due to various reasons, it has not been possible to use their High speed capabilities to their full extent. Two of the main reasons being, complex pocket geometry and complex tool path geometry. Most pockets are made up of sharp corners. In the traditional contour parallel pocket milling tool paths, as the cutting tool approaches these corners, they have to undergo a sudden change in directions and the acceleration of the tool has to be instantaneously decreased. Also, there is an instantaneous increase in the chip volume and the resultant forces acting on the cutting tool. In our proposed method we smooth these sharp corners of the traditional tool path by using Clothoidal spirals. The Clothoidal curves which have traditionally been used for Highways and Rail track design, have an unique property, according to which, the curvature of the Clothoidal spirals varies linearly with the length of the curve. By using these curves of uniformly varying curvature, we reduce the magnitude of the sudden direction changes that the cutting tool has to undergo at the sharp pocket corners. The cutting tool is subjected to lesser resultant forces and has a comparatively uniform acceleration. Machining time is also expected to be reduced by our proposed method.

Robotics has been the subject of academic study from as early as 1948. For much of this time, study has focused on very specific applications in very well controlled environments. For example, the first commercial robots (1961) were introduced in order to improve the efficiency of production lines. The tasks undertaken by these robots were simple, and all that was required of a control algorithm was speed, repetitiveness and reliability in these environments. Now however, robots are being used to move around autonomously in increasingly unpredictable environments, and the need for robotic control algorithms that can successfully react to such conditions is ever increasing. In addition to this there is an ever-increasing array of robots available, the control algorithms for which are often incompatible. This can result in extensive redesign and large sections of code being re-written for use on different architectures. The thesis presented here is that a new generic approach can be created that provides robust high quality smooth paths and time-optimal path tracking to substantially increase applicability and efficiency of autonomous motion plans. The control system developed to support this thesis is capable of producing high quality smooth paths, and following these paths to a high level of accuracy in a robust and near time-optimal manner. The system can control a variety of robots in environments that contain 2D obstacles of various shapes and sizes. The system is also resilient to sensor error, spatial drift, and wheel-slip. In achieving the above, this system provides previously unavailable functionality by generically creating and tracking high quality paths so that only minor and clear adjustments are required between different robots and also be being capable of operating in environments that contain high levels of perturbation. The system is comprised of five separate novel component algorithms in order to cater for five different motion challenges facing modern robots. Each algorithm provides guaranteed functionality that has previously been unavailable in respect to its challenges. The challenges are: high quality smooth movement to reach n-dimensional goals in regions without obstacles, the navigation of 2D obstacles with guaranteed completeness, high quality smooth movement for ground robots carrying out 2D obstacle navigation, near time-optimal path tracking, and finally, effective wheel-slip detection and compensation. In meeting these challenges the algorithms have tackled adherence to non-holonomic constraints, applicability to a wide range of robots and tasks, fast real-time creation of paths and controls, sensor error compensation, and compensation for perturbation. This thesis presents each of the above algorithms individually. It is shown that existing methods are unable to produce the results provided by this thesis, before detailing the operation of each algorithm. The methodology employed is varied in accordance with each of the five core challenges. However, a common element of methodology throughout the thesis is that of gradient descent within a new type of potential field, which is dynamic and capable of the simultaneous creation of high-quality paths and the controls required to execute them. By relating global to local considerations through subgoals, this methodology (combined with other elements) is shown to be fully capable of achieving the aims of the thesis. It is concluded that the produced system represents a novel and significant contribution as there is no other system (to the author’s knowledge) that provides all of the functionality given. For each component algorithm there are many control systems that provide one or more of its features, but none that are capable of all of the features. Applications for this work are wide ranging as it is comprised of five component algorithms each applicable in their own right. For example, high quality smooth paths may be created and followed in any dimensionality of space if time optimality and obstacle avoidance are not required. Broadly speaking, and in summary, applications are to ground-based robotics in the areas of smooth path planning, time optimal travel, and compensation for unpredictable perturbation.

The limiting behavior of weighted paths associated with the semidefinite program (SDP) map $X^{1/2}SX^{1/2}$ was studied and some applications to error bound analysis and superlinear convergence of a class of primal-dual interior-point methods were provided. A new approach for solving large-scale well-structured sparse SDPs via a saddle point mirror-prox algorithm with ${cal O}(epsilon^{-1})$ efficiency was developed based on exploiting sparsity structure and reformulating SDPs into smooth convex-concave saddle point problems. An iterative solver-based long-step primal-dual infeasible path-following algorithm for convex quadratic programming (CQP) was developed. The search directions of this algorithm were computed by means of a preconditioned iterative linear solver. A uniform bound, depending only on the CQP data, on the number of iterations performed by a preconditioned iterative linear solver was established. A polynomial bound on the number of iterations of this algorithm was also obtained. One efficient ``nearly exact' type of method for solving large-scale ``low-rank' trust region subproblems was proposed by completely avoiding the computations of Cholesky or partial Cholesky factorizations. A computational study of this method was also provided by applying it to solve some large-scale nonlinear programming problems.

Submitted by Regis Baratti Lima Salgado (regiss@fgvmail.br) on 2012-10-09T13:30:32Z No. of bitstreams: 1 TeseRegisBarattiLSalgado_VFim.pdf: 861409 bytes, checksum: 48cbf91a3e1e3ed3d3c91940bfde85ac (MD5)<br>Approved for entry into archive by ÁUREA CORRÊA DA FONSECA CORRÊA DA FONSECA (aurea.fonseca@fgv.br) on 2012-10-22T19:15:00Z (GMT) No. of bitstreams: 1 TeseRegisBarattiLSalgado_VFim.pdf: 861409 bytes, checksum: 48cbf91a3e1e3ed3d3c91940bfde85ac (MD5)<br>Made available in DSpace on 2012-10-23T18:23:36Z (GMT). No. of bitstreams: 1 TeseRegisBarattiLSalgado_VFim.pdf: 861409 bytes, checksum: 48cbf91a3e1e3ed3d3c91940bfde85ac (MD5) Previous issue date: 2012-08-22<br>This thesis extend the theoretical dominance of annuities over non-contingent discount notes; under standard assumptions, we show that full annuitization is optimal even in incomplete annuity markets. Through numerical simulations, we scrutinize factors a ecting annuitization decision, consolidating and extending previous research by taking into account unfair prices, bequest motives, and out-of-pocket medical expenses. We also take into consideration the insurer's risk of default, and relax an implicit assumption in most past models and detach annuitization from retirement, i.e.: we do not presume that consumers are already retired from work when they decide whether or not to annuitize. In line with previous literature, our results originate very high levels of annuitization. Yet, we show that the demand for annuities drops sharply, if preferences are such that the implied optimal consumption path decays with age. We also show that optimal annuitization timing is closely related to the endowments pattern.<br>A inconsistência entre a teoria e o comportamento empírico dos agentes no que tange ao mercado privado de pensões tem se mostrado um dos mais resistentes puzzles presentes na literatura econômica. Em modelos de otimização intertemporal de consumo e poupança sob incerteza em relação ao tempo de vida dos agentes, anuidades são ativos dominantes, anulando ou restringindo fortemente a demanda por ativos cujos retornos não estão relacionados à probabilidade de sobrevivência. Na prática, entretanto, consumidores são extremamente céticos em relação às anuidades. Em oposição ao seguro contra longevidade oferecido pelas anuidades, direitos sobre esses ativos - essencialmente ilíquidos - cessam no caso de morte do titular. Nesse sentido, choques não seguráveis de liquidez e a presença de bequest motives foram consideravelmente explorados como possíveis determinantes da baixa demanda verificada. Apesar dos esforços, o puzzle persiste. Este trabalho amplia a dominância teórica das anuidades sobre ativos não contingentes em mercados incompletos; total na ausência de bequest motives, e parcial, quando os agentes se preocupam com possíveis herdeiros. Em linha com a literatura, simulações numéricas atestam que uma parcela considerável do portfolio ótimo dos agentes seria constituída de anuidades mesmo diante de choques de liquidez, bequest motives, e preços não atuarialmente justos. Em relação a um aspecto relativamente negligenciado pela academia, mostramos que o tempo ótimo de conversão de poupança em anuidades está diretamente relacionado à curva salarial dos agentes. Finalmente, indicamos que, caso as preferências dos agentes sejam tais que o nível de consumo ótimo decaia com a idade, a demanda por anuidades torna-se bastante sensível ao sobrepreço (em relação àquele atuarialmente justo) praticado pela indústria, chegando a níveis bem mais compatíveis com a realidade empírica.

[EN] Nowadays, there are many electronic products that incorporate elements and features coming from the research in the field of mobile robotics. For instance, the well-known vacuum cleaning robot Roomba by iRobot, which belongs to the field of service robotics, one of the most active within the sector. There are also numerous autonomous robotic systems in industrial warehouses and plants. It is the case of Autonomous Guided Vehicles (AGVs), which are able to drive completely autonomously in very structured environments. Apart from industry and consumer electronics, within the automotive field there are some devices that give intelligence to the vehicle, derived in most cases from advances in mobile robotics. In fact, more and more often vehicles incorporate Advanced Driver Assistance Systems (ADAS), such as navigation control with automatic speed regulation, lane change and overtaking assistant, automatic parking or collision warning, among other features. However, despite all the advances there are some problems that remain unresolved and can be improved. Collisions and rollovers stand out among the most common accidents of vehicles with manual or autonomous driving. In fact, it is almost impossible to guarantee driving without accidents in unstructured environments where vehicles share the space with other moving agents, such as other vehicles and pedestrians. That is why searching for techniques to improve safety in intelligent vehicles, either autonomous or manual-assisted driving, is still a trending topic within the robotics community. This thesis focuses on the design of tools and techniques for planning and control of intelligent vehicles in order to improve safety and comfort. The dissertation is divided into two parts, the first one on autonomous driving and the second one on manual-assisted driving. The main link between them is the use of clothoids as mathematical formulation for both trajectory generation and collision detection. Among the problems solved the following stand out: obstacle avoidance, rollover avoidance and advanced driver assistance to avoid collisions with pedestrians.<br>[ES] En la actualidad se comercializan infinidad de productos de electrónica de consumo que incorporan elementos y características procedentes de avances en el sector de la robótica móvil. Por ejemplo, el conocido robot aspirador Roomba de la empresa iRobot, el cual pertenece al campo de la robótica de servicio, uno de los más activos en el sector. También hay numerosos sistemas robóticos autónomos en almacenes y plantas industriales. Es el caso de los vehículos autoguiados (AGVs), capaces de conducir de forma totalmente autónoma en entornos muy estructurados. Además de en la industria y en electrónica de consumo, dentro del campo de la automoción también existen dispositivos que dotan de cierta inteligencia al vehículo, derivados la mayoría de las veces de avances en robótica móvil. De hecho, cada vez con mayor frecuencia los vehículos incorporan sistemas avanzados de asistencia al conductor (ADAS por sus siglas en inglés), tales como control de navegación con regulación automática de velocidad, asistente de cambio de carril y adelantamiento, aparcamiento automático o aviso de colisión, entre otras prestaciones. No obstante, pese a todos los avances siguen existiendo problemas sin resolver y que pueden mejorarse. La colisión y el vuelco destacan entre los accidentes más comunes en vehículos con conducción tanto manual como autónoma. De hecho, la dificultad de conducir en entornos desestructurados compartiendo el espacio con otros agentes móviles, tales como coches o personas, hace casi imposible garantizar la conducción sin accidentes. Es por ello que la búsqueda de técnicas para mejorar la seguridad en vehículos inteligentes, ya sean de conducción autónoma o manual asistida, es un tema que siempre está en auge en la comunidad robótica. La presente tesis se centra en el diseño de herramientas y técnicas de planificación y control de vehículos inteligentes, para la mejora de la seguridad y el confort. La disertación se ha dividido en dos partes, la primera sobre conducción autónoma y la segunda sobre conducción manual asistida. El principal nexo de unión es el uso de clotoides como elemento de generación de trayectorias y detección de colisiones. Entre los problemas que se resuelven destacan la evitación de obstáculos, la evitación de vuelcos y la asistencia avanzada al conductor para evitar colisiones con peatones.<br>[CAT] En l'actualitat es comercialitzen infinitat de productes d'electrònica de consum que incorporen elements i característiques procedents d'avanços en el sector de la robòtica mòbil. Per exemple, el conegut robot aspirador Roomba de l'empresa iRobot, el qual pertany al camp de la robòtica de servici, un dels més actius en el sector. També hi ha nombrosos sistemes robòtics autònoms en magatzems i plantes industrials. És el cas dels vehicles autoguiats (AGVs), els quals són capaços de conduir de forma totalment autònoma en entorns molt estructurats. A més de en la indústria i en l'electrònica de consum, dins el camp de l'automoció també existeixen dispositius que doten al vehicle de certa intel·ligència, la majoria de les vegades derivats d'avanços en robòtica mòbil. De fet, cada vegada amb més freqüència els vehicles incorporen sistemes avançats d'assistència al conductor (ADAS per les sigles en anglés), com ara control de navegació amb regulació automàtica de velocitat, assistent de canvi de carril i avançament, aparcament automàtic o avís de col·lisió, entre altres prestacions. No obstant això, malgrat tots els avanços segueixen existint problemes sense resoldre i que poden millorar-se. La col·lisió i la bolcada destaquen entre els accidents més comuns en vehicles amb conducció tant manual com autònoma. De fet, la dificultat de conduir en entorns desestructurats compartint l'espai amb altres agents mòbils, tals com cotxes o persones, fa quasi impossible garantitzar la conducció sense accidents. És per això que la recerca de tècniques per millorar la seguretat en vehicles intel·ligents, ja siguen de conducció autònoma o manual assistida, és un tema que sempre està en auge a la comunitat robòtica. La present tesi es centra en el disseny d'eines i tècniques de planificació i control de vehicles intel·ligents, per a la millora de la seguretat i el confort. La dissertació s'ha dividit en dues parts, la primera sobre conducció autònoma i la segona sobre conducció manual assistida. El principal nexe d'unió és l'ús de clotoides com a element de generació de trajectòries i detecció de col·lisions. Entre els problemes que es resolen destaquen l'evitació d'obstacles, l'evitació de bolcades i l'assistència avançada al conductor per evitar col·lisions amb vianants.<br>Girbés Juan, V. (2016). Clothoid-based Planning and Control in Intelligent Vehicles (Autonomous and Manual-Assisted Driving) [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/65072<br>TESIS

Segmentar uma imagem consiste em particioná-la em regiões relevantes para uma dada aplicação, como para isolar um objeto de interesse no domínio de uma imagem. A segmentação é um dos problemas mais fundamentais e desafiadores em processamento de imagem e visão computacional. Ela tem desempenhado um papel importante, por exemplo, na pesquisa em neurologia, envolvendo imagens de Ressonância Magnética (RM), para fins de diagnóstico e tratamento de doenças relacionadas com alterações na anatomia do cérebro humano. Métodos de segmentação baseados na transformada imagem- floresta (IFT, Image Foresting Transform), com funções de conexidade suaves, possuem resultados ótimos, segundo o critério da otimalidade dos caminhos descrito no artigo original da IFT, e têm sido usados com sucesso em várias aplicações, como por exemplo na segmentação de imagens RM de 1.5 Tesla. No entanto, esses métodos carecem de restrições de regularização de borda, podendo gerar segmentações com fronteiras muito irregulares e indesejadas. Eles também não distinguem bem entre bordas similares com orientações opostas, e possuem alta sensibilidade à estimativa dos pesos das arestas do grafo, gerando problemas em imagens com efeitos de inomogeneidade. Nesse trabalho são propostas extensões da IFT, do ponto de vista teórico e experimental, através do uso de funções de conexidade não suaves, para a segmentação interativa de imagens por região. A otimalidade dos novos métodos é suportada pela maximização de energias de corte em grafo, ou como o fruto de uma sequência de iterações de otimização de caminhos em grafos residuais. Como resultados principais temos: O projeto de funções de conexidade mais adaptativas e flexíveis, com o uso de pesos dinâmicos, que permitem um melhor tratamento de imagens com forte inomogeneidade. O uso de grafos direcionados, de modo a explorar a polaridade de borda dos objetos na segmentação por região, e o uso de restrições de forma que ajudam a regularizar a fronteira delineada, favorecendo a segmentação de objetos com formas mais regulares. Esses avanços só foram possíveis devido ao uso de funções não suaves. Portanto, a principal contribuição desse trabalho consiste no suporte teórico para o uso de funções não suaves, até então evitadas na literatura, abrindo novas perpectivas na pesquisa de processamento de imagens usando grafos.<br>Segmenting an image consist in to partition it into relevant regions for a given application, as to isolate an object of interest in the domain of an image. Segmentation is one of the most fundamental and challenging problems in image processing and computer vision. It has played an important role, for example, in neurology research, involving images of Magnetic Resonance (MR), for the purposes of diagnosis and treatment of diseases related to changes in the anatomy of the human brain. Segmentation methods based on the Image Foresting Transform (IFT), with smooth connectivity functions, have optimum results, according to the criterion of path optimality described in the original IFT paper, and have been successfully used in many applications as, for example, the segmentation of MR images of 1.5 Tesla. However, these methods present a lack of boundary regularization constraints and may produce segmentations with quite irregular and undesired boundaries. They also do not distinguish well between similar boundaries with opposite orientations, and have high sensitivity to the arc-weight estimation of the graph, producing poor results in images with strong inhomogeneity effects. In this work, we propose extensions of the IFT framework, from the theoretical and experimental points of view, through the use of non-smooth connectivity functions for region-based interactive image segmentation. The optimality of the new methods is supported by the maximization of graph cut energies, or as the result of a sequence of paths optimizations in residual graphs. We have as main results: The design of more adaptive and flexible connectivity functions, with the use of dynamic weights, that allow better handling of images with strong inhomogeneity. The use of directed graphs to exploit the boundary polarity of the objects in region-based segmentation, and the use of shape constraints that help to regularize the segmentation boundary, by favoring the segmentation of objects with more regular shapes. These advances were only made possible by the use of non-smooth functions. Therefore, the main contribution of this work is the theoretical support for the usage of non-smooth functions, which were until now avoided in literature, opening new perspectives in the research of image processing using graphs.

La génération de chemins lisses pour les voitures intelligentes est l’une des conditions les plus importantes pour faire accepter et faciliter la navigation autonome de ces véhicules. Cette thèse propose plusieurs méthodes de génération de chemins lisses pour les véhicules non-holonomes qui permet une continuité intrinsèque de la courbure de navigation et offre par ailleurs une flexibilité accrue pour diverses conditions aux limites. Le chemin de courbure continue est construit en composant plusieurs clothoids, comprenant notamment des segments de lignes et/ou d’arcs, et où chaque clothoid est obtenue par une régulation appropriée de ses paramètres. À partir de ces propriétés, le chemin obtenu est nommé pCCP (parametric Continuous Curvature Path). Le pCCP fournit un diagramme de courbure qui facilite une commande en orientation du véhicule, ce qui permet d'obtenir une évolution lisse de sa trajectoire. Le problème du pCCP local est défini par des configurations initiales et finales (caractérisées pour chacune par une posture et un angle de braquage). Le problème a été étendu pour être aussi général que possible en incluant plusieurs cas. La génération locale de pCCPs, pour des cibles statiques, est spécifiquement décrite, les problèmes ont été divisés en trois problèmes et chaque problème a été décomposé par la suite en plusieurs sous-classes possibles. Pour avoir une flexibilité importante des pCCPs proposés, des cibles dynamiques ont été considérées, obtenant ainsi le dynamic-pCCP (d-pCCP). Un cadre simple mais efficace pour analyser l'état futur de l'évitement des obstacles est appliqué en configuration 4D (3D avec l’ajout d’un axe temporel) en mettant en exergue deux manoeuvres d’évitement possibles, car les évolutions avant et arrière sont appliquées et validées avec plusieurs exemples. Selon une méthodologie similaire pour atteindre les critères de performance liés à la génération des pCCPs, le h-CCP (pour human-pCCP) est proposé en utilisant des modèles expérimentaux comportementaux d’échantillons de conducteurs humains. À partir de quelques sous-expériences, le modèle de conduite humain pour l’évitement d’obstacles, les changements de voie et les mouvements en virage sont extraits et ces modèles ont été inclus pour créer ainsi le h-CCP (obtenu d’une manière similaire au pCCP mais avec différents critères d’optimisation) qui permet d’améliorer considérablement le confort des passagers<br>Smooth path generation for car-like vehicles is one of the most important requisite to facilitate the broadcast use of autonomous navigation. This thesis proposes a smooth path generation method for nonholonomic vehicles which has inherently continuity of curvature and having important flexibility for various boundary conditions. The continuous curvature path is constructed by composing multiple clothoids including lines and/or arc segments, and where each clothoid is obtained by parameter regulation. From those properties the path is named pCCP (parametric Continuous Curvature Path) and provides curvature diagram which facilitates a smooth steering control for path following problem. Local pCCP problem is defined by initial and final tuple configurations (vehicles posture and steering angle). The problem is expanded to be as general as possible by including several cases. The local pCCP generation for steady target pose is specifically described, where the problem is divided into three problems and each problem is also decomposed into several sub-cases. To give more flexibility to the proposed pCCP, dynamic target is considered to obtain dynamic-pCCP (d-CCP). A simple but efficient framework to analyze the future status of obstacle avoidance is applied in 4D (3D with the addition of time axis) configuration and two avoidance maneuvers as front and rear avoidance are applied and validated with several examples. Under the similar methodology in performance criteria of pCCP generation, the human-CCP (h-CCP) is derived from experimental patterns of human driver samples. From several subexperiments, human driving pattern for obstacle avoidance, lane change and cornering motion are extracted and those pattern were included to make the h-CCP (which is obtained with similar way as pCCP but with different optimization criteria) to enhance considerably the passenger comfort

[ES] Debido a la creciente popularidad sobre la variedad de los Vehículos No Tripulados tanto en el campo militar como en el comercial, y de sus capacidades para navegar por diversos entornos, ya sean terrestres, aéreos o marinos, se evidencia que la clásica planificación de trayectorias y movimientos bidimensionales 2D podría no ser suficiente en un futuro inmediato. De esta manera, se debe resaltar que el presente trabajo aborda el problema de los Vehículos Aéreos No Tripulados (UAVs) de ala fija. En este sentido, la necesidad de encontrar una trayectoria navegable en el espacio euclídeo 3D se hace cada vez más necesario. En el caso de los UAV, considerar su cinemática para generar trayectorias suaves en tres dimensiones puede tener un interés significativo para la navegación autónoma aérea. Finalmente, los beneficios adicionales que se pueden producir son importantes. La principal dificultad de este problema es que los vehículos aéreos de características no-holonómicas se ven obligados a avanzar sin la posibilidad de detenerse a través de trayectorias 3D con curvaturas limitadas. En este sentido, se ha investigado la manera de proporcionar una completa caracterización de trayectorias óptimas para UAVs con un radio de giro limitado que se mueve en el plano tridimensional a una velocidad constante. Para completar tales tareas, un planificador de trayectorias no sólo debe proporcionar rutas tridimensionales para alcanzar una posición de destino sin colisionar con obstáculos, sino también debe asegurar que tal trayectoria sea adecuada para los UAVs que poseen propiedades cinemáticas específicas. Por lo tanto, el desarrollo del trabajo ha completado la algoritmia que genera una trayectoria discreta tridimensional al definir un conjunto de puntos 3D, resultantes de una división del espacio euclídeo tridimensional de manera dinámica, determinando las mejores opciones de avance, evitando analizar cada espacio del entorno completo. De esta manera, partiendo de los puntos 3D resultantes de la planificación de trayectoria tridimensional, se ha generado una trayectoria en forma de curva suave construida en función de las limitaciones de giro del UAV (resaltando que es difícil asegurar que el camino resultante cumpla con las restricciones cinemáticas en las tres dimensiones simultáneamente). Finalmente, es importante destacar que a menudo las restricciones mencionadas se calculan secuencialmente y de forma bidimensional, sobre un par de dimensiones desacopladas, lo que limita la capacidad de optimización. Para todo ello, se ha desarrollado un algoritmo de suavizado para un planificador de trayectorias que considera las restricciones cinemáticas tridimensionales completas sin desacoplar las dimensiones.<br>[CA] Debut a la creixent popularitat sobre la varietat dels Vehicles No Tripulats tant en el camp militar com en el comercial, i de les seves capacitats per navegar per diversos entorns, ja siguin terrestres, aeris o marins, s'evidencia que la clàssica planificació de trajectòries i moviments bidimensionals 2D podria no ser suficient en un futur immediat. D'aquesta manera, s'ha de ressaltar que el present treball aborda el problema dels Vehicles Aeris No Tripulats (UAV) d'ala fixa. En aquest sentit, la necessitat de trobar una trajectòria navegable en l'espai euclidià 3D es fa cada vegada més necessari. En el cas dels UAV, considerar la seva cinemàtica per generar trajectòries suaus en tres dimensions pot tenir un interès significatiu per a la navegació autònoma aèria. Finalment, els beneficis addicionals que es poden produir són importants. La principal dificultat d'aquest problema és que els vehicles aeris de característiques no-holonómicas es veuen obligats a avançar sense la possibilitat de detenir-se a través de trajectòries 3D amb curvatures limitades. En aquest sentit, s'ha investigat la manera de proporcionar una completa caracterització de trajectòries òptimes per UAVs amb un radi de gir limitat que es mou en el pla tridimensional a una velocitat constant. Per completar aquestes tasques, un planificador de trajectòries no només ha de proporcionar rutes tridimensionals per assolir una posició de destinació sense col·lisionar amb obstacles, sinó també ha d'assegurar que tal trajectòria sigui adequada per als UAVs que posseeixen propietats cinemàtiques específiques. Per tant, el desenvolupament de la feina ha completat la algorísmia que genera una trajectòria discreta tridimensional a l'definir un conjunt de punts 3D, resultants d'una divisió de l'espai euclidià tridimensional de manera dinàmica, determinant les millors opcions d'avanç, evitant analitzar cada espai de l' entorn complet. D'aquesta manera, partint dels punts 3D resultants de la planificació de trajectòria tridimensional, s'ha generat una trajectòria en forma de corba suau construïda en funció de les limitacions de gir de l'UAV (ressaltant que és difícil assegurar que el camí resultant compleixi amb les restriccions cinemàtiques en les tres dimensions simultàniament). Finalment, és important destacar que sovint les restriccions esmentades es calculen seqöencialment i de forma bidimensional, sobre un parell de dimensions desacoblades, el que limita la capacitat d'optimització. Per tot això, s'ha desenvolupat un algoritme de suavitzat per a un planificador de trajectòries que considera les restriccions cinemàtiques tridimensionals completes sense desacoblar les dimensions.<br>[EN] Due to the growing popularity of the variety of Unmanned Vehicles in both the military and commercial fields, and their capabilities to navigate diverse environments, whether land, air or sea, it is evident that the classic two-dimensional 2D trajectory and motion planning may not be enough in the near future. Thus, it should be noted that this paper addresses the problem of fixed-wing Unmanned Aerial Vehicles (UAVs). In this sense, the need to find a navigable path in 3D Euclidean space becomes more and more necessary. In the case of UAVs, considering their kinematics to generate smooth trajectories in three dimensions may be of significant interest for autonomous air navigation. Finally, the additional benefits that can be produced are important. The main difficulty of this problem is that air vehicles with non-holonomic characteristics are forced to advance without the possibility of stopping through 3D trajectories with limited curvatures. In this regard, research has been conducted to provide a complete characterization of optimal trajectories for UAVs with a limited turning radius that move in the 3D plane at a constant speed. To complete such tasks, a path planner must not only provide three-dimensional paths to reach a target position without colliding with obstacles, but must also ensure that such a path is suitable for UAVs that possess specific kinematic properties. Therefore, the development of the work has completed the algorithm that generates a discrete three-dimensional path by defining a set of 3D points, resulting from a division of the three-dimensional Euclidean space in a dynamic way, determining the best forward options, avoiding to analyze each space of the whole environment. In this way, starting from the 3D points resulting from the three-dimensional path planning, a smooth curve path has been generated, built according to the UAV turning constraints (highlighting that it is difficult to ensure that the resulting path meets the kinematic constraints in the three dimensions simultaneously). Finally, it is important to note that often the constraints mentioned are calculated sequentially and in a two-dimensional shape, on a pair of decoupled dimensions, which limits the ability to optimize. For all this, a smoothing algorithm has been developed for a path planner that considers the complete three-dimensional kinematic constraints without decoupling the dimensions.<br>Este trabajo ha sido parcialmente financiado por el Gobierno de España a través del Ministerio de Economía y Competitividad bajo el proyecto de Investigación DP I2015−71443−R, y por la administración local de la Generalitat Valenciana a través de los proyectos GV /2017/029 y AICO/2019/055. El autor ha sido beneficiario de una beca otorgada por el Instituto de Fomento al Talento Humano (IFTH) (2015−AR2Q9209) a través del Gobierno de Ecuador.<br>Samaniego Riera, FE. (2021). Diseño de nuevos algoritmos de guiado y navegación con evasión de colisiones para vehículos aéreos no tripulados [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/161274<br>TESIS