Open Access. Powered by Scholars. Published by Universities.®

Artificial Intelligence and Robotics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1591 - 1620 of 1897

Full-Text Articles in Artificial Intelligence and Robotics

Robust Execution Strategies For Project Scheduling With Unreliable Resources And Stochastic Durations, Na Fu, Hoong Chuin Lau, Pradeep Varakantham Dec 2015

Robust Execution Strategies For Project Scheduling With Unreliable Resources And Stochastic Durations, Na Fu, Hoong Chuin Lau, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

The resource-constrained project scheduling problem with minimum and maximum time lags (RCPSP/max) is a general model for resource scheduling in many real-world problems (such as manufacturing and construction engineering). We consider RCPSP/max problems where the durations of activities are stochastic and resources can have unforeseen breakdowns. Given a level of allowable risk, (Formula presented.), our mechanisms aim to compute the minimum robust makespan execution strategy. Robust makespan for an execution strategy is any makespan value that has a risk less than (Formula presented.). The risk for a makespan value, (Formula presented.) given an execution strategy, is the probability that a …

Go to article

Building Crowd Movement Model Using Sample-Based Mobility Survey, Larry J. J. Lin, Shih-Fen Cheng, Hoong Chuin Lau Dec 2015

Building Crowd Movement Model Using Sample-Based Mobility Survey, Larry J. J. Lin, Shih-Fen Cheng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Crowd simulation is a well-studied topic, yet it usually focuses on visualization. In this paper, we study a special class of crowd simulation, where individual agents have diverse backgrounds, ad hoc objectives, and non-repeating visits. Such crowd simulation is particularly useful when modeling human agents movement in leisure settings such as visiting museums or theme parks. In these settings, we are interested in accurately estimating aggregate crowd-related movement statistics. As comprehensive monitoring is usually not feasible for a large crowd, we propose to conduct mobility surveys on only a small group of sampled individuals. We demonstrate via simulation that we …

Go to article

A Layered Hidden Markov Model For Predicting Human Trajectories In A Multi-Floor Building, Qian Li, Hoong Chuin Lau Dec 2015

A Layered Hidden Markov Model For Predicting Human Trajectories In A Multi-Floor Building, Qian Li, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Tracking and modeling huge amount of users’ movement in a multi-floor building by using wireless devices is a challenging task, due to crowd movement complexity and signal sensing accuracy. In this paper, we use Layered Hidden Markov Model (LHMM) to fit the spatial-temporal trajectories (with large number of missing values). We decompose the problem into distinct layers that Hidden Markov Models (HMMs) are operated at different spatial granularities separately. Baum-Welch algorithm and Viterbi algorithm are used for finding the probable location sequences at each layer. By measuring the predicted result of trajectories, we compared the predicted results of both single …

Go to article

Learning And Controlling Network Diffusion In Dependent Cascade Models, Jiali Du, Pradeep Varakantham, Akshat Kumar, Shih-Fen Cheng Dec 2015

Learning And Controlling Network Diffusion In Dependent Cascade Models, Jiali Du, Pradeep Varakantham, Akshat Kumar, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Diffusion processes have increasingly been used to represent flow of ideas, traffic and diseases in networks. Learning and controlling the diffusion dynamics through management actions has been studied extensively in the context of independent cascade models, where diffusion on outgoing edges from a node are independent of each other. Our work, in contrast, addresses (a) learning diffusion taking management actions to alter the diffusion dynamics to achieve a desired outcome in dependent cascade models. A key characteristic of such dependent cascade models is the flow preservation at all nodes in the network. For example, traffic and people flow is preserved …

Go to article

An Adaptive Markov Strategy For Effective Network Intrusion Detection, Jianye Hao, Yinxing Xue, Mahinthan Chandramohan, Yang Liu, Jun Sun Nov 2015

An Adaptive Markov Strategy For Effective Network Intrusion Detection, Jianye Hao, Yinxing Xue, Mahinthan Chandramohan, Yang Liu, Jun Sun

Research Collection School Of Computing and Information Systems

