An improved Dynamic Z* algorithm for rapid replanning of energy-efficient paths

2015-2016 > Academic research: refereed > Refereed conference paperpreprint_postprin

Rapid replanning of energy-efficient paths for navigation on uneven terrains

2015-2016 > Academic research: refereed > Refereed conference paperAccepted ManuscriptPublishe

Rapidly replanning A*

2016-2017 > Academic research: refereed > Refereed conference paper201804_a bcmaAccepted ManuscriptPublishe

Development and demonstration of an on-board mission planner for helicopters

Mission management tasks can be distributed within a planning hierarchy, where each level of the hierarchy addresses a scope of action, and associated time scale or planning horizon, and requirements for plan generation response time. The current work is focused on the far-field planning subproblem, with a scope and planning horizon encompassing the entire mission and with a response time required to be about two minutes. The far-feld planning problem is posed as a constrained optimization problem and algorithms and structural organizations are proposed for the solution. Algorithms are implemented in a developmental environment, and performance is assessed with respect to optimality and feasibility for the intended application and in comparison with alternative algorithms. This is done for the three major components of far-field planning: goal planning, waypoint path planning, and timeline management. It appears feasible to meet performance requirements on a 10 Mips flyable processor (dedicated to far-field planning) using a heuristically-guided simulated annealing technique for the goal planner, a modified A* search for the waypoint path planner, and a speed scheduling technique developed for this project

Multiobjective path planning on uneven terrains based on NAMOA*

2015-2016 > Academic research: refereed > Refereed conference paperAccepted ManuscriptPublishe

Design of Environment Aware Planning Heuristics for Complex Navigation Objectives

A heuristic is the simplified approximations that helps guide a planner in deducing the best way to move forward. Heuristics are valued in many modern AI algorithms and decision-making architectures due to their ability to drastically reduce computation time. Particularly in robotics, path planning heuristics are widely leveraged to aid in navigation and exploration. As the robotic platform explores and navigates, information about the world can and should be used to augment and update the heuristic to guide solutions. Complex heuristics that can account for environmental factors, robot capabilities, and desired actions provide optimal results with little wasted exploration, but are computationally expensive. This thesis demonstrates results of research into simplifying heuristics that maintains the performance improvements from complicated heuristics. The research presented is validated on two complex robotic tasks: stealth planning and energy efficient planning. The stealth heuristic was created to inform a planner and allow a ground robot to navigate unknown environments in a less visible manner. Due to the highly uncertain nature of the world (where unknown observers exist) this heuristic implemented was instrumental to enabling the first high-uncertainty stealth planner. Heuristic guidance is further explored for use in energy efficient planning, where a machine learning approach is used to generate a heuristic measure. This thesis demonstrates effective learned heuristics that simplify convergence time and accounts for the complexities of environment. A reduction of 60% in required compute time for planning was found

Planning Algorithms for Multi-Robot Active Perception

A fundamental task of robotic systems is to use on-board sensors and perception algorithms to understand high-level semantic properties of an environment. These semantic properties may include a map of the environment, the presence of objects, or the parameters of a dynamic field. Observations are highly viewpoint dependent and, thus, the performance of perception algorithms can be improved by planning the motion of the robots to obtain high-value observations. This motivates the problem of active perception, where the goal is to plan the motion of robots to improve perception performance. This fundamental problem is central to many robotics applications, including environmental monitoring, planetary exploration, and precision agriculture. The core contribution of this thesis is a suite of planning algorithms for multi-robot active perception. These algorithms are designed to improve system-level performance on many fronts: online and anytime planning, addressing uncertainty, optimising over a long time horizon, decentralised coordination, robustness to unreliable communication, predicting plans of other agents, and exploiting characteristics of perception models. We first propose the decentralised Monte Carlo tree search algorithm as a generally-applicable, decentralised algorithm for multi-robot planning. We then present a self-organising map algorithm designed to find paths that maximally observe points of interest. Finally, we consider the problem of mission monitoring, where a team of robots monitor the progress of a robotic mission. A spatiotemporal optimal stopping algorithm is proposed and a generalisation for decentralised monitoring. Experimental results are presented for a range of scenarios, such as marine operations and object recognition. Our analytical and empirical results demonstrate theoretically-interesting and practically-relevant properties that support the use of the approaches in practice

Planning for steerable needles in neurosurgery

The increasing adoption of robotic-assisted surgery has opened up the possibility to control innovative dexterous tools to improve patient outcomes in a minimally invasive way. Steerable needles belong to this category, and their potential has been recognised in various surgical fields, including neurosurgery. However, planning for steerable catheters' insertions might appear counterintuitive even for expert clinicians. Strategies and tools to aid the surgeon in selecting a feasible trajectory to follow and methods to assist them intra-operatively during the insertion process are currently of great interest as they could accelerate steerable needles' translation from research to practical use. However, existing computer-assisted planning (CAP) algorithms are often limited in their ability to meet both operational and kinematic constraints in the context of precise neurosurgery, due to its demanding surgical conditions and highly complex environment. The research contributions in this thesis relate to understanding the existing gap in planning curved insertions for steerable needles and implementing intelligent CAP techniques to use in the context of neurosurgery. Among this thesis contributions showcase (i) the development of a pre-operative CAP for precise neurosurgery applications able to generate optimised paths at a safe distance from brain sensitive structures while meeting steerable needles kinematic constraints; (ii) the development of an intra-operative CAP able to adjust the current insertion path with high stability while compensating for online tissue deformation; (iii) the integration of both methods into a commercial user front-end interface (NeuroInspire, Renishaw plc.) tested during a series of user-controlled needle steering animal trials, demonstrating successful targeting performances. (iv) investigating the use of steerable needles in the context of laser interstitial thermal therapy (LiTT) for maesial temporal lobe epilepsy patients and proposing the first LiTT CAP for steerable needles within this context. The thesis concludes with a discussion of these contributions and suggestions for future work.Open Acces

Robust Trajectory Planning for Autonomous Parafoils under Wind Uncertainty

A key challenge facing modern airborne delivery systems, such as parafoils, is the ability to accurately and consistently deliver supplies into di cult, complex terrain. Robustness is a primary concern, given that environmental wind disturbances are often highly uncertain and time-varying, coupled with under-actuated dynamics and potentially narrow drop zones. This paper presents a new on-line trajectory planning algorithm that enables a large, autonomous parafoil to robustly execute collision avoidance and precision landing on mapped terrain, even with signi cant wind uncertainties. This algorithm is designed to handle arbitrary initial altitudes, approach geometries, and terrain surfaces, and is robust to wind disturbances which may be highly dynamic throughout the terminal approach. Explicit, real-time wind modeling and classi cation is used to anticipate future disturbances, while a novel uncertainty-sampling technique ensures that robustness to possible future variation is e ciently maintained. The designed cost-to-go function enables selection of partial paths which intelligently trade o between current and reachable future states. Simulation results demonstrate that the proposed algorithm reduces the worst-case impact of wind disturbances relative to state-of-the-art approaches.Charles Stark Draper Laborator