3 resultados para Autonomous robots -- Control systems

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Let M be a finite-dimensional manifold and Sigma be a driftless control system on M of full rank. We prove that for a given initial state x epsilon M, the covering space Gamma(Sigma, x) for a monotonic homotopy of trajectories of Sigma which is recently constructed in [1] coincides with the simply connected universal covering manifold of M and that the terminal projection epsilon(x) : Gamma(Sigma, x) -> M given by epsilon(x) ([alpha]) = alpha(1) is a covering mapping.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, we consider an initial value problem for a class of generalized ODEs, also known as Kurzweil equations, and we prove the existence of a local semidynamical system there. Under certain perturbation conditions, we also show that this class of generalized ODEs admits a discontinuous semiflow which we shall refer to as an impulsive semidynamical system. As a consequence, we obtain LaSalle`s invariance principle for such a class of generalized ODEs. Due to the importance of LaSalle`s invariance principle in studying stability of differential systems, we include an application to autonomous ordinary differential systems with impulse action at variable times. (C) 2011 Elsevier Inc. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Planning to reach a goal is an essential capability for rational agents. In general, a goal specifies a condition to be achieved at the end of the plan execution. In this article, we introduce nondeterministic planning for extended reachability goals (i.e., goals that also specify a condition to be preserved during the plan execution). We show that, when this kind of goal is considered, the temporal logic CTL turns out to be inadequate to formalize plan synthesis and plan validation algorithms. This is mainly due to the fact that the CTL`s semantics cannot discern among the various actions that produce state transitions. To overcome this limitation, we propose a new temporal logic called alpha-CTL. Then, based on this new logic, we implement a planner capable of synthesizing reliable plans for extended reachability goals, as a side effect of model checking.