Network monitoring is an important way to ensure the security of hosts from being attacked by malicious attackers. One challenging problem for network operators is how to distribute the limited monitoring resources (e.g., intrusion detectors) among the network to detect attacks effectively, especially when the attacking strategies can be changing dynamically and unpredictable. To this end, we adopt Markov game to model the interactions between the network operator and the attacker and propose an adaptive Markov strategy (AMS) to determine how the detectors should be placed on the network against possible attacks to minimize the network’s accumulated cost over time. …

Go to article

Inferring Door Locations From A Teammate's Trajectory In Stealth Human-Robot Team Operations, Jean Oh, Arne Suppe, Arne Suppe, Anthony Stentz, Martial Hebert Oct 2015

Inferring Door Locations From A Teammate's Trajectory In Stealth Human-Robot Team Operations, Jean Oh, Arne Suppe, Arne Suppe, Anthony Stentz, Martial Hebert

Research Collection School Of Computing and Information Systems

Robot perception is generally viewed as the interpretation of data from various types of sensors such as cameras. In this paper, we study indirect perception where a robot can perceive new information by making inferences from non-visual observations of human teammates. As a proof-of-concept study, we specifically focus on a door detection problem in a stealth mission setting where a team operation must not be exposed to the visibility of the team's opponents. We use a special type of the Noisy-OR model known as BN2O model of Bayesian inference network to represent the inter-visibility and to infer the locations of …

Go to article

Density Peaks Clustering Approach For Discovering Demand Hot Spots In City-Scale Taxi Fleet Dataset, Dongchang Liu, Shih-Fen Cheng, Yiping Yang Oct 2015

Density Peaks Clustering Approach For Discovering Demand Hot Spots In City-Scale Taxi Fleet Dataset, Dongchang Liu, Shih-Fen Cheng, Yiping Yang

Research Collection School Of Computing and Information Systems

In this paper, we introduce a variant of the density peaks clustering (DPC) approach for discovering demand hot spots from a low-frequency, low-quality taxi fleet operational dataset. From the literature, the DPC approach mainly uses density peaks as features to discover potential cluster centers, and this requires distances between all pairs of data points to be calculated. This implies that the DPC approach can only be applied to cases with relatively small numbers of data points. For the domain of urban taxi operations that we are interested in, we could have millions of demand points per day, and calculating all-pair …

Go to article

Shineseniors: Personalized Services For Active Ageing-In-Place, Liming Bai, Alex I. Gavino, Wei Qi Lee, Jungyoon Kim, Na Liu, Hwee-Pink Tan, Hwee Xian Tan, Lee Buay Tan, Xiaoping Toh, Alvin Cerdena Valera, Elina Jia Yu, Alfred Wu, Mark S. Fox Oct 2015

Shineseniors: Personalized Services For Active Ageing-In-Place, Liming Bai, Alex I. Gavino, Wei Qi Lee, Jungyoon Kim, Na Liu, Hwee-Pink Tan, Hwee Xian Tan, Lee Buay Tan, Xiaoping Toh, Alvin Cerdena Valera, Elina Jia Yu, Alfred Wu, Mark S. Fox

Research Collection School Of Computing and Information Systems

Singapore faces a major challenge in providing care and support for senior citizens due to its rapidlyageing population and declining old-age support ratio. The concept of Ageing-in-Place was introduced by the Singapore government [1] to allow older people to live independently in their own homes and communities so that the need for institutionalised care will only be utilised when necessary. We have three fundamental questions that this project will answer: 1. How to make community care serviceseffective through innovations in care delivery? How to lower the cost of service delivery and improve 2. productivity of caregivers, by leveraging information and …

Go to article

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

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 …

Go to article

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 Sep 2015

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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 Jun 2015

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.

Go to article

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

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 …

Go to article

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

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 …

Go to article

Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau May 2015

Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We address the problem of crowd congestion at venues like theme parks, museums and world expos by providing route guidance to multiple selfish users (with budget constraints) moving through the venue simultaneously. To represent these settings, we introduce the Selfish Orienteering Problem (SeOP) that combines two well studied problems from literature, namely Orienteering Problem (OP) and Selfish Routing (SR). OP is a single agent routing problem where the goal is to minimize latency (or maximize reward) in traversing a subset of nodes while respecting budget constraints. SR is a game between selfish agents looking for minimum latency routes from source …

