View All Items

Title: A CONTEXTUAL APPROACH TO LEARNING COLLABORATIVE BEHAVIOR VIA OBSERVATION.
Creator: Johnson, Cynthia, Gonzalez, Avelino, University of Central Florida
Abstract / Description: This dissertation describes a novel technique to creating a simulated team of agents through observation. Simulated human teamwork can be used for a number of purposes, such as expert examples, automated teammates for training purposes and realistic opponents in games and training simulation. Current teamwork simulations require the team member behaviors be programmed into the simulation, often requiring a great deal of time and effort. None are able to observe a team at work and replicate...
Show moreThis dissertation describes a novel technique to creating a simulated team of agents through observation. Simulated human teamwork can be used for a number of purposes, such as expert examples, automated teammates for training purposes and realistic opponents in games and training simulation. Current teamwork simulations require the team member behaviors be programmed into the simulation, often requiring a great deal of time and effort. None are able to observe a team at work and replicate the teamwork behaviors. Machine learning techniques for learning by observation and learning by demonstration have proven successful at observing behavior of humans or other software agents and creating a behavior function for a single agent. The research described here combines current research in teamwork simulations and learning by observation to effectively train a multi-agent system in effective team behavior. The dissertation describes the background and work by others as well as a detailed description of the learning method. A prototype built to evaluate the developed approach as well as the extensive experimentation conducted is also described.
Show less
Date Issued: 2011
Identifier: CFE0003602, ucf:48869
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0003602

Title: Differential Games for Multi-Agent Systems under Distributed Information.
Creator: Lin, Wei, Qu, Zhihua, Simaan, Marwan, Haralambous, Michael, Das, Tuhin, Yong, Jiongmin, University of Central Florida
Abstract / Description: In this dissertation, we consider differential games for multi-agent systems under distributed information where every agent is only able to acquire information about the others according to a directed information graph of local communication/sensor networks. Such games arise naturally from many applications including mobile robot coordination, power system optimization, multi-player pursuit-evasion games, etc. Since the admissible strategy of each agent has to conform to the information...
Show moreIn this dissertation, we consider differential games for multi-agent systems under distributed information where every agent is only able to acquire information about the others according to a directed information graph of local communication/sensor networks. Such games arise naturally from many applications including mobile robot coordination, power system optimization, multi-player pursuit-evasion games, etc. Since the admissible strategy of each agent has to conform to the information graph constraint, the conventional game strategy design approaches based upon Riccati equation(s) are not applicable because all the agents are required to have the information of the entire system. Accordingly, the game strategy design under distributed information is commonly known to be challenging. Toward this end, we propose novel open-loop and feedback game strategy design approaches for Nash equilibrium and noninferior solutions with a focus on linear quadratic differential games. For the open-loop design, approximate Nash/noninferior game strategies are proposed by integrating distributed state estimation into the open-loop global-information Nash/noninferior strategies such that, without global information, the distributed game strategies can be made arbitrarily close to and asymptotically converge over time to the global-information strategies. For the feedback design, we propose the best achievable performance indices based approach under which the distributed strategies form a Nash equilibrium or noninferior solution with respect to a set of performance indices that are the closest to the original indices. This approach overcomes two issues in the classical optimal output feedback approach: the simultaneous optimization and initial state dependence. The proposed open-loop and feedback design approaches are applied to an unmanned aerial vehicle formation control problem and a multi-pursuer single-evader differential game problem, respectively. Simulation results of several scenarios are presented for illustration.
Show less
Date Issued: 2013
Identifier: CFE0005025, ucf:49991
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0005025

