Artificial Intelligence and Robotics Commons^™

Modeling Flood Risk For An Urban Cbd Using Ahp And Gis, Proceso L. Fernandez Jr, Generino P. Siddayao, Sony E. Valdez

Department of Information Systems & Computer Science Faculty Publications

The Central Business District (CBD) of a city is the activity center of the city, typically locating the main commercial and cultural establishments, as well as acting as the center point of the city’s transportation network. Flood risk assessment for a CBD is crucial for proper city planning and maintenance. In this study, we model the flood risk for the CBD of Tuguegarao City, which is located in northern Philippines. To accomplish this, we identified important flood-related factors whose data are either easily available or may be collected through some automated process that we developed. We then surveyed experts to …

The Effectiveness Of Using A Modified “Beat Frequent Pick” Algorithm In The First International Roshambo Tournament, Proceso L. Fernandez Jr, Sony E. Valdez, Generino P. Siddayao

Department of Information Systems & Computer Science Faculty Publications

In this study, a bot is developed to compete in the first International RoShamBo Tournament test suite. The basic “Beat Frequent Pick (BFP)” algorithm was taken from the supplied test suite and was improved by adding a random choice tailored fit against the opponent's distribution of picks. A training program was also developed that finds the best performing bot variant by changing the bot's behavior in terms of the timing of the recomputation of the pick distribution. Simulation results demonstrate the significantly improved performance of the proposed variant over the original BFP. This indicates the potential of using the core …

Reformulation Strategies Of Repeated References In The Context Of Robot Perception Errors In Situated Dialogue, Niels Schütte, John D. Kelleher, Brian Mac Namee

Conference papers

We performed an experiment in which human participants interacted through a natural language dialogue interface with a simulated robot to fulfil a series of object manipulation tasks. We introduced errors into the robot’s perception, and observed the resulting problems in the dialogues and their resolutions. We then introduced different methods for the user to request information about the robot’s understanding of the environment. In this work, we describe the effects that the robot’s perceptual errors and the information request options available to the participant had on the reformulation of the referring expressions the participants used when resolving a unsuccessful reference.

Adaptive Automation Design And Implementation, Jason M. Bindewald

Theses and Dissertations

Automations allow us to reduce the need for humans in certain environments, such as auto-pilot features on unmanned aerial vehicles. However, some situations still require human intervention. Adaptive automation is a research field that enables computer systems to adjust the amount of automation by taking over tasks from or giving tasks back to the user. This research develops processes and insights for adaptive automation designers to take theoretical adaptive automation ideas and develop them into real-world adaptive automation system. These allow developers to design better automation systems that recognize the limits of computers systems, enabling better designs for systems in …

Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We are concerned with the routine crowd management problem after a major event at a known venue. Without properly design complementary transport services, such sudden crowd build-ups will overwhelm the existing infrastructure. In this paper, we introduce a novel flow-rate based model to model the dynamic movement of passengers over the transportation flow network. Based on this basic model, an integer linear programming model is proposed to solve the bus transit problem permanently. We validate our model against a real scenario in Singapore, where a newly constructed mega-stadium hosts various large events regularly. The results show that the proposed approach …

A Survey On Artificial Intelligence-Based Modeling Techniques For High Speed Milling Processes, Amin Jahromi Torabi, Meng Joo Er, Xiang Li, Beng Siong Lim, Lianyin Zhai, Richard Jayadi Oentaryo, Gan Oon Peen, Jacek M. Zurada

Research Collection School Of Computing and Information Systems

The process of high speed milling is regarded as one of the most sophisticated and complicated manufacturing operations. In the past four decades, many investigations have been conducted on this process, aiming to better understand its nature and improve the surface quality of the products as well as extending tool life. To achieve these goals, it is necessary to form a general descriptive reference model of the milling process using experimental data, thermomechanical analysis, statistical or artificial intelligence (AI) models. Moreover, increasing demands for more efficient milling processes, qualified surface finishing, and modeling techniques have propelled the development of more …

Ad-Hoc Automated Teller Machine Failure Forecast And Field Service Optimization, Michelle L. F. Cheong, Ping Shung Koo, B. Chandra Babu

Research Collection School Of Computing and Information Systems

As part of its overall effort to maintain good customer service while managing operational efficiency and reducing cost, a bank in Singapore has embarked on using data and decision analytics methodologies to perform better ad-hoc ATM failure forecasting and plan the field service engineers to repair the machines. We propose using a combined Data and Decision Analytics Framework which helps the analyst to first understand the business problem by collecting, preparing and exploring data to gain business insights, before proposing what objectives and solutions can and should be done to solve the problem. This paper reports the work in analyzing …

