The aim of this research is to expand the access of hands-on controls education at the undergraduate level with an affordable laboratory kit. A kit was assembled for around $130 while replicating the educational functionality of a typical station in an introductory controls laboratory. The kit consists of a Raspberry Pi, a DC motor, and various circuits required for the lab exercises. Details of each of these components are explained. Additionally, the laboratory experiments tested with this kit are described. This kit replaces expensive equipment with an affordable alternative that can be easily shipped anywhere in the world and used by students who do not have a formal laboratory space to use. The kit greatly enhances the accessibility of the laboratory experience to students in budget-strapped campus laboratories and those participating in distance education.
28 January 2020 in IEEE Transactions on Automatic Control
Neither the existence, nor the non-existence, of a Liveness Enforcing Supervisory Policy (LESP) for an arbitrary Petri net (PN) is semi-decidable. In an attempt to identify decidable instances, we explore the decidability of certain properties of the set of initial markings for which an LESP exists, and the decidability of the existence of a specific class of LESPs. We first prove that for an arbitrary PN structure, determining if there is an initial marking, or there are no initial markings, for which there is an LESP, is not semi-decidable. Then, we characterize the class of PN structures for which the set of all initial-markings for which an LESP exists is right-closed. We show that testing membership, or non-membership, of an arbitrary PN in this class of PNs is not semi-decidable. We then consider a restricted class of LESPs, called marking monotone LESPs (MM-LESPs). We show that the existence of an MM-LESP for an arbitrary PN is decidable.
The authors consider Petri nets (PNs), where each transition can be prevented from firing by an external agent, the supervisor. A PN is said to be live if it is possible to fire any transition from every reachable marking, although not necessarily immediately. The procedure proposed previously by the author (1996) involves the construction of the coverability graph, which can be computationally expensive. Using the refinement/abstraction procedure of Suzuki and Murata (1983), where a single transition in a abstracted PN N is replaced by a PN N/spl circ/ to yield a larger refined PN N/spl circ/, we show that when N/spl circ/ belongs to a class of marked-graph PNs, there is a supervisory policy that enforces liveness in the refined PN N/spl circ/ if and only if there is a similar policy for the abstracted PN N. Since the coverability graph of the PN N is smaller than that of the PN N/spl circ/, it is possible to achieve significant computational savings by using the process of abstraction on N/spl circ/. This is illustrated by example.
This paper describes the development of an embedded system whose purpose is to control the Novint Falcon as a robot, and to develop a control experiment that demonstrates the use the Novint Falcon as a robotic actuator. The Novint Falcon, which is a PC input device, is "haptic" in the sense that it has a force feedback component. Its relatively low cost compared with other platforms makes it a good candidate for academic application in robot modeling and control. An embedded system is developed to interface with the multiple motors and sensors present in the Novint Falcon, which is subsequently used to control three independent Novint Falcons for a "ballon-plate" experiment. The results show that the device is a viable solution for high-speed actuation of small-scale mechanical systems.