Operations Research, Systems Engineering and Industrial Engineering Commons^™

Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith

Research Collection School Of Computing and Information Systems

The problem of finding optimal coordinated signal timing plans for a large number of traffic signals is a challenging problem because of the exponential growth in the number of joint timing plans that need to be explored as the network size grows. In this paper, the game-theoretic paradigm of fictitious play to iteratively search for a coordinated signal timing plan is employed, which improves a system-wide performance criterion for a traffic network. The algorithm is robustly scalable to realistic-size networks modeled with high-fidelity simulations. Results of a case study for the city of Troy, MI, where there are 75 signalized …

Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen

Research Collection School Of Computing and Information Systems

We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU) time when the edge lengths are positive integers, where n is the number of nodes in the tree and U is the length upper bound of the path. We present an algorithm that runs in O(nlog2n) time for the generalized case when the edge lengths are positive real numbers, which …

Dynamic Multi-Linked Negotiations In Multi-Echelon Production Scheduling Networks, Hoong Chuin Lau, Guan Li Soh, Wee Chong Wan

Research Collection School Of Computing and Information Systems

In this paper, we are concerned with scheduling resources in a multi-tier production/logistics system for multi-indenture goods. Unlike classical production scheduling problems, the problem we study is concerned with local utilities which are private. We present an agent model and investigate an efficient scheme for handling multi-linked agent negotiations. With this scheme we attempt to overcome the drawbacks of sequential negotiations and negotiation parameter settings. Our approach is based on embedding a credit-based negotiation protocol within a local search scheduling algorithm. We demonstrate the computational efficiency and effectiveness of the approach in solving a real-life dynamic production scheduling problem which …

Supply Chain Information Sharing In A Macro Prediction Market, Zhiling Guo, Fang Fang, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

This paper aims to address supply chain partners' incentives for information sharing from an information systems design perspective. Specifically, we consider a supply chain characterized by N geographically distributed retailers who order a homogeneous product from one manufacturer. Each retailer's demand risk consists of two parts: a systematic risk part that affects all retailers and an idiosyncratic risk part that only has a local effect. We propose a macro prediction market to effectively elicit and aggregate useful information about systematic demand risk. We show that such information can be used to achieve accurate demand forecast sharing and better channel coordination …

Robust Controllability In Temporal Constraint Networks Under Uncertainty, Hoong Chuin Lau, Jia Li, Roland H. C. Yap

Research Collection School Of Computing and Information Systems

Temporal constraint networks are embedded in many planning and scheduling problems. In dynamic problems, a fundamental challenge is to decide whether such a network can be executed as uncertainty is revealed over time. Very little work in this domain has been done in the probabilistic context. In this paper, we propose a Temporal Constraint Network (TCN) model where durations of uncertain activities are represented by random variables. We wish to know whether such a network is robust controllable, i.e. can be executed dynamically within a given failure probability, and if so, how one might find a feasible schedule as the …

Adaptive Critic Neural Network Force Controller For Atomic Force Microscope-Based Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Automating the task of nanomanipulation is extremely important since it is tedious for humans. This paper proposes an atomic force microscope (AFM) based force controller to push nano particles on the substrates. A block phase correlation-based algorithm is embedded into the controller for the compensation of the thermal drift which is considered as the main external uncertainty during nanomanipulation. Then, the interactive forces and dynamics between the tip and the particle, particle and the substrate are modeled and analyzed. Further, an adaptive critic NN controller based on adaptive dynamic programming algorithm is designed and the task of pushing nano particles …

Viz: A Visual Analysis Suite For Explaining Local Search Behavior, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algorithms are heuristic-based, it is hard to understand how to improve or tune them. We propose an interactive visualization tool, VIZ, meant for understanding the behavior of local search. VIZ uses animation of abstract search trajectories with other visualizations which are also animated in a VCR-like fashion to graphically playback the algorithm behavior. It combines generic visualizations applicable on arbitrary algorithms with algorithm and problem specific visualizations. We use a variety of techniques such as …

Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of deciding when and how to perform reallocation of existing spare parts in a multi-echelon reparable item inventory system. We present a mathematical model that solves the problem when there are two reallocation instants, in response to the open challenge post by Cao and Silver(2005) to consider two or more possible reallocations within a replenishment cycle.

Neural Network Based Decentralized Excitation Control Of Large Scale Power Systems, Wenxin Liu, Ganesh K. Venayagamoorthy, Donald C. Wunsch, David A. Cartes, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a neural network (NN) based decentralized excitation controller design for large scale power systems. The proposed controller design considers not only the dynamics of generators but also the algebraic constraints of the power flow equations. The control signals are calculated using only local signals. The transient stability and the coordination of the subsystem controllers can be guaranteed. NNs are used to approximate the unknown/imprecise dynamics of the local power system and the interconnections. All signals in the closed loop system are guaranteed to be uniformly ultimately bounded (UUB). Simulation results with a 3-machine power system demonstrate the …

Winning Back The Cup For Distributed Pomdps: Planning Over Continuous Belief Spaces, Pradeep Varakantham, Ranjit Nair, Milind Tambe, Makoto Yokoo

