Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTarget-point based path following controller for a car-type vehicle using bounded controls
232
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper, we have studied the control problem of target-point based path following for car-type vehicles. This special path following task arises from the needs of vision based guidance systems, where a given target-point located ahead of the vehicle, in the visual range of the camera, must follow a specified path. A solution to this problem is developed through a non linear transformation of the path following problem into a reference trajectory tracking problem, by modeling the target point as a virtual vehicle. Bounded feedback laws must be then used on the real vehicles angular acceleration and the virtual vehicles velocity, to achieve stability. The resulting controller is globally asymptotically stable with respect and the proof is demonstrated using Lyapunov based arguments and a bootstrap argument. The effectiveness of this controller has been illustrated through simulations.
rate research
Read More
The paper is concerned with elongating the shortest curvature-bounded path between two oriented points to an expected length. The elongation of curvature-bounded paths to an expected length is fundamentally important to plan missions for nonholonomic-constrained vehicles in many practical applications, such as coordinating multiple nonholonomic-constrained vehicles to reach a destination simultaneously or performing a mission with a strict time window. In the paper, the explicit conditions for the existence of curvature-bounded paths joining two oriented points with an expected length are established by applying the properties of the reachability set of curvature-bounded paths. These existence conditions are numerically verifiable, allowing readily checking the existence of curvature-bounded paths between two prescribed oriented points with a desired length. In addition, once the existence conditions are met, elongation strategies are provided in the paper to get curvature-bounded paths with expected lengths. Finally, some examples of minimum-time path planning for multiple fixed-wing aerial vehicles to cooperatively achieve a triangle-shaped flight formation are presented, illustrating and verifying the developments of the paper.
The flapping-wing aerial vehicle (FWAV) is a new type of flying robot that mimics the flight mode of birds and insects. However, FWAVs have their special characteristics of less load capacity and short endurance time, so that most existing systems of ground target localization are not suitable for them. In this paper, a vision-based target localization algorithm is proposed for FWAVs based on a generic camera model. Since sensors exist measurement error and the camera exists jitter and motion blur during flight, Gaussian noises are introduced in the simulation experiment, and then a first-order low-pass filter is used to stabilize the localization values. Moreover, in order to verify the feasibility and accuracy of the target localization algorithm, we design a set of simulation experiments where various noises are added. From the simulation results, it is found that the target localization algorithm has a good performance.
In this paper, we focus on solving a class of constrained non-convex non-concave saddle point problems in a decentralized manner by a group of nodes in a network. Specifically, we assume that each node has access to a summand of a global objective function and nodes are allowed to exchange information only with their neighboring nodes. We propose a decentralized variant of the proximal point method for solving this problem. We show that when the objective function is $rho$-weakly convex-weakly concave the iterates converge to approximate stationarity with a rate of $mathcal{O}(1/sqrt{T})$ where the approximation error depends linearly on $sqrt{rho}$. We further show that when the objective function satisfies the Minty VI condition (which generalizes the convex-concave case) we obtain convergence to stationarity with a rate of $mathcal{O}(1/sqrt{T})$. To the best of our knowledge, our proposed method is the first decentralized algorithm with theoretical guarantees for solving a non-convex non-concave decentralized saddle point problem. Our numerical results for training a general adversarial network (GAN) in a decentralized manner match our theoretical guarantees.
This paper addresses a novel architecture for person-following robots using active search. The proposed system can be applied in real-time to general mobile robots for learning features of a human, detecting and tracking, and finally navigating towards that person. To succeed at person-following, perception, planning, and robot behavior need to be integrated properly. Toward this end, an active target searching capability, including prediction and navigation toward vantage locations for finding human targets, is proposed. The proposed capability aims at improving the robustness and efficiency for tracking and following people under dynamic conditions such as crowded environments. A multi-modal sensor information approach including fusing an RGB-D sensor and a laser scanner, is pursued to robustly track and identify human targets. Bayesian filtering for keeping track of human and a regression algorithm to predict the trajectory of people are investigated. In order to make the robot autonomous, the proposed framework relies on a behavior-tree structure. Using Toyota Human Support Robot (HSR), real-time experiments demonstrate that the proposed architecture can generate fast, efficient person-following behaviors.
Car-following behavior has been extensively studied using physics-based models, such as the Intelligent Driver Model. These models successfully interpret traffic phenomena observed in the real-world but may not fully capture the complex cognitive process of driving. Deep learning models, on the other hand, have demonstrated their power in capturing observed traffic phenomena but require a large amount of driving data to train. This paper aims to develop a family of neural network based car-following models that are informed by physics-based models, which leverage the advantage of both physics-based (being data-efficient and interpretable) and deep learning based (being generalizable) models. We design physics-informed deep learning car-following (PIDL-CF) architectures encoded with two popular physics-based models - IDM and OVM, on which acceleration is predicted for four traffic regimes: acceleration, deceleration, cruising, and emergency braking. Two types of PIDL-CFM problems are studied, one to predict acceleration only and the other to jointly predict acceleration and discover model parameters. We also demonstrate the superior performance of PIDL with the Next Generation SIMulation (NGSIM) dataset over baselines, especially when the training data is sparse. The results demonstrate the superior performance of neural networks informed by physics over those without. The developed PIDL-CF framework holds the potential for system identification of driving models and for the development of driving-based controls for automated vehicles.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