Title: Identifying Influential Agents in Social Systems.
Creator: Maghami, Mahsa, Sukthankar, Gita, Turgut, Damla, Wu, Annie, Boloni, Ladislau, Garibay, Ivan, University of Central Florida
Abstract / Description: This dissertation addresses the problem of influence maximization in social networks. Influence maximization is applicable to many types of real-world problems, including modeling contagion, technology adoption, and viral marketing. Here we examine an advertisement domain in which the overarching goal is to find the influential nodes in a social network, based on the network structure and the interactions, as targets of advertisement. The assumption is that advertisement budget limits prevent...
Show moreThis dissertation addresses the problem of influence maximization in social networks. Influence maximization is applicable to many types of real-world problems, including modeling contagion, technology adoption, and viral marketing. Here we examine an advertisement domain in which the overarching goal is to find the influential nodes in a social network, based on the network structure and the interactions, as targets of advertisement. The assumption is that advertisement budget limits prevent us from sending the advertisement to everybody in the network. Therefore, a wise selection of the people can be beneficial in increasing the product adoption. To model these social systems, agent-based modeling, a powerful tool for the study of phenomena that are difficult to observe within the confines of the laboratory, is used.To analyze marketing scenarios, this dissertation proposes a new method for propagating information through a social system and demonstrates how it can be used to develop a product advertisement strategy in a simulated market. We consider the desire of agents toward purchasing an item as a random variable and solve the influence maximization problem in steady state using an optimization method to assign the advertisement of available products to appropriate messenger agents. Our market simulation 1) accounts for the effects of group membership on agent attitudes 2) has a network structure that is similar to realistic human systems 3) models inter-product preference correlations that can be learned from market data. The results on synthetic data show that this method is significantly better than network analysis methods based on centrality measures.The optimized influence maximization (OIM) described above, has some limitations. For instance, it relies on a global estimation of the interaction among agents in the network, rendering it incapable of handling large networks. Although OIM is capable of finding the influential nodes in the social network in an optimized way and targeting them for advertising, in large networks, performing the matrix operations required to find the optimized solution is intractable.To overcome this limitation, we then propose a hierarchical influence maximization (HIM) algorithm for scaling influence maximization to larger networks. In the hierarchical method the network is partitioned into multiple smaller networks that can be solved exactly with optimization techniques, assuming a generalized IC model, to identify a candidate set of seed nodes. The candidate nodes are used to create a distance-preserving abstract version of the network that maintains an aggregate influence model between partitions. The budget limitation for the advertising dictates the algorithm's stopping point. On synthetic datasets, we show that our method comes close to the optimal node selection, at substantially lower runtime costs.We present results from applying the HIM algorithm to real-world datasets collected from social media sites with large numbers of users (Epinions, SlashDot, and WikiVote) and compare it with two benchmarks, PMIA and DegreeDiscount, to examine the scalability and performance.Our experimental results reveal that HIM scales to larger networks but is outperformed by degree-based algorithms in highly-connected networks. However, HIM performs well in modular networks where the communities are clearly separable with small number of cross-community edges. This finding suggests that for practical applications it is useful to account for network properties when selecting an influence maximization method.
Show less
Date Issued: 2014
Identifier: CFE0005205, ucf:50647
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0005205

Title: Quantitative Framework For Social Cultural Interactions.
Creator: Bhatia, Taranjeet, Boloni, Ladislau, Turgut, Damla, Sukthankar, Gita, Fiore, Stephen, University of Central Florida
Abstract / Description: For an autonomous robot or software agent to participate in the social life of humans, it must have a way to perform a calculus of social behavior. Such a calculus must have explanatory power (it must provide a coherent theory for why the humans act the way they do), and predictive power (it must provide some plausible events from the predicted future actions of the humans).This dissertation describes a series of contributions that would allow agents observing or interacting with humans to...
Show moreFor an autonomous robot or software agent to participate in the social life of humans, it must have a way to perform a calculus of social behavior. Such a calculus must have explanatory power (it must provide a coherent theory for why the humans act the way they do), and predictive power (it must provide some plausible events from the predicted future actions of the humans).This dissertation describes a series of contributions that would allow agents observing or interacting with humans to perform a calculus of social behavior taking into account cultural conventions and socially acceptable behavior models. We discuss the formal components of the model: culture-sanctioned social metrics (CSSMs), concrete beliefs (CBs) and action impact functions. Through a detailed case study of a crooked seller who relies on the manipulation of public perception, we show that the model explains how the exploitation of social conventions allows the seller to finalize transactions, despite the fact that the clients know that they are being cheated. In a separate study, we show that how the crooked seller can find an optimal strategy with the use of reinforcement learning.We extend the CSSM model for modeling the propagation of public perception across multiple social interactions. We model the evolution of the public perception both over a single interaction and during a series of interactions over an extended period of time. An important aspect for modeling the public perception is its propagation - how the propagation is affected by the spatio-temporal context of the interaction and how does the short-term and long-term memory of humans affect the overall public perception.We validated the CSSM model through a user study in which participants cognizant with the modeled culture had to evaluate the impact on the social values. The scenarios used in the experiments modeled emotionally charged social situations in a cross-cultural setting and with the presence of a robot. The scenarios model conflicts of cross-cultural communication as well as ethical, social and financial choices. This study allowed us to study whether people sharing the same culture evaluate CSSMs at the same way (the inter-cultural uniformity conjecture). By presenting a wide range of possible metrics, the study also allowed us to determine whether any given metric can be considered a CSSM in a given culture or not.
Show less
Date Issued: 2016
Identifier: CFE0006262, ucf:51047
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0006262

