52,001 research outputs found
Interaction-aware Kalman Neural Networks for Trajectory Prediction
Forecasting the motion of surrounding obstacles (vehicles, bicycles,
pedestrians and etc.) benefits the on-road motion planning for intelligent and
autonomous vehicles. Complex scenes always yield great challenges in modeling
the patterns of surrounding traffic. For example, one main challenge comes from
the intractable interaction effects in a complex traffic system. In this paper,
we propose a multi-layer architecture Interaction-aware Kalman Neural Networks
(IaKNN) which involves an interaction layer for resolving high-dimensional
traffic environmental observations as interaction-aware accelerations, a motion
layer for transforming the accelerations to interaction aware trajectories, and
a filter layer for estimating future trajectories with a Kalman filter network.
Attributed to the multiple traffic data sources, our end-to-end trainable
approach technically fuses dynamic and interaction-aware trajectories boosting
the prediction performance. Experiments on the NGSIM dataset demonstrate that
IaKNN outperforms the state-of-the-art methods in terms of effectiveness for
traffic trajectory prediction.Comment: 8 pages, 4 figures, Accepted for IEEE Intelligent Vehicles Symposium
(IV) 202
Design of a Low-complexity Graph-Based Motion-Planning Algorithm for Autonomous Vehicles
In the development of autonomous vehicles, the design of real-time motion-planning is a crucial problem. The computation of the vehicle trajectory requires the consideration of safety, dynamic and comfort aspects. Moreover, the prediction of the vehicle motion in the surroundings and the real-time planning of the autonomous vehicle trajectory can be complex tasks. The goal of this paper is to present low-complexity motion-planning for overtaking scenarios in parallel traffic. The developed method is based on the generation of a graph, which contains feasible vehicle trajectories. The reduction of the complexity in the real-time computation is achieved through the reduction of the graph with clustering. In the motion-planning algorithm, the predicted motion of the surrounding vehicles is taken into consideration. The prediction algorithm is based on density functions of the surrounding vehicle motion, which are developed through real measurements. The resulted motion-planning algorithm is able to guarantee a safe and comfortable trajectory for the autonomous vehicle. The effectiveness of the method is illustrated through simulation examples using a high-fidelity vehicle dynamic simulator
Goal Directed Approach to Autonomous Motion Planning for Unmanned Vehicles
Advancement in the field of autonomous motion planning has enabled the realisation of fully autonomous unmanned vehicles. Sampling based motion planning algorithms have shown promising prospects in generating fast, effective and practical solutions to different motion planning problems in unmanned vehicles for both civilian and military applications. But the goal bias introduced by heuristic probability shaping to generate faster solution may result in local collisions. A simple, real-time method is proposed for goal direction by preferential selection of a state from a sampled pair of random state, based on the distance to goal. This limits the graph motions resulting in smaller data structure, making the algorithm optimised for time and solution length. This would enable unmanned vehicles to take shorter paths and avoid collisions in obstacle rich environment. The approach is analysed on a sampling based algorithm, rapidly-exploring random tree (RRT) which computes motion plans under constrain of time. This paper proposes an algorithm called ’goal directed RRT (GRRT)’ building on the basic RRT algorithm, providing an alternative to probabilistic goal biasing, thereby avoiding local collision. The approach is evaluated by benchmarking it with RRT algorithm for kinematic car, dynamic car and a quadrotor and the results show improvements in length of the motion plans and the time of computing
Coverage and Time-optimal Motion Planning for Autonomous Vehicles
Autonomous vehicles are rapidly advancing with a variety of applications, such as area surveillance, environment mapping, and intelligent transportation. These applications require coverage and/or time-optimal motion planning, where the major challenges include uncertainties in the environment, motion constraints of vehicles, limited energy resources and potential failures. While dealing with these challenges in various capacities, this dissertation addresses three fundamental motion planning problems: (1) single-robot complete coverage in unknown environment, (2) multi-robot resilient and efficient coverage in unknown environment, and (3) time-optimal risk-aware motion planning for curvature-constrained vehicles.
First, the ε* algorithm is developed for online coverage path planning in unknown environment using a single autonomous vehicle. It is computationally efficient, and can generate the desired back-and-forth path with less turns and overlappings. ε* prevents the local extrema problem, thus can guarantee complete coverage. Second, the CARE algorithm is developed which extends ε* for multi-robot resilient and efficient coverage in unknown environment. In case of failures, CARE guarantees complete coverage via dynamic task reallocations of other vehicles, hence provides resilience. Moreover, it reallocates idling vehicles to support others in their tasks, hence improves efficiency. Finally, the T* algorithm is developed to find the time-optimal risk-aware path for curvature-constrained vehicles. We present a novel risk function based on the concept of collision time, and integrate it with the time cost for optimization.
The above-mentioned algorithms have been validated via simulations in complex scenarios and/or real experiments, and the results have shown clear advantages over existing popular approaches
Motion Planning
Motion planning is a fundamental function in robotics and numerous intelligent machines. The global concept of planning involves multiple capabilities, such as path generation, dynamic planning, optimization, tracking, and control. This book has organized different planning topics into three general perspectives that are classified by the type of robotic applications. The chapters are a selection of recent developments in a) planning and tracking methods for unmanned aerial vehicles, b) heuristically based methods for navigation planning and routes optimization, and c) control techniques developed for path planning of autonomous wheeled platforms
Human Motion Trajectory Prediction: A Survey
With growing numbers of intelligent autonomous systems in human environments,
the ability of such systems to perceive, understand and anticipate human
behavior becomes increasingly important. Specifically, predicting future
positions of dynamic agents and planning considering such predictions are key
tasks for self-driving vehicles, service robots and advanced surveillance
systems. This paper provides a survey of human motion trajectory prediction. We
review, analyze and structure a large selection of work from different
communities and propose a taxonomy that categorizes existing methods based on
the motion modeling approach and level of contextual information used. We
provide an overview of the existing datasets and performance metrics. We
discuss limitations of the state of the art and outline directions for further
research.Comment: Submitted to the International Journal of Robotics Research (IJRR),
37 page
- …