4 research outputs found
Learning from Experience for Rapid Generation of Local Car Maneuvers
Being able to rapidly respond to the changing scenes and traffic situations
by generating feasible local paths is of pivotal importance for car autonomy.
We propose to train a deep neural network (DNN) to plan feasible and
nearly-optimal paths for kinematically constrained vehicles in small constant
time. Our DNN model is trained using a novel weakly supervised approach and a
gradient-based policy search. On real and simulated scenes and a large set of
local planning problems, we demonstrate that our approach outperforms the
existing planners with respect to the number of successfully completed tasks.
While the path generation time is about 40 ms, the generated paths are smooth
and comparable to those obtained from conventional path planners
Singularity-free Guiding Vector Field for Robot Navigation
Most of the existing path-following navigation algorithms cannot guarantee
global convergence to desired paths or enable following self-intersected
desired paths due to the existence of singular points where navigation
algorithms return unreliable or even no solutions. One typical example arises
in vector-field guided path-following (VF-PF) navigation algorithms. These
algorithms are based on a vector field, and the singular points are exactly
where the vector field diminishes. In this paper, we show that it is
mathematically impossible for conventional VF-PF algorithms to achieve global
convergence to desired paths that are self-intersected or even just simple
closed (precisely, homeomorphic to the unit circle). Motivated by this new
impossibility result, we propose a novel method to transform self-intersected
or simple closed desired paths to non-self-intersected and unbounded
(precisely, homeomorphic to the real line) counterparts in a higher-dimensional
space. Corresponding to this new desired path, we construct a singularity-free
guiding vector field on a higher-dimensional space. The integral curves of this
new guiding vector field is thus exploited to enable global convergence to the
higher-dimensional desired path, and therefore the projection of the integral
curves on a lower-dimensional subspace converge to the physical
(lower-dimensional) desired path. Rigorous theoretical analysis is carried out
for the theoretical results using dynamical systems theory. In addition, we
show both by theoretical analysis and numerical simulations that our proposed
method is an extension combining conventional VF-PF algorithms and trajectory
tracking algorithms. Finally, to show the practical value of our proposed
approach for complex engineering systems, we conduct outdoor experiments with a
fixed-wing airplane in windy environment to follow both 2D and 3D desired
paths.Comment: Accepted for publication in IEEE Trransactions on Robotics (T-RO