On the motion planning & control of nonlinear robotic systems

In the last decades, we saw a soaring interest in autonomous robots boosted not only by academia and industry, but also by the ever in- creasing demand from civil users. As a matter of fact, autonomous robots are fast spreading in all aspects of human life, we can see them clean houses, navigate through city traffic, or harvest fruits and vegetables. Almost all commercial drones already exhibit unprecedented and sophisticated skills which makes them suitable for these applications, such as obstacle avoidance, simultaneous localisation and mapping, path planning, visual-inertial odometry, and object tracking. The major limitations of such robotic platforms lie in the limited payload that can carry, in their costs, and in the limited autonomy due to finite battery capability. For this reason researchers start to develop new algorithms able to run even on resource constrained platforms both in terms of computation capabilities and limited types of endowed sensors, focusing especially on very cheap sensors and hardware. The possibility to use a limited number of sensors allowed to scale a lot the UAVs size, while the implementation of new efficient algorithms, performing the same task in lower time, allows for lower autonomy. However, the developed robots are not mature enough to completely operate autonomously without human supervision due to still too big dimensions (especially for aerial vehicles), which make these platforms unsafe for humans, and the high probability of numerical, and decision, errors that robots may make. In this perspective, this thesis aims to review and improve the current state-of-the-art solutions for autonomous navigation from a purely practical point of view. In particular, we deeply focused on the problems of robot control, trajectory planning, environments exploration, and obstacle avoidance

A Partially Randomized Approach to Trajectory Planning and Optimization for Mobile Robots with Flat Dynamics

Motion planning problems are characterized by huge search spaces and complex obstacle structures with no concise mathematical expression. The fixed-wing airplane application considered in this thesis adds differential constraints and point-wise bounds, i. e. an infinite number of equality and inequality constraints. An optimal trajectory planning approach is presented, based on the randomized Rapidly-exploring Random Trees framework (RRT*). The local planner relies on differential flatness of the equations of motion to obtain tree branch candidates that automatically satisfy the differential constraints. Flat output trajectories, in this case equivalent to the airplane's flight path, are designed using Bézier curves. Segment feasibility in terms of point-wise inequality constraints is tested by an indicator integral, which is evaluated alongside the segment cost functional. Although the RRT* guarantees optimality in the limit of infinite planning time, it is argued by intuition and experimentation that convergence is not approached at a practically useful rate. Therefore, the randomized planner is augmented by a deterministic variational optimization technique. To this end, the optimal planning task is formulated as a semi-infinite optimization problem, using the intermediate result of the RRT(*) as an initial guess. The proposed optimization algorithm follows the feasible flavor of the primal-dual interior point paradigm. Discretization of functional (infinite) constraints is deferred to the linear subproblems, where it is realized implicitly by numeric quadrature. An inherent numerical ill-conditioning of the method is circumvented by a reduction-like approach, which tracks active constraint locations by introducing new problem variables. Obstacle avoidance is achieved by extending the line search procedure and dynamically adding obstacle-awareness constraints to the problem formulation. Experimental evaluation confirms that the hybrid approach is practically feasible and does indeed outperform RRT*'s built-in optimization mechanism, but the computational burden is still significant.Bewegungsplanungsaufgaben sind typischerweise gekennzeichnet durch umfangreiche Suchräume, deren vollständige Exploration nicht praktikabel ist, sowie durch unstrukturierte Hindernisse, für die nur selten eine geschlossene mathematische Beschreibung existiert. Bei der in dieser Arbeit betrachteten Anwendung auf Flächenflugzeuge kommen differentielle Randbedingungen und beschränkte Systemgrößen erschwerend hinzu. Der vorgestellte Ansatz zur optimalen Trajektorienplanung basiert auf dem Rapidly-exploring Random Trees-Algorithmus (RRT*), welcher die Suchraumkomplexität durch Randomisierung beherrschbar macht. Der spezifische Beitrag ist eine Realisierung des lokalen Planers zur Generierung der Äste des Suchbaums. Dieser erfordert ein flaches Bewegungsmodell, sodass differentielle Randbedingungen automatisch erfüllt sind. Die Trajektorien des flachen Ausgangs, welche im betrachteten Beispiel der Flugbahn entsprechen, werden mittels Bézier-Kurven entworfen. Die Einhaltung der Ungleichungsnebenbedingungen wird durch ein Indikator-Integral überprüft, welches sich mit wenig Zusatzaufwand parallel zum Kostenfunktional berechnen lässt. Zwar konvergiert der RRT*-Algorithmus (im probabilistischen Sinne) zu einer optimalen Lösung, jedoch ist die Konvergenzrate aus praktischer Sicht unbrauchbar langsam. Es ist daher naheliegend, den Planer durch ein gradientenbasiertes lokales Optimierungsverfahren mit besseren Konvergenzeigenschaften zu unterstützen. Hierzu wird die aktuelle Zwischenlösung des Planers als Initialschätzung für ein kompatibles semi-infinites Optimierungsproblem verwendet. Der vorgeschlagene Optimierungsalgorithmus erweitert das verbreitete innere-Punkte-Konzept (primal dual interior point method) auf semi-infinite Probleme. Eine explizite Diskretisierung der funktionalen Ungleichungsnebenbedingungen ist nicht erforderlich, denn diese erfolgt implizit durch eine numerische Integralauswertung im Rahmen der linearen Teilprobleme. Da die Methode an Stellen aktiver Nebenbedingungen nicht wohldefiniert ist, kommt zusätzlich eine Variante des Reduktions-Ansatzes zum Einsatz, bei welcher der Vektor der Optimierungsvariablen um die (endliche) Menge der aktiven Indizes erweitert wird. Weiterhin wurde eine Kollisionsvermeidung integriert, die in den Teilschritt der Liniensuche eingreift und die Problemformulierung dynamisch um Randbedingungen zur lokalen Berücksichtigung von Hindernissen erweitert. Experimentelle Untersuchungen bestätigen, dass die Ergebnisse des hybriden Ansatzes aus RRT(*) und numerischem Optimierungsverfahren der klassischen RRT*-basierten Trajektorienoptimierung überlegen sind. Der erforderliche Rechenaufwand ist zwar beträchtlich, aber unter realistischen Bedingungen praktisch beherrschbar