Research Collection School Of Computing and Information Systems

Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms have been proposed to obtain locally or globally optimal policies. Unfortunately, most of these algorithms have either been explicitly designed or experimentally evaluated assuming knowledge of a starting belief point, an assumption that often does not hold in complex, uncertain domains. Instead, in such domains, it is important for agents to explicitly plan over continuous belief spaces. This paper provides a novel algorithm to explicitly compute finite horizon policies over continuous belief spaces, without restricting the space of …

Measuring Plant-Wide Energy Savings, J. Kelly Kissock, Carl Eger

Mechanical and Aerospace Engineering Faculty Publications

This paper presents a general method for measuring plant-wide industrial energy savings and demonstrates the method using a case study from an actual industrial energy assessment. The method uses regression models to characterize baseline energy use. It takes into account changes in weather and production, and can use sub-metered data or whole plant utility billing data. In addition to calculating overall savings, the method is also able to disaggregate savings into components, which provides additional insight into the effectiveness of the individual savings measures.

Although the method incorporates search techniques and multi-variable least-squares regression, it is easily implemented using data …

Evaluation Of Time-Varying Availability In Multi-Echelon Spare Parts Systems With Passivation, Hoong Chuin Lau, Huawei Song, Chuen Teck See, Siew Yen Cheng

Research Collection School Of Computing and Information Systems

The popular models for repairable item inventory, both in the literature as well as practical applications, assume that the demands for items are independent of the number of working systems. However this assumption can introduce a serious underestimation of availability when the number of working systems is small, the failure rate is high or the repair time is long. In this paper, we study a multi-echelon repairable item inventory system under the phenomenon of passivation, i.e. serviceable items are passivated (“switched off”) upon system failure. This work is motivated by corrective maintenance of high-cost technical equipment in the miltary. We …

Development Of Integrated Process Simulation System Model For Spent Fuel Treatment Facility (Sftf) Design: Quarterly Progress Report January 1-March 31, 2006, Yitung Chen, Sean Hsieh

Separations Campaign (TRP)

The UNLV developed TRPSEMPro software package can access engineering modeling software, ASPEN Plus through its own interface. The new interface eliminates the user interaction with the complex ASPEN Plus package and also provides input and output results for analysis purpose. The current interface will keep improving on collecting multiple scenario runs and database population.

Two separation processes, acid and plutonium separations, are near completion. The unit operations were finished while some sensitive chemical data for certain species are unknown. Graduate student, Matthew Hodges, continues on finishing those processes using dummy values for those restricted variables. Once the processes complete, researchers …

Optimization Of A Multi-Echelon Repair System Via Generalized Pattern Search With Ranking And Selection: A Computational Study, Derek D. Tharaldson

Theses and Dissertations

With increasing developments in computer technology and available software, simulation is becoming a widely used tool to model, analyze, and improve a real world system or process. However, simulation in itself is not an optimization approach. Common optimization procedures require either an explicit mathematical formulation or numerous function evaluations at improving iterative points. Mathematical formulation is generally impossible for problems where simulation is relevant, which are characteristically the types of problems that arise in practical applications. Further complicating matters is the variability in the simulation response which can cause problems in iterative techniques using the simulation model as a function …

Development Of Integrated Process Simulation System Model For Spent Fuel Treatment Facility (Sftf) Design, Yitung Chen, Sean Hsieh

Separations Campaign (TRP)

The overall goal of this project is the creation of a framework that combines all the strengths of AMUSE’s complicated calculations, well-established commercial system process packages, and TRPSEMPro’s flexible parameter optimization modules. Development of the process simulation code can be done using the solvent extraction process at Argonne National Laboratory in collaboration with the UNLV Nevada Center for Advanced Computational Methods.

The major objectives are the following:

• Develop a framework for simulating the Spent Fuel Treatment Facility (SFTF) process using AMUSE code, commercial process package, such as ASPEN-PLUS, and system engineering model.
• Develop a middleware package that can communicate between …

Adaptive And Probabilistic Power Control Algorithms For Dense Rfid Reader Network, Kainan Cha, Anil Ramachandran, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In radio frequency identification (RFID) systems, the detection range and read rates may suffer from interferences between high power devices such as readers. In dense networks, this problem grows severely and degrades system performance. In this paper, we investigate feasible power control schemes to ensure overall coverage area of the system while maintaining a desired data rate. The power control should dynamically adjust the output power of a RFID reader by adapting to the noise level seen during tag reading and acceptable signal-to-noise ratio (SNR). We present a novel distributed adaptive power control (DAPC) and probabilistic power control (PPC) as …

Decentralized Power Control With Implementation For Rfid Networks, Kainan Cha, Anil Ramachandran, David Pommerenke, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In radio frequency identification (RFID) systems, the detection range and read rates will suffer from interference among high power reading devices. This problem grows severely and degrades system performance in dense RFID networks. In this paper, we investigate a suite of feasible power control schemes to ensure overall coverage area of the system while maintaining a desired read rate. The power control scheme and MAC protocol dynamically adjusts the RFID reader power output in response to the interference level seen locally during tag reading for an acceptable signal-to-noise ratio (SNR). We present novel distributed adaptive power control (DAPC) and probabilistic …

