检索结果-内蒙古大学图书馆

Petri Net control Method for Pipe-line Systems and Its Implementation via CIF3 ⁎

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2019年第24期52卷 261-266页

作者： YuHao Fu JiLiang Luo Huifeng Wu Jianhong Ye Yi-sheng Huang College Information Science and Engineering Huaqiao University Xiamen 361021 China College Information Science and Engineering Huaqiao University Xiamen 361021 China and also with Fujian Engineering Research Center of Motor Control and System Optimal Schedule Xiamen 361021 China Institute of Intelligent and Software Technology Hangzhou Dianzi University Hangzhou 310018 China Computer Science and Technology Huaqiao University Xiamen 361021 China and also with Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou 362000 China Department of Electrical Engineering National Ilan University Taiwan

As for a pipe-line system subjected to complex operations, an approach is proposed to synthesize the controller via Petri nets (PNs) such that the plant is run as concurrently as possible and the loads of equipments are balanced. A P-timed and labeled PN is designed to model the whole process of a pipe-line system, where tasks, including transporting material from one tank to another and cleaning tank, are represented by operational places, and level sensors amounted in tanks are represented by labels assigned to transitions. Further, monitor places are designed to resolve the conflict relations among tasks due to the shared valves and pipes. An method is presented to translate an PN controller into a CIF3 (Compositional Interchange Format) model, which can be converted into a PLC program in the CIF3 tool. A beer filtration plant is taken as an example to illustrate the approach, and its simulation experiments are carried out to verify the theoretic results.

关键词： Chemical plant Valve control Petri net CIF3

Objective comparison of methods to decode anomalous diffusion

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Muñoz-Gil, Gorka Volpe, Giovanni Garcia-March, Miguel Angel Aghion, Erez Argun, Aykut Hong, Chang Beom Bland, Tom Bo, Stefano Conejero, J. Alberto Firbas, Nicolás Orts, Òscar Garibo Gentili, Alessia Huang, Zihan Jeon, Jae-Hyung Kabbech, Hélène Kim, Yeongjin Kowalek, Patrycja Krapf, Diego Loch-Olszewska, Hanna Lomholt, Michael A. Masson, Jean-Baptiste Meyer, Philipp G. Park, Seongyu Requena, Borja Smal, Ihor Song, Taegeun Szwabinski, Janusz Thapa, Samudrajit Verdier, Hippolyte Volpe, Giorgio Widera, Arthur Lewenstein, MacIej Metzler, Ralf Anzo, Carlo 08860 Spain Department of Physics University of Gothenburg Origovägen 6B GothenburgSE-41296 Sweden Instituto Universitario de Matemática Pura y Aplicada Universitat Politècnica de València Spain Max Planck Institute for the Physics of Complex Systems Nöthnitzer Straße 38 DresdenDE-01187 Germany Department of Physics Pohang University of Science and Technology Pohang37673 Korea Republic of Francis Crick Institute 1 Midland Road LondonNW1 1AT United Kingdom Department of Chemistry University College London 20 Gordon Street LondonWC1H 0AJ United Kingdom School of Physics and Electronics Hunan University Changsha410082 China Department of Cell Biology Erasmus Mc Rotterdam Netherlands Faculty of Pure and Applied Mathematics Hugo Steinhaus Center Wroclaw University of Science and Technology Wroclaw Poland Department of Electrical and Computer Engineering Colorado State University Fort CollinsCO80523 United States PhyLife Department of Physics Chemistry and Pharmacy University of Southern Denmark Odense MDK-5230 Denmark Institut Pasteur Decision and Bayesian Computation Lab Paris France Center for Ai and Natural Sciences Korea Institute for Advanced Study Seoul Korea Republic of Institute for Physics and Astronomy University of Potsdam Karl-Liebknecht-Str 24/25 Potsdam-GolmD-14476 Germany Sackler Center for Computational Molecular and Materials Science Tel Aviv University Tel Aviv69978 Israel School of Mechanical Engineering Tel Aviv University Tel Aviv69978 Israel Institut Pasteur Decision and Bayesian Computation Lab Paris France Department of Physics Research Center Optimas Technische Universität Kaiserslautern Kaiserslautern67663 Germany Icrea Pg. Lluís Companys 23 Barcelona08010 Spain C. de la Laura 13 Vic08500 Spain

Deviations from Brownian motion leading to anomalous diffusion are ubiquitously found in transport dynamics, playing a crucial role in phenomena from quantum physics to life sciences. The detection and characterization of anomalous diffusion from the measurement of an individual trajectory are challenging tasks, which traditionally rely on calculating the mean squared displacement of the trajectory. However, this approach breaks down for cases of important practical interest, e.g., short or noisy trajectories, ensembles of heterogeneous trajectories, or non-ergodic processes. Recently, several new approaches have been proposed, mostly building on the ongoing machine-learning revolution. Aiming to perform an objective comparison of methods, we gathered the community and organized an open competition, the Anomalous Diffusion challenge (AnDi). Participating teams independently applied their own algorithms to a commonly-defined dataset including diverse conditions. Although no single method performed best across all scenarios, the results revealed clear differences between the various approaches, providing practical advice for users and a benchmark for developers. Copyright © 2021, The Authors. All rights reserved.