Title: DEVELOPING STRAND SPACE BASED MODELS AND PROVING THE CORRECTNESS OF THE IEEE 802.11I AUTHENTICATION PROTOCOL WITH RESTRICTED SECURITY OBJECTIVES.
Creator: Furqan, Zeeshan, Guha, Ratan, University of Central Florida
Abstract / Description: The security objectives enforce the security policy, which defines what is to be protected in a network environment. The violation of these security objectives induces security threats. We introduce an explicit notion of security objectives for a security protocol. This notion should precede the formal verification process. In the absence of such a notion, the security protocol may be proven correct despite the fact that it is not equipped to defend against all potential threats. In order to...
Show moreThe security objectives enforce the security policy, which defines what is to be protected in a network environment. The violation of these security objectives induces security threats. We introduce an explicit notion of security objectives for a security protocol. This notion should precede the formal verification process. In the absence of such a notion, the security protocol may be proven correct despite the fact that it is not equipped to defend against all potential threats. In order to establish the correctness of security objectives, we present a formal model that provides basis for the formal verification of security protocols. We also develop the modal logic, proof based, and multi-agent approaches using the Strand Space framework. In our modal logic approach, we present the logical constructs to model a protocol's behavior in such a way that the participants can verify different security parameters by looking at their own run of the protocol. In our proof based model, we present a generic set of proofs to establish the correctness of a security protocol. We model the 802.11i protocol into our proof based system and then perform the formal verification of the authentication property. The intruder in our model is imbued with powerful capabilities and repercussions to possible attacks are evaluated. Our analysis proves that the authentication of 802.11i is not compromised in the presented model. We further demonstrate how changes in our model will yield a successful man-in-the-middle attack. Our multi-agent approach includes an explicit notion of multi-agent, which was missing in the Strand Space framework. The limitation of Strand Space framework is the assumption that all the information available to a principal is either supplied initially or is contained in messages received by that principal. However, other important information may also be available to a principal in a security setting, such as a principal may combine information from different roles played by him in a protocol to launch a powerful attack. Our presented approach models the behavior of a distributed system as a multi-agent system. The presented model captures the combined information, the formal model of knowledge, and the belief of agents over time. After building this formal model, we present a formal proof of authentication of the 4-way handshake of the 802.11i protocol.
Show less
Date Issued: 2007
Identifier: CFE0001801, ucf:47380
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0001801