A Visual Analysis Of Articulated Motion Complexity Based On Optical Flow And Spatial-Temporal Features, Beau Michael Christ

School of Computing: Dissertations, Theses, and Student Research

The understanding of motion is an important problem in computer vision with applications including crowd-flow analysis, video surveillance, and estimating three-dimensional structure. A less-explored problem is the visual characterization and quantification of motion complexity. An important motion class that is prevalent in living beings is articulated motion (segments connected by joints). At present, no known standardized measure for quantifying the complexity of articulated motion exists. Such a measure could facilitate advanced motion analysis with applications including video indexing, motion comparison, and advanced biological study of visual signals in organisms.

This dissertation presents an in-depth study of the development of several …

Inferring Interaction Type In Gene Regulatory Networks Using Co-Expression Data, Pegah Khosravi, Vahid H. Gazestani, Leila Pirhaji, Brian Law, Mehdi Sadeghi, Bahram Goliaei, Gary D. Bader

Publications and Research

Background

Knowledge of interaction types in biological networks is important for understanding the functional organization of the cell. Currently information-based approaches are widely used for inferring gene regulatory interactions from genomics data, such as gene expression profiles; however, these approaches do not provide evidence about the regulation type (positive or negative sign) of the interaction.

Results

This paper describes a novel algorithm, “Signing of Regulatory Networks” (SIREN), which can infer the regulatory type of interactions in a known gene regulatory network (GRN) given corresponding genome-wide gene expression data. To assess our new approach, we applied it to three different benchmark …

An Adaptive Computational Model For Personalized Persuasion, Yilin Kang, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

While a variety of persuasion agents have been created and applied in different domains such as marketing, military training and health industry, there is a lack of a model which can provide a unified framework for different persuasion strategies. Specifically, persuasion is not adaptable to the individuals’ personal states in different situations. Grounded in the Elaboration Likelihood Model (ELM), this paper presents a computational model called Model for Adaptive Persuasion (MAP) for virtual agents. MAP is a semi-connected network model which enables an agent to adapt its persuasion strategies through feedback. We have implemented and evaluated a MAP-based virtual nurse …

Probabilistic Inference Based Message-Passing For Resource Constrained Dcops, Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Distributed constraint optimization (DCOP) is an important framework for coordinated multiagent decision making. We address a practically useful variant of DCOP, called resource-constrained DCOP (RC-DCOP), which takes into account agents’ consumption of shared limited resources. We present a promising new class of algorithm for RC-DCOPs by translating the underlying co- ordination problem to probabilistic inference. Using inference techniques such as expectation- maximization and convex optimization machinery, we develop a novel convergent message-passing algorithm for RC-DCOPs. Experiments on standard benchmarks show that our approach provides better quality than previous best DCOP algorithms and has much lower failure rate. Comparisons against an …

Message Passing For Collective Graphical Models, Tao Sun, Daniel Sheldon, Akshat Kumar

Research Collection School Of Computing and Information Systems

Collective graphical models (CGMs) are a formalism for inference and learning about a population of independent and identically distributed individuals when only noisy aggregate data are available. We highlight a close connection between approximate MAP inference in CGMs and marginal inference in standard graphical models. The connection leads us to derive a novel Belief Propagation (BP) style algorithm for collective graphical models. Mathematically, the algorithm is a strict generalization of BP—it can be viewed as an extension to minimize the Bethe free energy plus additional energy terms that are non-linear functions of the marginals. For CGMs, the algorithm is much …

Cooperative 3-D Map Generation Using Multiple Uavs, Andrew Erik Lawson

University Scholar Projects

This report aims to demonstrate the feasibility of building a global 3-D map from multiple UAV robots in a GPS-denied, indoor environment. Presented are the design of each robot and the reasoning behind choosing its hardware and software components, the process in which a single robot obtains a individual 3-D map entirely onboard, and lastly how the mapping concept is extended to multiple robotic agents to form a global 3-D map using a centralized server. In the latter section, this report focuses on two algorithms, Online Mapping and Map Fusion, developed to facilitate the cooperative approach. A limited selection …

Retail Precinct Management: A Case Of Commercial Decentralization In Singapore, Robert De Souza, Hoong Chuin Lau, Mark Goh, Lindawati, Wee-Siong Ng, Puay-Siew Tan

Research Collection School Of Computing and Information Systems

