1,952 research outputs found

    Decentralized Hybrid Formation Control of Unmanned Aerial Vehicles

    Full text link
    This paper presents a decentralized hybrid supervisory control approach for a team of unmanned helicopters that are involved in a leader-follower formation mission. Using a polar partitioning technique, the motion dynamics of the follower helicopters are abstracted to finite state machines. Then, a discrete supervisor is designed in a modular way for different components of the formation mission including reaching the formation, keeping the formation, and collision avoidance. Furthermore, a formal technique is developed to design the local supervisors decentralizedly, so that the team of helicopters as whole, can cooperatively accomplish a collision-free formation task

    Supervisory Control of Extended Finite Automata Using Transition Projection

    Get PDF
    A limitation of the Ramadge and Wonham (RW) framework for the supervisory control theory is the explicit state representation using finite automata, often resulting in complex and unintelligible models. Extended finite automata (EFAs), i.e., deterministic finite automata extended with variables, provide compact state representation and then make the control logic transparent through logic expressions of the variables. A challenge with this new control framework is to exploit the rich control structure established in RW's framework. This paper studies the decentralized control structure with EFAs. To reduce the computational complexity, the controller is synthesized based on model abstraction of subsystems, which means that the global model of the entire system is unnecessary. Sufficient conditions are presented to guarantee that the decentralized supervisors result in maximally permissive and nonblocking control to the entire system

    Distributed Supervisory Control of Discrete-Event Systems with Communication Delay

    Full text link
    This paper identifies a property of delay-robustness in distributed supervisory control of discrete-event systems (DES) with communication delays. In previous work a distributed supervisory control problem has been investigated on the assumption that inter-agent communications take place with negligible delay. From an applications viewpoint it is desirable to relax this constraint and identify communicating distributed controllers which are delay-robust, namely logically equivalent to their delay-free counterparts. For this we introduce inter-agent channels modeled as 2-state automata, compute the overall system behavior, and present an effective computational test for delay-robustness. From the test it typically results that the given delay-free distributed control is delay-robust with respect to certain communicated events, but not for all, thus distinguishing events which are not delay-critical from those that are. The approach is illustrated by a workcell model with three communicating agents
    • …
    corecore