scholarly journals Motion Planning for Autonomous Vehicles Considering Longitudinal and Lateral Dynamics Coupling

2020 ◽  
Vol 10 (9) ◽  
pp. 3180 ◽  
Author(s):  
Dongfang Dang ◽  
Feng Gao ◽  
Qiuxia Hu
Keyword(s):  
Motion Planning ◽  
Autonomous Vehicles ◽  
Autonomous Vehicle ◽  
Dynamical Model ◽  
Planning Problem ◽  
Original Design ◽  
Automatic Driving ◽  
Wide Range ◽  
Planning Algorithm ◽  
Dynamical Coupling

Vehicles are highly coupled and multi-degree nonlinear systems. The establishment of an appropriate vehicle dynamical model is the basis of motion planning for autonomous vehicles. With the development of autonomous vehicles from L2 to L3 and beyond, the automatic driving system is required to make decisions and plans in a wide range of speeds and on bends with large curvature. In order to make precise and high-quality control maneuvers, it is important to account for the effects of dynamical coupling in these working conditions. In this paper, a new single-coupled dynamical model (SDM) is proposed to deal with the various dynamical coupling effects by identifying and simplifying the complicated one. An autonomous vehicle motion planning problem is then formulated using the nonlinear model predictive control theory (NMPC) with the SDM constraint (NMPC-SDM). We validated the NMPC-SDM with hardware-in-the-loop (HIL) experiments to evaluate improvements to control performance by comparing with the planners original design, using the kinematic and single-track models. The comparative results show the superiority of the proposed motion planning algorithm in improving the maneuverability and tracking performance.

scholarly journals Inverse kinematics-based motion planning for dual-arm robot with orientation constraints

2019 ◽  
Vol 16 (2) ◽  
pp. 172988141983685 ◽  
Author(s):  
Jiangping Wang ◽  
Shirong Liu ◽  
Botao Zhang ◽  
Changbin Yu
Keyword(s):  
Motion Planning ◽  
Joint Space ◽  
Inverse Kinematic ◽  
Planning Problem ◽  
Constraint Manifold ◽  
Wide Range ◽  
Planning Algorithm ◽  
Motion Paths ◽  
Dual Arm Robot ◽  
Dual Arm

This article proposes an efficient and probabilistic complete planning algorithm to address motion planning problem involving orientation constraints for decoupled dual-arm robots. The algorithm is to combine sampling-based planning method with analytical inverse kinematic calculation, which randomly samples constraint-satisfying configurations on the constraint manifold using the analytical inverse kinematic solver and incrementally connects them to the motion paths in joint space. As the analytical inverse kinematic solver is applied to calculate constraint-satisfying joint configurations, the proposed algorithm is characterized by its efficiency and accuracy. We have demonstrated the effectiveness of our approach on the Willow Garage’s PR2 simulation platform by generating trajectory across a wide range of orientation-constrained scenarios for dual-arm manipulation.

scholarly journals Review on path planning algorithm for unmanned aerial vehicles

2021 ◽  
Vol 24 (2) ◽  
pp. 1017
Author(s):  
Nurul Saliha Amani Ibrahim ◽  
Faiz Asraf Saparudin
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Autonomous Vehicles ◽  
Autonomous Vehicle ◽  
Optimal Path ◽  
Computation Time ◽  
Planning Problem ◽  
Aerial Vehicles ◽  
Planning Algorithm ◽  
Path Planning Algorithm

The path planning problem has been a crucial topic to be solved in autonomous vehicles. Path planning consists operations to find the route that passes through all of the points of interest in a given area. Several algorithms have been proposed and outlined in the various literature for the path planning of autonomous vehicle especially for unmanned aerial vehicles (UAV). The algorithms are not guaranteed to give full performance in each path planning cases but each one of them has their own specification which makes them suitable in sophisticated situation. This review paper evaluates several possible different path planning approaches of UAVs in terms optimal path, probabilistic completeness and computation time along with their application in specific problems.

scholarly journals An adaptive motion planning algorithm for obstacle avoidance in autonomous vehicle parking

2021 ◽  
Vol 10 (3) ◽  
pp. 687
Author(s):  
Naitik Nakrani ◽  
Maulin M. Joshi
Keyword(s):  
Motion Planning ◽  
Obstacle Avoidance ◽  
Vehicle Dynamics ◽  
Autonomous Vehicles ◽  
Intelligent Design ◽  
Autonomous Vehicle ◽  
Planning Techniques ◽  
Vehicle Localization ◽  
Adaptive Motion ◽  
Planning Algorithm

