Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics
Research Collection School Of Computing and Information Systems
- Keyword
-
- Crowdsourcing (2)
- Reinforcement learning (2)
- Twitter (2)
- Adaptive Resonance Theory operations (1)
- Aging in Place (1)
-
- Algorithms (1)
- BDI (1)
- Bag-of-visual word (1)
- Bi-objective Optimisation (1)
- Centralized planning (1)
- Centroid (1)
- Contact center (1)
- Coordination (1)
- Cost sharing (1)
- Crowdfunding (1)
- DEC-MDP (1)
- Decentralized Planning with Uncertainty (1)
- Decision analysis (1)
- Decision support system (1)
- Declarative memory (1)
- Design of Experiment (1)
- Dimension reduction (1)
- Energy Conservation (1)
- Experimentation (1)
- Facebook (1)
- Fair Division (1)
- Game theory (1)
- Group behaviors (1)
- Hamming embedding (1)
- Health care (1)
Articles 1 - 30 of 36
Full-Text Articles in Physical Sciences and Mathematics
Second Order-Response Surface Model For The Automated Parameter Tuning Problem, Aldy Gunawan, Hoong Chuin Lau
Second Order-Response Surface Model For The Automated Parameter Tuning Problem, Aldy Gunawan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Several automated parameter tuning procedures/configurators have been proposed in order to find the best parameter setting for a target algorithm. These configurators can generally be classified into model-free and model-based approaches. We introduce a recent approach which is based on the hybridization of both approaches. It combines the Design of Experiments (DOE) and Response Surface Methodology (RSM) with prevailing model-free techniques. DOE is mainly used for determining the importance of parameters. A First Order-RSM is initially employed to define the promising region for the important parameters. A Second Order-RSM is then built to approximate the center point as well as …
Unisense: A Unified And Sustainable Sensing And Transport Architecture For Large Scale And Heterogeneous Sensor Networks, Yunye Jin, Hwee-Pink Tan
Unisense: A Unified And Sustainable Sensing And Transport Architecture For Large Scale And Heterogeneous Sensor Networks, Yunye Jin, Hwee-Pink Tan
Research Collection School Of Computing and Information Systems
In this paper, we propose UNISENSE, a unified and sustainable sensing and transport architecture for large scale and heterogeneous sensor networks. The proposed architecture incorporates seven principal components, namely, application profiling, node architecture, intelligent network design, network management, deep sensing, generalized participatory sensing, and security. We describe the design and implementation for each component. We also present the deployment and performance of the UNISENSE architecture in four practical applications.
Towards Intelligent Caring Agents For Aging-In-Place: Issues And Challenges, Di Wang, Budhitama Subagdja, Yilin Kang, Ah-Hwee Tan
Towards Intelligent Caring Agents For Aging-In-Place: Issues And Challenges, Di Wang, Budhitama Subagdja, Yilin Kang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
The aging of the world’s population presents vast societal and individual challenges. The relatively shrinking workforce to support the growing population of the elderly leads to a rapidly increasing amount of technological innovations in the field of elderly care. In this paper, we present an integrated framework consisting of various intelligent agents with their own expertise and responsibilities working in a holistic manner to assist, care, and accompany the elderly around the clock in the home environment. To support the independence of the elderly for Aging-In-Place (AIP), the intelligent agents must well understand the elderly, be fully aware of the …
Traccs: Trajectory-Aware Coordinated Urban Crowd-Sourcing, Cen Chen, Shih-Fen Cheng, Aldy Gunawan, Archan Misra, Koustuv Dasgupta, Deepthi Chander
Traccs: Trajectory-Aware Coordinated Urban Crowd-Sourcing, Cen Chen, Shih-Fen Cheng, Aldy Gunawan, Archan Misra, Koustuv Dasgupta, Deepthi Chander
Research Collection School Of Computing and Information Systems
We investigate the problem of large-scale mobile crowd-tasking, where a large pool of citizen crowd-workers are used to perform a variety of location-specific urban logistics tasks. Current approaches to such mobile crowd-tasking are very decentralized: a crowd-tasking platform usually provides each worker a set of available tasks close to the worker's current location; each worker then independently chooses which tasks she wants to accept and perform. In contrast, we propose TRACCS, a more coordinated task assignment approach, where the crowd-tasking platform assigns a sequence of tasks to each worker, taking into account their expected location trajectory over a wider time …
Hippi Care Hospital: Towards Proactive Business Processes In Emergency Room Services, Kar Way Tan, Venky Shankaraman
Hippi Care Hospital: Towards Proactive Business Processes In Emergency Room Services, Kar Way Tan, Venky Shankaraman
Research Collection School Of Computing and Information Systems
It was 2.35 am on a Saturday morning. Wiki Lim, process specialist from the Process Innovation Centre (PIC) of Hippi Care Hospital (HCH), desperately doodling on her notepad for ideas to improve service delivery at HCH’s Emergency Department (ED). HCH has committed to the public that its ED would meet the service quality criterion of serving 90% of A3 and A4 patients, non-emergency patients with moderate to mild symptoms, within 90 minutes of their arrival at the ED. The ED was not able to meet this performance goal and Dr. Edward Kim, the head of the ED at HCH, had …
Partisan Sharing: Facebook Evidence And Societal Consequences, Jisun An, Daniele Quercia, Jon Crowcroft
Partisan Sharing: Facebook Evidence And Societal Consequences, Jisun An, Daniele Quercia, Jon Crowcroft
Research Collection School Of Computing and Information Systems
The hypothesis of selective exposure assumes that people seek out information that supports their views and eschew information that conflicts with their beliefs, and that has negative consequences on our society. Few researchers have recently found counter evidence of selective exposure in social media: users are exposed to politically diverse articles. No work has looked at what happens after exposure, particularly how individuals react to such exposure, though. Users might well be exposed to diverse articles but share only the partisan ones. To test this, we study partisan sharing on Facebook: the tendency for users to predominantly share like-minded news …
Auction With Rolling Horizon For Urban Consolidation Centre, Chen Wang, Stephanus Daniel Handoko, Hoong Chuin Lau
Auction With Rolling Horizon For Urban Consolidation Centre, Chen Wang, Stephanus Daniel Handoko, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
A number of cities around the world have adopted urban consolidation centres (UCCs) to address some challenges of their last-mile deliveries. At the UCC, goods are consolidated based on their destinations prior to their deliveries into the city centre. In many examples, the UCC owns a fleet of eco-friendly vehicles to carry out the deliveries. A carrier/shipper who buys the UCC’s service hence no longer needs to enter the city centre in which time-window and vehicle-type restrictions may apply. As a result, it becomes possible to retain the use of large trucks for the economies of scale outside the city …
Multi-Agent Orienteering Problem With Time-Dependent Capacity Constraints, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau
Multi-Agent Orienteering Problem With Time-Dependent Capacity Constraints, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we formulate and study the Multi-agent Orienteering Problem with Time-dependent Capacity Constraints (MOPTCC). MOPTCC is similar to the classical orienteering problem at single-agent level: given a limited time budget, an agent travels around the network and collects rewards by visiting different nodes, with the objective of maximizing the sum of his collected rewards. The most important feature we introduce in MOPTCC is the inclusion of multiple competing agents. All agents in MOPTCC are assumed to be self-interested, and they interact with each other when arrive at certain nodes simultaneously. As all nodes are capacitated, if a particular …
An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau
An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Automating the process of finding good parameter settings is important in the design of high-performing algorithms. These automatic processes can generally be categorized into off-line and on-line methods. Off-line configuration consists in learning and selecting the best setting in a training phase, and usually fixes it while solving an instance. On-line adaptation methods on the contrary vary the parameter setting adaptively during each algorithm run. In this work, we provide an empirical study of both approaches on the operator selection problem, explore the possibility of varying parameter value by a non-adaptive distribution tuned off-line, and incorporate the off-line with on-line …
Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau
Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP). The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to construct an initial solution, and then using a hybrid Simulated Annealing and Tabu Search (SA-TS) algorithm to further improve the solution. Experimental results show that the hybrid metaheuristic is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time. The proposed algorithm is extended to solve the Generalized Quadratic Assignment Problem (GQAP), with an emphasis on modelling and solving a practical problem, namely an examination timetabling problem. We found that …
Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau
Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The patrol scheduling problem is concerned with assigning security teams to different stations for distinct time intervals while respecting a limited number of contractual constraints. The objective is to minimise the total distance travelled while maximising the coverage of the stations with respect to their security requirement levels. This paper introduces a hyper-heuristic strategy focusing on generating diverse solutions for a bi-objective patrol scheduling problem. While a variety of hyper-heuristics have been applied to a large suite of problem domains usually in the form of single-objective optimisation, we suggest an alternative approach for solving the patrol scheduling problem with two …
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …
Unleashing Dec-Mdps In Security Games: Enabling Effective Defender Teamwork, Eric Shieh, Albert Jiang, Amulya Yadav, Pradeep Reddy Varakantham, Milind Tambe
Unleashing Dec-Mdps In Security Games: Enabling Effective Defender Teamwork, Eric Shieh, Albert Jiang, Amulya Yadav, Pradeep Reddy Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
Multiagent teamwork and defender-attacker security games are two areas that are currently receiving significant attention within multiagent systems research. Unfortunately, despite the need for effective teamwork among multiple defenders, little has been done to harness the teamwork research in security games. This paper is the first to remedy this situation by integrating the powerful teamwork mechanisms offered by Dec-MDPs into security games. We offer the following novel contributions in this paper: (i) New models of security games where a defender team’s pure strategy is defined as a DecMDP policy for addressing coordination under uncertainty; (ii) New algorithms based on column …
A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau
A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper presents a generalization of the Orienteering Problem, the Time-Dependent Orienteering Problem (TDOP) which is based on the real-life application of providing automatic tour guidance to a large leisure facility such as a theme park. In this problem, the travel time between two nodes depends on the time when the trip starts. We formulate the problem as an integer linear programming (ILP) model. We then develop various heuristics in a step by step fashion: greedy construction, local search and variable neighborhood descent, and two versions of iterated local search. The proposed metaheuristics were tested on modified benchmark instances, randomly …
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …
Decentralized Stochastic Planning With Anonymity In Interactions, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet
Decentralized Stochastic Planning With Anonymity In Interactions, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet
Research Collection School Of Computing and Information Systems
In this paper, we solve cooperative decentralized stochastic planning problems, where the interactions between agents (specified using transition and reward functions) are dependent on the number of agents (and not on the identity of the individual agents) involved in the interaction. A collision of robots in a narrow corridor, defender teams coordinating patrol activities to secure a target, etc. are examples of such anonymous interactions. Formally, we consider problems that are a subset of the well known Decentralized MDP (DEC-MDP) model, where the anonymity in interactions is specified within the joint reward and transition functions. In this paper, not only …
Building Algorithm Portfolios For Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
Building Algorithm Portfolios For Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The present study introduces an automated mechanism to build algorithm portfolios for memetic algorithms. The objective is to determine an algorithm set involving combinations of crossover, mutation and local search operators based on their past performance. The past performance is used to cluster algorithm combinations. Top performing combinations are then considered as the members of the set. The set is expected to have algorithm combinations complementing each other with respect to their strengths in a portfolio setting. In other words, each algorithm combination should be good at solving a certain type of problem instances such that this set can be …
Creating Autonomous Adaptive Agents In A Real-Time First-Person Shooter Computer Game, Di Wang, Ah-Hwee Tan
Creating Autonomous Adaptive Agents In A Real-Time First-Person Shooter Computer Game, Di Wang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Games are good test-beds to evaluate AI methodologies. In recent years, there has been a vast amount of research dealing with real-time computer games other than the traditional board games or card games. This paper illustrates how we create agents by employing FALCON, a self-organizing neural network that performs reinforcement learning, to play a well-known first-person shooter computer game called Unreal Tournament. Rewards used for learning are either obtained from the game environment or estimated using the temporal difference learning scheme. In this way, the agents are able to acquire proper strategies and discover the effectiveness of different weapons without …
Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang
Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang
Research Collection School Of Computing and Information Systems
A big challenge in text classification is to perform classification on a large-scale and high-dimensional text corpus in the presence of imbalanced class distributions and a large number of irrelevant or noisy term features. A number of techniques have been proposed to handle this challenge with varying degrees of success. In this paper, by combining the strengths of two widely used text classification techniques, K-Nearest-Neighbor (KNN) and centroid based (Centroid) classifiers, we propose a scalable and effective flat classifier, called CenKNN, to cope with this challenge. CenKNN projects high-dimensional (often hundreds of thousands) documents into a low-dimensional (normally a few …
Reinforcement Learning For Adaptive Operator Selection In Memetic Search Applied To Quadratic Assignment Problem, Stephanus Daniel Handoko, Duc Thien Nguyen, Zhi Yuan, Hoong Chuin Lau
Reinforcement Learning For Adaptive Operator Selection In Memetic Search Applied To Quadratic Assignment Problem, Stephanus Daniel Handoko, Duc Thien Nguyen, Zhi Yuan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Memetic search is well known as one of the state-of-the-art metaheuristics for finding high-quality solutions to NP-hard problems. Its performance is often attributable to appropriate design, including the choice of its operators. In this paper, we propose a Markov Decision Process model for the selection of crossover operators in the course of the evolutionary search. We solve the proposed model by a Q-learning method. We experimentally verify the efficacy of our proposed approach on the benchmark instances of Quadratic Assignment Problem.
Decentralized Multi-Agent Reinforcement Learning In Average-Reward Dynamic Dcops, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, Shlomo Zilberstein, Chongjie Zhang
Decentralized Multi-Agent Reinforcement Learning In Average-Reward Dynamic Dcops, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, Shlomo Zilberstein, Chongjie Zhang
Research Collection School Of Computing and Information Systems
Researchers have introduced the Dynamic Distributed Constraint Optimization Problem (Dynamic DCOP) formulation to model dynamically changing multi-agent coordination problems, where a dynamic DCOP is a sequence of (static canonical) DCOPs, each partially different from the DCOP preceding it. Existing work typically assumes that the problem in each time step is decoupled from the problems in other time steps, which might not hold in some applications. Therefore, in this paper, we make the following contributions: (i) We introduce a new model, called Markovian Dynamic DCOPs (MD-DCOPs), where the DCOP in the next time step is a function of the value assignments …
Near-Optimal Nonmyopic Contact Center Planning Using Dual Decomposition, Akshat Kumar, Sudhanshu Singh, Pranav Gupta, Gyana Parija
Near-Optimal Nonmyopic Contact Center Planning Using Dual Decomposition, Akshat Kumar, Sudhanshu Singh, Pranav Gupta, Gyana Parija
Research Collection School Of Computing and Information Systems
We address the problem of minimizing staffing cost in a contact center subject to service level requirements over multiple weeks. We handle both the capacity planning and agent schedule generation aspect of this problem. Our work incorporates two unique business requirements. First, we develop techniques that can provide near-optimal staffing for 247 contact centers over long term, upto eight weeks, rather than planning myopically on a week-on-week basis. Second, our approach is usable in an online interactive setting in which staffing managers using our system expect high quality plans within a short time period. Results on large real world and …
Streets: Game-Theoretic Traffic Patrolling With Exploration And Exploitation, Matthew Brown, Sandhya Saisubramanian, Pradeep Varakantham, Milind Tambe
Streets: Game-Theoretic Traffic Patrolling With Exploration And Exploitation, Matthew Brown, Sandhya Saisubramanian, Pradeep Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
To dissuade reckless driving and mitigate accidents, cities deploy resources to patrol roads. In this paper, we present STREETS, an application developed for the city of Singapore, which models the problem of computing randomized traffic patrol strategies as a defenderattacker Stackelberg game. Previous work on Stackelberg security games has focused extensively on counterterrorism settings. STREETS moves beyond counterterrorism and represents the first use of Stackelberg games for traffic patrolling, in the process providing a novel algorithm for solving such games that addresses three major challenges in modeling and scale-up. First, there exists a high degree of unpredictability in travel times …
Revisiting Risk-Sensitive Mdps: New Algorithms And Results, Ping Hou, William Yeoh, Pradeep Reddy Varakantham
Revisiting Risk-Sensitive Mdps: New Algorithms And Results, Ping Hou, William Yeoh, Pradeep Reddy Varakantham
Research Collection School Of Computing and Information Systems
While Markov Decision Processes (MDPs) have been shown to be effective models for planning under uncertainty, theobjective to minimize the expected cumulative cost is inappropriate for high-stake planning problems. As such, Yu, Lin, and Yan (1998) introduced the Risk-Sensitive MDP (RSMDP) model, where the objective is to find a policy that maximizes the probability that the cumulative cost is within some user-defined cost threshold. In this paper, we revisit this problem and introduce new algorithms that are based on classical techniques, such as depth-first search and dynamic programming, and a recently introduced technique called Topological Value Iteration (TVI). We demonstrate …
Decentralized Multi-Agent Reinforcement Learning In Average-Reward Dynamic Dcops, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, Shlomo Zilberstein
Decentralized Multi-Agent Reinforcement Learning In Average-Reward Dynamic Dcops, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Researchers have introduced the Dynamic Distributed Constraint Optimization Problem (Dynamic DCOP) formulation to model dynamically changing multi-agent coordination problems, where a dynamic DCOP is a sequence of (static canonical) DCOPs, each partially different from the DCOP preceding it. Existing work typically assumes that the problem in each time step is decoupled from the problems in other time steps, which might not hold in some applications. Therefore, in this paper, we make the following contributions: (i) We introduce a new model, called Markovian Dynamic DCOPs (MD-DCOPs), where the DCOP in the next time step is a function of the value assignments …
Mechanisms For Arranging Ride Sharing And Fare Splitting For Last-Mile Travel Demands, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau
Mechanisms For Arranging Ride Sharing And Fare Splitting For Last-Mile Travel Demands, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
A great challenge of city planners is to provide efficient and effective connection service to travelers using public transportation system. This is commonly known as the last-mile problem and is critical in promoting the utilization of public transportation system. In this paper, we address the last-mile problem by considering a dynamic and demand-responsive mechanism for arranging ride sharing on a non-dedicated commercial fleet (such as taxis or passenger vans). Our approach has the benefits of being dynamic, flexible, and with low setup cost. A critical issue in such ride-sharing service is how riders should be grouped and serviced, and how …
On Understanding Diffusion Dynamics Of Patrons At A Theme Park, Jiali Du, Akshat Kumar, Pradeep Reddy Varakantham
On Understanding Diffusion Dynamics Of Patrons At A Theme Park, Jiali Du, Akshat Kumar, Pradeep Reddy Varakantham
Research Collection School Of Computing and Information Systems
In this work, we focus on the novel application of learning the diffusion dynamics of visitors among attractions at a large theme park using only aggregate information about waiting times at attractions. Main contributions include formulating optimisation models to compute diffusion dynamics. We also developed algorithm capable of dealing with noise in the data to populate parameters in the optimization model. We validated our approach using cross validation on a real theme park data set. Our approach provides an accuracy of about 80$% for popular attractions, providing solid empirical support for our diffusion models.
On Coordinating Pervasive Persuasive Agents, Budhitama Subagdja, Ah-Hwee Tan
On Coordinating Pervasive Persuasive Agents, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
There is a growing interest in applying multiagent systems for smart-home environment supporting self-caring elderly. In this paper we investigate situations and conditions for coordination for such kind of system. We specify a high level architecture of it based on the notions of beliefs, desires, and intentions for both individual and group behavior of the agents including the human occupant's. The framework enables flexible coordinations among loosely-coupled heterogeneous agents that converse with the user. This work is conducted towards producing a coordination framework for agents and people in such a kind of smart-home environment as mentioned.
Declarative-Procedural Memory Interaction In Learning Agents, Wenwen Wang, Ah-Hwee Tan, Loo-Nin Teow, Tan Yuan-Sin
Declarative-Procedural Memory Interaction In Learning Agents, Wenwen Wang, Ah-Hwee Tan, Loo-Nin Teow, Tan Yuan-Sin
Research Collection School Of Computing and Information Systems
It has been well recognized that human makes use of both declarative memory and procedural memory for decision making and problem solving. In this paper, we propose a computational model with the overall architecture and individual processes for realizing the interaction between the declarative and procedural memory based on self-organizing neural networks. We formalize two major types of memory interactions and show how each of them can be embedded into autonomous reinforcement learning agents. Our experiments based on the Toad and Frog puzzle and a strategic game known as Starcraft Broodwar have shown that the cooperative interaction between declarative knowledge …
A Quantitative Analysis Of Decision Process In Social Groups Using Human Trajectories, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan
A Quantitative Analysis Of Decision Process In Social Groups Using Human Trajectories, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan
Research Collection School Of Computing and Information Systems
A group's collective action is an outcome of the group's decision-making process, which may be reached by either averaging of the individual preferences or following the choices of certain members in the group. Our problem here is to decide which decision process the group has adopted given the data of the collective actions. We propose a generic statistical framework to infer the group's decision process from the spatio-temporal data of group trajectories, where each "trajectory" is a sequence of group actions. This is achieved by systematically comparing each agent type's influence on the group actions based on an array of …