George J. Pappas

Bio: George J. Pappas is an academic researcher from University of Pennsylvania. The author has contributed to research in topics: Hybrid system & Computer science. The author has an hindex of 96, co-authored 677 publications receiving 33624 citations. Previous affiliations of George J. Pappas include University of California, Berkeley & Royal Institute of Technology.

Flocking in Fixed and Switching Networks

Abstract: This note analyzes the stability properties of a group of mobile agents that align their velocity vectors, and stabilize their inter-agent distances, using decentralized, nearest-neighbor interaction rules, exchanging information over networks that change arbitrarily (no dwell time between consecutive switches). These changes introduce discontinuities in the agent control laws. To accommodate for arbitrary switching in the topology of the network of agent interactions we employ nonsmooth analysis. The main result is that regardless of switching, convergence to a common velocity vector and stabilization of inter-agent distances is still guaranteed as long as the network remains connected at all times

Conflict resolution for air traffic management: a study in multiagent hybrid systems

Abstract: Air traffic management (ATM) of the future allows for the possibility of free flight, in which aircraft choose their own optimal routes, altitudes, and velocities. The safe resolution of trajectory conflicts between aircraft is necessary to the success of such a distributed control system. In this paper, we present a method to synthesize provably safe conflict resolution manoeuvres. The method models the aircraft and the manoeuvre as a hybrid control system and calculates the maximal set of safe initial conditions for each aircraft so that separation is assured in the presence of uncertainties in the actions of the other aircraft. Examples of manoeuvres using both speed and heading changes are worked out in detail.

Discrete abstractions of hybrid systems

Abstract: A hybrid system is a dynamical system with both discrete and continuous state changes. For analysis purposes, it is often useful to abstract a system in a way that preserves the properties being analysed while hiding the details that are of no interest. We show that interesting classes of hybrid systems can be abstracted to purely discrete systems while preserving all properties that are definable in temporal logic. The classes that permit discrete abstractions fall into two categories. Either the continuous dynamics must be restricted, as is the case for timed and rectangular hybrid systems, or the discrete dynamics must be restricted, as is the case for o-minimal hybrid systems. In this paper, we survey and unify results from both areas.

Stable flocking of mobile agents, part I: fixed topology

Abstract: This is the first of a two-part paper that investigates the stability properties of a system of multiple mobile agents with double integrator dynamics In this first part we generate stable flocking motion for the group using a coordination control scheme which gives rise to smooth control laws for the agents These control laws are a combination of attractive/repulsive and alignment forces, ensuring collision avoidance and cohesion of the group and an aggregate motion along a common heading direction In this control scheme the topology of the control interconnections is fixed and time invariant The control policy ensures that all agents eventually align with each other and have a common heading direction while at the same time avoid collisions and group into a tight formation

Leader-to-formation stability.

Abstract: The paper investigates the stability properties of mobile agent formations which are based on leader following. We derive nonlinear gain estimates that capture how leader behavior affects the interconnection errors observed in the formation. Leader-to-formation stability (LFS) gains quantify error amplification, relate interconnection topology to stability and performance, and offer safety bounds for different formation topologies. Analysis based on the LFS gains provides insight to error propagation and suggests ways to improve the safety, robustness, and performance characteristics of a formation.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。

Consensus and Cooperation in Networked Multi-Agent Systems

Abstract: This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in small-world networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, distributed sensor fusion in sensor networks, and belief propagation. We establish direct connections between spectral and structural properties of complex networks and the speed of information diffusion of consensus algorithms. A brief introduction is provided on networked systems with nonlocal information flow that are considerably faster than distributed systems with lattice-type nearest neighbor interactions. Simulation results are presented that demonstrate the role of small-world effects on the speed of consensus algorithms and cooperative control of multivehicle formations

Consensus seeking in multiagent systems under dynamically changing interaction topologies

Abstract: This note considers the problem of information consensus among multiple agents in the presence of limited and unreliable information exchange with dynamically changing interaction topologies. Both discrete and continuous update schemes are proposed for information consensus. This note shows that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.