Design, development and guidance of the Airborne’s quadrotor

The main goal of the Airborne project is to develop, at technology readiness level 8 (TRL8), a few selected robotic aerial technologies for quick localization of victims by avalanches by equipping drones with two forefront sensors used in SAR operations in case of avalanches, namely the ARVA and RECCO. This thesis focuses on the design, development, and guidance of the TRL8 quadrotor developed during the project. We present and describe the design method that allowed us to obtain an EMI shielded UAV capable of integrating both RECCO and ARVA sensors. Besides, is presented the avionics and power train design and building procedure in order to obtain a modular UAV frame that can be easily carried by rescuers and achieves all the performance benchmarks of the project. Additionally, in addition to the onboard algorithms, a multivariate regressive convolutional neural network whose goal is the localization of the ARVA signal is presented. On guidance, the automatic flight procedure is described, and the onboard waypoint generator algorithm is presented. The goal of this algorithm is the generation and execution of an automatic grid pattern without the need to know the map in advance and without the support of a control ground station (CGS). Moreover, we present an iterative trajectory planner that does not need pre-knowledge of the map and uses Bézier curves to address optimal, dynamically feasible, safe, and re-plannable trajectories. The goal is to develop a method that allows local and fast replannings in case of an obstacle pop up or if some waypoints change. This makes the novel planner suitable to be applied in SAR operations. The introduction of the final version of the quadrotor is supported by internal flight tests and field tests performed in real operative scenarios by the Club Alpino Italiano (CAI)

Distributed cooperative trajectory generation for multiple autonomous vehicles using Pythagorean Hodograph Bézier curves

This dissertation presents a framework for multi-vehicle trajectory generation that enables efficient computation of sets of feasible, collision-free trajectories for teams of autonomous vehicles executing cooperative missions with common objectives. Existing methods for multi-vehicle trajectory generation generally rely on discretization in time or space and, therefore, ensuring safe separation between the paths comes at the expense of an increase in computational complexity. On the contrary, the proposed framework is based on a three-dimensional geometric-dynamic approach that uses continuous Bézier curves with Pythagorean hodographs, a class of polynomial functions with attractive mathematical properties and a collection of highly efficient computational procedures associated with them. The use of these curves is critical to generate cooperative trajectories that are guaranteed to satisfy minimum separation distances, a key feature from a safety standpoint. By the differential flatness property of the dynamic system, the dynamic constraints can be expressed in terms of the trajectories and, therefore, in terms of Bézier polynomials. This allows the proposed framework to efficiently evaluate and, hence, observe the dynamic constraints of the vehicles, and satisfy mission-specific assignments such as simultaneous arrival at predefined locations. The dissertation also addresses the problem of distributing the computation of the trajectories over the vehicles, in order to prevent a single point of failure, inherently present in a centralized approach. The formulated cooperative trajectory-generation framework results in a semi-infinite programming problem, that falls under the class of nonsmooth optimization problems. The proposed distributed algorithm combines the bundle method, a widely used solver for nonsmooth optimization problems, with a distributed nonlinear programming method. In the latter, a distributed formulation is obtained by introducing local estimates of the vector of optimization variables and leveraging on a particular structure, imposed on the local minimizer of an equivalent centralized optimization problem

