ترغب بنشر مسار تعليمي؟ اضغط هنا

Multifunctions of Bounded Variation, Preliminary Version I

36   0   0.0 ( 0 )
 نشر من قبل Richard Vinter Professor
 تاريخ النشر 2014
  مجال البحث
والبحث باللغة English
 تأليف R. B. Vinter




اسأل ChatGPT حول البحث

Consider control systems described by a differential equation with a control term or, more generally, by a differential inclusion with velocity set $F(t,x)$. Certain properties of state trajectories can be derived when, in addition to other hypotheses, it is assumed that $F(t,x)$ is merely measurable w.r.t. the time variable $t$. But sometimes a refined analysis requires the imposition of stronger hypotheses regarding the $t$ dependence of $F(t,x)$. Stronger forms of necessary conditions for state trajectories that minimize a cost can derived, for example, if it is hypothesized that $F(t,x)$ is Lipschitz continuous w.r.t. $t$. It has recently become apparent that interesting addition properties of state trajectories can still be derived, when the Lipschitz continuity hypothesis is replaced by the weaker requirement that $F(t,x)$ has bounded variation w.r.t. $t$. This paper introduces a new concept of multifunctions $F(t,x)$ that have bounded variation w.r.t. $t$ near a given state trajectory, of special relevance to control system analysis. Properties of such multifunctions are derived and their significance is illustrated by an application to sensitivity analysis.

قيم البحث

اقرأ أيضاً

This is a preliminary version of our book. It goes up to the definition of dimension, which is about 30% of the material we plan to include. If you use it as a reference, do not forget to include the version number since the numbering will be changed.
Closure spaces are a generalisation of topological spaces obtained by removing the idempotence requirement on the closure operator. We adapt the standard notion of bisimilarity for topological models, namely Topo-bisimilarity, to closure models -- we call the resulting equivalence CM-bisimilarity -- and refine it for quasi-discrete closure models. We also define two additional notions of bisimilarity that are based on paths on space, namely Path-bisimilarity and Compatible Path-bisimilarity, CoPa-bisimilarity for short. The former expresses (unconditional) reachability, the latter refines it in a way that is reminishent of Stuttering Equivalence on transition systems. For each bisimilarity we provide a logical characterisation, using variants of the Spatial Logic for Closure Spaces (SLCS). We also address the issue of (space) minimisation via the three equivalences.
This work discusses the finite element discretization of an optimal control problem for the linear wave equation with time-dependent controls of bounded variation. The main focus lies on the convergence analysis of the discretization method. The stat e equation is discretized by a space-time finite element method. The controls are not discretized. Under suitable assumptions optimal convergence rates for the error in the state and control variable are proven. Based on a conditional gradient method the solution of the semi-discretized optimal control problem is computed. The theoretical convergence rates are confirmed in a numerical example.
This paper provides necessary conditions of optimality for optimal control problems with time delays in both state and control variables. Differen
87 - Zheng Chen , Kun Wang , Yang Lu 2021
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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا