اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPace and motor control optimization for a runner
78
0
0.0
(
0
)
تأليف
Amandine Aftalion
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Our aim is to present a new model which encompasses pace optimization and motor control effort for a runner on a fixed distance. We see that for long races, the long term behaviour is well approximated by a turnpike problem. We provide numerical simulations quite consistent with this approximation which leads to a simplified problem. We are also able to estimate the effect of slopes and ramps.
قيم البحث
اقرأ أيضاً
Controlling diseases such as dengue fever, chikungunya and zika fever by introduction of the intracellular parasitic bacterium Wolbachia in mosquito populations which are their vectors, is presently quite a promising tool to reduce their spread. Whil
e description of the conditions of such experiments has received ample attention from biologists, entomologists and applied mathematicians, the issue of effective scheduling of the releases remains an interesting problem for Control theory. Having in mind the important uncertainties present in the dynamics of the two populations in interaction, we attempt here to identify general ideas for building release strategies, which should apply to several models and situations. These principles are exemplified by two interval observer-based feedback control laws whose stabilizing properties are demonstrated when applied to a model retrieved from [Bliman et al., 2018]. Crucial use is made of the theory of monotone dynamical systems.
We study a family of optimal control problems in which one aims at minimizing a cost that mixes a quadratic control penalization and the variance of the system, both for finitely many agents and for the mean-field dynamics as their number goes to inf
inity. While solutions of the discrete problem always exist in a unique and explicit form, the behavior of their macroscopic counterparts is very sensitive to the magnitude of the time horizon and penalization parameter. When one minimizes the final variance, there always exists a Lipschitz-in-space optimal controls for the infinite dimensional problem, which can be obtained as a suitable extension of the optimal controls for the finite-dimensional problems. The same holds true for variance maximizations whenever the time horizon is sufficiently small. On the contrary, for large final times (or equivalently for small penalizations of the control cost), it can be proven that there does not exist Lipschitz-regular optimal controls for the macroscopic problem.
We consider the problem of incentivization and optimal control of autonomous vehicles for improving traffic congestion. In our scenario, autonomous vehicles must be incentivized in order to participate in traffic improvement. Using the theory and met
hods of optimal transport, we propose a constrained optimization framework over dynamics governed by partial differential equations, so that we can optimally select a portion of vehicles to be incentivized and controlled. The goal of the optimization is to obtain a uniform distribution of vehicles over the spatial domain. To achieve this, we consider two types of penalties on vehicle density, one is the $L^2$ cost and the other is a multiscale-norm cost, commonly used in fluid-mixing problems. To solve this non-convex optimization problem, we introduce a novel algorithm, which iterates between solving a convex optimization problem and propagating the flow of uncontrolled vehicles according to the Lighthill-Whitham-Richards model. We perform numerical simulations, which suggest that the optimization of the $L^2$ cost is ineffective while optimization of the multiscale norm is effective. The results also suggest the use of a dedicated lane for this type of control in practice.
This paper proposes a fully distributed reactive power optimization algorithm that can obtain the global optimum of non-convex problems for distribution networks without a central coordinator. Second-order cone (SOC) relaxation is used to achieve exa
ct convexification. A fully distributed algorithm is then formulated corresponding to the given division of areas based on an alternating direction method of multipliers (ADMM) algorithm, which is greatly simplified by exploiting the structure of active distribution networks (ADNs). The problem is solved for each area with very little interchange of boundary information between neighboring areas. The standard ADMM algorithm is extended using a varying penalty parameter to improve convergence. The validity of the method is demonstrated via numerical simulations on an IEEE 33-node distribution network, a PG&E 69-node distribution system, and an extended 137-node system.
Developing automated and semi-automated solutions for reconstructing wiring diagrams of the brain from electron micrographs is important for advancing the field of connectomics. While the ultimate goal is to generate a graph of neuron connectivity, m
ost prior automated methods have focused on volume segmentation rather than explicit graph estimation. In these approaches, one of the key, commonly occurring error modes is dendritic shaft-spine fragmentation. We posit that directly addressing this problem of connection identification may provide critical insight into estimating more accurate brain graphs. To this end, we develop a network-centric approach motivated by biological priors image grammars. We build a computer vision pipeline to reconnect fragmented spines to their parent dendrites using both fully-automated and semi-automated approaches. Our experiments show we can learn valid connections despite uncertain segmentation paths. We curate the first known reference dataset for analyzing the performance of various spine-shaft algorithms and demonstrate promising results that recover many previously lost connections. Our automated approach improves the local subgraph score by more than four times and the full graph score by 60 percent. These data, results, and evaluation tools are all available to the broader scientific community. This reframing of the connectomics problem illustrates a semantic, biologically inspired solution to remedy a major problem with neuron tracking.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
