Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3880)
- Singapore Management University (256)
- Old Dominion University (38)
- Air Force Institute of Technology (17)
- Missouri University of Science and Technology (10)
-
- University of Dar es Salaam (10)
- University of Arkansas, Fayetteville (7)
- Embry-Riddle Aeronautical University (5)
- Bucknell University (2)
- Clemson University (2)
- Purdue University (2)
- University of Louisville (2)
- University of Malaya (2)
- American University in Cairo (1)
- California State University, San Bernardino (1)
- City University of New York (CUNY) (1)
- Claremont Colleges (1)
- Florida Institute of Technology (1)
- Michigan Technological University (1)
- New Jersey Institute of Technology (1)
- Northern Illinois University (1)
- Syracuse University (1)
- University of Kentucky (1)
- Keyword
-
- Simulation (135)
- Path planning (76)
- Deep learning (52)
- Genetic algorithm (49)
- Reinforcement learning (47)
-
- Numerical simulation (44)
- Digital twin (42)
- Virtual reality (42)
- Multi-objective optimization (40)
- Modeling and simulation (39)
- Particle swarm optimization (35)
- Deep reinforcement learning (34)
- Modeling (34)
- Optimization (33)
- Attention mechanism (29)
- Fault diagnosis (29)
- Scheduling (29)
- UAV (27)
- Neural network (26)
- Simulation model (25)
- Uncertainty (23)
- Visualization (23)
- Artificial intelligence (22)
- Complex network (22)
- System simulation (22)
- Machine learning (21)
- System dynamics (21)
- Virtual simulation (20)
- DRL (19)
- Multi-agent (18)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Research Collection School Of Computing and Information Systems (255)
- Theses and Dissertations (17)
- Engineering Management & Systems Engineering Theses & Dissertations (14)
- Engineering Management & Systems Engineering Faculty Publications (10)
-
- Tanzania Journal of Engineering and Technology (TJET) (10)
- Graduate Theses and Dissertations (7)
- Doctoral Dissertations (5)
- Graduate Student Government Association Research Conference (4)
- Engineering Management and Systems Engineering Faculty Research & Creative Works (3)
- Engineering Technology Faculty Publications (3)
- Discovery Day - Daytona Beach (2)
- Doctoral Dissertations and Master's Theses (2)
- Electrical & Computer Engineering Faculty Publications (2)
- Electronic Theses and Dissertations (2)
- Faculty Conference Papers and Presentations (2)
- Faculty Publications (2)
- Masters Theses (2)
- All Dissertations (1)
- All Theses (1)
- Computer Science Theses & Dissertations (1)
- Dissertations (1)
- Dissertations and Theses Collection (Open Access) (1)
- Dissertations, Master's Theses and Master's Reports (1)
- Electronic Theses, Projects, and Dissertations (1)
- Graduate Research Theses & Dissertations (1)
- HMC Senior Theses (1)
- I-GUIDE Forum (1)
- Journal of Aviation/Aerospace Education & Research (1)
- Mechanical & Aerospace Engineering Faculty Publications (1)
- Publication Type
- File Type
Articles 4141 - 4170 of 4243
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Distributed Model Shaping For Scaling To Decentralized Pomdps With Hundreds Of Agents, Prasanna Velagapudi, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Distributed Model Shaping For Scaling To Decentralized Pomdps With Hundreds Of Agents, Prasanna Velagapudi, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Research Collection School Of Computing and Information Systems
The use of distributed POMDPs for cooperative teams has been severely limited by the incredibly large joint policy- space that results from combining the policy-spaces of the individual agents. However, much of the computational cost of exploring the entire joint policy space can be avoided by observing that in many domains important interactions between agents occur in a relatively small set of scenarios, previously defined as coordination locales (CLs) [11]. Moreover, even when numerous interactions might occur, given a set of individual policies there are relatively few actual interactions. Exploiting this observation and building on an existing model shaping algorithm, …
Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig
Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig
Research Collection School Of Computing and Information Systems
Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP to the next one in the sequence. We introduce the ReuseBounds procedure, which can be used by any-space ADOPT and any-space BnB-ADOPT to find cost-minimal solutions for all DCOPs in the sequence faster than by solving each DCOP individually. This procedure allows those agents that are guaranteed to remain unaffected by a change to reuse their lower and upper …
Decentralized Decision Support For An Agent Population In Dynamic And Uncertain Domains, Pradeep Reddy Varakantham, Shih-Fen Cheng, Thi Duong Nguyen
Decentralized Decision Support For An Agent Population In Dynamic And Uncertain Domains, Pradeep Reddy Varakantham, Shih-Fen Cheng, Thi Duong Nguyen
Research Collection School Of Computing and Information Systems
This research is motivated by problems in urban transportation and labor mobility, where the agent flow is dynamic, non-deterministic and on a large scale. In such domains, even though the individual agents do not have an identity of their own and do not explicitly impact other agents, they have implicit interactions with other agents. While there has been much research in handling such implicit effects, it has primarily assumed controlled movements of agents in static environments. We address the issue of decision support for individual agents having involuntary movements in dynamic environments . For instance, in a taxi fleet serving …
Message-Passing Algorithms For Large Structured Decentralized Pomdps, Akshat Kumar, Shlomo Zilberstein
Message-Passing Algorithms For Large Structured Decentralized Pomdps, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide a rigorous framework for multi-agent decision-theoretic planning. However, their high complexity has limited scalability. In this work, we present a promising new class of algorithms based on probabilistic inference for infinite-horizon ND-POMDPs---a restricted Dec-POMDP model. We first transform the policy optimization problem to that of likelihood maximization in a mixture of dynamic Bayes nets (DBNs). We then develop the Expectation-Maximization (EM) algorithm for maximizing the likelihood in this representation. The EM algorithm for ND-POMDPs lends itself naturally to a simple message-passing paradigm guided by the agent interaction graph. It is thus highly scalable w.r.t. the number of …
Adaptive Decision Support For Structured Organizations: A Case For Orgpomdps, Pradeep Reddy Varakantham, Nathan Schurr, Alan Carlin, Christopher Amato
Adaptive Decision Support For Structured Organizations: A Case For Orgpomdps, Pradeep Reddy Varakantham, Nathan Schurr, Alan Carlin, Christopher Amato
Research Collection School Of Computing and Information Systems
In today's world, organizations are faced with increasingly large and complex problems that require decision-making under uncertainty. Current methods for optimizing such decisions fall short of handling the problem scale and time constraints. We argue that this is due to existing methods not exploiting the inherent structure of the organizations which solve these problems. We propose a new model called the OrgPOMDP (Organizational POMDP), which is based on the partially observable Markov decision process (POMDP). This new model combines two powerful representations for modeling large scale problems: hierarchical modeling and factored representations. In this paper we make three key contributions: …
Random Keys Genetic Algorithms Scheduling And Rescheduling Systems For Common Production Systems, Elkin Rodriguez-Velasquez
Random Keys Genetic Algorithms Scheduling And Rescheduling Systems For Common Production Systems, Elkin Rodriguez-Velasquez
Engineering Management & Systems Engineering Theses & Dissertations
The majority of scheduling research deals with problems in specific production environments with specific objective functions. However, in many cases, more than one problem type and/or objective function exists, resulting in the need for a more generic and flexible system to generate schedules. Furthermore, most of the published scheduling research focuses on creating an optimal or near optimal initial schedule during the planning phase. However, after production processes start, circumstances like machine breakdowns, urgent jobs, and other unplanned events may render the schedule suboptimal, obsolete or even infeasible resulting in a "rescheduling" problem, which is typically also addressed for a …
Instance-Based Parameter Tuning Via Search Trajectory Similarity Clustering, Linda Lindawati, Hoong Chuin Lau, David Lo
Instance-Based Parameter Tuning Via Search Trajectory Similarity Clustering, Linda Lindawati, Hoong Chuin Lau, David Lo
Research Collection School Of Computing and Information Systems
This paper is concerned with automated tuning of parameters in local-search based meta-heuristics. Several generic approaches have been introduced in the literature that returns a ”one-size-fits-all” parameter configuration for all instances. This is unsatisfactory since different instances may require the algorithm to use very different parameter configurations in order to find good solutions. There have been approaches that perform instance-based automated tuning, but they are usually problem-specific. In this paper, we propose CluPaTra, a generic (problem-independent) approach to perform parameter tuning, based on CLUstering instances with similar PAtterns according to their search TRAjectories. We propose representing a search trajectory as …
Improving Service Through Just-In-Time Concept In A Dynamic Operational Environment, Kar Way Tan, Hoong Chuin Lau, Na Fu
Improving Service Through Just-In-Time Concept In A Dynamic Operational Environment, Kar Way Tan, Hoong Chuin Lau, Na Fu
Research Collection School Of Computing and Information Systems
This paper is concerned with the problem of Just-In-Time (JIT) job scheduling in a dynamic environment under uncertainty to attain timely service. We provide an approach, based on robust scheduling concepts, to analytically evaluate the expected cost of earliness and tardiness for each job and also the project. In addition, we search for a schedule execution policy with the minimum robust cost such that for a given risk level (epsilon), the actual realized schedule has (1 - epsilon) probability of completing with less than or equal to this robust cost. Our method is quite generic, and can be applied to …
Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati
Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati
Research Collection School Of Computing and Information Systems
Optimizing parameter settings is an important task in algorithm design. Several automated parameter tuning procedures/configurators have been proposed in the literature, most of which work effectively when given a good initial range for the parameter values. In the Design of Experiments (DOE), a good initial range is known to lead to an optimum parameter setting. In this paper, we present a framework based on DOE to find a good initial range of parameter values for automated tuning. We use a factorial experiment design to first screen and rank all the parameters thereby allowing us to then focus on the parameter …
Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein
Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Computing a maximum a posteriori (MAP) assignment in graphical models is a crucial inference problem for many practical applications. Several provably convergent approaches have been successfully developed using linear programming (LP) relaxation of the MAP problem. We present an alternative approach, which transforms the MAP problem into that of inference in a finite mixture of simple Bayes nets. We then derive the Expectation Maximization (EM) algorithm for this mixture that also monotonically increases a lower bound on the MAP assignment until convergence. The update equations for the EM algorithm are remarkably simple, both conceptually and computationally, and can be implemented …
Event Study Method For Validating Agent-Based Trading Simulations, Shih-Fen Cheng
Event Study Method For Validating Agent-Based Trading Simulations, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In this paper, we introduce how one can validate an event-centric trading simulation platform that is built with multi-agent technology. The issue of validation is extremely important for agent-based simulations, but unfortunately, so far there is no one universal method that would work in all domains. The primary contribution of this paper is a novel combination of event-centric simulation design and event study approach for market dynamics generation and validation. In our event-centric design, the simulation is progressed by announcing news events that affect market prices. Upon receiving these events, event-aware software agents would adjust their views on the market …
Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau
Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we discuss the problem of route planning and scheduling by a group of agents. Each agent is responsible for designing a route plan and schedule over a geographical network, and the goal is to obtain a conflict-free plan/schedule that optimizes a global objective. We present a hybrid conflict resolution method that involves coalition formation and distributed constraint satisfaction depending on the level of coupling between agents. We show how this approach can be effectively applied to solve a distributed convoy movement planning problem.
Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau
Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.
The Bi-Objective Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau
The Bi-Objective Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Physician scheduling is the assignment of physicians to perform different duties in the hospital timetable. In this paper, the goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We present a mathematical programming model to represent the problem as a bi-objective optimization problem. Three different methods based on ε–Constraint Method, Weighted-Sum Method and HillClimbing algorithm are proposed. These methods were tested on a real case from the Surgery Department of a large local government hospital, as well as on randomly generated problem instances. The strengths and weaknesses of the …
A Decision Theoretic Approach To Data Leakage Prevention, Janusz Marecki, Mudhakar Srivastava, Pradeep Reddy Varakantham
A Decision Theoretic Approach To Data Leakage Prevention, Janusz Marecki, Mudhakar Srivastava, Pradeep Reddy Varakantham
Research Collection School Of Computing and Information Systems
In both the commercial and defense sectors a compelling need is emerging for rapid, yet secure, dissemination of information. In this paper we address the threat of information leakage that often accompanies such information flows. We focus on domains with one information source (sender) and many information sinks (recipients) where: (i) sharing is mutually beneficial for the sender and the recipients, (ii) leaking a shared information is beneficial to the recipients but undesirable to the sender, and (iii) information sharing decisions of the sender are determined using imperfect monitoring of the (un)intended information leakage by the recipients.We make two key …
Effect Of Human Biases On Human-Agent Teams, Praveen Paruchuri, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Effect Of Human Biases On Human-Agent Teams, Praveen Paruchuri, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Research Collection School Of Computing and Information Systems
As human-agent teams get increasingly deployed in the real-world, agent designers need to take into account that humans and agents have different abilities to specify preferences. In this paper, we focus on how human biases in specifying preferences for resources impacts the performance of large, heterogeneous teams. In particular, we model the inclination of humans to simplify their preference functions and to exaggerate their utility for desired resources, and show the effect of these biases on the team performance. We demonstrate this on two different problems, which are representative of many resource allocation problems addressed in literature. In both these …
Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau
Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper introduces the SoI problem, that of finding nonoptimal solutions of interest for constrained optimization models. SoI problems subsume finding FoIs (feasible solutions of interest), and IoIs (infeasible solutions of interest). In all cases, the interest addressed is post-solution analysis in one form or another. Post-solution analysis of a constrained optimization model occurs after the model has been solved and a good or optimal solution for it has been found. At this point, sensitivity analysis and other questions of import for decision making (discussed in the paper) come into play and for this purpose the SoIs can be of …
Anytime Planning For Decentralized Pomdps Using Expectation Maximization, Akshat Kumar, Shlomo Zilberstein
Anytime Planning For Decentralized Pomdps Using Expectation Maximization, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide an expressive framework for multi-agent sequential decision making. While finite-horizon DECPOMDPs have enjoyed signifcant success, progress remains slow for the infinite-horizon case mainly due to the inherent complexity of optimizing stochastic controllers representing agent policies. We present a promising new class of algorithms for the infinite-horizon case, which recasts the optimization problem as inference in a mixture of DBNs. An attractive feature of this approach is the straightforward adoption of existing inference techniques in DBNs for solving DEC-POMDPs and supporting richer representations such as factored or continuous states and actions. We also derive the Expectation Maximization (EM) …
Point-Based Backup For Decentralized Pompds: Complexity And New Algorithms, Akshat Kumar, Shlomo Zilberstein
Point-Based Backup For Decentralized Pompds: Complexity And New Algorithms, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up existing algorithms, largely due to the use of point-based methods. Performing point-based backup is a fundamental operation in state-of-the-art algorithms. We show that even a single backup step in the multi-agent setting is NP-Complete. Despite this negative worst-case result, we present an efficient and scalable optimal algorithm as well as a principled approximation scheme. The optimal algorithm exploits recent advances in the weighted CSP literature to overcome the complexity of the backup operation. The polytime approximation scheme …
Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau
Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max) have been studied extensively in the literature. However, the more realistic RCPSP/max problems — ones where durations of activities are not known with certainty – have received scant interest and hence are the main focus of the paper. Towards addressing the significant computational complexity involved in tackling RCPSP/max with durational uncertainty, we employ a local search mechanism to generate robust schedules. In this regard, we make two key contributions: (a) Introducing and studying the key properties of a new decision rule to specify start times of activities with …
An Analysis Of Extreme Price Shocks And Illiquidity Among Trend Followers, Bernard Lee, Shih-Fen Cheng, Annie Koh
An Analysis Of Extreme Price Shocks And Illiquidity Among Trend Followers, Bernard Lee, Shih-Fen Cheng, Annie Koh
Research Collection School Of Computing and Information Systems
We construct an agent-based model to study the interplay between extreme price shocks and illiquidity in the presence of systematic traders known as trend followers. The agent-based approach is particularly attractive in modeling commodity markets because the approach allows for the explicit modeling of production, capacities, and storage constraints. Our study begins by using the price stream from a market simulation involving human participants and studies the behavior of various trend-following strategies, assuming initially that their participation will not impact the market. We notice an incremental deterioration in strategy performance as and when strategies deviate further and further from the …
Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin Lau, Jie Pan, Huawei Song
Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin Lau, Jie Pan, Huawei Song
Research Collection School Of Computing and Information Systems
Given an existing stock allocation in an inventory system, it is often necessary to perform reallocation over multiple time points to address inventory imbalance and maximize availability. In this paper, we focus on the situation where there are two opportunities to perform reallocation within a replenishment cycle. We derive a mathematical model to determine when and how to perform reallocation. Furthermore, we consider the extension of this model to the situation allowing an arbitrary number of reallocations. Experimental results show that the two-reallocation approach achieves better performance compared with the single-reallocation approach found in the literature. We also illustrate how …
Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy Varakantham, Milind Tambe
Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has failed to address communication. Without communication, the size of a local policy at each agent within the ND-POMDPs grows exponentially in the time horizon. To overcome this problem, we extend existing algorithms so that agents periodically communicate their observation and action histories with each other. After communication, agents can start from new synchronized belief state. Thus, we can avoid the exponential growth in the size of local policies at agents. Furthermore, we introduce …
A Service Choice Model For Optimizing Taxi Service Delivery, Shih-Fen Cheng, Xin Qu
A Service Choice Model For Optimizing Taxi Service Delivery, Shih-Fen Cheng, Xin Qu
Research Collection School Of Computing and Information Systems
Taxi service has undergone radical revamp in recent years. In particular, significant investments in communication system and GPS devices have improved quality of taxi services through better dispatches. In this paper, we propose to leverage on such infrastructure and build a service choice model that helps individual drivers in deciding whether to serve a specific taxi stand or not. We demonstrate the value of our model by applying it to a real-world scenario. We also highlight interesting new potential approaches that could significantly improve the quality of taxi services.
Sharing Mobile Multimedia Annotations To Support Inquiry-Based Learning Using Mobitop, Khasfariyati Razikin, Dion Hoe-Lian Goh, Yin-Leng Theng, Quang Minh Nguyen, Thi Nhu Quynh Kim, Ee Peng Lim, Chew-Hung Chang, Kalyani Chatterjea, Aixin Sun
Sharing Mobile Multimedia Annotations To Support Inquiry-Based Learning Using Mobitop, Khasfariyati Razikin, Dion Hoe-Lian Goh, Yin-Leng Theng, Quang Minh Nguyen, Thi Nhu Quynh Kim, Ee Peng Lim, Chew-Hung Chang, Kalyani Chatterjea, Aixin Sun
Research Collection School Of Computing and Information Systems
Mobile devices used in educational settings are usually employed within a collaborative learning activity in which learning takes place in the form of social interactions between team members while performing a shared task. We introduce MobiTOP (Mobile Tagging of Objects and People), a geospatial digital library system which allows users to contribute and share multimedia annotations via mobile devices. A key feature of MobiTOP that is well suited for collaborative learning is that annotations are hierarchical, allowing annotations to be annotated by other users to an arbitrary depth. A group of student-teachers involved in an inquiry-based learning activity in geography …
Font Size: Make Font Size Smaller Make Font Size Default Make Font Size Larger Exploiting Coordination Locales In Distributed Pomdps Via Social Model Shaping, Pradeep Varakantham, Jun Young Kwak, Matthew Taylor, Janusz Marecki, Paul Scerri, Milind Tambe
Font Size: Make Font Size Smaller Make Font Size Default Make Font Size Larger Exploiting Coordination Locales In Distributed Pomdps Via Social Model Shaping, Pradeep Varakantham, Jun Young Kwak, Matthew Taylor, Janusz Marecki, Paul Scerri, Milind Tambe
Research Collection School Of Computing and Information Systems
Distributed POMDPs provide an expressive framework for modeling multiagent collaboration problems, but NEXPComplete complexity hinders their scalability and application in real-world domains. This paper introduces a subclass of distributed POMDPs, and TREMOR, an algorithm to solve such distributed POMDPs. The primary novelty of TREMOR is that agents plan individually with a single agent POMDP solver and use social model shaping to implicitly coordinate with other agents. Experiments demonstrate that TREMOR can provide solutions orders of magnitude faster than existing algorithms while achieving comparable, or even superior, solution quality.
Setting Discrete Bid Levels Adaptively In Repeated Auctions, Jilian Zhang, Hoong Chuin Lau, Jialie Shen
Setting Discrete Bid Levels Adaptively In Repeated Auctions, Jilian Zhang, Hoong Chuin Lau, Jialie Shen
Research Collection School Of Computing and Information Systems
The success of an auction design often hinges on its ability to set parameters such as reserve price and bid levels that will maximize an objective function such as the auctioneer revenue. Works on designing adaptive auction mechanisms have emerged recently, and the challenge is in learning different auction parameters by observing the bidding in previous auctions. In this paper, we propose a non-parametric method for determining discrete bid levels dynamically so as to maximize the auctioneer revenue. First, we propose a non-parametric kernel method for estimating the probabilities of closing price with past auction data. Then a greedy strategy …
Multilayer Image Inpainting Approach Based On Neural Networks, Quan Wang, Zhaoxia Wang, Che Sau Chang, Ting Yang
Multilayer Image Inpainting Approach Based On Neural Networks, Quan Wang, Zhaoxia Wang, Che Sau Chang, Ting Yang
Research Collection School Of Computing and Information Systems
This paper describes an image inpainting approach based on the self-organizing map for dividing an image into several layers, assigning each damaged pixel to one layer, and then restoring these damaged pixels by the information of their respective layer. These inpainted layers are then fused together to provide the final inpainting results. This approach takes advantage of the neural network's ability of imitating human's brain to separate objects of an image into different layers for inpainting. The approach is promising as clearly demonstrated by the results in this paper.
An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim
An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim
Research Collection School Of Computing and Information Systems
In this paper, an event-centric commodity trading simulation powered by the multiagent framework is presented. The purpose of this simulation platform is for training novice traders. The simulation is progressed by announcing news events that affect various aspects of the commodity supply chain. Upon receiving these events, market agents that play the roles of producers, consumers, and speculators would adjust their views on the market and act accordingly. Their actions would be based on their roles and also their private information, and collectively they shape the market dynamics. This simulation has been effectively deployed for several training sessions. We will …
An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim, Chao-Chi Liu
An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim, Chao-Chi Liu
Research Collection School Of Computing and Information Systems
In recent years, the study of trading in electronic markets has received significant amount of attention, particularly in the areas of artificial intelligence and electronic commerce. With increasingly sophisticated technologies being applied in analyzing information and making decisions, fully autonomous software agents are expected to take up significant roles in many important fields. This trend is most obvious in the financial domain, where speed of reaction is highly valued and significant investments have been made in information and communication technologies.Despite the successes of automated trading in many important classes of financial markets, commodity trading has lagged behind, mainly because of …