3,051 research outputs found
Autonomous Exploration over Continuous Domains
Motion planning is an essential aspect of robot autonomy, and as such it has been studied for decades, producing a wide range of planning methodologies. Path planners are generally categorised as either trajectory optimisers or sampling-based planners. The latter is the predominant planning paradigm as it can resolve a path efficiently while explicitly reasoning about path safety. Yet, with a limited budget, the resulting paths are far from optimal. In contrast, state-of-the-art trajectory optimisers explicitly trade-off between path safety and efficiency to produce locally optimal paths. However, these planners cannot incorporate updates from a partially observed model such as an occupancy map and fail in planning around information gaps caused by incomplete sensor coverage. Autonomous exploration adds another twist to path planning. The objective of exploration is to safely and efficiently traverse through an unknown environment in order to map it. The desired output of such a process is a sequence of paths that efficiently and safely minimise the uncertainty of the map. However, optimising over the entire space of trajectories is computationally intractable. Therefore, most exploration algorithms relax the general formulation by optimising a simpler one, for example finding the single next best view, resulting in suboptimal performance. This thesis investigates methodologies for optimal and safe exploration over continuous paths. Contrary to existing exploration algorithms that break exploration into independent sub-problems of finding goal points and planning safe paths to these points, our holistic approach simultaneously optimises the coupled problems of where and how to explore. Thus, offering a shift in paradigm from next best view to next best path. With exploration defined as an optimisation problem over continuous paths, this thesis explores two different optimisation paradigms; Bayesian and functional
Learning to represent surroundings, anticipate motion and take informed actions in unstructured environments
Contemporary robots have become exceptionally skilled at achieving specific tasks in structured environments. However, they often fail when faced with the limitless permutations of real-world unstructured environments. This motivates robotics methods which learn from experience, rather than follow a pre-defined set of rules. In this thesis, we present a range of learning-based methods aimed at enabling robots, operating in dynamic and unstructured environments, to better understand their surroundings, anticipate the actions of others, and take informed actions accordingly
Path Signatures for Diversity in Probabilistic Trajectory Optimisation
Motion planning can be cast as a trajectory optimisation problem where a cost
is minimised as a function of the trajectory being generated. In complex
environments with several obstacles and complicated geometry, this optimisation
problem is usually difficult to solve and prone to local minima. However,
recent advancements in computing hardware allow for parallel trajectory
optimisation where multiple solutions are obtained simultaneously, each
initialised from a different starting point. Unfortunately, without a strategy
preventing two solutions to collapse on each other, naive parallel optimisation
can suffer from mode collapse diminishing the efficiency of the approach and
the likelihood of finding a global solution. In this paper we leverage on
recent advances in the theory of rough paths to devise an algorithm for
parallel trajectory optimisation that promotes diversity over the range of
solutions, therefore avoiding mode collapses and achieving better global
properties. Our approach builds on path signatures and Hilbert space
representations of trajectories, and connects parallel variational inference
for trajectory estimation with diversity promoting kernels. We empirically
demonstrate that this strategy achieves lower average costs than competing
alternatives on a range of problems, from 2D navigation to robotic manipulators
operating in cluttered environments
- …