Scopus İndeksli Yayınlar Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/8651

Browse

Filters

2015 - 20206

Settings

Access Right: Open AccessAuthor: search.filters.author.Schmidt, Klaus Werner

Search Results

Now showing 1 - 6 of 6
  • Article
    Outputs Bounds for Linear Systems with Repeated Input Signals: Existence, Computation and Application to Vehicle Platooning
    (Tubitak Scientific & Technological Research Council Turkey, 2018) Schmidt, Klaus Werner; Saglam, Harun Bugra
    This paper investigates the effect of repeated time-limited input signals on the output excursion of stable, linear time-invariant systems. It is first shown that the maximum norm of the output signal remains bounded if the repeated input signals are separated by a nonzero dwell time. Then a novel method for computing a tight bound on the output signal norm is proposed. The setting of the paper is motivated by a vehicle platooning application, where vehicles repeatedly open/close gaps in order to perform lane changes. The developed method analyzes driving safety by computing a bound on the spacing error between vehicles when performing repeated open/close gap maneuvers.
  • Article
    Citation - WoS: 2
    Citation - Scopus: 2
    Order-Preserving Languages for the Supervisory Control of Automated Manufacturing Systems
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Nooruldeen, Anas; Schmidt, Klaus Werner
    Automated manufacturing systems (AMSs) consist of computer-controlled interconnected manufacturing components (MCs) that are used to transport and process different product types. Each product type requires a certain sequence of processing steps in different MCs. Hereby, multiple product types can share processing steps on the same MC and the paths of different products types can overlap. In this paper we consider the modeling of AMSs in the scope of supervisory control for discrete event systems (DES). On the one hand, a suitable AMS model must allow the representation of sequential and concurrent processing steps in MCs. On the other hand, such model must be able to track different product types traveling through the AMS so as to process the products correctly. While previous work is commonly concerned with the first requirement, this paper identifies that the existing literature lacks a general treatment of the second requirement. Accordingly, we first introduce order-preserving (OP) languages that preserve the order of different product types in MCs and we propose a suitable finite state automaton model for OP languages. Then, we show that the composition of OP languages again leads to an OP language. That is, modeling MCs by OP languages, an OP model of a complete AMS that is suitable for supervisory control is obtained. In addition, it is possible to use both OP models and non-OP models for general AMSs, where MCs have different properties. We demonstrate the applicability of the proposed modeling technique by a flexible manufacturing system example.
  • Article
    Citation - WoS: 17
    Citation - Scopus: 23
    Voronoi Boundary Visibility for Efficient Path Planning
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Al-Dahhan, Mohammed Rabeea Hashim; Schmidt, Klaus Werner
    The subject of this paper is the computation of paths for mobile robots that navigate from a start position to a goal position in environments with static obstacles. Specifically, we focus on paths that are represented by straight lines. Such paths can for example directly be followed by omni-directional robots or can be used as an initial solution for path smoothing. In this context, the most common performance metrics are the path length, the obstacle clearance and the computation time. In this paper, we develop a new path planning algorithm that addresses all the stated performance metrics. Our method first determines all possible connections between the start position and goal position along the edges of the generalized Voronoi diagram (GVD) of a given obstacle map. The shortest connections are then refined using a balanced method for creating shortcuts along existing waypoints and introducing new waypoints in order to cut corners. As an important feature, our method reduces the number of required waypoints by iteratively adding new waypoints and then removing unnecessary waypoints along solution paths. Moreover, our method takes into account multiple start-goal connections, since the shortest start-goal connection along the edges of the GVD might not lead to the shortest solution path. A comprehensive computational evaluation for a large number of maps with different properties shows that the proposed method outperforms sampling-based algorithms such as Probabilistic Roadmaps (PRM) and exact methods such as Visibility Graphs (VG) by computing close-to-optimal solution paths with a specified minimum obstacle clearance in less time.
  • Conference Object
    Citation - WoS: 5
    Citation - Scopus: 6
    Fault-Tolerant Control of Discrete-Event Systems With Lower-Bound Specifications
    (Elsevier, 2015) Moor, Thomas; Schmidt, Klaus Werner
    Fault-tolerant control addresses the control of dynamical systems such that they remain functional after the occurrence of a fault. To allow the controller to compensate for a fault, the system must exhibit certain redundancies. Alternatively, one may relax performance requirements for the closed loop behaviour after the occurrence of a fault. To achieve fault tolerance for a hierarchical control architecture, a combination of both options appears to be advisable: on each individual level of the hierarchy, the controller may compensate the fault as far as possible, and then pass on responsibility to the next upper level. This approach, when further elaborated for discrete-event systems represented by formal languages, turns out to impose a hard lower-bound inclusion specification on the closed-loop behaviour. The present paper discusses the corresponding synthesis problem and presents a solution. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
  • Conference Object
    The Controllability Prefix for Supervisory Control Under Partial Observation With an Application To Fault-Tolerant Control
    (Elsevier, 2017) Moor, Thomas; Schmidt, Klaus Werner
    The controllability prefix is known as a useful concept for the discussion and solution of synthesis problems in supervisory control of cp-languages, i.e., formal languages of infinite-length words. There, the controllability prefix is defined as the set of all finite-length prefixes that can be controlled to satisfy prescribed liveness and safety properties. In this paper, we discuss a variation of the controllability prefix to address supervisory control under partial observation for regular *-languages, i.e., formal languages of finite-length words. We derive algebraic properties that are useful for a quantitative analysis on how an upper-bound language-inclusion specification affects achievable lower-bound specifications. Our study is motivated by the synthesis of fault-tolerant supervisory controllers, where the possible occurrence of a fault may restrict the achievable pre-fault behaviour so severe, that a relaxation of the upper-bound specification becomes a practical option. As our study shows, such a relaxation can be systematically constructed in terms of the controllability prefix. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
  • Article
    Citation - WoS: 1
    Citation - Scopus: 1
    Outputs Bounds for Linear Systems With Repeated Input Signals: Existence, Computation and Application To Vehicle Platooning
    (2018) Schmidt, Klaus Werner; Sağlam, Harun Buğra
    This paper investigates the effect of repeated time-limited input signals on the output excursion of stable, linear time-invariant systems. It is rst shown that the maximum norm of the output signal remains bounded if the repeated input signals are separated by a nonzero dwell time. Then a novel method for computing a tight bound on the output signal norm is proposed. The setting of the paper is motivated by a vehicle platooning application, where vehicles repeatedly open/close gaps in order to perform lane changes. The developed method analyzes driving safety by computing a bound on the spacing error between vehicles when performing repeated open/close gap maneuvers.