Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (11)
- Operations Research, Systems Engineering and Industrial Engineering (11)
- Business (9)
- Social and Behavioral Sciences (3)
- Databases and Information Systems (2)
-
- Law (2)
- Administrative Law (1)
- Arts and Humanities (1)
- Communication (1)
- Computational Linguistics (1)
- Computer Law (1)
- Education (1)
- Educational Assessment, Evaluation, and Research (1)
- Educational Technology (1)
- Law and Philosophy (1)
- Legal Ethics and Professional Responsibility (1)
- Legal Profession (1)
- Legal Writing and Research (1)
- Linguistics (1)
- Numerical Analysis and Scientific Computing (1)
- Operations and Supply Chain Management (1)
- Public Administration (1)
- Public Affairs, Public Policy and Public Administration (1)
- Speech and Rhetorical Studies (1)
- Technical and Professional Writing (1)
- Institution
- Keyword
-
- Logistics (2)
- (self)adaptation (1)
- AI (1)
- Ant colony (1)
- Artificial intelligence (1)
-
- Assessment (1)
- Basic working principles of evolutionary computations (1)
- Benefits (1)
- Case decisions (1)
- Challenges (1)
- Clustering (1)
- Cognitive robotics (1)
- Continuous-review (1)
- Deceptive & multimodal optimization problems. (1)
- Demand Classes (1)
- Dialectical relationships (1)
- Ethics (1)
- Evolutionary algorithm (1)
- Fitness evaluation (1)
- Fitness landscapes (1)
- Human-level performance (1)
- Information management (1)
- Insights (1)
- Integration of theories (1)
- Inventory model (1)
- Law and technology (1)
- Legal analysis (1)
- Legal information retrieval (1)
- Legal reasoning (1)
- Logistics Network Design (1)
Articles 1 - 17 of 17
Full-Text Articles in Artificial Intelligence and Robotics
Two-Echelon Repairable Item Inventory System With Limited Repair Capacity Under Nonstationary Demands, Hoong Chuin Lau, Huawei Song
Two-Echelon Repairable Item Inventory System With Limited Repair Capacity Under Nonstationary Demands, Hoong Chuin Lau, Huawei Song
Research Collection School Of Computing and Information Systems
We study a repairable item inventory system under limited repair capacity and nonstationary Poisson demands, motivated by corrective maintenance of military equipment. Our goal is to minimize the cost of both spare and repair resource allocation. We propose an efficient analytical model that combines optimization modeling and queuing theory.
Corrective Maintenance Optimization In An Air Force, Hoong Chuin Lau, K. Y. Neo, W. C. Wan
Corrective Maintenance Optimization In An Air Force, Hoong Chuin Lau, K. Y. Neo, W. C. Wan
Research Collection School Of Computing and Information Systems
Successful military mission planning and execution depend critically on equipment serviceability and resupply. Due to the stochastic nature of demands, the forecast of optimal spares and resources needed to guarantee the level of serviceability is a complex problem, especially in a multi-echelon setting. In this paper, we propose a decision-support concept and software tool known as Corrective Maintenance Optimizer (CMO) that helps to optimize system availability, through proper allocation of spare parts, both strategically and operationally.
Job Scheduling With Unfixed Availability Constraints, Hoong Chuin Lau, C. Zhang
Job Scheduling With Unfixed Availability Constraints, Hoong Chuin Lau, C. Zhang
Research Collection School Of Computing and Information Systems
Standard scheduling theory assumes that all machines are continuously available throughout the planning horizon. In many manufacturing and service management situations however, machines need to be maintained periodically to prevent malfunctions. During the maintenance period, a machine is not available for processing jobs. Hence, a more realistic scheduling model should take into account machine maintenance activities. In this paper, we study the problem of job scheduling with unfixed availability constraints on a single machine. We first propose a preliminary classification for the scheduling problem with unfixed availability constraints based on maintenance constraints, job characteristics and objective function. We divide our …
Logistics Network Design With Differentiated Delivery Lead Time: A Chemical Industry Case Study, Michelle Lee Fong Cheong, Rohit Bhatnagar, Stephen C. Graves
Logistics Network Design With Differentiated Delivery Lead Time: A Chemical Industry Case Study, Michelle Lee Fong Cheong, Rohit Bhatnagar, Stephen C. Graves
Research Collection School Of Computing and Information Systems
Most logistics network design models assume exogenous customer demand that is independent of the service time or level. This paper examines the benefits of segmenting demand according to lead-time sensitivity of customers. To capture lead-time sensitivity in the network design model, we use a facility grouping method to ensure that the different demand classes are satisfied on time. In addition, we perform a series of computational experiments to develop a set of managerial insights for the network design decision making process.
A Periodic-Review Inventory Model With Application To The Continuous-Review Obsolescence Problem, Yuyue Song, Hoong Chuin Lau
A Periodic-Review Inventory Model With Application To The Continuous-Review Obsolescence Problem, Yuyue Song, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper we consider a stochastic-demand periodic-review inventory model with sudden obsolescence. We characterize the structure of the optimal policy and propose a dynamic programming algorithm for computing its parameters. We then utilize this algorithm to approximate the solution to the continuous-review sudden obsolescence problem with general obsolescence distribution. We prove convergence of our approximation scheme, and demonstrate it numerically against known closed-form solutions of special cases.
Towards Personalised Web Intelligence, Ah-Hwee Tan, Hwee-Leng Ong, Hong Pan, Jamie Ng, Qiu-Xiang Li
Towards Personalised Web Intelligence, Ah-Hwee Tan, Hwee-Leng Ong, Hong Pan, Jamie Ng, Qiu-Xiang Li
Research Collection School Of Computing and Information Systems
The Flexible Organizer for Competitive Intelligence (FOCI) is a personalised web intelligence system that provides an integrated platform for gathering, organising, tracking, and disseminating competitive information on the web. FOCI builds personalised information portfolios through a novel method called User-Configurable Clustering, which allows a user to personalise his/her portfolios in terms of the content as well as the organisational structure. This paper outlines the key challenges we face in personalised information management and gives a detailed account of FOCI’s underlying personalisation mechanism. For a quantitative evaluation of the system’s performance, we propose a set of performance indices based on information …
A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim
A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim
Research Collection School Of Computing and Information Systems
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to specific problems. For this reason, a software tool for rapid prototyping of algorithms would save considerable resources. This work presents a generic software framework that reduces development time through abstract classes and software reuse, and more importantly, aids design with support of user-defined strategies and hybridization of meta-heuristics. Most interestingly, we propose a novel way of redefining hybridization with the use of the "request and response" metaphor, which form an abstract concept for hybridization. Different hybridization schemes can now be formed …
A Two-Level Framework For Coalition Formation Via Optimization And Agent Negotiation, Hoong Chuin Lau, Lei Zhang
A Two-Level Framework For Coalition Formation Via Optimization And Agent Negotiation, Hoong Chuin Lau, Lei Zhang
Research Collection School Of Computing and Information Systems
We present a two-level coalition formation approach based on a centralized optimization model on the upper level, and a distributed agent-negotiation model on the lower level. This approach allows us to balance agent self-interests against a high joint utility. Experimental results show that the two-level coalition formation mechanism will increase not only the overall utility of the coalition, but also the individual utility of most participating agents. The results also suggest it is better for the agents to be partially cooperative rather than either fully cooperative or self-interested in our setting.
Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman
Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman
Research Collection School Of Computing and Information Systems
In a symmetric game, every player is identical with respect to the game rules. We show that a symmetric 2strategy game must have a pure-strategy Nash equilibrium. We also discuss Nash’s original paper and its generalized notion of symmetry in games. As a special case of Nash’s theorem, any finite symmetric game has a symmetric Nash equilibrium. Furthermore, symmetric infinite games with compact, convex strategy spaces and continuous, quasiconcave utility functions have symmetric pure-strategy Nash equilibria. Finally, we discuss how to exploit symmetry for more efficient methods of finding Nash equilibria.
Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham
Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Distributed Constraint Optimization (DCOP) is an elegant formalism relevant to many areas in multiagent systems, yet complete algorithms have not been pursued for real world applications due to perceived complexity. To capably capture a rich class of complex problem domains, we introduce the Distributed Multi-Event Scheduling (DiMES) framework and design congruent DCOP formulations with binary constraints which are proven to yield the optimal solution. To approach real-world efficiency requirements, we obtain immense speedups by improving communication structure and precomputing best case bounds. Heuristics for generating better communication structures and calculating bound in a distributed manner are provided and tested on …
Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar
Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar
Research Collection School Of Computing and Information Systems
In evolutionary algorithms a critical parameter that must be tuned is that of selection pressure. If it is set too low then the rate of convergence towards the optimum is likely to be slow. Alternatively if the selection pressure is set too high the system is likely to become stuck in a local optimum due to a loss of diversity in the population. The recent Fitness Uniform Selection Scheme (FUSS) is a conceptually simple but somewhat radical approach to addressing this problem - rather than biasing the selection towards higher fitness, FUSS biases selection towards sparsely populated fitness levels. In …
Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim
Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim
Research Collection School Of Computing and Information Systems
This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.
Cognitive Robot Mapping With Polylines And An Absolute Space Representation, Kennard R. Laviers, Gilbert L. Peterson
Cognitive Robot Mapping With Polylines And An Absolute Space Representation, Kennard R. Laviers, Gilbert L. Peterson
Faculty Publications
Robot mapping even today is one of the most challenging problems in robot programming. Most successful methods use some form of occupancy grid to represent a mapped region. This approach becomes problematic if the robot is mapping a large environment, the map quickly becomes too large for processing and storage. Rather than storing the map as an occupancy grid, our robot (equipped with sonars) sees the world as a series of connected spaces. These spaces are initially mapped as an occupancy grid in a room by room fashion. As the robot leaves a space, denoted by passing through a doorway, …
Integrating Perception, Language And Problem Solving In A Cognitive Agent For A Mobile Robot., Deryle W. Lonsdale, D. Paul Benjamin, Damian M. Lyons
Integrating Perception, Language And Problem Solving In A Cognitive Agent For A Mobile Robot., Deryle W. Lonsdale, D. Paul Benjamin, Damian M. Lyons
Faculty Publications
We are implementing a unified cognitive architecture for a mobile robot. Our goal is to endow a robot agent with the full range of cognitive abilities, including perception, use of natural language, learning and the ability to solve complex problems. The perspective of this work is that an architecture based on a unified theory of robot cognition has the best chance of attaining human-level performance.
This agent architecture is an integration of three theories: a theory of cognition embodied in the Soar system, the RS formal model of sensorimotor activity and an algebraic theory of decomposition and reformulation.
These three …
E-Rulemaking: Information Technology And The Regulatory Process: New Directions In Digital Government Research, Cary Coglianese
E-Rulemaking: Information Technology And The Regulatory Process: New Directions In Digital Government Research, Cary Coglianese
All Faculty Scholarship
Electronic rulemaking, or e-rulemaking, offers the potential to overcome some of the informational challenges associated with developing regulations. E-rulemaking refers to the use of digital technologies in the development and implementation of regulations. The use of these technologies may help streamline and improve regulatory management, such as by helping agency staff retrieve and analyze vast quantities of information from diverse sources. By taking better advantage of advances in digital technologies, agencies might also be able to increase the public's access to and involvement in rulemaking. Part I of this article details the rulemaking process, outlining the procedures agencies must currently …
Logistics Outsourcing And 3pl Challenges, Michelle L. F. Cheong
Logistics Outsourcing And 3pl Challenges, Michelle L. F. Cheong
Research Collection School Of Computing and Information Systems
Logistics has been an important part of every economy and every business entity. The worldwide trend in globalization has led to many companies outsourcing their logistics function to Third-Party Logistics (3PL) companies, so as to focus on their core competencies. This paper attempts to broadly identify and categorize the challenges faced by 3PL companies and discover potential gaps for future research. Some of the challenges will be related with the experience and information collected from interviews with two 3PL companies.
Capturing The Dialectic Between Principles And Cases, Kevin D. Ashley
Capturing The Dialectic Between Principles And Cases, Kevin D. Ashley
Articles
Theorists in ethics and law posit a dialectical relationship between principles and cases; abstract principles both inform and are informed by the decisions of specific cases. Until recently, however, it has not been possible to investigate or confirm this relationship empirically. This work involves a systematic study of a set of ethics cases written by a professional association's board of ethical review. Like judges, the board explains its decisions in opinions. It applies normative standards, namely principles from a code of ethics, and cites past cases. We hypothesized that the board's explanations of its decisions elaborated upon the meaning and …