Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition

Multi-agent systems rely heavily on coordination and cooperation to achieve a variety of tasks. It is often assumed that these agents will be fully cooperative, or have reliable and equal performance among group members. Instead, we consider cooperation as a spectrum of possible interactions, ranging from performance variations within the group to adversarial agents. This thesis examines several scenarios where cooperation and performance are not guaranteed. Potential applications include sensor coverage, emergency response, wildlife management, tracking, and surveillance. We use geometric methods, such as Voronoi tessellations, for design insight and Lyapunov-based stability theory to analyze our proposed controllers. Performance is verified through simulations and experiments on a variety of ground and aerial robotic platforms. First, we consider the problem of Voronoi-based coverage control, where a group of robots must spread out over an environment to provide coverage. Our approach adapts online to sensing and actuation performance variations with the group. The robots have no prior knowledge of their relative performance, and in a distributed fashion, compensate by assigning weaker robots a smaller portion of the environment. Next, we consider the problem of multi-agent herding, akin to shepherding. Here, a group of dog-like robots must drive a herd of non-cooperative sheep-like agents around the environment. Our key insight in designing the control laws for the herders is to enforce geometrical relationships that allow for the combined system dynamics to reduce to a single nonholonomic vehicle. We also investigate the cooperative pursuit of an evader by a group of quadrotors in an environment with no-fly zones. While the pursuers cannot enter the no-fly zones, the evader moves freely through the zones to avoid capture. Using tools for Voronoi-based coverage control, we provide an algorithm to distribute the pursuers around the zone's boundary and minimize capture time once the evader emerges. Finally, we present an algorithm for the guaranteed capture of multiple evaders by one or more pursuers in a bounded, convex environment. The pursuers utilize properties of the evader's Voronoi cell to choose a control strategy that minimizes the safe-reachable area of the evader, which in turn leads to the evader's capture

Convexity Applications in Single and Multi-Agent Control

The focus of this dissertation is in the application of convexity for control problems; specifically, single-agent problems with linear or nonlinear dynamics and multi-agent problems with linear dynamics. A mixture of convex and non-convex constraints for optimal control problems is also considered. The main contributions of this dissertation include: 1) a convexification of single-agent problems with linear dynamics and annular control constraint, 2) a technique for controlling bounded nonlinear single-agent systems, and 3) a technique for solving multi-agent pursuit-evasion games with linear dynamics and convex control and state constraints. The first result shows that for annularly constrained linear systems, controllability is a sufficient condition for a free or fixed time problem to be solvable as a sequence of convex optimization problems. The second result shows that if a nonlinear system is bounded and “ordered”, it is possible to use a convex combination of bounding linear systems to design a control for the nonlinear system. The third result takes advantage of a convex reachable set computation for each agent in solving games using a geometrical approach. Altogether, the theoretical and computational results demonstrate the significance of convex analysis in solving non-convex control problems

Optimal Control Methods for Missile Evasion

Optimal control theory is applied to the study of missile evasion, particularly in the case of a single pursuing missile versus a single evading aircraft. It is proposed to divide the evasion problem into two phases, where the primary considerations are energy and maneuverability, respectively. Traditional evasion tactics are well documented for use in the maneuverability phase. To represent the first phase dominated by energy management, the optimal control problem may be posed in two ways, as a fixed final time problem with the objective of maximizing the final distance between the evader and pursuer, and as a free final time problem with the objective of maximizing the final time when the missile reaches some capture distance away from the evader.These two optimal control problems are studied under several different scenarios regarding assumptions about the pursuer. First, a suboptimal control strategy, proportional navigation, is used for the pursuer. Second, it is assumed that the pursuer acts optimally, requiring the solution of a two-sided optimal control problem, otherwise known as a differential game. The resulting trajectory is known as a minimax, and it can be shown that it accounts for uncertainty in the pursuer\u27s control strategy. Finally, a pursuer whose motion and state are uncertain is studied in the context of Receding Horizon Control and Real Time Optimal Control. The results highlight how updating the optimal control trajectory reduces the uncertainty in the resulting miss distance

Nonlinear Model Predictive Control Framework For Cooperative Three-Agent Target Defense Game

This paper presents cooperative target defense guidance strategies using nonlinear model predictive control (NMPC) framework for a target-attacker-defender (TAD) game. The TAD game consists of an attacker and a cooperative target-defender pair. The attacker's objective is to capture the target, whereas the target-defender team acts together such that the defender can intercept the attacker and ensure target survival. We assume that the cooperative target-defender pair do not have perfect knowledge of the attacker states, and hence the states are estimated using an Extended Kalman Filter (EKF). The capture analysis based on the Apollonius circles is performed to identify the target survival regions. The efficacy of the NMPC-based solution is evaluated through extensive numerical simulations. The results show that the NMPC-based solution offers robustness to the different unknown attacker models and has better performance than CLOS and A-CLOS based strategies.Comment: 16 page

Construction of Barrier in a Fishing Game With Point Capture

