We study the boundary value problem $-{\mathrm{d}iv\left(\right(\left|\nabla u\right|}^{p_1\left(x\right)-2}+{\left|\nabla u\right|}^{p_2\left(x\right)-2}\left)\nabla u\right)=f(x,u)$ in $\Omega$, $u=0$ on $\partial \Omega$, where $\Omega$ is a smooth bounded domain in ${ℝ}^N$. Our attention is focused on two cases when $f(x,u)=\pm (-\lambda |u{|}^{m\left(x\right)-2}u+\left|u{|}^{q\left(x\right)-2}u\right)$, where $m\left(x\right)=max\{p_1\left(x\right),p_2\left(x\right)\}$ for any $x\in \overline{\Omega }$ or $m\left(x\right)<q\left(x\right)<\frac{N·m\left(x\right)}{(N-m(x\left)\right)}$ for any $x\in \overline{\Omega }$. In the former case we show the existence of infinitely many weak solutions for any $\lambda >0$. In the latter we prove that if $\lambda$ is large enough then there exists a nontrivial weak solution. Our approach relies on the variable exponent theory of generalized Lebesgue-Sobolev spaces, combined with a ${\mathbb{Z}}_2$-symmetric version for even functionals...

This paper describes the problem of designing control laws for path following robots, including two types of nonholonomic mobile manipulators. Due to a cascade structure of the motion equation, a backstepping procedure is used to achieve motion along a desired path. The control algorithm consists of two simultaneously working controllers: the kinematic controller, solving motion constraints, and the dynamic controller, preserving an appropriate coordination between both subsystems of a mobile manipulator,...

A language grounding problem is considered for nonuniform sets of modal conjunctions consisting of conjunctions extended with more than one modal operator of knowledge, belief or possibility. The grounding is considered in the context of semiotic triangles built from language symbols, communicative cognitive agents and external objects. The communicative cognitive agents are assumed to be able to observe external worlds and store the results of observations in internal knowledge bases. It is assumed...