Go to article

Oscar: Online Selection Of Algorithm Portfolios With Case Study On Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau May 2015

Oscar: Online Selection Of Algorithm Portfolios With Case Study On Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper introduces an automated approach called OSCAR that combines algorithm portfolios and online algorithm selection. The goal of algorithm portfolios is to construct a subset of algorithms with diverse problem solving capabilities. The portfolio is then used to select algorithms from for solving a particular (set of) instance(s). Traditionally, algorithm selection is usually performed in an offline manner and requires the need of domain knowledge about the target problem; while online algorithm selection techniques tend not to pay much attention to a careful construction of algorithm portfolios. By combining algorithm portfolios and online selection, our hope is to design …

Go to article

Adviser: A Web-Based Algorithm Portfolio Deviser, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau May 2015

Adviser: A Web-Based Algorithm Portfolio Deviser, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The basic idea of algorithm portfolio [1] is to create a mixture of diverse algorithms that complement each other’s strength so as to solve a diverse set of problem instances. Algorithm portfolios have taken on a new and practical meaning today with the wide availability of multi-core processors: from an enterprise perspective, the interest is to make best use of parallel machines within the organization by running different algorithms simultaneously on different cores to solve a given problem instance. Parallel execution of a portfolio of algorithms as suggested by [2, 3] a number of years …

Go to article

Near-Optimal Decentralized Power Supply Restoration In Smart Grids, Pritee Agrawal, Akshat Kumar, Pradeep Varakantham May 2015

Near-Optimal Decentralized Power Supply Restoration In Smart Grids, Pritee Agrawal, Akshat Kumar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Next generation of smart grids face a number of challenges including co-generation from intermittent renewable power sources, a shift away from monolithic control due to increased market deregulation, and robust operation in the face of disasters. Such heterogeneous nature and high operational readiness requirement of smart grids necessitates decentralized control for critical tasks such as power supply restoration (PSR) after line failures. We present a novel multiagent system based approach for PSR using Lagrangian dual decomposition. Our approach works on general graphs, provides provable quality-bounds and requires only local message-passing among different connected sub-regions of a smart grid, enabling decentralized …

Go to article

Predicting Bundles Of Spatial Locations From Learning Revealed Preference Data, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan May 2015

Predicting Bundles Of Spatial Locations From Learning Revealed Preference Data, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

We propose the problem of predicting a bundle of goods, where the goods considered is a set of spatial locations that an agent wishes to visit. This typically arises in the tourism setting where attractions can often be bundled and sold as a package to visitors. While the problem of predicting future locations given the current and past trajectories is well-established, we take a radical approach by looking at it from an economic point of view. We view an agent's past trajectories as revealed preference (RP) data, where the choice of locations is a solution to an optimisation problem according …

Go to article

Exploring Cyberbullying And Other Toxic Behavior In Team Competition Online Games, Haewoon Kwak, Jeremy Blackburn, Seungyeop. Han Apr 2015

Exploring Cyberbullying And Other Toxic Behavior In Team Competition Online Games, Haewoon Kwak, Jeremy Blackburn, Seungyeop. Han

Research Collection School Of Computing and Information Systems

In this work we explore cyberbullying and other toxic behavior in team competition online games. Using a dataset of over 10 million player reports on 1.46 million toxic players along with corresponding crowdsourced decisions, we test several hypotheses drawn from theories explaining toxic behavior. Besides providing large-scale, empirical based understanding of toxic behavior, our work can be used as a basis for building systems to detect, prevent, and counter-act toxic behavior.

Go to article

Using Infrastructure-Provided Context Filters For Efficient Fine-Grained Activity Sensing, Vigneshwaran Subbaraju, Sougata Sen, Archan Misra, Satyadip Chakraborty, Rajesh Krishna Balan Mar 2015

