You searched for +publisher:"Georgia Tech" +contributor:("Shamma, Jeff S.").
Showing records 1 – 11 of
11 total matches.
No search limiters apply to these results.
1.
Genton, Antoine.
Conflict resolution in a decentralized air traffic concept of operation.
Degree: MS, Aerospace Engineering, 2015, Georgia Tech
URL: http://hdl.handle.net/1853/53508 
► The current air traffic concept of operations relies on a centralized process in which ground controllers are responsible for determining conflict-free trajectories. However, with new…
(more)
▼ The current air traffic concept of operations relies on a centralized process in which ground controllers are responsible for determining conflict-free trajectories. However, with new technologies such as ADS-B and GPS, aircraft could directly interact together to resolve their own conflicts in a decentralized manner. The challenge is to guarantee aircraft separation while converging to reasonably fair resolutions for all aircraft. The difficulty is that aircraft have only limited information about how the other aircraft evaluate the cost of conflict resolutions.
Thus, this thesis proposes to frame decentralized conflict resolution using game theory. A collaborative decentralized conflict resolution is developed as a sequential bargaining process between the different aircraft. The goal of each aircraft is to minimize the cost associated with the conflict resolution. However, each aircraft doesn’t know the cost function and performance constraints of the other involved aircraft.
In the sequential bargaining process developed, aircraft propose at each step personal trajectories to the other aircraft, corresponding to trajectories they would be ready to fly. Then they compute response trajectories, corresponding to trajectories they would have to fly to avoid the conflict if the personal trajectories were flown. If some response trajectories are cheaper than the offered personal trajectories, an agreement is reached; otherwise compromises have to be made by the aircraft by offering more expensive personal trajectories at the next step.
Several pairwise conflict experiments, corresponding to different conflict geometries, were conducted to explore different ways of handling performance constraints and different ways of searching trajectories in the resolution space.
Ultimately, the algorithm was demonstrated in a large scale simulation with more than a thousand aircraft flying over the Indianapolis Center, incurring more than five hundred conflicts. The traffic sets were taken from real ETMS data over five hours, to represent ‘real’ conditions. 93% of the conflicts were successfully solved by the bargaining process.
Advisors/Committee Members: Pritchett, Amy R. (advisor), Feron, Eric M. (committee member), Shamma, Jeff S. (committee member).
Subjects/Keywords: Decentralized; Conflict; Resolution; Bargaining; Game theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Genton, A. (2015). Conflict resolution in a decentralized air traffic concept of operation. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53508
Chicago Manual of Style (16th Edition):
Genton, Antoine. “Conflict resolution in a decentralized air traffic concept of operation.” 2015. Masters Thesis, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/53508.
MLA Handbook (7th Edition):
Genton, Antoine. “Conflict resolution in a decentralized air traffic concept of operation.” 2015. Web. 25 Jan 2021.
Vancouver:
Genton A. Conflict resolution in a decentralized air traffic concept of operation. [Internet] [Masters thesis]. Georgia Tech; 2015. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/53508.
Council of Science Editors:
Genton A. Conflict resolution in a decentralized air traffic concept of operation. [Masters Thesis]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53508
2.
Jones, Malachi G.
Asymmetric information games and cyber security.
Degree: PhD, Electrical and Computer Engineering, 2013, Georgia Tech
URL: http://hdl.handle.net/1853/50284
► A cyber-security problem is a conflict-resolution scenario that typically consists of a security system and at least two decision makers (e.g. attacker and defender) that…
(more)
▼ A cyber-security problem is a conflict-resolution scenario that typically consists of a security system and at least two decision makers (e.g. attacker and defender) that can each have competing objectives. In this thesis, we are interested in cyber-security problems where one decision maker has superior or better information. Game theory is a well-established mathematical tool that can be used to analyze such problems and will be our tool of choice. In particular, we will formulate cyber-security problems as stochastic games with asymmetric information, where game-theoretic methods can then be applied to the problems to derive optimal policies for each decision maker. A severe limitation of considering optimal policies is that these policies are computationally prohibitive. We address the complexity issues by introducing methods, based on the ideas of model predictive control, to compute suboptimal polices. Specifically, we first prove that the methods generate suboptimal policies that have tight performance bounds. We then show that the suboptimal polices can be computed by solving a linear program online, and the complexity of the linear program remains constant with respect to the game length. Finally, we demonstrate how the suboptimal policy methods can be applied to cyber-security problems to reduce the computational complexity of forecasting cyber-attacks.
Advisors/Committee Members: Shamma, Jeff S. (advisor), Fekri, Faramarz (committee member), Egerstedt, Magnus (committee member), Feron, Eric (committee member), Blough, Doug (committee member).
Subjects/Keywords: Game theory; Asymmetric information games; Cyber security; Cyber-attack forecasting; Model predictive control; Stochastic games; Repeated games; Cyber intelligence (Computer security); Decision making; Game theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jones, M. G. (2013). Asymmetric information games and cyber security. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/50284
Chicago Manual of Style (16th Edition):
Jones, Malachi G. “Asymmetric information games and cyber security.” 2013. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/50284.
MLA Handbook (7th Edition):
Jones, Malachi G. “Asymmetric information games and cyber security.” 2013. Web. 25 Jan 2021.
Vancouver:
Jones MG. Asymmetric information games and cyber security. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/50284.
Council of Science Editors:
Jones MG. Asymmetric information games and cyber security. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/50284
Georgia Tech
3.
Lim, Yusun.
Game theoretic distributed coordination: drifting environments and constrained communications.
Degree: PhD, Electrical and Computer Engineering, 2014, Georgia Tech
URL: http://hdl.handle.net/1853/52986
► The major objective of this dissertation is extending the capabilities of game theoretic distributed control to more general settings. In particular, we are interested in…
(more)
▼ The major objective of this dissertation is extending the capabilities of game theoretic distributed control to more general settings. In particular, we are interested in drifting environments and/or constrained communications.
The first part of the dissertation concerns slowly varying dynamics, i.e., drifting environments. A standard assumption in game theoretic learning is a stationary environment, e.g., the game is fixed. We investigate the case of slow variations and show that for sufficiently slow time variations, the limiting behavior “tracks” the stochastically stable states. Since the analysis is regarding Markov processes, the results could be applied to various game theoretic learning rules. In this research, the results were applied to log-linear learning. A mobile sensor coverage example was tested in both simulation and laboratory experiments.
The second part considers a problem of coordinating team players' actions without any communications in team-based zero-sum games. Generally, some global signalling devices are required for common randomness between players, but communications are very limited or impossible in many practical applications. Instead of learning a one-shot strategy, we let players coordinate a periodic sequence of deterministic actions and put an assumption on opponent'
s rationality. Since team players' action sequences are periodic and deterministic, common randomness is no longer required to coordinate players. It is proved that if a length of a periodic action sequence is long enough, then opponents with limited rationality cannot recognize its pattern. Because the opponents cannot recognize that the players are playing deterministic actions, the players' behavior looks like a correlated and randomized joint strategy with empirical distribution of their action sequences. Consequently players can coordinate their action sequences without any communications or global signals, and the resulting action sequences have correlated behavior.
Moreover, the notion of micro-players are introduced for efficient learning of long action sequences. Micro-player matching approach provides a new framework that converts the original team-based zero-sum game to a game between micro-players. By introducing a de Bruijn sequence to micro-player matching, we successfully separate the level of opponent'
s rationality and the size of the game of micro-players. The simulation results are shown to demonstrate the performance of micro-player matching methods.
Lastly, the results of the previous two topics are combined by considering a problem of coordinating actions without communications in drifting environments. More specifically, it is assumed that the opponent player in the team-based zero-sum games tries to adjust its strategy in the set of bounded recall strategies. Then the time-varying opponent'
s strategy can be considered as a dynamic environment parameter in a coordination game between the team players. Additionally, we develop a human testbed program for further study regarding a human as an…
Advisors/Committee Members: Shamma, Jeff S. (advisor), Wardi, Yorai (committee member), Fekri, Faramarz (committee member), Feron, Eric (committee member), Howard, Ayanna M. (committee member), Bloch, Matthieu R. (committee member).
Subjects/Keywords: Game theoretic learning; Cooperative control; Distributed control
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lim, Y. (2014). Game theoretic distributed coordination: drifting environments and constrained communications. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52986
Chicago Manual of Style (16th Edition):
Lim, Yusun. “Game theoretic distributed coordination: drifting environments and constrained communications.” 2014. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/52986.
MLA Handbook (7th Edition):
Lim, Yusun. “Game theoretic distributed coordination: drifting environments and constrained communications.” 2014. Web. 25 Jan 2021.
Vancouver:
Lim Y. Game theoretic distributed coordination: drifting environments and constrained communications. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/52986.
Council of Science Editors:
Lim Y. Game theoretic distributed coordination: drifting environments and constrained communications. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52986
Georgia Tech
4.
Siddique, Shahnewaz.
Failure mechanisms of complex systems.
Degree: PhD, Aerospace Engineering, 2014, Georgia Tech
URL: http://hdl.handle.net/1853/51831
► Understanding the behavior of complex, large-scale, interconnected systems in a rigorous and structured manner is one of the most pressing scientific and technological challenges of…
(more)
▼ Understanding the behavior of complex, large-scale, interconnected systems in a rigorous and structured manner is one of the most pressing scientific and technological challenges of current times. These systems include, among many others, transportation and communications systems, smart grids and power grids, financial markets etc. Failures of these systems have potentially enormous social, environmental and financial costs. In this work, we investigate the failure mechanisms of load-sharing complex systems. The systems are composed of multiple nodes or components whose failures are determined based on the interaction of their respective strengths and loads (or capacity and demand respectively) as well as the ability of a component to share its load with its neighbors when needed. Each component possesses a specific strength (capacity) and can be in one of three states: failed, damaged or functioning normally. The states are determined based on the load (demand) on the component.
We focus on two distinct mechanisms to model the interaction between components strengths and loads. The first, a Loss of Strength (LOS) model and the second, a Customer Service (CS) model. We implement both models on lattice and scale-free graph network topologies. The failure mechanisms of these two models demonstrate temporal scaling phenomena, phase transitions and multiple distinct failure modes excited by extremal dynamics. We find that the resiliency of these models is sensitive to the underlying network topology. For critical ranges of parameters the models demonstrate power law and exponential failure patterns. We find that the failure mechanisms of these models have parallels to failure mechanisms of critical infrastructure systems such as congestion in transportation networks, cascading failure in electrical power grids, creep-rupture in composite structures, and draw-downs in financial markets. Based on the different variants of failure, strategies for mitigating and postponing failure in these critical infrastructure systems can be formulated.
Advisors/Committee Members: Feron, Eric M. (advisor), Volovoi, Vitali V. (committee member), Hodges, Dewey H. (committee member), Schrage, Daniel P. (committee member), Shamma, Jeff S. (committee member).
Subjects/Keywords: Non-equilibrium systems; Statistical physics; Extremal dynamics; Cascading failure; Network congestion; Monte Carlo simulations; Reliability theory; System failures (Engineering); System analysis; Electric network topology
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Siddique, S. (2014). Failure mechanisms of complex systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51831
Chicago Manual of Style (16th Edition):
Siddique, Shahnewaz. “Failure mechanisms of complex systems.” 2014. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/51831.
MLA Handbook (7th Edition):
Siddique, Shahnewaz. “Failure mechanisms of complex systems.” 2014. Web. 25 Jan 2021.
Vancouver:
Siddique S. Failure mechanisms of complex systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/51831.
Council of Science Editors:
Siddique S. Failure mechanisms of complex systems. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51831
Georgia Tech
5.
Ruf, Sebastian Felix.
A control theoretic perspective on social networks.
Degree: PhD, Electrical and Computer Engineering, 2018, Georgia Tech
URL: http://hdl.handle.net/1853/59915
► This thesis discusses the application of control theory to the study of complex networks, drawing inspiration from the behavior of social networks. There are three…
(more)
▼ This thesis discusses the application of control theory to the study of complex networks, drawing inspiration from the behavior of social networks. There are three topic areas covered by the thesis. The first area considers the ability to control a dynamical system which evolves over a network. Specifically, this thesis introduces a network controllability notion known as herdability. Herdability quantifies the ability to encourage general behavioral change in a system via a set-based reachability condition, which describes a class of desirable behaviors for the application of control in a social network setting. The notion is closely related to the classical notion of controllability, however ensuring complete controllability of large complex networks is often unnecessary for certain beneficial behaviors to be achieved. The basic theory of herdability is developed in this thesis. The second area of study, which builds directly on the first, is the application of herdability to the study of complex networks. Specifically, this thesis explores how to make a network herdable, an extension of the input selection problem which is often discussed in the context of controllability. The input selection problem in this case considers which nodes to select to ensure the maximal number of nodes in the system are herdable. When there are multiple single node sets which can be used to make a system completely herdable, a herdability centrality measure is introduced to differentiate between them. The herdability centrality measure, a measure of importance with respect to the ability to herd the network with minimum energy, is compared to existing centrality measures. The third area explores modeling the spread of the adoption of a beneficial behavior or an idea, in which the spread is encouraged by the action of a social network. A novel model of awareness-coupled epidemic spread is introduced, where agents in a network are aware of a virus (here representing something which should be spread) moving through the network. If the agents have a high opinion of the virus, they are more likely to adopt it. The behavior of this viral model is considered both analytically and in simulation.
Advisors/Committee Members: Egerstedt, Magnus (advisor), Shamma, Jeff S. (committee member), Yezzi, Anthony (committee member), Dovrolis, Constantine (committee member), Feron, Eric (committee member), Wardi, Yorai (committee member).
Subjects/Keywords: Control theory; Social networks; Network science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ruf, S. F. (2018). A control theoretic perspective on social networks. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59915
Chicago Manual of Style (16th Edition):
Ruf, Sebastian Felix. “A control theoretic perspective on social networks.” 2018. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/59915.
MLA Handbook (7th Edition):
Ruf, Sebastian Felix. “A control theoretic perspective on social networks.” 2018. Web. 25 Jan 2021.
Vancouver:
Ruf SF. A control theoretic perspective on social networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/59915.
Council of Science Editors:
Ruf SF. A control theoretic perspective on social networks. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/59915
Georgia Tech
6.
Dolatshahi, Sepideh.
Advanced methodologies for the modeling of metabolic pathway systems based on time series data.
Degree: PhD, Electrical and Computer Engineering, 2015, Georgia Tech
URL: http://hdl.handle.net/1853/55530
► Metabolic pathways are series of enzyme-catalyzed chemical reactions that take place within a cell. These biochemical pathways can be quite elaborate and highly regulated with…
(more)
▼ Metabolic pathways are series of enzyme-catalyzed chemical reactions that take place within a cell. These biochemical pathways can be quite elaborate and highly regulated with numerous positive or negative feedback or feed-forward mechanisms, which produce complex dynamical behaviors. Time series data have been more readily available in recent years as a result of the development of new measurement techniques. These techniques offer novel options for inferring the intricate regulatory structure of the metabolic pathways, analyzing the design and function of biological modules, as well as making predictions based on this analysis. The first objective of the proposed research is to advance mathematical methodologies for the study of metabolic and signaling pathways where time series data are available. The second objective is the application of these methodological advances toward a deeper understanding of the glycolytic pathway in the dairy bacterium Lactococcus lactis.
Advisors/Committee Members: Voit, Eberhard O (advisor), Butera, Robert J. (advisor), Kemp, Melissa L. (committee member), Shamma, Jeff S. (committee member), Verriest, Erik I. (committee member), Vidakovic, Brani (committee member).
Subjects/Keywords: Biochemical Systems Theory (BST); Dynamic Flux Estimation (DFE); Metabolic pathway analysis; Parameter estimation; Smoothing; Wavelets
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dolatshahi, S. (2015). Advanced methodologies for the modeling of metabolic pathway systems based on time series data. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55530
Chicago Manual of Style (16th Edition):
Dolatshahi, Sepideh. “Advanced methodologies for the modeling of metabolic pathway systems based on time series data.” 2015. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/55530.
MLA Handbook (7th Edition):
Dolatshahi, Sepideh. “Advanced methodologies for the modeling of metabolic pathway systems based on time series data.” 2015. Web. 25 Jan 2021.
Vancouver:
Dolatshahi S. Advanced methodologies for the modeling of metabolic pathway systems based on time series data. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/55530.
Council of Science Editors:
Dolatshahi S. Advanced methodologies for the modeling of metabolic pathway systems based on time series data. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/55530
7.
Wu, Wencen.
Bio-inspired cooperative exploration of noisy scalar fields.
Degree: PhD, Electrical and Computer Engineering, 2013, Georgia Tech
URL: http://hdl.handle.net/1853/48940
► A fundamental problem in mobile robotics is the exploration of unknown fields that might be inaccessible or hostile to humans. Exploration missions of great importance…
(more)
▼ A fundamental problem in mobile robotics is the exploration of unknown fields that might be inaccessible or hostile to humans. Exploration missions of great importance include geological survey, disaster prediction and recovery, and search and rescue. For missions in relatively large regions, mobile sensor networks (MSN) are ideal candidates. The basic idea of MSN is that mobile robots form a sensor network that collects information, meanwhile, the behaviors of the mobile robots adapt to changes in the environment. To design feasible motion patterns and control of MSN, we draw inspiration from biology, where animal groups demonstrate amazingly complex but adaptive collective behaviors to changing environments.
The main contributions of this thesis include platform independent mathematical models for the coupled motion-sensing dynamics of MSN and biologically-inspired provably convergent cooperative control and filtering algorithms for MSN exploring unknown scalar fields in both 2D and 3D spaces. We introduce a novel model of behaviors of mobile agents that leads to fundamental theoretical results for evaluating the feasibility and difficulty of exploring a field using MSN. Under this framework, we propose and implement source seeking algorithms using MSN inspired by behaviors of fish schools. To balance the cost and performance in exploration tasks, a switching strategy, which allows the mobile sensing agents to switch between individual and cooperative exploration, is developed. Compared to fixed strategies, the switching strategy brings in more flexibility in engineering design. To reveal the geometry of 3D spaces, we propose a control and sensing co-design for MSN to detect and track a line of curvature on a desired level surface.
Advisors/Committee Members: Zhang, Fumin (advisor), Shamma, Jeff S. (committee member), Wardi, Yorai (committee member), Egerstedt, Magnus (committee member), Haddad, Wassim M. (committee member).
Subjects/Keywords: Bio-inspired; Cooperative exploration; Mobile sensor networks; Mobile robots; Biomimicry; Mathematical models; Computer simulation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wu, W. (2013). Bio-inspired cooperative exploration of noisy scalar fields. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/48940
Chicago Manual of Style (16th Edition):
Wu, Wencen. “Bio-inspired cooperative exploration of noisy scalar fields.” 2013. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/48940.
MLA Handbook (7th Edition):
Wu, Wencen. “Bio-inspired cooperative exploration of noisy scalar fields.” 2013. Web. 25 Jan 2021.
Vancouver:
Wu W. Bio-inspired cooperative exploration of noisy scalar fields. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/48940.
Council of Science Editors:
Wu W. Bio-inspired cooperative exploration of noisy scalar fields. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/48940
8.
Aksaray, Derya.
Formulation of control strategies for requirement definition of multi-agent surveillance systems.
Degree: PhD, Aerospace Engineering, 2014, Georgia Tech
URL: http://hdl.handle.net/1853/53121
► In a multi-agent system (MAS), the overall performance is greatly influenced by both the design and the control of the agents. The physical design determines…
(more)
▼ In a multi-agent system (MAS), the overall performance is greatly influenced by both the design and the control of the agents. The physical design determines the agent capabilities, and the control strategies drive the agents to pursue their objectives using the available capabilities. The objective of this thesis is to incorporate control strategies in the early conceptual design of an MAS. As such, this thesis proposes a methodology that mainly explores the interdependency between the design variables of the agents and the control strategies used by the agents. The output of the proposed methodology, i.e. the interdependency between the design variables and the control strategies, can be utilized in the requirement analysis as well as in the later design stages to optimize the overall system through some higher fidelity analyses.
In this thesis, the proposed methodology is applied to a persistent multi-UAV surveillance problem, whose objective is to increase the situational awareness of a base that receives some instantaneous monitoring information from a group of UAVs. Each UAV has a limited energy capacity and a limited communication range. Accordingly, the connectivity of the communication network becomes essential for the information flow from the UAVs to the base. In long-run missions, the UAVs need to return to the base for refueling with certain frequencies depending on their endurance. Whenever a UAV leaves the surveillance area, the remaining UAVs may need relocation to mitigate the impact of its absence. In the control part of this thesis, a set of energy-aware control strategies are developed for efficient multi-UAV surveillance operations. To this end, this thesis first proposes a decentralized strategy to recover the connectivity of the communication network. Second, it presents two return policies for UAVs to achieve energy-aware persistent surveillance. In the design part of this thesis, a design space exploration is performed to investigate the overall performance by varying a set of design variables and the candidate control strategies. Overall, it is shown that a control strategy used by an MAS affects the influence of the design variables on the mission performance. Furthermore, the proposed methodology identifies the preferable pairs of design variables and control strategies through low fidelity analysis in the early design stages.
Advisors/Committee Members: Mavris, Dimitri N. (advisor), Feron, Eric (committee member), Shamma, Jeff S. (committee member), Schrage, Daniel P. (committee member), Griendling, Kelly (committee member).
Subjects/Keywords: Multi-agent systems; Persistent surveillance; Decentralized control; Connectivity maintenance; Design space exploration
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Aksaray, D. (2014). Formulation of control strategies for requirement definition of multi-agent surveillance systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53121
Chicago Manual of Style (16th Edition):
Aksaray, Derya. “Formulation of control strategies for requirement definition of multi-agent surveillance systems.” 2014. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/53121.
MLA Handbook (7th Edition):
Aksaray, Derya. “Formulation of control strategies for requirement definition of multi-agent surveillance systems.” 2014. Web. 25 Jan 2021.
Vancouver:
Aksaray D. Formulation of control strategies for requirement definition of multi-agent surveillance systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/53121.
Council of Science Editors:
Aksaray D. Formulation of control strategies for requirement definition of multi-agent surveillance systems. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/53121
9.
Pickem, Daniel.
Self-reconfigurable multi-robot systems.
Degree: PhD, Electrical and Computer Engineering, 2016, Georgia Tech
URL: http://hdl.handle.net/1853/55001
► Self-reconfigurable robotic systems are variable-morphology machines capable of changing their overall structure by rearranging the modules they are composed of. Individual modules are capable of…
(more)
▼ Self-reconfigurable robotic systems are variable-morphology machines capable of changing their overall structure by rearranging the modules they are composed of. Individual modules are capable of connecting and disconnecting to and from one another, which allows the robot to adapt to changing environments. Optimally reconfiguring such systems is computationally prohibitive and thus in general self-reconfiguration approaches aim at approximating optimal solutions. Nonetheless, even for approximate solutions, centralized methods scale poorly in the number of modules. Therefore, the objective of this research is the development of decentralized self-reconfiguration methods for modular robotic systems. Building on completeness results of the centralized algorithms in this work, decentralized methods are developed that guarantee stochastic convergence to a given target shape. A game-theoretic approach lays the theoretical foundation of a novel potential game-based formulation of the self-reconfiguration problem. Furthermore, two extensions to the basic game-theoretic algorithm are proposed that enable agents to modify the algorithms' parameters during runtime and improve convergence times. The flexibility in the choice of utility functions together with runtime adaptability makes the presented approach and the underlying theory suitable for a range of problems that rely on decentralized local control to guarantee global, emerging properties. The experimental evaluation of the presented algorithms relies on a newly developed multi-robotic testbed called the "Robotarium" that is equipped with custom-designed miniature robots, the "GRITSBots". The Robotarium provides hardware validation of self-reconfiguration on robots but more importantly introduces a novel paradigm for remote accessibility of multi-agent testbeds with the goal of lowering the barrier to entrance into the field of multi-robot research and education.
Advisors/Committee Members: Egerstedt, Magnus (advisor), Shamma, Jeff S. (committee member), Romberg, Justin (committee member), Grover, Martha A. (committee member), Ueda, Jun (committee member).
Subjects/Keywords: Self-reconfiguration; Multi-agent systems; Game-theoretic learning; Multi-robot testbeds; Agent-based approaches
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pickem, D. (2016). Self-reconfigurable multi-robot systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55001
Chicago Manual of Style (16th Edition):
Pickem, Daniel. “Self-reconfigurable multi-robot systems.” 2016. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/55001.
MLA Handbook (7th Edition):
Pickem, Daniel. “Self-reconfigurable multi-robot systems.” 2016. Web. 25 Jan 2021.
Vancouver:
Pickem D. Self-reconfigurable multi-robot systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/55001.
Council of Science Editors:
Pickem D. Self-reconfigurable multi-robot systems. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55001
10.
Paarporn, Keith.
Information and decision-making in socio-biological multi-agent systems.
Degree: PhD, Electrical and Computer Engineering, 2018, Georgia Tech
URL: http://hdl.handle.net/1853/59911
► The objective of this thesis is to develop understanding of the role of information in multi-agent biological and social systems, and to identify ways the…
(more)
▼ The objective of this thesis is to develop understanding of the role of information in multi-agent biological and social systems, and to identify ways the information can be influenced in order to produce a desirable outcome. These systems consist of a population of individual decision makers who wish to achieve a common goal. Individuals may only have access to a limited amount or certain types of information and hence make only partially informed decisions. We investigate the role information plays in three distinct systems that appear in biological and social contexts - 1) epidemic spreading in a population of aware individuals, 2) social dilemmas of cooperation, and 3) averting a tragedy of the commons. The operation of these systems depend on how information or incentives are distributed among the agents, and the decisions they make affecting the population-level welfare. We analyze their inherent behaviors and outline methods in which they can be influenced.
Advisors/Committee Members: Weitz, Joshua S. (advisor), Wardi, Yorai (advisor), Shamma, Jeff S. (committee member), Egerstedt, Magnus (committee member), Ratcliff, William (committee member), Bloch, Matthieu (committee member).
Subjects/Keywords: Multi-agent systems; Information; Control; Biology
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Paarporn, K. (2018). Information and decision-making in socio-biological multi-agent systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59911
Chicago Manual of Style (16th Edition):
Paarporn, Keith. “Information and decision-making in socio-biological multi-agent systems.” 2018. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/59911.
MLA Handbook (7th Edition):
Paarporn, Keith. “Information and decision-making in socio-biological multi-agent systems.” 2018. Web. 25 Jan 2021.
Vancouver:
Paarporn K. Information and decision-making in socio-biological multi-agent systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/59911.
Council of Science Editors:
Paarporn K. Information and decision-making in socio-biological multi-agent systems. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/59911
11.
Aziz, Farhan Muhammad.
Resilience of LTE networks against smart jamming attacks: A game-theoretic approach.
Degree: PhD, Electrical and Computer Engineering, 2017, Georgia Tech
URL: http://hdl.handle.net/1853/58635
► The objectives of this research are to identify security vulnerabilities in LTE/LTE-A air interface; model the network and the smart jammer dynamics under realistic constraints;…
(more)
▼ The objectives of this research are to identify security vulnerabilities in LTE/LTE-A air interface; model the network and the smart jammer dynamics under realistic constraints; and devise adept algorithms that can help the network combat smart jamming attacks autonomously. LTE/LTE-A networks provide advanced data, Voice-over-IP (VoIP), multimedia, and location-based services to more than a billion subscribers around the world. Lately, it has been suggested to utilize commercially and privately-owned LTE/LTE-A networks for mission-critical applications like public safety, smart grid and military communications. Although LTE/LTE-A air interface provides ease of accessibility, flexibility, mobility support, low latency, high data rates, and economy of scale, it also raises serious security concerns. It is shown that the LTE air interface is vulnerable to denial-of-service (DoS) and loss of service attacks from power and bandwidth-limited smart jammers, without being hacked by them. The interaction between the network and the smart jammer is modeled as a two-player infinite-horizon Bayesian game with asymmetric information, with the network being the uninformed player. This research investigates the smart jamming problem in LTE/LTE-A networks, by using heuristic analysis, threat mechanism, game-theoretic and reinforcement learning and regret minimization in repeated games to construct autonomous policies for the network to help it combat these attacks. Moreover, this work is focused on devising policies (algorithms) that can be practically deployed in current networks under realistic constraints, without modifying 3GPP specifications.
Advisors/Committee Members: Shamma, Jeff S. (advisor), Stuber, Gordon L. (advisor), McLaughlin, Steven W. (committee member), Feron, Eric M. J. (committee member), Bloch, Matthieu R. (committee member), Romberg, Justin K. (committee member).
Subjects/Keywords: LTE/LTE-advanced; Smart jamming; Repeated game with asymmetric information; Threat mechanism; Game-theoretic learning; Regret minimization; Algorithms
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Aziz, F. M. (2017). Resilience of LTE networks against smart jamming attacks: A game-theoretic approach. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58635
Chicago Manual of Style (16th Edition):
Aziz, Farhan Muhammad. “Resilience of LTE networks against smart jamming attacks: A game-theoretic approach.” 2017. Doctoral Dissertation, Georgia Tech. Accessed January 25, 2021.
http://hdl.handle.net/1853/58635.
MLA Handbook (7th Edition):
Aziz, Farhan Muhammad. “Resilience of LTE networks against smart jamming attacks: A game-theoretic approach.” 2017. Web. 25 Jan 2021.
Vancouver:
Aziz FM. Resilience of LTE networks against smart jamming attacks: A game-theoretic approach. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2021 Jan 25].
Available from: http://hdl.handle.net/1853/58635.
Council of Science Editors:
Aziz FM. Resilience of LTE networks against smart jamming attacks: A game-theoretic approach. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58635
. 
Open Access Theses and Dissertations
