arXiv subjects

Hai Lin

Publications and source records attributed to Hai Lin.

At least 217 records · Page 12Linked to original sources

arXiv2014

Decentralized Hybrid Formation Control of Unmanned Aerial Vehicles

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.

eess.SY↗

arXiv2013

Building Blocks for Generalized Heterotic/F-theory Duality

In this note we propose a generalization of heterotic/F-theory duality. We introduce a set of non-compact building blocks which we glue together to reach compact examples of generalized duality pairs. The F-theory building blocks consist of non-compact elliptically fibered Calabi-Yau fourfolds which also admit a K3 fibration. The compact elliptic model obtained by gluing need not have a globally defined K3 fibration. By replacing the K3 fiber of each F-theory building block with a T^2, we reach building blocks in a heterotic dual vacuum which includes a position dependent dilaton and three-form flux. These building blocks are glued together to reach a heterotic flux background. We argue that in these vacua, the gauge fields of the heterotic string become localized, and remain dynamical even when gravity decouples. This enables a heterotic dual for the hyperflux GUT breaking mechanism which has recently figured prominently in F-theory GUT models. We illustrate our general proposal with some explicit examples.

hep-th↗

arXiv2013

Structural Controllability of Switched Linear Systems

This paper studies the structural controllability of a class of uncertain switched linear systems, where the parameters of subsystems state matrices are either unknown or zero. The structural controllability is a generalization of the traditional controllability concept for dynamical systems, and purely based on the interconnection relation between the state variables and inputs through non-zero elements in the state matrices. In order to illustrate such a relationship, two kinds of graphic representations of switched linear systems are proposed, based on which graph theory based necessary and sufficient characterizations of the structural controllability for switched linear systems are presented. Finally, the paper concludes with discussions on the results and future work.

eess.SY↗

arXiv2013

Quantum tunneling from three-dimensional black holes

We study Hawking radiation from three-dimensional black holes. For this purpose the emission of charged scalar and charged fermionic particles is investigated from charged BTZ black holes, with and without rotation. We use the quantum tunneling approach incorporating WKB approximation and spacetime symmetries. Another class of black hole which is asymptotic to a Sol three-manifold has also been investigated. This procedure gives us the tunneling probability of outgoing particles, and we compute the temperature of the radiation for these black holes. We also consider the quantum tunneling of particles from black hole asymptotic to Sol geometry.

hep-th↗

arXiv2013

On exotic sphere fibrations, topological phases, and edge states in physical systems

We suggest that exotic sphere fibrations can be mapped to band topologies in condensed matter systems. These fibrations can correspond to geometric phases of two double bands or state vector bases with second Chern numbers m+n and -n respectively. They can be related to topological insulators, magneto-electric effects, and photonic crystals with special edge states. We also consider time-reversal symmetry breaking perturbations of topological insulator, and heterostructures of topological insulators with normal insulators and with superconductors. We consider periodic TI/NI/TI/NI' heterostuctures, and periodic TI/SC/TI/SC' heterostuctures. They also give rise to models of Weyl semimetals which have thermal and electrical transports.

cond-mat.str-el↗

arXiv2012

Giant gravitons and correlators

We calculate non-extremal correlators of Schur polynomials and single trace operators. We analyse their dual descriptions from the approach of the variation of DBI and WZ actions of the giant gravitons. We show a regularization procedure under which the extremal correlators of Schur polynomials and single trace operators match exactly with string theory computation. Other aspects of the extremal and non-extremal correlators are also discussed.

hep-th↗

arXiv2012

Cooperative Tasking for Deterministic Specification Automata

In our previous work [1], a divide-and-conquer approach was proposed for cooperative tasking among multi-agent systems. The basic idea is to decompose a requested global specification into subtasks for individual agents such that the fulfillment of these subtasks by each individual agent leads to the satisfaction of the global specification as a team. It was shown that not all tasks can be decomposed. Furthermore, a necessary and sufficient condition was proposed for the decomposability of a task automaton between two cooperative agents. The current paper continues the results in [1] and proposes necessary and sufficient conditions for task decomposability with respect to arbitrary finite number of agents. It is further shown that the fulfillment of local specifications can guarantee the satisfaction of the global specification. This work provides hints for the designers on how to rule out the indecomposable task automata and enforce the decomposability conditions. The result therefore may pave the way towards a new perspective for decentralized cooperative control of multi-agent systems.

eess.SY↗

arXiv2012

An Input-Output Simulation Approach to Controlling Multi-AffineSystems for Linear Temporal Logic Specifications