This paper addresses a particular pursuit-evasion game, called as “fishing game” where a faster evader attempts to pass the gap between two pursuers. We are concerned with the conditions under which the evader or pursuers can win the game. This is a game of kind in which an essential aspect, barrier, separates the state space into disjoint parts associated with each player's winning region. We present a method of explicit policy to construct the barrier. This method divides the fishing game into two subgames related to the included angle and the relative distances between the evader and the pursuers, respectively, and then analyzes the possibility of capture or escape for each subgame to ascertain the analytical forms of the barrier. Furthermore, we fuse the games of kind and degree by solving the optimal control strategies in the minimum time for each player when the initial state lies in their winning regions. Along with the optimal strategies, the trajectories of the players are delineated and the upper bounds of their winning times are also derived

Optimal steering for kinematic vehicles with applications to spatially distributed agents

The recent technological advances in the field of autonomous vehicles have resulted in a growing impetus for researchers to improve the current framework of mission planning and execution within both the military and civilian contexts. Many recent efforts towards this direction emphasize the importance of replacing the so-called monolithic paradigm, where a mission is planned, monitored, and controlled by a unique global decision maker, with a network centric paradigm, where the same mission related tasks are performed by networks of interacting decision makers (autonomous vehicles). The interest in applications involving teams of autonomous vehicles is expected to significantly grow in the near future as new paradigms for their use are constantly being proposed for a diverse spectrum of real world applications. One promising approach to extend available techniques for addressing problems involving a single autonomous vehicle to those involving teams of autonomous vehicles is to use the concept of Voronoi diagram as a means for reducing the complexity of the multi-vehicle problem. In particular, the Voronoi diagram provides a spatial partition of the environment the team of vehicles operate in, where each element of this partition is associated with a unique vehicle from the team. The partition induces, in turn, a graph abstraction of the operating space that is in a one-to-one correspondence with the network abstraction of the team of autonomous vehicles; a fact that can provide both conceptual and analytical advantages during mission planning and execution. In this dissertation, we propose the use of a new class of Voronoi-like partitioning schemes with respect to state-dependent proximity (pseudo-) metrics rather than the Euclidean distance or other generalized distance functions, which are typically used in the literature. An important nuance here is that, in contrast to the Euclidean distance, state-dependent metrics can succinctly capture system theoretic features of each vehicle from the team (e.g., vehicle kinematics), as well as the environment-vehicle interactions, which are induced, for example, by local winds/currents. We subsequently illustrate how the proposed concept of state-dependent Voronoi-like partition can induce local control schemes for problems involving networks of spatially distributed autonomous vehicles by examining different application scenarios.PhDCommittee Chair: Tsiotras Panagiotis; Committee Member: Egerstedt Magnus; Committee Member: Feron Eric; Committee Member: Haddad Wassim; Committee Member: Shamma Jef

A methodology for finding persons of national interest

The asymmetrical threats that challenge U.S. national policies are not large standing armies, but rather individuals who seek to usurp and coerce U.S. national interests. The nature of today's threats call for the U.S. military to change from finding, fixing, and destroying the enemy's forces to identifying, locating and capturing rogue individuals in order to destroy networks. To counter such threats, the USG will have to quickly and efficiently identify and find these targets globally. Unfortunately, no military doctrine, framework or process currently exists for finding and apprehending these Persons of National Interest (PONIs). Since military planners and intelligence analysts are neither educated nor trained in the methods or procedures necessary to find and capture PONIs, this thesis will propose a methodology to do so. This involves the development of an analytical process, and an organizational structure and procedure to identify and locate PONIs. Consequently, the United States government's ability to prosecute the war on terrorism today, and to find and apprehend PONIs in the future, depends on its ability to develop and institutionalize a comprehensive manhunting strategy now.http://archive.org/details/manhuntingmethod109451921US Air Force (USAF) author.Approved for public release; distribution is unlimited

Chasing control in male blowflies : behavioural performance and neuronal responses

Trischler C. Chasing control in male blowflies : behavioural performance and neuronal responses. Bielefeld (Germany): Bielefeld University; 2008

Guidance and control for defense systems against ballistic threats

A defense system against ballistic threat is a very complex system from the engineering point of view. It involves different kinds of subsystems and, at the same time, it presents very strict requirements. Technology evolution drives the need of constantly upgrading system’s capabilities. The guidance and control fields are two of the areas with the best progress possibilities. This thesis deals with the guidance and control problems involved in a defense system against ballistic threats. This study was undertaken by analyzing the mission of an intercontinental ballistic missile. Trajectory reconstruction from radar and satellite measurements was carried out with an estimation algorithm for nonlinear systems. Knowing the trajectory is a prerequisite for intercepting the ballistic missile. Interception takes place thanks to a dedicated tactical missile. The guidance and control of this missile were also studied in this work. Particular attention was paid on the estimation of engagement’s variables inside the homing loop. Interceptor missiles are usually equipped with a seeker that provides the angle under which the interceptor sees its target. This single measurement does not guarantee the observability of the variables required by advanced guidance laws such as APN, OGL, or differential games-based laws. A new guidance strategy was proposed, that solves the bad observability problems and returns satisfactory engagement performances. The thesis is concluded by a study of the interceptor most suitable aerodynamic configuration in order to implement the proposed strategy, and by the relative autopilot design. The autopilot implements the lateral acceleration commands from the guidance system. The design was carried out with linear control techniques, considering requirements on the rising time, actuators maximum effort, and response to a bang-bang guidance command. The analysis of the proposed solutions was carried on by means of numerical simulations, developed for each single case-study