Multi Vehicle Trajectory Planning On Road Networks

When multiple autonomous vehicles work in a shared space, such as in a surface mine or warehouse, they often travel along specified paths through a static road network. Although these vehicles’ actions and performance are coupled, their motion is often planned myopically or omits cooperation beyond avoiding collisions reactively. More desirable solutions could be achieved by coordinating and planning actions ahead of time. To make multi-vehicle systems more productive and efficient, the thesis introduces planning methods that can optimise for travel time, energy consumption, and trajectory smoothness. Vehicle motion is coordinated by using motion models that combine all trajectories, and avoid collisions. Mathematical programming is then used to find optimised solutions. The proposed methods are shown to significantly reduce solution costs compared to an approach based on common driving practices. As the number of vehicles and interactions between them increases, the number of solutions grows exponentially, making finding a solution computationally challenging. A major aim here was to find high quality solutions within practical computation times. To achieve this, techniques were developed that exploit the structure of the problems. This includes a heuristic algorithm that scales better with problem size, and is combined with the mathematical programming techniques to reduce their complexity. These were found to significantly reduce computation times, trading off marginal solution quality

Clothoid-based Planning and Control in Intelligent Vehicles (Autonomous and Manual-Assisted Driving)

[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.[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.[CA] 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.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/65072TESI

Surgical Subtask Automation for Intraluminal Procedures using Deep Reinforcement Learning

Intraluminal procedures have opened up a new sub-field of minimally invasive surgery that use flexible instruments to navigate through complex luminal structures of the body, resulting in reduced invasiveness and improved patient benefits. One of the major challenges in this field is the accurate and precise control of the instrument inside the human body. Robotics has emerged as a promising solution to this problem. However, to achieve successful robotic intraluminal interventions, the control of the instrument needs to be automated to a large extent. The thesis first examines the state-of-the-art in intraluminal surgical robotics and identifies the key challenges in this field, which include the need for safe and effective tool manipulation, and the ability to adapt to unexpected changes in the luminal environment. To address these challenges, the thesis proposes several levels of autonomy that enable the robotic system to perform individual subtasks autonomously, while still allowing the surgeon to retain overall control of the procedure. The approach facilitates the development of specialized algorithms such as Deep Reinforcement Learning (DRL) for subtasks like navigation and tissue manipulation to produce robust surgical gestures. Additionally, the thesis proposes a safety framework that provides formal guarantees to prevent risky actions. The presented approaches are evaluated through a series of experiments using simulation and robotic platforms. The experiments demonstrate that subtask automation can improve the accuracy and efficiency of tool positioning and tissue manipulation, while also reducing the cognitive load on the surgeon. The results of this research have the potential to improve the reliability and safety of intraluminal surgical interventions, ultimately leading to better outcomes for patients and surgeons

Trajectory optimization for mobile manipulator motion planning

State-of-the-art robotics research has been progressively focusing on autonomous robots that can operate in unconstrained environments and interact with people. Specifically, manipulation tasks in Ambient Assisted Living environments are complex, involving an unknown number of parameters. Recent years show a trend of successfully applied machine learning approaches affecting day-to-day life. Similar tendencies are perceivable in robotics, existing methods being enhanced with learning-based components. This thesis studies approaches for incorporating task-specific knowledge into the motion planning process that can be shared across a heterogeneous fleet of robots. A step towards data-driven strategies will allow the field to break away from manuallytweaked, heuristics- or state-machine-based solutions and provide good scaling properties, while maintaining operation safety around humans at a very high level. The presented work proposes a motion planning framework employing Learning from Demonstration to encode task-specific motions, facilitating skill-transfer and improving state-of-the-art in motion planning. Resulting algorithms are compared against other methods in a series of everyday tasks. While different optimisation methods have different benefits, it is possible to build them into systems that both generalise and scale well with the number of tasks and number of robot platforms. This thesis shows that optimisation-based planners are ideal for incorporating prior knowledge into a motion-planning system