Artificial Intelligence and Robotics Commons^™

Artificial Intelligence – I: A Preliminary Framework For Human-Agent Communication In Electronic Negotiations, Moez Ur Rehman, Nosheen Riaz

International Conference on Information and Communication Technologies

Electronic negotiations are business negotiations conducted via electronic means using information and communications technologies (ICT). Two dominant types of electronic negotiation systems are automated negotiation systems for software agents and negotiation support systems (NSSs) for humans. However, the integration of two types for human-agent negotiations is an important task. In this paper, an extended communication model for human-agent business negotiations is presented. For this purpose, the underlying communication models of automated negotiations and NSSs are analyzed. The extended communication model is based on a common negotiation ontology which captures the negotiation agenda and paves the way for such hybrid communication, …

Finding Robust-Under-Risk Solutions For Flowshop Scheduling, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We propose and explore, in the context of benchmark problems for flowshop scheduling, a risk-based concept of robustness for optimization problems. This risk-based concept is in distinction to, and complements, the uncertainty-based concept employed in the field known as robust optimization. Implementation of our concept requires problem solution methods that sample the solution space intelligently and that produce large numbers of distinct sample points. With these solutions to hand, their robustness scores are easily obtained and heuristically robust solutions found. We find evolutionary computation to be effective for this purpose on these problems.

Learning Author’S Writing Pattern System By Automata, Qun Yu

Master's Projects

The purpose of the report is to document our project’s theory, implementation and test results. The project works on an automata-based learning system which models authors’ writing characters with automatons. Since there were pervious works done by Dr. T.Y. Lin and Ms. S.X. Zhang, we continue on ALERGIA algorithm analysis and initial common pattern study in this project. Although every author has his/her own writing style, such as sentence length and word frequency etc, there are always some similarities in writing style. We hypothesize that common strings fogged the expected test result, just like the noise in radio wave. This …

Solution Pluralism And Metaheuristics, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, Frederic H. Murphy, David Harlan Wood

Research Collection School Of Computing and Information Systems

Solution pluralism is an approach to problem solving and deliberation. It employs a plurality of distinct solutions for a decision problem for aiding decision making. The concept is well established in existing practice, although perhaps not recognized as such. This paper: (1) presents the concept as a generalization of established practice, (2) briefly describes successful uses of the concept in practice, and (3) presents several areas that appear would benefit from application of the concept. Throughout, the role of metaheuristics in finding the pluralities of solutions is emphasized.

Scalable Multiagent Planning Using Probabilistic Inference, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint

Research Collection School Of Computing and Information Systems

Multiagent planning has seen much progress with the development of formal models such as Dec-POMDPs. However, the complexity of these models -- NEXP-Complete even for two agents -- has limited scalability. We identify certain mild conditions that are sufficient to make multiagent planning amenable to a scalable approximation w.r.t. the number of agents. This is achieved by constructing a graphical model in which likelihood maximization is equivalent to plan optimization. Using the Expectation-Maximization framework for likelihood maximization, we show that the necessary inference can be decomposed into processes that often involve a small subset of agents, thereby facilitating scalability. We …

Message-Passing Algorithms For Quadratic Programming Formulations Of Map Estimation, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation of MAP can be derived from the CCCP perspective. Experiments on synthetic and real-world problems …

Real-World Parameter Tuning Using Factorial Design With Parameter Decomposition, Aldy Gunawan, Hoong Chuin Lau, Elaine Wong

Research Collection School Of Computing and Information Systems

In this paper, we explore the idea of improving the efficiency of factorial design for parameter tuning of metaheuristics. In a standard full factorial design, the number of runs increases exponentially as the number of parameters. To reduce the parameter search space, one option is to first partition parameters into disjoint categories. While this may be done manually based on user guidance, an automated approach proposed in this paper is to apply a fractional factorial design to partition parameters based on their main effects where each partition is then tuned independently. With a careful choice of fractional design, our approach …

A Novel Methodology For Evaluating User Interfaces In Health Care, Luca Longo, Bridget Kane

Conference papers