关键词： Trajectories

Decentralized event-triggered consensus of autonomous agents over unreliable communication networks

学校读者我要写书评

暂无评论

Decentralized event-triggered consensus of autonomous agents...

AIAA Guidance, Navigation, and control Conference, 2018

作者： Garcia, Eloy Cao, Yongcan Casbeer, David W. Control Science Center of Excellence Air Force Research Laboratory Wright-Patterson AFB OH45433 United States Department of Electrical and Computer Engineering University of Texas at San Antonio San AntonioTX78249 United States

ISBN: (数字)9781624105265

ISBN: (纸本)9781624105265

This paper presents distributed event-triggered control and communication strategies for a group of autonomous agents to achieve consensus over unreliable communication channels. Communication is unreliable in the sense that the broadcast channel from one agent to its neighbors can drop the event-triggered packets of information, where the transmitting agent is unaware that the packet was not received and the receiving agents have no knowledge of the transmitted packet. Additionally, packets that successfully arrive at their destinations may suffer from time-varying communication delays. In this paper, we consider directed graphs, and also consider the general case of relaxed consistency on the packet dropouts and the delays. Relaxing consistency means that the delays and dropouts for a packet broadcast by one agent can be different for each receiving node. We show that even under this challenging scenario, agents can reach consensus asymptotically while reducing transmissions of measurements based on the proposed event-triggered consensus protocol. In addition, positive inter-event times are obtained which guarantee that Zeno behavior does not occur. © 2018 by the American Institute of Aeronautics and Astronautics, Inc.

关键词： Multi agent systems

Distributed Resource Allocation through Utility Design – Part I: Optimizing the Performance Certificates via the Price of Anarchy

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Paccagnan, Dario Chandan, Rahul Marden, Jason R. Mechanical Engineering Department Center of Control Dynamical Systems and Computation UC Santa BarbaraCA93106-5070 United States Department of Electrical and Computer Engineering University of California Santa BarbaraCA93106-5070 United States

—Game theory has emerged as a fruitful paradigm for the design of networked multiagent systems. A fundamental component of this approach is the design of agents’ local utility functions so that their self-interested maximization results in a desirable collective behavior. In this work we focus on a well-studied class of distributed resource allocation problems where each agent is requested to select a subset of resources with the goal of optimizing a given system-level objective, separable over the resources. Our core contribution is the development of a novel framework to tightly characterize the worst case performance of any resulting Nash equilibrium (price of anarchy) as a function of the chosen agents’ utility functions. Leveraging this result, we then identify how to design such utilities so as to optimize the price of anarchy through a tractable linear program. This provides us with a-priori performance certificates applicable to any existing learning algorithm capable of driving the system to an equilibrium. Part II of this work specializes these results to submodular and supermodular objectives, discusses the complexity of computing Nash equilibria, and provides multiple illustrations of the theoretical findings. Copyright © 2018, The Authors. All rights reserved.

关键词： Game theory

Distributed resource allocation through utility design - Part II: Applications to submodular, supermodular and set covering problems

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Paccagnan, Dario Marden, Jason R. Mechanical Engineering Department Center of Control Dynamical Systems and Computation UC Santa Barbara CA93106-5070 United States Department of Electrical and Computer Engineering University of California Santa BarbaraCA93106-5070 United States

A fundamental component of the game theoretic approach to distributed control is the design of local utility functions. In Part I of this work we showed how to systematically design local utilities so as to maximize the induced worst case performance. The purpose of the present manuscript is to specialize the general results obtained in Part I to a class of monotone submodular, supermodular and set covering problems. In the case of set covering problems, we show how any distributed algorithm capable of computing a Nash equilibrium inherits a performance certificate matching the well known 1 - 1=e approximation of [1]. Relative to the class of submodular maximization problems considered here, we show how the performance offered by the game theoretic approach improves on existing approximation algorithms. We briefly discuss the algorithmic complexity of computing (pure) Nash equilibria and show how our approach generalizes and subsumes previously fragmented results in the area of optimal utility design. Two applications and corresponding numerics are presented: the vehicle target assignment problem and a coverage problem arising in distributed caching for wireless networks. Copyright © 2018, The Authors. All rights reserved.

关键词： Combinatorial optimization

Streaming data analysis framework for cyber-physical system of metal machining processes 1

学校读者我要写书评

暂无评论

Streaming data analysis framework for cyber-physical system ...

1st IEEE International Conference on Industrial Cyber-Physical Systems, ICPS 2018