Using Infrastructure-Provided Context Filters For Efficient Fine-Grained Activity Sensing, Vigneshwaran Subbaraju, Sougata Sen, Archan Misra, Satyadip Chakraborty, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

While mobile and wearable sensing can capture unique insights into fine-grained activities (such as gestures and limb-based actions) at an individual level, their energy overheads are still prohibitive enough to prevent them from being executed continuously. In this paper, we explore practical alternatives to addressing this challenge-by exploring how cheap infrastructure sensors or information sources (e.g., BLE beacons) can be harnessed with such mobile/wearable sensors to provide an effective solution that reduces energy consumption without sacrificing accuracy. The key idea is that many fine-grained activities that we desire to capture are specific to certain location, movement or background context: infrastructure …

Go to article

Toward Mobile Robots Reasoning Like Humans, Jean Oh, Arne Suppe, Felix Duvallet, Abdeslam Boularias, Luis Navarro-Serment, Martial Hebert, Anthony Stentz, Jerry Vinokurov, Oscar Romero, Christian Lebiere, Robert Dean Jan 2015

Toward Mobile Robots Reasoning Like Humans, Jean Oh, Arne Suppe, Felix Duvallet, Abdeslam Boularias, Luis Navarro-Serment, Martial Hebert, Anthony Stentz, Jerry Vinokurov, Oscar Romero, Christian Lebiere, Robert Dean

Research Collection School Of Computing and Information Systems

Robots are increasingly becoming key players in human-robot teams. To become effective teammates, robots must possess profound understanding of an environment, be able to reason about the desired commands and goals within a specific context, and be able to communicate with human teammates in a clear and natural way. To address these challenges, we have developed an intelligence architecture that combines cognitive components to carry out high-level cognitive tasks, semantic perception to label regions in the world, and a natural language component to reason about the command and its relationship to the objects in the world. This paper describes recent …

Go to article

Integrated Intelligence For Human-Robot Teams, Jean Oh, Et. Al. Jan 2015

Integrated Intelligence For Human-Robot Teams, Jean Oh, Et. Al.

Research Collection School Of Computing and Information Systems

With recent advances in robotics technologies and autonomous systems, the idea of human-robot teams is gaining ever-increasing attention. In this context, our research focuses on developing an intelligent robot that can autonomously perform non-trivial, but specific tasks conveyed through natural language. Toward this goal, a consortium of researchers develop and integrate various types of intelligence into mobile robot platforms, including cognitive abilities to reason about high-level missions, perception to classify regions and detect relevant objects in an environment, and linguistic abilities to associate instructions with the robot’s world model and to communicate with human teammates in a natural way. This …

Go to article

Designing A Portfolio Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir Jan 2015

Designing A Portfolio Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir

Research Collection School Of Computing and Information Systems

Algorithm portfolios seek to determine an effective set of algorithms that can be used within an algorithm selection framework to solve problems. A limited number of these portfolio studies focus on generating different versions of a target algorithm using different parameter configurations. In this paper, we employ a Design of Experiments (DOE) approach to determine a promising range of values for each parameter of an algorithm. These ranges are further processed to determine a portfolio of parameter configurations, which would be used within two online Algorithm Selection approaches for solving different instances of a given combinatorial optimization problem effectively. We …

Go to article

Algorithm Selection Via Ranking, Jayadi Oentaryo Richard, Handoko Stephanus Daniel, Hoong Chuin Lau Jan 2015

Algorithm Selection Via Ranking, Jayadi Oentaryo Richard, Handoko Stephanus Daniel, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The abundance of algorithms developed to solve different problems has given rise to an important research question: How do we choose the best algorithm for a given problem? Known as algorithm selection, this issue has been prevailing in many domains, as no single algorithm can perform best on all problem instances. Traditional algorithm selection and portfolio construction methods typically treat the problem as a classification or regression task. In this paper, we present a new approach that provides a more natural treatment of algorithm selection and portfolio construction as a ranking task. Accordingly, we develop a Ranking-Based Algorithm Selection (RAS) …

Go to article

First Prev Next Last