A pilot study is reported to identify an improved method of evaluating digital user interfaces in health care. Experience and developments from the aviation industry and the NASA-TLX mental workload assessment tools are applied in conjunction with Nielsen heuristics for evaluating an Electronic Health Record System in an Irish hospital. The NASA-TLX performs subjective workload assessments on operators working with various human-computer systems. Results suggest that depending on the cognitive workload and the working context of users, the usability will differ for the same digital interface. We conclude that incorporating the NASA-TLX with Nielsen's heuristics offers a more reliable method …

Effects Of Appearance And Functions On Likability And Perceived Occupational Suitability Of Robots, Sau-Lai Lee, Ivy Yee-Man Lau, Ying-Yi Hong

Research Collection School of Social Sciences

This article reports three experiments that examined the association between (a) appearances and perceived capabilities of robots, (b) appearance and capabilities of robots and liking for the robots, and (c) perceived capabilities of robots and judgments concerning their suitability for different occupations. In Experiment 1, the authors found that participants perceived human- and animal-like robots to have relatively more warmth-related (e.g., emotion) capabilities than machinelike robots have. In Experiment 2, the authors found that liking for robots was not affected by their human likeness or their having warmth or competence capabilities. In Experiment 3, participants generally thought that robots should …

Intelligent Systems Development In A Non Engineering Curriculum, Emily A. Brand, William L. Honig, Matthew Wojtowicz

Computer Science: Faculty Publications and Other Works

Much of computer system development today is programming in the large - systems of millions of lines of code distributed across servers and the web. At the same time, microcontrollers have also become pervasive in everyday products, economical to manufacture, and represent a different level of learning about system development. Real world systems at this level require integrated development of custom hardware and software.

How can academic institutions give students a view of this other extreme - programming on small microcontrollers with specialized hardware? Full scale system development including custom hardware and software is expensive, beyond the range of any …

Multiagent Coalition Formation In Uncertain Environments With Type-Changing Influences And Its Application Towards Forming Human Coalitions, Nobel A. Khandaker

School of Computing: Dissertations, Theses, and Student Research

We aim to solve the problem forming multiagent coalitions in uncertain environments where the coalition members’ capability of solving tasks change due to their learning. The MCFP-Mproblem for the agents refers to forming or joining coalitions on behalf of a set of human users so that those human users can solve tasks and improve their types (expertise) to improve their performances over time. MCFP-A problem for a set of agents refers to their forming or joining coalitions so that they are able to solve a set of assigned tasks while optimize their performance over time. We propose the Integrated Human …

Noise, Delays, And Resonance In A Neural Network, Austin Quan

HMC Senior Theses

A stochastic-delay differential equation (SDDE) model of a small neural network with recurrent inhibition is presented and analyzed. The model exhibits unexpected transient behavior: oscillations that occur at the boundary of the basins of attraction when the system is bistable. These are known as delay-induced transitory oscillations (DITOs). This behavior is analyzed in the context of stochastic resonance, an unintuitive, though widely researched phenomenon in physical bistable systems where noise can play in constructive role in strengthening an input signal. A method for modeling the dynamics using a probabilistic three-state model is proposed, and supported with numerical evidence. The potential …

A Simple Curious Agent To Help People Be Curious, Han Yu, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Curiosity is an innately rewarding state of mind that, over the millennia, has driven the human race to explore and discover. Many researches in pedagogical science have confirmed the importance of being curious to the students' cognitive development. However, in the newly popular virtual world-based learning environments (VLEs), there is currently a lack of attention being paid to enhancing the learning experience by stimulating the learners' curiosity. In this paper, we propose a simple model for curious agents (CAs) which can be used to stimulate learners' curiosity in VLEs. Potential future research directions will be discussed.

Message-Passing Algorithms For Large Structured Decentralized Pomdps, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Decentralized POMDPs provide a rigorous framework for multi-agent decision-theoretic planning. However, their high complexity has limited scalability. In this work, we present a promising new class of algorithms based on probabilistic inference for infinite-horizon ND-POMDPs---a restricted Dec-POMDP model. We first transform the policy optimization problem to that of likelihood maximization in a mixture of dynamic Bayes nets (DBNs). We then develop the Expectation-Maximization (EM) algorithm for maximizing the likelihood in this representation. The EM algorithm for ND-POMDPs lends itself naturally to a simple message-passing paradigm guided by the agent interaction graph. It is thus highly scalable w.r.t. the number of …

Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig

Research Collection School Of Computing and Information Systems

Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP to the next one in the sequence. We introduce the ReuseBounds procedure, which can be used by any-space ADOPT and any-space BnB-ADOPT to find cost-minimal solutions for all DCOPs in the sequence faster than by solving each DCOP individually. This procedure allows those agents that are guaranteed to remain unaffected by a change to reuse their lower and upper …

Distributed Model Shaping For Scaling To Decentralized Pomdps With Hundreds Of Agents, Prasanna Velagapudi, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri

Research Collection School Of Computing and Information Systems

The use of distributed POMDPs for cooperative teams has been severely limited by the incredibly large joint policy- space that results from combining the policy-spaces of the individual agents. However, much of the computational cost of exploring the entire joint policy space can be avoided by observing that in many domains important interactions between agents occur in a relatively small set of scenarios, previously defined as coordination locales (CLs) [11]. Moreover, even when numerous interactions might occur, given a set of individual policies there are relatively few actual interactions. Exploiting this observation and building on an existing model shaping algorithm, …

Decentralized Decision Support For An Agent Population In Dynamic And Uncertain Domains, Pradeep Reddy Varakantham, Shih-Fen Cheng, Thi Duong Nguyen

Research Collection School Of Computing and Information Systems

This research is motivated by problems in urban transportation and labor mobility, where the agent flow is dynamic, non-deterministic and on a large scale. In such domains, even though the individual agents do not have an identity of their own and do not explicitly impact other agents, they have implicit interactions with other agents. While there has been much research in handling such implicit effects, it has primarily assumed controlled movements of agents in static environments. We address the issue of decision support for individual agents having involuntary movements in dynamic environments . For instance, in a taxi fleet serving …

Adaptive Decision Support For Structured Organizations: A Case For Orgpomdps, Pradeep Reddy Varakantham, Nathan Schurr, Alan Carlin, Christopher Amato

Research Collection School Of Computing and Information Systems

In today's world, organizations are faced with increasingly large and complex problems that require decision-making under uncertainty. Current methods for optimizing such decisions fall short of handling the problem scale and time constraints. We argue that this is due to existing methods not exploiting the inherent structure of the organizations which solve these problems. We propose a new model called the OrgPOMDP (Organizational POMDP), which is based on the partially observable Markov decision process (POMDP). This new model combines two powerful representations for modeling large scale problems: hierarchical modeling and factored representations. In this paper we make three key contributions: …

Random Keys Genetic Algorithms Scheduling And Rescheduling Systems For Common Production Systems, Elkin Rodriguez-Velasquez

Engineering Management & Systems Engineering Theses & Dissertations

The majority of scheduling research deals with problems in specific production environments with specific objective functions. However, in many cases, more than one problem type and/or objective function exists, resulting in the need for a more generic and flexible system to generate schedules. Furthermore, most of the published scheduling research focuses on creating an optimal or near optimal initial schedule during the planning phase. However, after production processes start, circumstances like machine breakdowns, urgent jobs, and other unplanned events may render the schedule suboptimal, obsolete or even infeasible resulting in a "rescheduling" problem, which is typically also addressed for a …

Holistic Network Defense: Fusing Host And Network Features For Attack Classification, Jenny W. Ji

Theses and Dissertations

This work presents a hybrid network-host monitoring strategy, which fuses data from both the network and the host to recognize malware infections. This work focuses on three categories: Normal, Scanning, and Infected. The network-host sensor fusion is accomplished by extracting 248 features from network traffic using the Fullstats Network Feature generator and from the host using text mining, looking at the frequency of the 500 most common strings and analyzing them as word vectors. Improvements to detection performance are made by synergistically fusing network features obtained from IP packet flows and host features, obtained from text mining port, processor, logon …