NASA Center for Intelligent Robotic Systems for Space Exploration

NASA's program for the civilian exploration of space is a challenge to scientists and engineers to help maintain and further develop the United States' position of leadership in a focused sphere of space activity. Such an ambitious plan requires the contribution and further development of many scientific and technological fields. One research area essential for the success of these space exploration programs is Intelligent Robotic Systems. These systems represent a class of autonomous and semi-autonomous machines that can perform human-like functions with or without human interaction. They are fundamental for activities too hazardous for humans or too distant or complex for remote telemanipulation. To meet this challenge, Rensselaer Polytechnic Institute (RPI) has established an Engineering Research Center for Intelligent Robotic Systems for Space Exploration (CIRSSE). The Center was created with a five year $5.5 million grant from NASA submitted by a team of the Robotics and Automation Laboratories. The Robotics and Automation Laboratories of RPI are the result of the merger of the Robotics and Automation Laboratory of the Department of Electrical, Computer, and Systems Engineering (ECSE) and the Research Laboratory for Kinematics and Robotic Mechanisms of the Department of Mechanical Engineering, Aeronautical Engineering, and Mechanics (ME,AE,&M), in 1987. This report is an examination of the activities that are centered at CIRSSE

Analusis and Modeling of Flexible Manufacturing System

Analysis and modeling of flexible manufacturing system (FMS) consists of scheduling of the system and optimization of FMS objectives. Flexible manufacturing system (FMS) scheduling problems become extremely complex when it comes to accommodate frequent variations in the part designs of incoming jobs. This research focuses on scheduling of variety of incoming jobs into the system efficiently and maximizing system utilization and throughput of system where machines are equipped with different tools and tool magazines but multiple machines can be assigned to single operation. Jobs have been scheduled according to shortest processing time (SPT) rule. Shortest processing time (SPT) scheduling rule is simple, fast, and generally a superior rule in terms of minimizing completion time through the system, minimizing the average number of jobs in the system, usually lower in-process inventories (less shop congestion) and downstream idle time (higher resource utilization). Simulation is better than experiment with the real world system because the system as yet does not exist and experimentation with the system is expensive, too time consuming, too dangerous. In this research, Taguchi philosophy and genetic algorithm have been used for optimization. Genetic algorithm (GA) approach is one of the most efficient algorithms that aim at converging and giving optimal solution in a shorter time. Therefore, in this work, a suitable fitness function is designed to generate optimum values of factors affecting FMS objectives (maximization of system utilization and maximization of throughput of system by Genetic Algorithm (GA) approach

AI and OR in management of operations: history and trends

The last decade has seen a considerable growth in the use of Artificial Intelligence (AI) for operations management with the aim of finding solutions to problems that are increasing in complexity and scale. This paper begins by setting the context for the survey through a historical perspective of OR and AI. An extensive survey of applications of AI techniques for operations management, covering a total of over 1200 papers published from 1995 to 2004 is then presented. The survey utilizes Elsevier's ScienceDirect database as a source. Hence, the survey may not cover all the relevant journals but includes a sufficiently wide range of publications to make it representative of the research in the field. The papers are categorized into four areas of operations management: (a) design, (b) scheduling, (c) process planning and control and (d) quality, maintenance and fault diagnosis. Each of the four areas is categorized in terms of the AI techniques used: genetic algorithms, case-based reasoning, knowledge-based systems, fuzzy logic and hybrid techniques. The trends over the last decade are identified, discussed with respect to expected trends and directions for future work suggested

Locating emergency services with priority rules: The priority queuing covering location problem

One of the assumptions of the Capacitated Facility Location Problem (CFLP) is that demand is known and fixed. Most often, this is not the case when managers take some strategic decisions such as locating facilities and assigning demand points to those facilities. In this paper we consider demand as stochastic and we model each of the facilities as an independent queue. Stochastic models of manufacturing systems and deterministic location models are put together in order to obtain a formula for the backlogging probability at a potential facility location. Several solution techniques have been proposed to solve the CFLP. One of the most recently proposed heuristics, a Reactive Greedy Adaptive Search Procedure, is implemented in order to solve the model formulated. We present some computational experiments in order to evaluate the heuristics’ performance and to illustrate the use of this new formulation for the CFLP. The paper finishes with a simple simulation exercise.Location, queuing, greedy heuristics, simulation