In the recent era, machine learning-based autonomous vehicle parking and obstacle avoidance navigation have drawn increased attention. An intelligent design is needed to solve the autonomous vehicles related problems. Presently, autonomous parking systems follow path planning techniques that generally do not possess a quality and a skill of natural adapting behavior of a human. Most of these designs are built on pre-defined and fixed criteria. It needs to be adaptive with respect to the vehicle dynamics. A novel adaptive motion planning algorithm is proposed in this paper that incorporates obstacle avoidance capability into a standalone parking controller that is kept adaptive to vehicle dimensions to provide human-like intelligence for parking problems. This model utilizes fuzzy membership thresholds concerning vehicle dimensions and vehicle localization to enhance the vehicle’s trajectory during parking when taking into consideration obstacles. It is generalized for all segments of cars, and simulation results prove the proposed algorithm’s effectiveness.

scholarly journals Design of a Low-complexity Graph-Based Motion-Planning Algorithm for Autonomous Vehicles

2020 ◽  
Vol 10 (21) ◽  
pp. 7716
Author(s):  
Tamás Hegedűs ◽  
Balázs Németh ◽  
Péter Gáspár
Keyword(s):  
Motion Planning ◽  
Real Time ◽  
Autonomous Vehicles ◽  
Autonomous Vehicle ◽  
Low Complexity ◽  
The Real ◽  
Time Motion ◽  
Planning Algorithm ◽  
Vehicle Motion ◽  
Vehicle Trajectory

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.

scholarly journals Model Contrast of Autonomous Vehicle Impacts on Traffic

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Derek Hungness ◽  
Raj Bridgelall
Keyword(s):  
Autonomous Vehicles ◽  
Travel Demand ◽  
Autonomous Vehicle ◽  
Sociodemographic Factors ◽  
Vehicle Miles Traveled ◽  
The Road ◽  
Traffic Conditions ◽  
Demand Models ◽  
Wide Range ◽  
Potential Benefits

The adoption of connected and autonomous vehicles (CAVs) is in its infancy. Therefore, very little is known about their potential impacts on traffic. Meanwhile, researchers and market analysts predict a wide range of possibilities about their potential benefits and the timing of their deployments. Planners traditionally use various types of travel demand models to forecast future traffic conditions. However, such models do not yet integrate any expected impacts from CAV deployments. Consequently, many long-range transportation plans do not yet account for their eventual deployment. To address some of these uncertainties, this work modified an existing model for Madison, Wisconsin. To compare outcomes, the authors used identical parameter changes and simulation scenarios for a model of Gainesville, Florida. Both models show that with increasing levels of CAV deployment, both the vehicle miles traveled and the average congestion speed will increase. However, there are some important exceptions due to differences in the road network layout, geospatial features, sociodemographic factors, land-use, and access to transit.

scholarly journals A sampling-based optimized algorithm for task-constrained motion planning

2019 ◽  
Vol 16 (3) ◽  
pp. 172988141984737 ◽  
Author(s):  
Kai Mi ◽  
Haojian Zhang ◽  
Jun Zheng ◽  
Jianhua Hu ◽  
Dengxiang Zhuang ◽  
...  
Keyword(s):  
Motion Planning ◽  
Sampling Methods ◽  
Tracking Error ◽  
Joint Space ◽  
Planning Problem ◽  
Redundant Manipulators ◽  
Task Space ◽  
Constrained Motion ◽  
Smooth Path ◽  
Planning Algorithm

We consider a motion planning problem with task space constraints in a complex environment for redundant manipulators. For this problem, we propose a motion planning algorithm that combines kinematics control with rapidly exploring random sampling methods. Meanwhile, we introduce an optimization structure similar to dynamic programming into the algorithm. The proposed algorithm can generate an asymptotically optimized smooth path in joint space, which continuously satisfies task space constraints and avoids obstacles. We have confirmed that the proposed algorithm is probabilistically complete and asymptotically optimized. Finally, we conduct multiple experiments with path length and tracking error as optimization targets and the planning results reflect the optimization effect of the algorithm.

scholarly journals SAGE: A S plit- A rchitecture Methodolo g y for E fficient End-to-End Autonomous Vehicle Control

