相关论文: The realizability problem as a special case of the…

We address an optimal reachability problem for a planar manipulator in a constrained environment. After introducing the optmization problem in full generality, we practically embed the geometry of the workspace in the problem, by…

A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem…

In this note, we consider the problem of choosing which nodes of a linear dynamical system should be actuated so that the state transfer from the system's initial condition to a given final state is possible. Assuming a standard complexity…

We propose an approach to compute inner and outer-approximations of the sets of values satisfying constraints expressed as arbitrarily quantified formulas. Such formulas arise for instance when specifying important problems in control such…

We solve the reachability problem for a coupled wave-wave system with an integro-differential term. The control functions act on one side of the boundary. The estimates on the time is given in terms of the parameters of the problem and they…

The "problem of time" in canonical quantum gravity refers to the difficulties involved in defining a Hilbert space structure on states -- and local observables on this Hilbert space -- for a theory in which the spacetime metric is treated…

A risk-aware decision-making problem can be formulated as a chance-constrained linear program in probability measure space. Chance-constrained linear program in probability measure space is intractable, and no numerical method exists to…

We present an expanded expository account of the $K$-moment problem for polynomial algebras over \(\R^d\), with special emphasis on compact basic closed semialgebraic sets. The central question is to characterize those linear functionals on…

This paper studies binary linear programming problems in the presence of uncertainties that may cause solution values to change during implementation. This type of uncertainty, termed implementation uncertainty, is modeled explicitly…

We revisit the linear programming approach to deterministic, continuous time, infinite horizon discounted optimal control problems. In the first part, we relax the original problem to an infinite-dimensional linear program over a measure…

Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is…

Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…

The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range…

Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…

In connection with machine arithmetic, we are interested in systems of constraints of the form x + k \leq y + k'. Over integers, the satisfiability problem for such systems is polynomial time. The problem becomes NP complete if we restrict…

In this paper we study the truncated matrix trigonometric moment problem. We obtained a bijective parameterization of all solutions of this moment problem (both in nondegenerate and degenerate cases) via an operator approach. We use…

The probabilistic reachability problems of nondeterministic systems are studied. Based on the existing studies, the definition of probabilistic reachable sets is generalized by taking into account time-varying target set and obstacle. A…

In experiment, the multiplicity distributions of inelastic processes are truncated due to finite energy, insufficient statistics or special choice of events. It is shown that the moments of such truncated multiplicity distributions possess…

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…