作者： Yang, Chao-Lung Sutrisno, Hendri Lo, Nai-Wei Chen, Zhi-Xuan Wei, Ching-Chih Zhang, Han-Wei Lin, Chin-Teng Wei, Chen-Lung Hsieh, Shang-Heng Department of Industrial Management National Taiwan University of Science and Technology Taipei Taiwan Department of Information Management National Taiwan University of Science and Technology Taipei Taiwan Department of Mechanical Engineering National Taiwan University of Science and Technology Taipei Taiwan Institute of Electrical Control Engineering Department of Electrical and Computer Engineering National Chiao Tung University Hsinchu Taiwan Precision Machinery Research and Development Center Taichung City Taiwan CIMFORCE International Limited New Taipei City Taiwan

ISBN: (纸本)9781538665312

Online monitoring and offline batch analyzing the data stream obtained from computer numeric control (CNC) machines and sensors deployed on manufacturing site are the core technology of Cyber-Physical System (CPS). In order to analyze data stream collected continually, in this research, the data analysis framework consist of supervisory control and data acquisition (SCADA), edge computing and cloud computing is proposed. By integrating signal smoothing and anomaly pattern detection techniques, the significant unique patterns of data stream can be discovered and stored for further usage in CPS application. © 2018 IEEE.

关键词： Cyber Physical System

Quantifying the unextendibility of entanglementa

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wang, Kun Wang, Xin Wilde, Mark M. Institute for Quantum Computing Baidu Research Beijing100193 China Guangzhou China Hearne Institute for Theoretical Physics Department of Physics and Astronomy Center for Computation and Technology Louisiana State University Baton RougeLA70803 United States School of Electrical and Computer Engineering Cornell University IthacaNY14850 United States

Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states. First, we define the unextendible entanglement, a family of entanglement measures based on the concept of a state-dependent set of free states. The intuition behind these measures is that the more entangled a bipartite state is, the less entangled each of its individual systems is with a third party. Second, we demonstrate that the unextendible entanglement is an entanglement monotone under two-extendible quantum operations, including local operations and one-way classical communication as a special case. Normalization and faithfulness are two other desirable properties of unextendible entanglement, which we establish here. We further show that the unextendible entanglement provides efficiently computable benchmarks for the rate of exact entanglement or secret key distillation, as well as the overhead of probabilistic entanglement or secret key distillation. Copyright © 2019, The Authors. All rights reserved.

关键词： Distillation

Max-Min Fair Sensor Scheduling: Game-Theoretic Perspective and Algorithmic Solution

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wu, Shuang Ren, Xiaoqiang Hong, Yiguang Shi, Ling Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong Access Linnaeus Center School of Electrical Engineering Kth Royal Institute of Technology Stockholm114 28 Sweden Key Laboratory of Systems and Control Institute of Systems Science Chinese Academy of Sciences Beijing100080 China

We consider the design of a fair sensor schedule for a number of sensors monitoring different linear time-invariant processes. The largest average remote estimation error among all processes is to be minimized. We first consider a general setup for the max-min fair allocation problem. By reformulating the problem as its equivalent form, we transform the fair resource allocation problem into a zero-sum game between a "judge" and a resource allocator. We propose an equilibrium seeking procedure and show that there exists a unique Nash equilibrium in pure strategy for this game. We then apply the result to the sensor scheduling problem and show that the max-min fair sensor scheduling policy can be achieved. Copyright © 2019, The Authors. All rights reserved.

关键词： Game theory

Entropic Energy-Time Uncertainty Relation

学校读者我要写书评

暂无评论

Physical Review Letters 2019年第10期122卷 100401-100401页

作者： Patrick J. Coles Vishal Katariya Seth Lloyd Iman Marvian Mark M. Wilde Theoretical Division Los Alamos National Laboratory Los Alamos New Mexico 87545 USA Hearne Institute for Theoretical Physics Department of Physics and Astronomy Louisiana State University Baton Rouge Louisiana 70803 USA Department of Mechanical Engineering Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Research Laboratory of Electronics Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Departments of Physics & Electrical and Computer Engineering Duke University Durham North Carolina 27708 USA Center for Computation and Technology Louisiana State University Baton Rouge Louisiana 70803 USA

Energy-time uncertainty plays an important role in quantum foundations and technologies, and it was even discussed by the founders of quantum mechanics. However, standard approaches (e.g., Robertson’s uncertainty relation) do not apply to energy-time uncertainty because, in general, there is no Hermitian operator associated with time. Following previous approaches, we quantify time uncertainty by how well one can read off the time from a quantum clock. We then use entropy to quantify the information-theoretic distinguishability of the various time states of the clock. Our main result is an entropic energy-time uncertainty relation for general time-independent Hamiltonians, stated for both the discrete-time and continuous-time cases. Our uncertainty relation is strong, in the sense that it allows for a quantum memory to help reduce the uncertainty, and this formulation leads us to reinterpret it as a bound on the relative entropy of asymmetry. Because of the operational relevance of entropy, we anticipate that our uncertainty relation will have information-processing applications.

关键词： Quantum entanglement Quantum foundations Quantum information processing Quantum measurements Quantum memories Quantum theory