2021 ◽  
Vol 20 (5s) ◽  
pp. 1-22
Author(s):  
Arnav Malawade ◽  
Mohanad Odema ◽  
Sebastien Lajeunesse-degroot ◽  
Mohammad Abdullah Al Faruque
Keyword(s):  
High Resolution ◽  
Real Time ◽  
Autonomous Vehicles ◽  
Autonomous Vehicle ◽  
Industry Standard ◽  
Wide Range ◽  
Energy Consuming ◽  
Time Latency ◽  
4G Lte ◽  
Hardware Platforms

Autonomous vehicles (AV) are expected to revolutionize transportation and improve road safety significantly. However, these benefits do not come without cost; AVs require large Deep-Learning (DL) models and powerful hardware platforms to operate reliably in real-time, requiring between several hundred watts to one kilowatt of power. This power consumption can dramatically reduce vehicles’ driving range and affect emissions. To address this problem, we propose SAGE: a methodology for selectively offloading the key energy-consuming modules of DL architectures to the cloud to optimize edge, energy usage while meeting real-time latency constraints. Furthermore, we leverage Head Network Distillation (HND) to introduce efficient bottlenecks within the DL architecture in order to minimize the network overhead costs of offloading with almost no degradation in the model’s performance. We evaluate SAGE using an Nvidia Jetson TX2 and an industry-standard Nvidia Drive PX2 as the AV edge, devices and demonstrate that our offloading strategy is practical for a wide range of DL models and internet connection bandwidths on 3G, 4G LTE, and WiFi technologies. Compared to edge-only computation, SAGE reduces energy consumption by an average of 36.13% , 47.07% , and 55.66% for an AV with one low-resolution camera, one high-resolution camera, and three high-resolution cameras, respectively. SAGE also reduces upload data size by up to 98.40% compared to direct camera offloading.

Predictive Motion Planning for Autonomous Vehicles With Geometric Constraints via Convex Optimization

2020 ◽  
Author(s):  
Xiaoyuan Zhu ◽  
Jian Chen ◽  
Yan Ma ◽  
Jianqiang Deng ◽  
Yuexuan Wang
Keyword(s):  
Decision Making ◽  
Motion Planning ◽  
Autonomous Vehicles ◽  
Linear Constraints ◽  
Geometric Constraints ◽  
Dynamic Constraints ◽  
The Road ◽  
Moving Obstacles ◽  
Planning Algorithm ◽  
Decision Module

Abstract In this paper, we propose an MPC-based motion planning algorithm, including a decision-making module, an obstacle-constraints generating module, and an MPC-based planning module. The designed decision module effectively distinguishes between structured and unstructured roads and processes them separately, so that the algorithm is more robust in different environments. Besides, the movement of obstacles is considered in the decision-making and obstacle constraints generating module. By processing obstacles with lateral and longitudinal speed separately, obstacle avoidance can be done in scenarios with moving obstacles, including moving obstacles crossing the road. Instead of treating the vehicle as a mass point, we explicitly consider the geometric constraints by modeling the vehicle as three intersecting circles when generating obstacle constraints. This ensures that the vehicle is collision-free in motion planning, especially when the vehicle turns. For non-convex obstacle constraints, we propose an algorithm that generates up to two alternative linear constraints to convexify the obstacle constraints for improving computational efficiency. In MPC, we consider the vehicle kino-dynamic constraints and two generated linear constraints. Therefore, the proposed method can achieve better real-time performance and can be applied to more complicated traffic scenarios with moving obstacles. Simulation results in three different scenarios show that motion planning can achieve satisfactory performance in both structured and unstructured roads with moving obstacles.

scholarly journals Lagrangian Jacobian Motion Planning: A Parametric Approach

2016 ◽  
Vol 85 (3-4) ◽  
pp. 511-522 ◽  
Author(s):  
Ida Góral ◽  
Krzysztof Tchoń
Keyword(s):  
Motion Planning ◽  
System Performance ◽  
Orthogonal Series ◽  
Robotic Systems ◽  
Planning Problem ◽  
Rolling Ball ◽  
Control Functions ◽  
Planning Algorithm ◽  
Jacobian Motion Planning ◽  
Motion Planning Problem

AbstractThis paper addresses the motion planning problem of nonholonomic robotic systems. The system’s kinematics are described by a driftless control system with output. It is assumed that the control functions are represented in a parametric form, as truncated orthogonal series. A new motion planning algorithm is proposed based on the solution of a Lagrange-type optimisation problem stated in the linear approximation of the parametrised system. Performance of the algorithm is illustrated by numeric computations for a motion planning problem of the rolling ball.

Sign in / Sign up

Export Citation Format

Share Document