Search results for "102"
showing 10 items of 2892 documents
Geometric optimal control of elliptic Keplerian orbits
2005
This article deals with the transfer of a satellite between Keplerian orbits. We study the controllability properties of the system and make a preliminary analysis of the time optimal control using the maximum principle. Second order sufficient conditions are also given. Finally, the time optimal trajectory to transfer the system from an initial low orbit with large eccentricity to a terminal geostationary orbit is obtained numerically.
Minimum Time Control of the Restricted Three-Body Problem
2012
The minimum time control of the circular restricted three-body problem is considered. Controllability is proved on an adequate submanifold. Singularities of the extremal flow are studied by means of a stratification of the switching surface. Properties of homotopy maps in optimal control are framed in a simple case. The analysis is used to perform continuations on the two parameters of the problem: The ratio of the masses, and the magnitude of the control.
On some Riemannian aspects of two and three-body controlled problems
2009
The flow of the Kepler problem (motion of two mutually attracting bodies) is known to be geodesic after the work of Moser [20], extended by Belbruno and Osipov [2, 21]: Trajectories are reparameterizations of minimum length curves for some Riemannian metric. This is not true anymore in the case of the three-body problem, and there are topological obstructions as observed by McCord et al. [19]. The controlled formulations of these two problems are considered so as to model the motion of a spacecraft within the influence of one or two planets. The averaged flow of the (energy minimum) controlled Kepler problem with two controls is shown to remain geodesic. The same holds true in the case of o…
Characterization of the Clarke regularity of subanalytic sets
2017
International audience; In this note, we will show that for a closed subanalytic subset $A \subset \mathbb{R}^n$, the Clarke tangential regularity of $A$ at $x_0 \in A$ is equivalent to the coincidence of the Clarke's tangent cone to $A$ at $x_0$ with the set \\$$\mathcal{L}(A, x_0):= \bigg\{\dot{c}_+(0) \in \mathbb{R}^n: \, c:[0,1]\longrightarrow A\;\;\mbox{\it is Lipschitz}, \, c(0)=x_0\bigg\}.$$Where $\dot{c}_+(0)$ denotes the right-strict derivative of $c$ at $0$. The results obtained are used to show that the Clarke regularity of the epigraph of a function may be characterized by a new formula of the Clarke subdifferential of that function.
Some Computational Aspects of DISTANCE-SAT
2007
In many AI fields, one must face the problem of finding a solution that is as close as possible to a given configuration. This paper addresses this problem in a propositional framework. We introduce the decision problem distance-sat, which consists in determining whether a propositional formula admits a model that disagrees with a given partial interpretation on at most d variables. The complexity of distance-sat and of several restrictions of it are identified. Two algorithms based on the well-known Davis/Logemann/Loveland search procedure for the satisfiability problem sat are presented so as to solve distance-sat for CNF formulas. Their computational behaviors are compared with the ones …
How to Enrich Description Logics with Fuzziness
2017
International audience; The paper describes the relation between fuzzy and non-fuzzy description logics. It gives an overview about current research in these areas and describes the difference between tasks for description logics and fuzzy logics. The paper also deals with the transformation properties of description logics to fuzzy logics and backwards. While the process of transformation from a description logic to a fuzzy logic is a trivial inclusion, the other way of reducing information from fuzzy logic to description logic is a difficult task, that will be topic of future work.
Whole mirror duplication-random loss model and pattern avoiding permutations
2010
International audience; In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length p2+1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953). Other relative mo…
Topological properties of cellular automata on trees
2012
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.
Query-preserving watermarking of relational databases and XML documents
2011
Watermarking allows robust and unobtrusive insertion of information in a digital document. During the last few years, techniques have been proposed for watermarking relational databases or Xml documents, where information insertion must preserve a specific measure on data (for example the mean and variance of numerical attributes). In this article we investigate the problem of watermarking databases or Xml while preserving a set of parametric queries in a specified language, up to an acceptable distortion. We first show that unrestricted databases can not be watermarked while preserving trivial parametric queries. We then exhibit query languages and classes of structures that allow guarante…
Presentations of constrained systems with unconstrained positions
2005
International audience; We give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for con…