Title: Exploring Natural User Abstractions For Shared Perceptual Manipulator Task Modeling (&) Recovery.
Creator: Koh, Senglee, Laviola II, Joseph, Foroosh, Hassan, Zhang, Shaojie, Kim, Si Jung, University of Central Florida
Abstract / Description: State-of-the-art domestic robot assistants are essentially autonomous mobile manipulators capable of exerting human-scale precision grasps. To maximize utility and economy, non-technical end-users would need to be nearly as efficient as trained roboticists in control and collaboration of manipulation task behaviors. However, it remains a significant challenge given that many WIMP-style tools require superficial proficiency in robotics, 3D graphics, and computer science for rapid task modeling...
Show moreState-of-the-art domestic robot assistants are essentially autonomous mobile manipulators capable of exerting human-scale precision grasps. To maximize utility and economy, non-technical end-users would need to be nearly as efficient as trained roboticists in control and collaboration of manipulation task behaviors. However, it remains a significant challenge given that many WIMP-style tools require superficial proficiency in robotics, 3D graphics, and computer science for rapid task modeling and recovery. But research on robot-centric collaboration has garnered momentum in recent years; robots are now planning in partially observable environments that maintain geometries and semantic maps, presenting opportunities for non-experts to cooperatively control task behavior with autonomous-planning agents exploiting the knowledge. However, as autonomous systems are not immune to errors under perceptual difficulty, a human-in-the-loop is needed to bias autonomous-planning towards recovery conditions that resume the task and avoid similar errors.In this work, we explore interactive techniques allowing non-technical users to model task behaviors and perceive cooperatively with a service robot under robot-centric collaboration. We evaluate stylus and touch modalities that users can intuitively and effectively convey natural abstractions of high-level tasks, semantic revisions, and geometries about the world. Experiments are conducted with `pick-and-place' tasks in an ideal `Blocks World' environment using a Kinova JACO six degree-of-freedom manipulator. Possibilities for the architecture and interface are demonstrated with the following features; (1) Semantic `Object' and `Location' grounding that describe function and ambiguous geometries (2) Task specification with an unordered list of goal predicates, and (3) Guiding task recovery with implied scene geometries and trajectory via symmetry cues and configuration space abstraction. Empirical results from four user studies show our interface was much preferred than the control condition, demonstrating high learnability and ease-of-use that enable our non-technical participants to model complex tasks, provide effective recovery assistance, and teleoperative control.
Show less
Date Issued: 2018
Identifier: CFE0007209, ucf:52292
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0007209

Title: MULTIAGENT LEARNING THROUGH INDIRECT ENCODING.
Creator: D'Ambrosio, David, Stanley, Kenneth, University of Central Florida
Abstract / Description: Designing a system of multiple, heterogeneous agents that cooperate to achieve a common goal is a difficult task, but it is also a common real-world problem. Multiagent learning addresses this problem by training the team to cooperate through a learning algorithm. However, most traditional approaches treat multiagent learning as a combination of multiple single-agent learning problems. This perspective leads to many inefficiencies in learning such as the problem of reinvention, whereby...
Show moreDesigning a system of multiple, heterogeneous agents that cooperate to achieve a common goal is a difficult task, but it is also a common real-world problem. Multiagent learning addresses this problem by training the team to cooperate through a learning algorithm. However, most traditional approaches treat multiagent learning as a combination of multiple single-agent learning problems. This perspective leads to many inefficiencies in learning such as the problem of reinvention, whereby fundamental skills and policies that all agents should possess must be rediscovered independently for each team member. For example, in soccer, all the players know how to pass and kick the ball, but a traditional algorithm has no way to share such vital information because it has no way to relate the policies of agents to each other.In this dissertation a new approach to multiagent learning that seeks to address these issues is presented. This approach, called multiagent HyperNEAT, represents teams as a pattern of policies rather than individual agents. The main idea is that an agent's location within a canonical team layout (such as a soccer team at the start of a game) tends to dictate its role within that team, called the policy geometry. For example, as soccer positions move from goal to center they become more offensive and less defensive, a concept that is compactly represented as a pattern. The first major contribution of this dissertation is a new method for evolving neural network controllers called HyperNEAT, which forms the foundation of the second contribution and primary focus of this work, multiagent HyperNEAT. Multiagent learning in this dissertation is investigated in predator-prey, room-clearing, and patrol domains, providing a real-world context for the approach. Interestingly, because the teams in multiagent HyperNEAT are represented as patterns they can scale up to an infinite number of multiagent policies that can be sampled from the policy geometry as needed. Thus the third contribution is a method for teams trained with multiagent HyperNEAT to dynamically scale their size without further learning. Fourth, the capabilities to both learn and scale in multiagent HyperNEAT are compared to the traditional multiagent SARSA(lamba) approach in a comprehensive study. The fifth contribution is a method for efficiently learning and encoding multiple policies for each agent on a team to facilitate learning in multi-task domains. Finally, because there is significant interest in practical applications of multiagent learning, multiagent HyperNEAT is tested in a real-world military patrolling application with actual Khepera III robots. The ultimate goal is to provide a new perspective on multiagent learning and to demonstrate the practical benefits of training heterogeneous, scalable multiagent teams through generative encoding.
Show less
Date Issued: 2011
Identifier: CFE0003661, ucf:48812
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0003661

Title: Planning and Control of Swarm Motion as Continua.
Creator: Rastgoftar, Hossein, Jayasuriya, Suhada, Das, Tuhin, Xu, Chengying, Qu, Zhihua, Simaan, Marwan, University of Central Florida
Abstract / Description: In this thesis, new algorithms for formation control of multi agent systems (MAS) based on continuum mechanics principles will be investigated. For this purpose agents of the MAS are treated as particles in a continuum, evolving in an n-D space, whose desired configuration is required to satisfy an admissible deformation function. Considered is a specific class of mappings that is called homogenous where the Jacobian of the mapping is only a function of time and is not spatially varying. The...
Show moreIn this thesis, new algorithms for formation control of multi agent systems (MAS) based on continuum mechanics principles will be investigated. For this purpose agents of the MAS are treated as particles in a continuum, evolving in an n-D space, whose desired configuration is required to satisfy an admissible deformation function. Considered is a specific class of mappings that is called homogenous where the Jacobian of the mapping is only a function of time and is not spatially varying. The primary objectives of this thesis are to develop the necessary theory and its validation via simulation on a mobile-agent based swarm test bed that includes two primary tasks: 1) homogenous transformation of MAS and 2) deployment of a random distribution of agents on to a desired configuration. Developed will be a framework based on homogenous transformations for the evolution of a MAS in an n-D space (n=1, 2, and 3), under two scenarios: 1) no inter-agent communication (predefined motion plan); and 2) local inter-agent communication. Additionally, homogenous transformations based on communication protocols will be used to deploy an arbitrary distribution of a MAS on to a desired curve. Homogenous transformation with no communication: A homogenous transformation of a MAS, evolving in an R^n space, under zero inter agent communication is first considered. Here the homogenous mapping, is characterized by an n x n Jacobian matrix Q(t) and an n x 1 rigid body displacement vector D(t), that are based on positions of n+1 agents of the MAS, called leader agents. The designed Jacobian Q(t) and rigid body displacement vector D(t) are passed onto rest of the agents of the MAS, called followers, who will then use that information to update their positions under a pre-defined motion plan. Consequently, the motion of MAS will evolve as a homogenous transformation of the initial configuration without explicit communication among agents. Homogenous Transformation under Local Communication: We develop a framework for homogenous transformation of MAS, evolving in R^n, under a local inter agent communication topology. Here we assume that some agents are the leaders, that are transformed homogenously in an n-D space. In addition, every follower agent of the MAS communicates with some local agents to update its position, in order to grasp the homogenous mapping that is prescribed by the leader agents. We show that some distance ratios that are assigned based on initial formation, if preserved, lead to asymptotic convergence of the initial formation to a final formation under a homogenous mapping.Deployment of a Random Distribution on a Desired Manifold: Deployment of agents of a MAS, moving in a plane, on to a desired curve, is a task that is considered as an application of the proposed approach. In particular, a 2-D MAS evolution problem is considered as two 1-D MAS evolution problems, where x or y coordinates of the position of all agents are modeled as points confined to move on a straight line. Then, for every coordinate of MAS evolution, bulk motion is controlled by two agents considered leaders that move independently, with rest of the follower agents motions evolving through each follower agent communicating with two adjacent agents.
Show less
Date Issued: 2013
Identifier: CFE0004915, ucf:49640
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0004915

Title: On RADAR DECEPTION, AS MOTIVATION FOR CONTROL OF CONSTRAINED SYSTEMS.
Creator: Hajieghrary, Hadi, Jayasuriya, Suhada, Xu, Yunjun, Das, Tuhin, University of Central Florida
Abstract / Description: This thesis studies the control algorithms used by a team of ECAVs (Electronic Combat Air Vehicle) to deceive a network of radars to detect a phantom track. Each ECAV has the electronic capability of intercepting the radar waves, and introducing an appropriate time delay before transmitting it back, and deceiving the radar into seeing a spurious target beyond its actual position. On the other hand, to avoid the errors and increase the reliability, have a complete coverage in various...
Show moreThis thesis studies the control algorithms used by a team of ECAVs (Electronic Combat Air Vehicle) to deceive a network of radars to detect a phantom track. Each ECAV has the electronic capability of intercepting the radar waves, and introducing an appropriate time delay before transmitting it back, and deceiving the radar into seeing a spurious target beyond its actual position. On the other hand, to avoid the errors and increase the reliability, have a complete coverage in various atmosphere conditions, and confronting the effort of the belligerent intruders to delude the sentinel and enter the area usually a network of radars are deployed to guard the region. However, a team of cooperating ECAVs could exploit this arrangement and plans their trajectories in a way all the radars in the network vouch for seeing a single and coherent spurious track of a phantom. Since each station in the network confirms the other, the phantom track is considered valid. This problem serves as a motivating example in trajectory planning for the multi-agent system in highly constrained operation conditions. The given control command to each agent should be a viable one in the agent limited capabilities, and also drives it in a cumulative action to keep the formation.In this thesis, three different approaches to devise a trajectory for each agent is studied, and the difficulties for deploying each one are addressed. In the first one, a command center has all information about the state of the agents, and in every step decides about the control each agent should apply. This method is very effective and robust, but needs a reliable communication. In the second method, each agent decides on its own control, and the members of the group just communicate and agree on the range of control they like to apply on the phantom. Although in this method much less data needs to communicate between the agents, it is very sensitive to the disturbances and miscalculations, and could be easily fell apart or come to a state with no feasible solution to continue. In the third method a differential geometric approach to the problem is studied. This method has a very strong backbone, and minimizes the communication needed to a binary one. However, less data provided to the agents about the system, more sensitive and infirm the system is when it faced with imperfectionalities. In this thesis, an object oriented program is developed in the Matlab software area to simulate all these three control strategies in a scalable fashion. Object oriented programming is a naturally suitable method to simulate a multi-agent system. It gives the flexibility to make the code more close to a real scenario with defining each agent as a separated and independent identity. The main objective is to understand the nature of the constrained dynamic problems, and examine various solutions in different situations. Using the flexibility of this code, we could simulate several scenarios, and incorporate various conditions on the system. Also, we could have a close look at each agent to observe its behavior in these situations. In this way we will gain a good insight of the system which could be used in designing of the agents for specific missions.
Show less
Date Issued: 2013
Identifier: CFE0004857, ucf:49683
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0004857

Title: Information Propagation Algorithms for Consensus Formation in Decentralized Multi-Agent Systems.
Creator: Hollander, Christopher, Wu, Annie, Shumaker, Randall, Wiegand, Rudolf, Turgut, Damla, Song, Zixia, University of Central Florida
Abstract / Description: Consensus occurs within a multi-agent system when every agent is in agreement about the value of some particular state. For example, the color of an LED, the position or magnitude of a vector, a rendezvous location, the most recent state of data within a database, or the identity of a leader are all states that agents might need to agree on in order to execute their tasking.The task of the decentralized consensus problem for multi-agent systems is to design an algorithm that enables agents to...
Show moreConsensus occurs within a multi-agent system when every agent is in agreement about the value of some particular state. For example, the color of an LED, the position or magnitude of a vector, a rendezvous location, the most recent state of data within a database, or the identity of a leader are all states that agents might need to agree on in order to execute their tasking.The task of the decentralized consensus problem for multi-agent systems is to design an algorithm that enables agents to communicate and exchange information such that, in finite time, agents are able to form a consensus without the use of a centralized control mechanism. The primary goal of this research is to introduce and provide supporting evidence for Stochastic Local Observation/Gossip (SLOG) algorithms as a new class of solutions to the decentralized consensus problem for multi-agent systems that lack a centralized controller, with the additional constraints that agents act asynchronously, information is discrete, and all consensus options are equally preferable to all agents. Examples of where these constraints might apply include the spread of social norms and conventions in artificial populations, rendezvous among a set of specific locations, and task assignment.This goal is achieved through a combination of theory and experimentation. Information propagation process and an information propagation algorithm are derived by unifying the general structure of multiple existing solutions to the decentralized consensus problem. They are then used to define two classes of algorithms that spread information across a network and solve the decentralized consensus problem: buffered gossip algorithms and local observation algorithms. Buffered gossip algorithms generalize the behavior of many push-based solutions to the decentralized consensus problem. Local observation algorithms generalize the behavior of many pull-based solutions to the decentralized consensus problem. In the language of object oriented design, buffered gossip algorithms and local observation algorithms are abstract classes; information propagation processes are interfaces. SLOG algorithms combine the transmission mechanisms of buffered gossip algorithms and local observation algorithms into a single "hybrid" algorithm that is able to push and pull information within the local neighborhood. A common mathematical framework is constructed and used to determine the conditions under which each of these algorithms are guaranteed to produce a consensus, and thus solve the decentralized consensus problem. Finally, a series of simulation experiments are conducted to study the performance of SLOG algorithms. These experiments compare the average speed of consensus formation between buffered gossip algorithms, local observation algorithms, and SLOG algorithms over four distinct network topologies.Beyond the introduction of the SLOG algorithm, this research also contributes to the existing literature on the decentralized consensus problem by: specifying a theoretical framework that can be used to explore the consensus behavior of push-based and pull-based information propagation algorithms; using this framework to define buffered gossip algorithms and local observation algorithms as generalizations for existing solutions to the decentralized consensus problem; highlighting the similarities between consensus algorithms within control theory and opinion dynamics within computational sociology, and showing how these research areas can be successfully combined to create new and powerful algorithms; and providing an empirical comparison between multiple information propagation algorithms.
Show less
Date Issued: 2015
Identifier: CFE0005629, ucf:50229
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0005629

Title: Towards Improving Human-Robot Interaction For Social Robots.
Creator: Khan, Saad, Boloni, Ladislau, Behal, Aman, Sukthankar, Gita, Garibay, Ivan, Fiore, Stephen, University of Central Florida
Abstract / Description: Autonomous robots interacting with humans in a social setting must consider the social-cultural environment when pursuing their objectives. Thus the social robot must perceive and understand the social cultural environment in order to be able to explain and predict the actions of its human interaction partners. This dissertation contributes to the emerging field of human-robot interaction for social robots in the following ways: 1. We used the social calculus technique based on culture...
Show moreAutonomous robots interacting with humans in a social setting must consider the social-cultural environment when pursuing their objectives. Thus the social robot must perceive and understand the social cultural environment in order to be able to explain and predict the actions of its human interaction partners. This dissertation contributes to the emerging field of human-robot interaction for social robots in the following ways: 1. We used the social calculus technique based on culture sanctioned social metrics (CSSMs) to quantify, analyze and predict the behavior of the robot, human soldiers and the public perception in the Market Patrol peacekeeping scenario. 2. We validated the results of the Market Patrol scenario by comparing the predicted values with the judgment of a large group of human observers cognizant of the modeled culture. 3. We modeled the movement of a socially aware mobile robot in a dense crowds, using the concept of a micro-conflict to represent the challenge of giving or not giving way to pedestrians. 4. We developed an approach for the robot behavior in micro-conflicts based on the psychological observation that human opponents will use a consistent strategy. For this, the mobile robot classifies the opponent strategy reflected by the personality and social status of the person and chooses an appropriate counter-strategy that takes into account the urgency of the robots' mission. 5. We developed an alternative approach for the resolution of micro-conflicts based on the imitation of the behavior of the human agent. This approach aims to make the behavior of an autonomous robot closely resemble that of a remotely operated one.
Show less
Date Issued: 2015
Identifier: CFE0005965, ucf:50819
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0005965

Title: COALITION FORMATION IN MULTI-AGENT UAV SYSTEMS.
Creator: DeJong, Paul, Boloni, Ladislau, University of Central Florida
Abstract / Description: Coalitions are collections of agents that join together to solve a common problem that either cannot be solved individually or can be solved more efficiently as a group. Each individual agent has capabilities that can benefit the group when working together as a coalition. Typically, individual capabilities are joined together in an additive way when forming a coalition. This work will introduce a new operator that is used when combining capabilities, and suggest that the behavior of the...
Show moreCoalitions are collections of agents that join together to solve a common problem that either cannot be solved individually or can be solved more efficiently as a group. Each individual agent has capabilities that can benefit the group when working together as a coalition. Typically, individual capabilities are joined together in an additive way when forming a coalition. This work will introduce a new operator that is used when combining capabilities, and suggest that the behavior of the operator is contextual, depending on the nature of the capability itself. This work considers six different capabilities of Unmanned Air Vehicles (UAV) and determines the nature of the new operator in the context of each capability as coalitions (squadrons) of UAVs are formed. Coalitions are formed using three different search algorithms, both with and without heuristics: Depth-First, Depth-First Iterative Deepening, and Genetic Algorithm (GA). The effectiveness of each algorithm is evaluated. Multi agent-based UAV simulation software was developed and used to test the ideas presented. In addition to coalition formation, the software aims to address additional multi-agent issues such as agent identity, mutability, and communication as applied to UAV systems, in a realistic simulated environment. Social potential fields provide a means of modeling a clustering attractive force at the same time as a collision-avoiding repulsive force, and are used by the simulation to maintain aircraft position relative to other UAVs.
Show less
Date Issued: 2005
Identifier: CFE0000394, ucf:46332
Format: Document (PDF)
PURL: http://purl.flvc.org/ucf/fd/CFE0000394

multi-agent systems (4)	+ -
Multi-agent system (2)	+ -
simulation (2)	+ -
802.11i (1)	+ -
Advertising (1)	+ -

Agent (1)	+ -
Agent system (1)	+ -
Agents (1)	+ -
CONSTRAINED SYSTEMS (1)	+ -
Coalition (1)	+ -
Coalition Formation (1)	+ -
Coalitions (1)	+ -
Crowd modeling (1)	+ -
DIFFERENTIAL GEOMETRY (1)	+ -
Decentralized control (1)	+ -
Differential game (1)	+ -
Formation Control (1)	+ -
Homogenous Transformation (1)	+ -
Human behavior (1)	+ -
Human robot interaction (1)	+ -
HyperNEAT (1)	+ -
Influence maximization (1)	+ -
Local Communication (1)	+ -
MULTI-AGENT SYSTEMS (1)	+ -
Machine learning (1)	+ -
Multi Agent Systems (MAS) (1)	+ -
Multi-Agent Systems (1)	+ -
Mutli-Agent (1)	+ -
NEAT (1)	+ -
OBJECT-ORIENTED PROGRAMMING (1)	+ -

University of Central Florida (12)	+ -
Boloni, Ladislau (4)	+ -
Das, Tuhin (3)	+ -
Sukthankar, Gita (3)	+ -
Turgut, Damla (3)	+ -

Fiore, Stephen (2)	+ -
Garibay, Ivan (2)	+ -
Jayasuriya, Suhada (2)	+ -
Qu, Zhihua (2)	+ -
Simaan, Marwan (2)	+ -
Wu, Annie (2)	+ -
Behal, Aman (1)	+ -
Bhatia, Taranjeet (1)	+ -
D'Ambrosio, David (1)	+ -
DeJong, Paul (1)	+ -
Foroosh, Hassan (1)	+ -
Furqan, Zeeshan (1)	+ -
Gonzalez, Avelino (1)	+ -
Guha, Ratan (1)	+ -
Hajieghrary, Hadi (1)	+ -
Haralambous, Michael (1)	+ -
Hollander, Christopher (1)	+ -
Johnson, Cynthia (1)	+ -
Khan, Saad (1)	+ -
Kim, Si Jung (1)	+ -
Koh, Senglee (1)	+ -
Laviola II, Joseph (1)	+ -
Lin, Wei (1)	+ -
Maghami, Mahsa (1)	+ -
Rastgoftar, Hossein (1)	+ -

Search In

Sort Results By:

Narrow results by:

Topical Subject

Collection

Type of Resource

Language

Creator

Format

Owner