Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Artificial intelligence (3)
- Singapore (2)
- ATM failures (1)
- Ageing-in-place (1)
- Agent-based modeling and simulation (1)
-
- Aging (1)
- Algorithm selection (1)
- Algorithms (1)
- Artificial intelligence (AI) (1)
- Auction (1)
- Bayesian Reinforcement Learning (1)
- Benchmarking (1)
- Bus transit service (1)
- Caregivers (1)
- Combinatorial optimization (1)
- Commercial decentralization (1)
- Computer vision (1)
- Constrained optimization (1)
- Crowd management (1)
- Crowd movement model (1)
- Crowd simulation (1)
- Crowdsourcing (1)
- Cyberbullying (1)
- Data analysis (1)
- Decision Support (1)
- Decision analytics (1)
- Design of experiments (1)
- Distributed constraint optimization (1)
- Energy utilization (1)
- Forecasting (1)
Articles 1 - 30 of 38
Full-Text Articles in Physical Sciences and Mathematics
Learning And Controlling Network Diffusion In Dependent Cascade Models, Jiali Du, Pradeep Varakantham, Akshat Kumar, Shih-Fen Cheng
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 …
Preface: Wi 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, Jie Zhang, Dell Zhang, Julita Vassileva
Preface: Wi 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, Jie Zhang, Dell Zhang, Julita Vassileva
Research Collection School Of Computing and Information Systems
This volume contains the papers selected for presentation at the 2015 IEEE/WIC/ACM International Conference on Web Intelligence (WI’15), which was held from 6 to 9 December 2015 in Singapore, a city which welcomes people from different parts of the world to work and play. Following the tradition of WI conference in previous years, WI’15 was collocated with 2015 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT’15). Both WI’15 and IAT’15 were sponsored by the IEEE Computer Society, Web Intelligence Consortium (WIC), Association for Computing Machinery (ACM), and the Memetic Computing Society. The two collocated conferences were hosted by the Joint …
Building Crowd Movement Model Using Sample-Based Mobility Survey, Larry J. J. Lin, Shih-Fen Cheng, Hoong Chuin Lau
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 …
A Layered Hidden Markov Model For Predicting Human Trajectories In A Multi-Floor Building, Qian Li, Hoong Chuin Lau
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 …
Oriented Object Proposals, Shengfeng He, Rynson W. H. Lau
Oriented Object Proposals, Shengfeng He, Rynson W. H. Lau
Research Collection School Of Computing and Information Systems
In this paper, we propose a new approach to generate oriented object proposals (OOPs) to reduce the detection error caused by various orientations of the object. To this end, we propose to efficiently locate object regions according to pixelwise object probability, rather than measuring the objectness from a set of sampled windows. We formulate the proposal generation problem as a generative probabilistic model such that object proposals of different shapes (i.e., sizes and orientations) can be produced by locating the local maximum likelihoods. The new approach has three main advantages. First, it helps the object detector handle objects of different …
Preface Iat 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, An Bo, Anita Raja, Sarvapali Ramchurn
Preface Iat 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, An Bo, Anita Raja, Sarvapali Ramchurn
Research Collection School Of Computing and Information Systems
This volume contains the papers selected for presentation at the 2015 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT’15), which was held from 6 to 9 December 2015 in Singapore, a city which welcomes people from different parts of the world to work and play. Following the tradition of IAT conference in previous years, IAT’15 was collocated with 2015 IEEE/WIC/ACM International Conference on Web Intelligence (WI’15). Both WI’15 and IAT’15 were sponsored by the IEEE Computer Society, Web Intelligence Consortium (WIC), Association for Computing Machinery (ACM), and the Memetic Computing Society. The two collocated conferences were hosted by the Joint …
Non-Intrusive Robust Human Activity Recognition For Diverse Age Groups, Di Wang, Ah-Hwee Tan, Daqing Zhang
Non-Intrusive Robust Human Activity Recognition For Diverse Age Groups, Di Wang, Ah-Hwee Tan, Daqing Zhang
Research Collection School Of Computing and Information Systems
—Many elderly prefer to live independently at their own homes. However, how to use modern technologies to ensure their safety presents vast challenges and opportunities. Being able to non-intrusively sense the activities performed by the elderly definitely has great advantages in various circumstances. Non-intrusive activity recognition can be performed using the embedded sensors in modern smartphones. However, not many activity recognition models are robust enough that allow the subjects to carry the smartphones in different pockets with unrestricted orientations and varying deviations. Moreover, to the best of our knowledge, no existing literature studied the difference between the youth and the …
Coordinated Persuasion With Dynamic Group Formation For Collaborative Elderly Care, Budhitama Subagdja, Ah-Hwee Tan
Coordinated Persuasion With Dynamic Group Formation For Collaborative Elderly Care, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Ageing in place demands a new paradigm of inhouse caregiving allowing many aspects of daily lives to be tackled by smart appliances and technologies. The important challenges include the effective provision of recommendations by multiple parties of caregiver constituting changes of the user’s behavior. In this multiagent environment, interdependencies between agents become major issues to tackle. This paper presents an approach of dynamic group formation for autonomous caregiving agents to collaborate in recommending different aspects of well-being. The approach supports the agents to regulate the timing of their recommendations, prevent conflicting messages, and cooperate to make more effective persuasions. A …
Robust Execution Strategies For Project Scheduling With Unreliable Resources And Stochastic Durations, Na Fu, Hoong Chuin Lau, Pradeep Varakantham
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 …
Preface To Wi-Iat 2015 Workshops And Demo/Posters, Ah-Hwee Tan, Yuefeng Li
Preface To Wi-Iat 2015 Workshops And Demo/Posters, Ah-Hwee Tan, Yuefeng Li
Research Collection School Of Computing and Information Systems
This volume contains the papers selected for presentation at the workshops and demonstration/poster track as part of the 2015 IEEE/WIC/ACM International Conference on Web Intelligence (WI’15) and 2015 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT’15) held from 6 to 9 December 2015 in Singapore.
Silver Assistants For Aging-In-Place, Di Wang, Budhitama Subagdja, Yilin Kang, Ah-Hwee Tan
Silver Assistants For Aging-In-Place, Di Wang, Budhitama Subagdja, Yilin Kang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
In this demo, we present an assembly of silver assistants for supporting Aging-In-Place (AIP). The virtual agents are designed to serve around the clock to complement human care within the intelligent home environment. Residing in different platforms with ubiquitous access, the agents collaboratively provide holistic care to the elderly users. The demonstration is shown in a 3-D virtual home replicating a typical 5-room apartment in Singapore. Sensory inputs are stored in a knowledge base named Situation Awareness Model (SAM). Therefore, the capabilities of the agents can always be extended by expanding the knowledge defined in SAM. Using the simulation system, …
Coordinated Persuasion With Dynamic Group Formation For Collaborative Elderly Care, Budhitama Subagdja, Ah-Hwee Tan
Coordinated Persuasion With Dynamic Group Formation For Collaborative Elderly Care, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Ageing in place demands a new paradigm of inhouse caregiving allowing many aspects of daily lives to be tackled by smart appliances and technologies. The important challenges include the effective provision of recommendations by multiple parties of caregiver constituting changes of the user's behavior. In this multiagent environment, interdependencies between agents become major issues to tackle. This paper presents an approach of dynamic group formation for autonomous caregiving agents to collaborate in recommending different aspects of well-being. The approach supports the agents to regulate the timing of their recommendations, prevent conflicting messages, and cooperate to make more effective persuasions. A …
An Adaptive Markov Strategy For Effective Network Intrusion Detection, Jianye Hao, Yinxing Xue, Mahinthan Chandramohan, Yang Liu, Jun Sun
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. …
Density Peaks Clustering Approach For Discovering Demand Hot Spots In City-Scale Taxi Fleet Dataset, Dongchang Liu, Shih-Fen Cheng, Yiping Yang
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 …
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
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 …
Inferring Door Locations From A Teammate's Trajectory In Stealth Human-Robot Team Operations, Jean Oh, Arne Suppe, Arne Suppe, Anthony Stentz, Martial Hebert
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 …
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
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
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
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 …
An Adaptive Computational Model For Personalized Persuasion, Yilin Kang, Ah-Hwee Tan, Chunyan Miao
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
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
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 …
History-Based Controller Design And Optimization For Partially Observable Mdps, Akshat Kumar, Shlomo Zilberstein
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
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 …
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
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.
Discriminant Analysis On Riemannian Manifold Of Gaussian Distributions For Face Recognition With Image Sets, Wen. Wang, Ruiping. Wang, Zhiwu Huang, Shiguang. Shan, Xilin. Chen
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 …
Oscar: Online Selection Of Algorithm Portfolios With Case Study On Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
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 …
Near-Optimal Decentralized Power Supply Restoration In Smart Grids, Pritee Agrawal, Akshat Kumar, Pradeep Varakantham
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 …
Adviser: A Web-Based Algorithm Portfolio Deviser, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
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 …
Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau
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 …