The synchronized last mile logistics concept seeks to address, through coordinated collaboration, several challenges that hinder reliability, cost efficiency, effective resource planning, scheduling and utilization; and increasingly, sustainability objectives. Subsequently, the meeting of service level and contractual commitments are competitively impacted with any loss of efficiency. These challenges, against a backdrop of Singapore, can essentially be addressed in selected industry sectors through a better understanding of logistics structures; innovative supply chain designs and coordination of services, operations and processes coupled with concerted policies and supply chain strategies.

Sudden Cardiac Arrest Prediction Through Heart Rate Variability Analysis, Luke Joseph Plewa

Master's Theses

The increase in popularity for wearable technologies (see: Apple Watch and Microsoft Band) has opened the door for an Internet of Things solution to healthcare. One of the most prevalent healthcare problems today is the poor survival rate of out-of hospital sudden cardiac arrests (9.5% on 360,000 cases in the USA in 2013). It has been proven that heart rate derived features can give an early indicator of sudden cardiac arrest, and that providing an early warning has the potential to save many lives. Many of these new wearable devices are capable of providing this warning through their heart rate …

Integrated Low-Rank-Based Discriminative Feature Learning For Recognition, Pan Zhou, Zhouchen Lin, Chao Zhang

Research Collection School Of Computing and Information Systems

Feature learning plays a central role in pattern recognition. In recent years, many representation-based feature learning methods have been proposed and have achieved great success in many applications. However, these methods perform feature learning and subsequent classification in two separate steps, which may not be optimal for recognition tasks. In this paper, we present a supervised low-rank-based approach for learning discriminative features. By integrating latent low-rank representation (LatLRR) with a ridge regression-based classifier, our approach combines feature learning with classification, so that the regulated classification error is minimized. In this way, the extracted features are more discriminative for the recognition …

History-Based Controller Design And Optimization For Partially Observable Mdps, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Partially observable MDPs provide an elegant framework forsequential decision making. Finite-state controllers (FSCs) are often used to represent policies for infinite-horizon problems as they offer a compact representation, simple-to-execute plans, and adjustable tradeoff between computational complexityand policy size. We develop novel connections between optimizing FSCs for POMDPs and the dual linear programfor MDPs. Building on that, we present a dual mixed integer linear program (MIP) for optimizing FSCs. To assign well-defined meaning to FSC nodes as well as aid in policy search, we show how to associate history-based features with each FSC node. Using this representation, we address another challenging …

Probabilistic Inference Techniques For Scalable Multiagent Decision Making, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint

Research Collection School Of Computing and Information Systems

Decentralized POMDPs provide an expressive framework for multiagent sequential decision making. However, the complexity of these models---NEXP-Complete even for two agents---has limited their scalability. We present a promising new class of approximation algorithms by developing novel connections between multiagent planning and machine learning. We show how the multiagent planning problem can be reformulated as inference in a mixture of dynamic Bayesian networks (DBNs). This planning-as-inference approach paves the way for the application of efficient inference techniques in DBNs to multiagent decision making. To further improve scalability, we identify certain conditions that are sufficient to extend the approach to multiagent systems …

Discriminant Analysis On Riemannian Manifold Of Gaussian Distributions For Face Recognition With Image Sets, Wen. Wang, Ruiping. Wang, Zhiwu Huang, Shiguang. Shan, Xilin. Chen

Research Collection School Of Computing and Information Systems

This paper presents a method named Discriminant Analysis on Riemannian manifold of Gaussian distributions (DARG) to solve the problem of face recognition with image sets. Our goal is to capture the underlying data distribution in each set and thus facilitate more robust classification. To this end, we represent image set as Gaussian Mixture Model (GMM) comprising a number of Gaussian components with prior probabilities and seek to discriminate Gaussian components from different classes. In the light of information geometry, the Gaussians lie on a specific Riemannian manifold. To encode such Riemannian geometry properly, we investigate several distances between Gaussians and …

Brain Machine Interface Using Emotiv Epoc To Control Robai Cyton Robotic Arm, Daniel P. Prince, Mark J. Edmonds, Andrew J. Sutter, Matthew Thomas Cusumano, Wenjie Lu, Vijayan K. Asari

Electrical and Computer Engineering Faculty Publications

The initial framework for an electroencephalography (EEG) thought recognition software suite is developed, built, and tested. This suite is designed to recognize human thoughts and pair them to actions for controlling a robotic arm.

Raw EEG brain activity data is collected using an Emotiv EPOC headset. The EEG data is processed through linear discriminant analysis (LDA), where an intended action is identified. The EEG classification suite is being developed to increase the number of distinct actions that can be identified compared to the Emotiv recognition software. The EEG classifier was able to correctly distinguish between two separate physical movements.

Future …