Related papers: Cut time in sub-Riemannian problem on Engel group
Optimal control of a mobile robot system is formulated. Multiobjective criteria of time and energy is employed. The optimal control problem is formulated as a nonlinear programming problem (NLP). The problem is solved using the direct…
The study is devoted to mathematical modeling and optimal control design of longitudinal motions of a rectilinear elastic rod. The control inputs are a force, which is normal to the cross section and distributed piecewise constantly along…
The curvature discussed in this paper is a rather far going generalization of the Riemannian sectional curvature. We define it for a wide class of optimal control problems: a unified framework including geometric structures such as…
The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…
Consider a branching random walk evolving in a macroscopic time-inhomogeneous environment, that scales with the length $n$ of the process under study. We compute the first two terms of the asymptotic of the maximal displacement at time $n$.…
The definition of invariant time is fundamental to relativistic symmetry. Invariant time may be formulated as a degenerate orthogonal metric on a flat phase space with time, position, energy and momentum degrees of freedom that is also…
In this paper we propose a new finite element method for solving elliptic optimal control problems with pointwise state constraints, including the distributed controls and the Dirichlet or Neumann boundary controls. The main idea is to use…
We explicitly describe the length minimizing geodesics for a sub-Riemannian structure of the elliptic type defined on $SL(2, \mathbb{R})$. Our method uses a symmetry reduction which translates the problem into a Riemannian problem on a two…
We survey connections between the theory of bi-Lipschitz embeddings and the Sparsest Cut Problem in combinatorial optimization. The story of the Sparsest Cut Problem is a striking example of the deep interplay between analysis, geometry,…
For many hard computational problems, simple algorithms that run in time $2^n \cdot n^{O(1)}$ arise, say, from enumerating all subsets of a size-$n$ set. Finding (exponentially) faster algorithms is a natural goal that has driven much of…
Spatiotemporal dynamic medical imaging is critical in clinical applications, such as tomographic imaging of the heart or lung. To address such kind of spatiotemporal imaging problems, essentially, a time-dependent dynamic inverse problem,…
In this article, the minimum time control problem of an electric vehicle is modeled as a Mayer problem in optimal control, with affine dynamics with respect to the control and with state constraints. The candidates as minimizers are…
This note confirms a conjecture of [Bramoull\'{e}, Anti-coordination and social interactions, Games and Economic Behavior, 58, 2007: 30-49]. The problem, which we name the maximum independent cut problem, is a restricted version of the…
We construct analytic extensions across the Killing horizons of non-extremal and extremal dipole black rings in Einstein-Maxwell's theory using different methods. We show that these extensions are non-globally hyperbolic, have multiple…
The Max-Cut problem is a fundamental NP-hard problem, which is attracting attention in the field of quantum computation these days. Regarding the approximation algorithm of the Max-Cut problem, algorithms based on semidefinite programming…
We use a computer algebra system to compute, in an efficient way, optimal control variational symmetries up to a gauge term. The symmetries are then used to obtain families of Noether's first integrals, possibly in the presence of…
Algebraically speaking, linear time-invariant (LTI) systems can be considered as modules. In this framework, controllability is translated as the freeness of the system module. Optimal control mainly relies on quadratic Lagrangians and the…
The fundamental problem of the calculus of variations on time scales concerns the minimization of a delta-integral over all trajectories satisfying given boundary conditions. This includes the discrete-time, the quantum, and the…
We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism,…
We design the first subexponential-time (parameterized) algorithms for several cut and cycle-hitting problems on $H$-minor free graphs. In particular, we obtain the following results (where $k$ is the solution-size parameter). 1.…