Distributed Power Control For Cellular Networks In The Presence Of Channel Uncertainties, Maciej Jan Zawodniok, Q. Shang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel distributed power control (DPC) scheme for cellular network in the presence of radio channel uncertainties such as path loss, shadowing, and Rayleigh fading is presented. Since these uncertainties can attenuate the received signal strength and can cause variations in the received Signal-to-Interference ratio (SIR), a new DPC scheme, which can estimate the slowly varying channel uncertainty, is proposed so that a target SIR at the receiver can be maintained. Further, the standard assumption of a constant interference during a link's power update used in other works in the literature is relaxed. A CDMA-based cellular network …

Visualization For Analyzing Trajectory-Based Metaheuristic Search Algorithms, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

No abstract provided.

Adaptive Distributed Fair Scheduling And Its Implementation In Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani, Steve Eugene Watkins, James W. Fonda

Electrical and Computer Engineering Faculty Research & Creative Works

A novel adaptive and distributed fair scheduling (ADFS) scheme for wireless sensor networks is shown through hardware implementation. In contrast to simulation, hardware evaluation provides valuable feedback to protocol and hardware development process. The proposed protocol focuses on quality-of-service (QoS) issues to address flow prioritization. Thus, when nodes access a shared channel, the proposed ADFS allocates the channel bandwidth proportionally to the weight, or priority, of the packet flows. Moreover, ADFS allows for dynamic allocation of network resources with little added overhead. Weights are initially assigned using user specified QoS criteria. These weights are subsequently updated as a function of …

Development And Implementation Of Optimized Energy-Delay Sub-Network Routing Protocol For Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani, Steve Eugene Watkins, James W. Fonda

Electrical and Computer Engineering Faculty Research & Creative Works

The development and implementation of the optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSN) is presented. This ondemand routing protocol minimizes a novel link cost factor which is defined using available energy, end-to-end (E2E) delay and distance from a node to the base station (BS), along with clustering, to effectively route information to the BS. Initially, the nodes are either in idle or sleep mode, but once an event is detected, the nodes near the event become active and start forming sub-networks. Formation of the inactive network into a sub-network saves energy because only a portion of …

Neural Network-Based Output Feedback Controller For Lean Operation Of Spark Ignition Engines, Brian C. Kaul, Jagannathan Sarangapani, J. A. Drallmeier, Jonathan B. Vance, Pingan He

Electrical and Computer Engineering Faculty Research & Creative Works

Spark ignition (SI) engines running at very lean conditions demonstrate significant nonlinear behavior by exhibiting cycle-to-cycle dispersion of heat release even though such operation can significantly reduce NOx emissions and improve fuel efficiency by as much as 5-10%. A suite of neural network (NN) controller without and with reinforcement learning employing output feedback has shown ability to reduce the nonlinear cyclic dispersion observed under lean operating conditions. The neural network controllers consists of three NN: a) A NN observer to estimate the states of the engine such as total fuel and air; b) a second NN for generating virtual input; …

Neuro Control Of Nonlinear Discrete Time Systems With Deadzone And Input Constraints, Pingan He, Wenzhi Gao, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

A neural network (NN) controller in discrete time is designed to deliver a desired tracking performance for a class of uncertain nonlinear systems with unknown deadzones and magnitude constraints on the input. The NN controller consists of two NNs: the first NN for compensating the unknown deadzones; and the second NN for compensating the uncertain nonlinear system dynamics. The magnitude constraints on the input are modeled as saturation nonlinearities and they are dealt with in the Lyapunov-based controller design. The uniformly ultimate boundedness (UUB) of the closed-loop tracking errors and the neural network weights estimation errors is demonstrated via Lyapunov …

A Dyadic Composition To Foster Virtual Team Effectiveness: An Experimental Study, Gamze Karayaz

Engineering Management & Systems Engineering Theses & Dissertations

The importance of effectiveness for virtual teamwork continues to gain momentum as technology and globalization of work accelerate. The implementation of virtual teams provides one approach to enhance competitiveness, overcoming the disadvantages of space and time differences through collaborative technologies. The influence of structure to virtual team performance has not been clearly established in the literature. The purpose of this research study was to investigate the effectiveness of a dyad structured approach for virtual teams using a quasi-experimental research design.

This research investigated four questions related to the influence of structure on virtual team effectiveness related to task performance, communication …

Multiagent Teamwork: Hybrid Approaches, Praveen Paruchuri, Emma Bowring, Ranjit Nair, Jonathan Pearce, Nathan Schurr, Milind Tambe, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Today within the multiagent community, we see at least four competing methods to building multiagent systems: beliefdesireintention (BDI), distributed constraint optimization (DCOP), distributed POMDPs, and auctions or game-theoretic methods. While there is exciting progress within each approach, there is a lack of cross-cutting research. This article highlights the various hybrid techniques for multiagent teamwork developed by the teamcore group. In particular, for the past decade, the TEAMCORE research group has focused on building agent teams in complex, dynamic domains. While our early work was inspired by BDI, we will present an overview of recent research that uses DCOPs and distributed …