Abstract Multimodal processes planning and scheduling play a pivotal role in many different domains including city networks, multimodal transportation systems, computer and telecommunication networks and so on. Multimodal process can be seen as a process partially processed by locally executed cyclic processes. In that context the concept of a Mesh-like Multimodal Transportation Network (MMTN) in which several isomorphic subnetworks interact each other via distinguished subsets of common shared intermodal transport interchange facilities (such as a railway station, bus station or bus/tram stop) as to provide a variety of demand-responsive passenger transportation services is examined. Consider a mesh-like layout of a passengers transport network equipped with different lines including buses, trams, metro, trains etc. where passenger flows are treated as multimodal processes. The goal is to provide a declarative model enabling to state a constraint satisfaction problem aimed at multimodal transportation processes scheduling encompassing passenger flow itineraries. Then, the main objective is to provide conditions guaranteeing solvability of particular transport lines scheduling, i.e. guaranteeing the right match-up of local cyclic acting bus, tram, metro and train schedules to a given passengers flow itineraries.

Abstract The paper addresses the problem of algorithm synthesis for controlling the motion of an electric powered wheelchair. The aim of the algorithm is to stabilize the wheelchair following a linear path and avoiding obstacles if occurred on its way. The main restriction imposed on the project is the application of simple low-cost sensors. That implies the system to cope with a number of inaccuracies and uncertainties related to the measurements. The goal of this work is to evaluate the possibility of the wheelchair project with a navigation system which aids a disable person to move in a complex and dynamic areas. Exemplary simulations are presented in order to discuss the results obtained.

Abstract Problems of dynamical reconstruction of unknown characteristics for nonlinear equations described the process of diffusion of innovations through results of observations of phase states are considered. Solving algorithms, which are stable with respect to informational noises and computational errors, are designed. The algorithms are based on the principle of auxiliary models with adaptive controls.

Abstract The paper considers the robust stability problem of uncertain continuous-time fractional order linear systems with pure delay in the following two cases: a) the state matrix is a linear convex combination of two known constant matrices, b) the state matrix is an interval matrix. It is shown that the system is robustly stable if and only if all the eigenvalues of the state matrix multiplied by delay in power equal to fractional order are located in the open stability region in the complex plane. Parametric description of boundary of this region is derived. In the case a) the necessary and sufficient computational condition for robust stability is established. This condition is given in terms of eigenvalue-loci of the state matrix, fractional order and time delay. In the case b) the method for determining the rectangle with sides parallel to the axes of the complex plane in which all the eigenvalues of interval matrix are located is given and the sufficient condition for robust stability is proposed. This condition is satisfied if the rectangle multiplied by delay in power equal to fractional order lie in the stability region. The considerations are illustrated by numerical examples.

Abstract The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, no waiting and no idle flow shop problems. It is assessed the impact of the constraints on the extension of the schedules and correlations of the length of the schedules for these variants. It is also examined the effectiveness of a set of insert type algorithms. The efficiency of the algorithms is tested on well-known literature benchmarks.

Abstract In the paper an approximate model of time-varying linear systems using a sequence of time-invariant systems is suggested. The conditions for validity of the approximation are proven with a theorem. Examples comparing the numerical solution of the original system and the analytical solution of the model are given. For the system under the consideration a new criterion giving sufficient conditions for robust Lagrange stability is suggested. The criterion is proven with a theorem. Examples are given showing stable and non stable solutions of a time-varying system and the results are compared with the numerical Runge-Kutta solution of the system. In the paper an important application of the described method of solution of linear systems with time-varying coefficients, namely analytical solution of the Kolmogorov equations is shown.

Abstract This article proposes the use of parametric design software, commonly used by architects, in order to obtain complex trajectory and program code for industrial robots. The paper describes the drawbacks of existing solutions and proposes a new script to obtain a correct program. The result of the algorithm was verified experimentally.

Abstract A method of analysis of descriptor nonlinear discrete-time systems with regular pencils of linear part is proposed. The method is based on the Weierstrass-Kronecker decomposition of the pencils. Necessary and sufficient conditions for the positivity of the nonlinear systems are established. A procedure for computing the solution to the equations describing the nonlinear systems are proposed and demonstrated on numerical examples.