Über die Anwendung von Operatoren in der Theorie der linearen dynamischen Systeme
This paper introduces a new approach for the joint alignment of a large collection of segmented images into the same system of coordinates while estimating at the same time an optimal common coordinate system. The atlas resulting from our group-wise alignment algorithm is obtained as the hidden variable of an Expectation-Maximization (EM) estimation. This is achieved by identifying the most consistent label across the collection of images at each voxel in the common frame of coordinates. In an...
We study a hybrid control system in which both discrete and continuous controls are involved. The discrete controls act on the system at a given set interface. The state of the system is changed discontinuously when the trajectory hits predefined sets, namely, an autonomous jump set A or a controlled jump set C where controller can choose to jump or not. At each jump, trajectory can move to a different Euclidean space. We allow the cost functionals to be unbounded with certain growth and hence...
An introduction to the worst scenario method is given. We start with an example and a general abstract scheme. An analysis of the method both on the continuous and approximate levels is discussed. We show a possible incorporation of the method into the fuzzy set theory. Finally, we present a survey of applications published during the last decade.
This paper discusses how uncertainty models of vision-based positioning sensors can be used to support the planning and optimization of positioning actions for mobile robots. Two sensor types are considered: a global vision with overhead cameras, and an on-board camera observing artificial landmarks. The developed sensor models are applied to optimize robot positioning actions in a distributed system of mobile robots and monitoring sensors, and to plan the sequence of actions for a robot cooperating...
Cet article introduit une nouvelle transformation des réseaux de Petri généralisés appelée l’abstraction généralisée. C’est une réduction dont nous montrons qu’elle conserve les invariants du réseau de départ et les propriétés structurelles les plus importantes. Une fonction de transformation de marquages nous permet d’introduire l’étude de la conservation des propriétés comportementales.
Cet article introduit une nouvelle transformation des réseaux de Petri généralisés appelée l'abstraction généralisée. C'est une réduction dont nous montrons qu'elle conserve les invariants du réseau de départ et les propriétés structurelles les plus importantes. Une fonction de transformation de marquages nous permet d'introduire l'étude de la conservation des propriétés comportementales.