This paper presents an input-output simulation approach to controlling multi-affine systems for linear temporal logic (LTL) specifications, which consists of the following steps. First, we partition the state space into rectangles, each of which satisfies atomic LTL propositions. Then, we study the control of multi-affine systems on rectangles including the control of driving all trajectories starting from a rectangle to exit through a facet and the control of stabilizing the system towards a desired point. With the proposed controllers, a finitely abstracted transition system is constructed which is shown to be input-output simulated by the rectangular transition system of the multi-affine system. Since input-output simulation preserves LTL properties, the controller synthesis of the multi-affine system for LTL specifications is achieved by designing a nonblocking supervisor for the abstracted transition system and by continuously implementing the resulting supervisor for the original multi-affine system.

eess.SY↗

arXiv2012

Graph-Theoretic Characterizations of Structural Controllability for Multi-Agent System with Switching Topology

This paper considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems under switching topologies is investigated. The structural controllability of multi-agent systems is a generalization of the traditional controllability concept for dynamical systems, and purely based on the communication topologies among agents. The main contributions of the paper are graph-theoretic characterizations of the structural controllability for multi-agent systems. It turns out that the multi-agent system with switching topology is structurally controllable if and only if the union graph G of the underlying communication topologies is connected (single leader) or leader-follower connected (multi-leader). Finally, the paper concludes with several illustrative examples and discussions of the results and future work.

cs.MA↗

arXiv2012

Bisimilarity Enforcing Supervisory Control for Deterministic Specifications

This paper investigates the supervisory control of nondeterministic discrete event systems to enforce bisimilarity with respect to deterministic specifications. A notion of synchronous simulation-based controllability is introduced as a necessary and sufficient condition for the existence of a bisimilarity enforcing supervisor, and a polynomial algorithm is developed to verify such a condition. When the existence condition holds, a supervisor achieving bisimulation equivalence is constructed. Furthermore, when the existence condition does not hold, two different methods are provided for synthesizing maximal permissive sub-specifications.

eess.SY↗

arXiv2012

Output Feedback Tracking Control for a Class of Uncertain Systems subject to Unmodeled Dynamics and Delay at Input

Besides parametric uncertainties and disturbances, the unmodeled dynamics and time delay at the input are often present in practical systems, which cannot be ignored in some cases. This paper aims to solve output feedback tracking control problem for a class of nonlinear uncertain systems subject to unmodeled high-frequency gains and time delay at the input. By the additive decomposition, the uncertain system is transformed to an uncertainty-free system, where the uncertainties, disturbance and effect of unmodeled dynamics plus time delay are lumped into a new disturbance at the output. Sequently, additive decomposition is used to decompose the transformed system, which simplifies the tracking controller design. To demonstrate the effectiveness, the proposed control scheme is applied to three benchmark examples.

eess.SY↗

arXiv2012

Additive-Decomposition-Based Output Feedback Tracking Control for Systems with Measurable Nonlinearities and Unknown Disturbances

In this paper, a new control scheme, called as additive-decomposition-based tracking control, is proposed to solve the output feedback tracking problem for a class of systems with measurable nonlinearities and unknown disturbances. By the additive decomposition, the output feedback tracking task for the considered nonlinear system is decomposed into three independent subtasks: a pure tracking subtask for a linear time invariant (LTI) system, a pure rejection subtask for another LTI system and a stabilization subtask for a nonlinear system. By benefiting from the decomposition, the proposed additive-decomposition-based tracking control scheme i) can give a potential way to avoid conflict among tracking performance, rejection performance and robustness, and ii) can mix both design in time domain and frequency domain for one controller design. To demonstrate the effectiveness, the output feedback tracking problem for a single-link robot arm subject to a sinusoidal or a general disturbance is solved respectively, where the transfer function method for tracking and rejection and backstepping method for stabilization are applied together to the design.

nlin.AO↗

arXiv2011

Young diagrams, Brauer algebras, and bubbling geometries

We study the 1/4 BPS geometries corresponding to the 1/4 BPS operators of the dual gauge theory side, in ${\cal N}=4$ SYM. By analyzing asymptotic structure and flux integration of the geometries, we present a mapping between droplet configurations arising from the geometries and Young diagrams of the Brauer algebra. In particular, the integer $k$ classifying the operators in the Brauer basis is mapped to the mixing between the two angular directions.

hep-th↗

arXiv2011

Decentralized Supervisory Control of Discrete Event Systems for Bisimulation Equivalence

