اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGeometric analysis of gaits and optimal control for three-link kinematic swimmers
99
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Many robotic systems locomote using gaits - periodic changes of internal shape, whose mechanical interaction with the robot`s environment generate characteristic net displacements. Prominent examples with two shape variables are the low Reynolds number 3-link Purcell swimmer with inputs of 2 joint angles and the ideal fluid swimmer. Gait analysis of these systems allows for intelligent decisions to be made about the swimmer`s locomotive properties, increasing the potential for robotic autonomy. In this work, we present comparative analysis of gait optimization using two different methods. The first method is variational approach of Pontryagin`s maximum principle (PMP) from optimal control theory. We apply PMP for several variants of 3-link swimmers, with and without incorporation of bounds on joint angles. The second method is differential-geometric analysis of the gaits based on curvature (total Lie bracket) of the local connection for 3-link swimmers. Using optimized body-motion coordinates, contour plots of the curvature in shape space gives visualization that enables identifying distance-optimal gaits as zero level sets. Combining and comparing results of the two methods enables better understanding of changes in existence, shape and topology of distance-optimal gait trajectories, depending on the swimmers parameters.
قيم البحث
اقرأ أيضاً
We develop optimal control strategies for autonomous vehicles (AVs) that are required to meet complex specifications imposed as rules of the road (ROTR) and locally specific cultural expectations of reasonable driving behavior. We formulate these spe
cifications as rules, and specify their priorities by constructing a priority structure, called underline{T}otal underline{OR}der over eunderline{Q}uivalence classes (TORQ). We propose a recursive framework, in which the satisfaction of the rules in the priority structure are iteratively relaxed in reverse order of priority. Central to this framework is an optimal control problem, where convergence to desired states is achieved using Control Lyapunov Functions (CLFs) and clearance with other road users is enforced through Control Barrier Functions (CBFs). We present offline and online approaches to this problem. In the latter, the AV has limited sensing range that affects the activation of the rules, and the control is generated using a receding horizon (Model Predictive Control, MPC) approach. We also show how the offline method can be used for after-the-fact (offline) pass/fail evaluation of trajectories - a given trajectory is rejected if we can find a controller producing a trajectory that leads to less violation of the rule priority structure. We present case studies with multiple driving scenarios to demonstrate the effectiveness of the algorithms, and to compare the offline and onli
We develop optimal control strategies for Autonomous Vehicles (AVs) that are required to meet complex specifications imposed by traffic laws and cultural expectations of reasonable driving behavior. We formulate these specifications as rules, and spe
cify their priorities by constructing a priority structure. We propose a recursive framework, in which the satisfaction of the rules in the priority structure are iteratively relaxed based on their priorities. Central to this framework is an optimal control problem, where convergence to desired states is achieved using Control Lyapunov Functions (CLFs), and safety is enforced through Control Barrier Functions (CBFs). We also show how the proposed framework can be used for after-the-fact, pass / fail evaluation of trajectories - a given trajectory is rejected if we can find a controller producing a trajectory that leads to less violation of the rule priority structure. We present case studies with multiple driving scenarios to demonstrate the effectiveness of the proposed framework.
We present a new quadrotor geometric control scheme that is capable of tracking highly aggressive trajectories. Unlike previous works, our geometric controller uses the logarithmic map of SO(3) to express rotational error in the Lie algebra, allowing
us to treat the manifold in a more effective and natural manner, and can be shown to be globally attractive. We show the performance of our control scheme against highly aggressive trajectories in simulation experiments. Additionally, we present an adaptation of this controller that allows us to interface effectively with the angular rate controllers on an onboard flight control unit and show the ability of this adapted control scheme to track aggressive trajectories on a quadrotor hardware platform.
We address the issue of safe optimal path planning under parametric uncertainties using a novel regularizer that allows trading off optimality with safety. The proposed regularizer leverages the notion that collisions may be modeled as constraint vio
lations in an optimal control setting in order to produce open-loop trajectories with reduced risk of collisions. The risk of constraint violation is evaluated using a state-dependent relevance function and first-order variations in the constraint function with respect to parametric variations. The approach is generic and can be adapted to any optimal control formulation that deals with constraints under parametric uncertainty. Simulations using a holonomic robot avoiding multiple dynamic obstacles with uncertain velocities are used to demonstrate the effectiveness of the proposed approach. Finally, we introduce the car vs. train problem to emphasize the dependence of the resultant risk aversion behavior on the form of the constraint function used to derive the regularizer.
Artificial potential fields (APFs) and their variants have been a staple for collision avoidance of mobile robots and manipulators for almost 40 years. Its model-independent nature, ease of implementation, and real-time performance have played a larg
e role in its continued success over the years. Control barrier functions (CBFs), on the other hand, are a more recent development, commonly used to guarantee safety for nonlinear systems in real-time in the form of a filter on a nominal controller. In this paper, we address the connections between APFs and CBFs. At a theoretic level, we prove that APFs are a special case of CBFs: given a APF one obtains a CBFs, while the converse is not true. Additionally, we prove that CBFs obtained from APFs have additional beneficial properties and can be applied to nonlinear systems. Practically, we compare the performance of APFs and CBFs in the context of obstacle avoidance on simple illustrative examples and for a quadrotor, both in simulation and on hardware using onboard sensing. These comparisons demonstrate that CBFs outperform APFs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
