About: Containment (computer programming) is a research topic. Over the lifetime, 473 publications have been published within this topic receiving 6689 citations.
TL;DR: This brief studies distributed containment control for double-integrator dynamics in the presence of both stationary and dynamic leaders to derive conditions on the network topology and the control gains to guarantee asymptotic containment control in any dimensional space.
Abstract: This brief studies distributed containment control for double-integrator dynamics in the presence of both stationary and dynamic leaders. In the case of stationary leaders, we propose a distributed containment control algorithm and study conditions on the network topology and the control gains to guarantee asymptotic containment control in any dimensional space. In the case of dynamic leaders, we study two cases: leaders with an identical velocity and leaders with nonidentical velocities. For the first case, we propose two distributed containment control algorithms to solve, respectively, asymptotic containment control under a switching directed network topology and finite-time containment control under a fixed directed network topology. In particular, asymptotic containment control can be achieved for any dimensional space if the network topology is fixed and for only the 1-D space if the network topology is switching. For the second case, we propose a distributed containment control algorithm under a fixed network topology where the communication patterns among the followers are undirected and derive conditions on the network topology and the control gains to guarantee asymptotic containment control for any dimensional space. Both simulation results and experimental results on a multi-robot platform are provided to validate some theoretical results.
TL;DR: In 2004, 11 undergraduate students who organized a sit-in support of adjunct faculty and service employee workers at The George Washington University (GW) were arrested by Washington, DC police as a result of a university complaint for trespassing in the Marvin Center, the designated student center as discussed by the authors.
Abstract: On March 29, 2004, 11 undergraduate students who organized a sit-in support of adjunct faculty and service employee workers at The George Washington University (GW) were arrested by Washington, DC police as a result of a university complaint for trespassing in the Marvin Center, the designated student center. Considering the arrest of the eleven students provides a moment in which to re-conceptualize the corporate university. Most of the students who were arrested were members of the Progressive Student Union (PSU). Over the past few years this organization has studied workers and working conditions on the GW campus. Among others, students in PSU are in contact with parking lot workers in GW garages, housekeepers who clean GW dorm rooms, unionized cafeteria workers on campus, and GW part-time faculty who are involved in an attempt to unionize. The PSU-initiated sit-in was a response to labor abuses observed by students throughout the year, as well as their feeling that GW failed to respond to student objections to these labor abuses. In the fall of the 2003-2004 academic year, it was reported that theAramark Company, contracted by GW to operate campus food services, dismissed approximately 28 workers. The workers—many of whom the PSU students know personally—were replaced with non-unionized temporary employees. In addition, several of the food stalls in the cafeteria were outsourced to non-unionized contractors. At the same time, PSU students learned from parking workers about the anti-union efforts of their employer, Colonial Parking Company. According to Holly Smith, a member of the PSU, PSU efforts to develop a conversation with the GW administration about labor abuses were met
TL;DR: Two kinds of classical control schemes are utilized to address the proposed synthesis problem of the containment control with respect to continuous-time semi- Markovian multiagent systems with semi-Markovian switching topologies.
Abstract: This article is concerned with the problem of the containment control with respect to continuous-time semi-Markovian multiagent systems with semi-Markovian switching topologies. Two kinds of classical control schemes, which are dynamic containment control and static containment control schemes, are utilized to address the proposed synthesis problem. Based on the linear matrix inequality (LMI) method, the dynamic containment controller and static containment controller are designed to plunge into the studied semi-Markovian multiagent systems, respectively. Moreover, the random switching topologies with the semi-Markovian process, the partly unknown transition rates, and the generally uncertain transition rates are taken into account, which can be applicable to more practical situations. Finally, the simulation results are provided to illustrate the effectiveness of the proposed theoretical results.
TL;DR: It is shown that containment of STRUQLO queries is decidable, and a syntactic criteria for query containment is given, based on a notion of query mappings, which extends containment mappings for conjunctive queries.
Abstract: The management of semistructured data has recently rccoivcd significant attention because of the need of several applications to model and query large volumes of irregular data. This paper considers the problem of query containment for a query language over semistructured data, STRUQLO, that contains the essential feature common to all such languages, namely the ability to specify regular path expressions over the data. We show hcrc that containment of STRUQLO queries is decidable. First, we give a semantic criterion for STRUQLO query containment: WC show that it suffices to check containment on only finitely many canonical databases. Second, we give a syntactic criteria for query containment, based on a notion of query mappings, which extends containment mappings for conjunctive queries. Third, wc consider a certain fragment of STRUQLO, obtained by imposing restrictions on the regular path expressions, and show that query containment for this fragment of STRUQLO is NP complete.