In decentralized systems, branching behaviors naturally arise due to communication, unmodeled dynamics and system abstraction, which can not be adequately captured by the traditional sequencing-based language equivalence. As a finer behavior equivalence than language equivalence, bisimulation not only allows the full set of branching behaviors but also explicitly specifies the properties in terms of temporal logic such as CTL* and mu-calculus. This observation motivates us to consider the decentralized control of discrete event systems (DESs) for bisimulation equivalence in this paper, where the plant and the specification are taken to be nondeterministic and the supervisor is taken to be deterministic. An automata-based control framework is formalized, upon which we develop three architectures with respect to different decision fusion rules for the decentralized bisimilarity control, named a conjunctive architecture, a disjunctive architecture and a general architecture. Under theses three architectures, necessary and sufficient conditions for the existence of decentralized bisimilarity supervisors are derived respectively, which extend the traditional results of supervisory control from language equivalence to bisimulation equivalence. It is shown that these conditions can be verified with exponential complexity. Furthermore, the synthesis of bisimilarity supervisors is presented when the existence condition holds.

eess.SY↗

arXiv2011

Strings on Bubbling Geometries

We study gauge theory operators which take the form of a product of a trace with a Schur polynomial, and their string theory duals. These states represent strings excited on bubbling AdS geometries which are dual to the Schur polynomials. These geometries generically take the form of multiple annuli in the phase space plane. We study the coherent state wavefunction of the lattice, which labels the trace part of the operator, for a general Young tableau and their dual description on the droplet plane with a general concentric ring pattern. In addition we identify a density matrix over the coherent states on all the geometries within a fixed constraint. This density matrix may be used to calculate the entropy of a given ensemble of operators. We finally recover the BMN string spectrum along the geodesic near any circle from the ansatz of the coherent state wavefunction.

hep-th↗

arXiv2011

Topological conditions of scale-free networks for cooperation to evolve

Evolutionary game theory is employed to study topological conditions of scale-free networks for the evolution of cooperation. We show that Apollonian Networks (ANs) are perfect scale-free networks, on which cooperation can spread to all individuals, even though there are initially only 3 or 4 hubs occupied by cooperators and all the others by defectors. Local topological features such as degree, clustering coefficient, gradient as well as topology potential are adopted to analyze the advantages of ANs in cooperation enhancement. Furthermore, a degree-skeleton underlying ANs is uncovered for understanding the cooperation diffusion. Constructing this kind degree-skeleton for random scale-free networks promotes cooperation level close to that of Barabási-Albert networks, which gives deeper insights into the origin of the latter on organization and further promotion of cooperation.

q-bio.PE↗

arXiv2011

Communicate only when necessary: Cooperative tasking for multi-agent systems

New advances in large scale distributed systems have amazingly offered complex functionalities through parallelism of simple and rudimentary components. The key issue in cooperative control of multi-agent systems is the synthesis of local control and interaction rules among the agents such that the entire controlled system achieves a desired global behavior. For this purpose, three fundamental problems have to be addressed: (1) task decomposition for top-down design, such that the fulfillment of local tasks guarantees the satisfaction of the global task, by the team; (2) fault-tolerant top-down design, such that the global task remains decomposable and achievable, in spite of some failures, and (3) design of interactions among agents to make an undecomposable task decomposable and achievable in a top-down framework. The first two problems have been addressed in our previous works, by identifying necessary and sufficient conditions for task automaton decomposition, and fault-tolerant task decomposability. This paper deals with the third problem and proposes a procedure to redistribute the events among agents in order to enforce decomposability of an undecomposable task automaton. The decomposability conditions are used to identify the root causes of undecomposability which are found to be due to over-communications that have to be deleted, while respecting the fault-tolerant decomposability conditions; or because of the lack of communications that require new sharing of events, while considering new violations of decomposability conditions. This result provides a sufficient condition to make any undecomposable deterministic task automaton decomposable in order to facilitate cooperative tasking. Illustrative examples are presented to show the concept of task automaton decomposabilization.

cs.MA↗

arXiv2011

Fault-tolerant Cooperative Tasking for Multi-agent Systems

A natural way for cooperative tasking in multi-agent systems is through a top-down design by decomposing a global task into sub-tasks for each individual agent such that the accomplishments of these sub-tasks will guarantee the achievement of the global task. In our previous works [1], [2] we presented necessary and sufficient conditions on the decomposability of a global task automaton between cooperative agents. As a follow-up work, this paper deals with the robustness issues of the proposed top-down design approach with respect to event failures in the multi-agent systems. The main concern under event failure is whether a previously decomposable task can still be achieved collectively by the agents, and if not, we would like to investigate that under what conditions the global task could be robustly accomplished. This is actually the fault-tolerance issue of the top-down design, and the results provide designers with hints on which events are fragile with respect to failures, and whether redundancies are needed. The main objective of this paper is to identify necessary and sufficient conditions on failed events under which a decomposable global task can still be achieved successfully. For such a purpose, a notion called passivity is introduced to characterize the type of event failures. The passivity is found to reflect the redundancy of communication links over shared events, based on which necessary and sufficient conditions for the reliability of cooperative tasking under event failures are derived, followed by illustrative examples and remarks for the derived conditions.

eess.SY↗