اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEnhancing Data-Driven Reachability Analysis using Temporal Logic Side Information
153
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper presents algorithms for performing data-driven reachability analysis under temporal logic side information. In certain scenarios, the data-driven reachable sets of a robot can be prohibitively conservative due to the inherent noise in the robots historical measurement data. In the same scenarios, we often have side information about the robots expected motion (e.g., limits on how much a robot can move in a one-time step) that could be useful for further specifying the reachability analysis. In this work, we show that if we can model this side information using a signal temporal logic (STL) fragment, we can constrain the data-driven reachability analysis and safely limit the conservatism of the computed reachable sets. Moreover, we provide formal guarantees that, even after incorporating side information, the computed reachable sets still properly over-approximate the robots future states. Lastly, we empirically validate the practicality of the over-approximation by computing constrained, data-driven reachable sets for the Small-Vehicles-for-Autonomy (SVEA) hardware platform in two driving scenarios.
قيم البحث
اقرأ أيضاً
We present an algorithm for data-driven reachability analysis that estimates finite-horizon forward reachable sets for general nonlinear systems using level sets of a certain class of polynomials known as Christoffel functions. The level sets of Chri
stoffel functions are known empirically to provide good approximations to the support of probability distributions: the algorithm uses this property for reachability analysis by solving a probabilistic relaxation of the reachable set computation problem. We also provide a guarantee that the output of the algorithm is an accurate reachable set approximation in a probabilistic sense, provided that a certain sample size is attained. We also investigate three numerical examples to demonstrate the algorithms capabilities, such as providing non-convex reachable set approximations and detecting holes in the reachable set.
We introduce reachability analysis for the formal examination of robots. We propose a novel identification method, which preserves reachset conformance of linear systems. We additionally propose a simultaneous identification and control synthesis sch
eme to obtain optimal controllers with formal guarantees. In a case study, we examine the effectiveness of using reachability analysis to synthesize a state-feedback controller, a velocity observer, and an output feedback controller.
Systems whose movement is highly dissipative provide an opportunity to both identify models easily and quickly optimize motions. Geometric mechanics provides means for reduction of the dynamics by environmental homogeneity, while the dissipative natu
re minimizes the role of second order (inertial) features in the dynamics. Here we extend the tools of geometric system identification to ``Shape-Underactuated Dissipative Systems (SUDS) -- systems whose motions are more dissipative than inertial, but whose actuation is restricted to a subset of the body shape coordinates. Many animal motions are SUDS, including micro-swimmers such as nematodes and flagellated bacteria, and granular locomotors such as snakes and lizards. Many soft robots are also SUDS, particularly those robots using highly damped series elastic actuators. Whether involved in locomotion or manipulation, these robots are often used to interface less rigidly with the environment. We motivate the use of SUDS models, and validate their ability to predict motion of a variety of simulated viscous swimming platforms. For a large class of SUDS, we show how the shape velocity actuation inputs can be directly converted into torque inputs suggesting that systems with soft pneumatic actuators or dielectric elastomers can be modeled with the tools presented. Based on fundamental assumptions in the physics, we show how our model complexity scales linearly with the number of passive shape coordinates. This offers a large reduction on the number of trials needed to identify the system model from experimental data, and may reduce overfitting. The sample efficiency of our method suggests its use in modeling, control, and optimization in robotics, and as a tool for the study of organismal motion in friction dominated regimes.
Koopman operator theory has served as the basis to extract dynamics for nonlinear system modeling and control across settings, including non-holonomic mobile robot control. There is a growing interest in research to derive robustness (and/or safety)
guarantees for systems the dynamics of which are extracted via the Koopman operator. In this paper, we propose a way to quantify the prediction error because of noisy measurements when the Koopman operator is approximated via Extended Dynamic Mode Decomposition. We further develop an enhanced robot control strategy to endow robustness to a class of data-driven (robotic) systems that rely on Koopman operator theory, and we show how part of the strategy can happen offline in an effort to make our algorithm capable of real-time implementation. We perform a parametric study to evaluate the (theoretical) performance of the algorithm using a Van der Pol oscillator and conduct a series of simulated experiments in Gazebo using a non-holonomic wheeled robot.
In legged locomotion, the relationship between different gait behaviors and energy consumption must consider the full-body dynamics and the robot control as a whole, which cannot be captured by simple models. This work studies the robot dynamics and
whole-body optimal control as a coupled system to investigate energy consumption during balance recovery. We developed a 2-phase nonlinear optimization pipeline for dynamic stepping, which generates reachability maps showing complex energy-stepping relations. We optimize gait parameters to search all reachable locations and quantify the energy cost during dynamic transitions, which allows studying the relationship between energy consumption and stepping locations given different initial conditions. We found that to achieve efficient actuation, the stepping location and timing can have simple approximations close to the underlying optimality. Despite the complexity of this nonlinear process, we show that near-minimal effort stepping locations fall within a region of attractions, rather than a narrow solution space suggested by a simple model. This provides new insights into the non-uniqueness of near-optimal solutions in robot motion planning and control, and the diversity of stepping behavior in humans.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
