Search NASASearch

SEARCH · Search NASA

Results for “Allocation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Methodologies for optimal resource allocation to the national space program and new space utilizations. Volume 2: Resource allocation and smoothing model, programmer's manual

Appendixes are presented that provide model input requirements, a sample case, flow charts, and a program listing. At the beginning of each appendix, descriptive details and technical comments are provided to indicate any special instructions applicable to the use of that appendix. In addition, the program listing includes comment cards that state the purpose of each subroutine in the complete program and describe operations performed within that subroutine. The input requirements includes details on the many options that adapt the program to the specific needs of the analyst for a particular problem.

Source record

Human-Automation Allocations for Current Robotic Space Operations

Within the Human Research Program, one risk delineates the uncertainty surrounding crew working with automation and robotics in spaceflight. The Risk of Inadequate Design of Human and Automation/Robotic Integration (HARI) is concerned with the detrimental effects on crew performance due to ineffective user interfaces, system designs and/or functional task allocation, potentially compromising mission success and safety. Risk arises because we have limited experience with complex automation and robotics. One key gap within HARI, is the gap related to functional allocation. The gap states: We need to evaluate, develop, and validate methods and guidelines for identifying human-automation/robot task information needs, function allocation, and team composition for future long duration, long distance space missions. Allocations determine the human-system performance as it identifies the functions and performance levels required by the automation/robotic system, and in turn, what work the crew is expected to perform and the necessary human performance requirements. Allocations must take into account each of the human, automation, and robotic systems capabilities and limitations. Some functions may be intuitively assigned to the human versus the robot, but to optimize efficiency and effectiveness, purposeful role assignments will be required. The role of automation and robotics will significantly change in future exploration missions, particularly as crew becomes more autonomous from ground controllers. Thus, we must understand the suitability of existing function allocation methods within NASA as well as the existing allocations established by the few robotic systems that are operational in spaceflight. In order to evaluate future methods of robotic allocations, we must first benchmark the allocations and allocation methods that have been used. We will present 1) documentation of human-automation-robotic allocations in existing, operational spaceflight systems; and 2) To gather existing lessons learned and best practices in these role assignments, from spaceflight operational experience of crew and ground teams that may be used to guide development for future systems. NASA and other space agencies have operational spaceflight experience with two key Human-Automation-Robotic (HAR) systems: heavy lift robotic arms and planetary robotic explorers. Additionally, NASA has invested in high-fidelity rover systems that can carry crew, building beyond Apollo's lunar rover. The heavy lift robotic arms reviewed are: Space Station Remote Manipulator System (SSRMS), Japanese Remote Manipulator System (JEMRMS), and the European Robotic Arm (ERA, designed but not deployed in space). The robotic rover systems reviewed are: Mars Exploration Rovers, Mars Science Laboratory rover, and the high-fidelity K10 rovers. Much of the design and operational feedback for these systems have been communicated to flight controllers and robotic design teams. As part of the mitigating the HARI risk for future human spaceflight operations, we must document function allocations between robots and humans that have worked well in practice.

robotic allocation

Applicability and Limitations of Reliability Allocation Methods

Reliability allocation process may be described as the process of assigning reliability requirements to individual components within a system to attain the specified system reliability. For large systems, the allocation process is often performed at different stages of system design. The allocation process often begins at the conceptual stage. As the system design develops, more information about components and the operating environment becomes available, different allocation methods can be considered. Reliability allocation methods are usually divided into two categories: weighting factors and optimal reliability allocation. When properly applied, these methods can produce reasonable approximations. Reliability allocation techniques have limitations and implied assumptions that need to be understood by system engineers. Applying reliability allocation techniques without understanding their limitations and assumptions can produce unrealistic results. This report addresses weighting factors, optimal reliability allocation techniques, and identifies the applicability and limitations of each reliability allocation technique.

Reliability allocation

An intelligent allocation algorithm for parallel processing

The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network.

Carroll, Chester C.

Task allocation among multiple intelligent robots

Researchers describe the design of a decentralized mechanism for allocating assembly tasks in a multiple robot assembly workstation. Currently, the approach focuses on distributed allocation to explore its feasibility and its potential for adaptability to changing circumstances, rather than for optimizing throughput. Individual greedy robots make their own local allocation decisions using both dynamic allocation policies which propagate through a network of allocation goals, and local static and dynamic constraints describing which robots are elibible for which assembly tasks. Global coherence is achieved by proper weighting of allocation pressures propagating through the assembly plan. Deadlock avoidance and synchronization is achieved using periodic reassessments of local allocation decisions, ageing of allocation goals, and short-term allocation locks on goals.

Gasser, L.

Spectrum allocations above 40 GHz

The 1979 World Administrative Radio Conference (WARC-79) revised the International Table of Frequency Allocations to reflect increased interest and activity in the region of the EM spectrum above 40 GHz. The total width of the spectrum allocated (235 GHz) in the region above 40 GHz indicates the extent of this new spectrum resource, made accessible by advances in the state-of-the-art of telecommunications equipment. There are some striking differences between the approach to allocation above and below 40 GHz. For example, there are not bands allocated exclusively. This reflects the characteristics of propagation and the small antenna beamwidths achievable at these frequencies. Attention is given to atmospheric window and absorption band limits, allocations to satellite services, allocations to scientific services, allocations to terrestrial services, the future refinement of the radio regulations above 40 GHz, and allocations of WARC-79 and frequency management.

Katzenstein, W. E.

Methodology to Support Dynamic Function Allocation Policies Between Humans and Flight Deck Automation

Function allocation assigns work functions to all agents in a team, both human and automation. Efforts to guide function allocation systematically have been studied in many fields such as engineering, human factors, team and organization design, management science, cognitive systems engineering. Each field focuses on certain aspects of function allocation, but not all; thus, an independent discussion of each does not address all necessary aspects of function allocation. Four distinctive perspectives have emerged from this comprehensive review of literature on those fields: the technology-centered, human-centered, team-oriented, and work-oriented perspectives. Each perspective focuses on different aspects of function allocation: capabilities and characteristics of agents (automation or human), structure and strategy of a team, and work structure and environment. This report offers eight issues with function allocation that can be used to assess the extent to which each of issues exist on a given function allocation. A modeling framework using formal models and simulation was developed to model work as described by the environment, agents, their inherent dynamics, and relationships among them. Finally, to validate the framework and metrics, a case study modeled four different function allocations between a pilot and flight deck automation during the arrival and approach phases of flight.

Johnson, Eric N.

Patch Network for Power Allocation and Distribution in Smart Materials

The power allocation and distribution (PAD) circuitry is capable of allocating and distributing a single or multiple sources of power over multi-elements of a power user grid system. The purpose of this invention is to allocate and distribute power that is collected by individual patch rectennas to a region of specific power-user devices, such as actuators. The patch rectenna converts microwave power into DC power. Then this DC power is used to drive actuator devices. However, the power from patch rectennas is not sufficient to drive actuators unless all the collected power is effectively used to drive another group by allocation and distribution. The power allocation and distribution (PAD) circuitry solves the shortfall of power for devices in a large array. The PAD concept is based on the networked power control in which power collected over the whole array of rectennas is allocated to a sub domain where a group of devices is required to be activated for operation. Then the allocated power is distributed to individual element of power-devices in the sub domain according to a selected run-mode.

Golembiewski, Walter T.

Proposal Drafted for Allocating Space-to-Space Frequencies in the GPS Spectrum Bands

Radionavigation Satellite Service (RNSS) systems such as the U.S. Global Positioning System (GPS) and the Russian Global Navigation Satellite System (GLONASS) are primarily being used today in the space-to-Earth direction (i.e., from GPS satellite to Earth user) for a broad range of applications such as geological surveying; aircraft, automobile, and maritime navigation; hiking and mountain climbing; and precision farming and mining. However, these navigation systems are being used increasingly in space. Beginning with the launch of the TOPEX/Poseidon remote-sensing mission in 1992, over 90 GPS receivers have flown onboard spacecraft for such applications as real-time spacecraft navigation, three-axis attitude control, precise time synchronization, precision orbit determination, and atmospheric profiling. In addition to use onboard many science spacecraft, GPS has been used or is planned to be used onboard the shuttles, the International Space Station, the International Space Station Emergency Crew Return Vehicle, and many commercial satellite systems such as Orbcomm, Globalstar, and Teledesic. From a frequency spectrum standpoint, however, one important difference between the space and terrestrial uses of GPS is that it is being used in space with no interference protection. This is because there is no frequency allocation for the space-to-space use of GPS (i.e., from GPS satellite to user spacecraft) in the International Telecommunications Union (ITU) regulatory table of frequency allocations. If another space-based or groundbased radio system interferes with a spaceborne GPS user, the spaceborne user presently has no recourse other than to accept the interference. Consequently, for the past year and a half, the NASA Glenn Research Center at Lewis Field and other Government agencies have been working within ITU toward obtaining a GPS space-to-space allocation at the next World Radio Conference in the year 2000 (WRC 2000). Numerous interference studies have been conducted in support of a primary space-tospace allocation in the 1215- to 1260-MHz and 1559- to 1610-MHz RNSS bands. Most of these studies and analyses were performed by Glenn and submitted as U.S. input documents to the international Working Party 8D meetings in Geneva, Switzerland. In the structure of the ITU, Working Party 8D is responsible for frequency spectrum issues in the RNSS and the mobile satellite service (MSS). The full texts of the studies are available from the ITU web site under Working Party 8D contributions. Note that because spaceborne RNSS receivers operate in a receive-only mode with navigation signals already being broadcast toward the Earth, the addition of a space-tospace allocation will not result in interference with other systems. A space-based RNSS receiver, however, could experience interference from systems of other services, including intraservice interference from other RNSS systems. The interference scenarios examined in the studies can be inferred from the following frequency allocation charts. In these charts, services labeled in all capital letters (e.g., "ARNS") have primary status, whereas those labeled with sentence-style capitalization (e.g., "Amateur radio") have secondary status (i.e., a service with secondary status cannot claim interference protection from or cause harmful interference to a service with primary status). Charts showing the ITU frequency allocations in the 960 to 1350 MHZ range and the 1525-1660 MHZ range are discussed and presented.

Spence, Rodney L.

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and weighted links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Weights are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and directed links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Reliability values are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.

Affine Generalized Inverse for Optimal Control Allocation

This research is a follow on to the "Optimal Control Prediction Method for Control Allocation" paper in which the Prediction Method iterative algorithm was introduced. Previously, the Prediction Method was shown to provide optimal control allocation solutions over the entire Attainable Moment Set for the Moore-Penrose and the generalized (weighted) inverse. As an extension to the Prediction Method, this paper introduces a family of Moore Penrose Affine Generalized Inverses, applicable for all moments, which compute control allocation solutions using a constant matrix and fixed null-space vector. The Moore-Penrose Affine Generalized Inverse is proven to yield equivalent solutions to those of the Prediction Method and therefore is guaranteed to yield Moore-Penrose optimal control allocation solutions. While the Prediction Method is applicable for any moment along an a priori specified moment direction, the Affine Generalized Inverse is shown to yield optimal control allocation solutions in a neighborhood of the given moment which is not restricted to a specified moment direction. Furthermore, the Affine Generalized Inverse is shown to provide the time derivative of optimal control allocation solutions and to facilitate maintaining solutions within control effector rate limitations. The Moore-Penrose Affine Generalized Inverse is broadened to encompass any arbitrary (weighted) Affine Generalized Inverse. Finally, a method of creating a moment lookup table is outlined to utilize the Affine Generalized Inverse as an offline control allocation solution for all moments in the Attainable Moment Set.

Acheson, Michael J.

A Comparison of Control Allocation Methods in the Presence of Parametric Model Uncertainty

When allocating redundant effectors to virtual control commands, linear (generalized inverse) allocators have historically been used on aircraft and spacecraft. While simple to implement, generalized inverses are unable to realize a significant portion of the attainable moments. To address this drawback, the control allocation problem can also be formulated as a linear programming or quadratic programming problem and solved using convex optimization based solvers. These approaches have been shown to access a larger set of attainable moments, however, little work has been done to understand the performance of convex optimization-based control allocation in the presence of parametric model uncertainty. This paper seeks to compare the performance of several control allocation approaches, including two forms of generalized inverse allocators, the pseudo inverse and minimum-variance, and the linear programming and quadratic programming approach in the presence of parametric model uncertainty. The performance of these four allocators were tested on an aircraft model in the presence of realistic parametric model uncertainty and the convex optimization approaches were shown to outperform the generalized inverses.

Luke J Miller

Dynamic resource allocation in a hierarchical multiprocessor system: A preliminary study

An integrated system approach to dynamic resource allocation is proposed. Some of the problems in dynamic resource allocation and the relationship of these problems to system structures are examined. A general dynamic resource allocation scheme is presented. A hierarchial system architecture which dynamically maps between processor structure and programs at multiple levels of instantiations is described. Simulation experiments were conducted to study dynamic resource allocation on the proposed system. Preliminary evaluation based on simple dynamic resource allocation algorithms indicates that with the proposed system approach, the complexity of dynamic resource management could be significantly reduced while achieving reasonable effective dynamic resource allocation.

Ngai, Tin-Fook

Evolving Reliability and Maintainability Allocations for NASA Ground Systems

This paper describes the methodology that was developed to allocate reliability and maintainability requirements for the NASA Ground Systems Development and Operations (GSDO) program's subsystems. As systems progressed through their design life cycle and hardware data became available, it became necessary to reexamine the previously derived allocations. Allocating is an iterative process; as systems moved beyond their conceptual and preliminary design phases this provided an opportunity for the reliability engineering team to reevaluate allocations based on updated designs and maintainability characteristics of the components. Trade-offs in reliability and maintainability were essential to ensuring the integrity of the reliability and maintainability analysis. This paper will discuss the value of modifying reliability and maintainability allocations made for the GSDO subsystems as the program nears the end of its design phase.

allocations

Minimum-Variance Control Allocation Considering Parametric Model Uncertainty

The control allocation problem was investigated for linear dynamical systems with known parametric uncertainty. Minimizing a cost function that penalizes the variance of the error in achieving commanded forces and moments on the vehicle resulted in a special case of the weighted pseudo-inverse allocator. Rather than an engineer designing the weighting matrix, it is computed from the covariances of the control effectiveness parameters. This minimum-variance allocator balances the effectiveness of the control inputs against the corresponding levels of uncertainty. The approach was demonstrated using simulations of aircraft with realistic uncertainty levels operating in open-loop and closed-loop configurations. Results showed that when model uncertainty is known, significant, and unevenly distributed amongst the controls, the minimum-variance allocator more often achieves the intended forces and moments on the vehicle in comparison to other allocators, which can lead to increased performance, reliability, and safety during flight tests. The cost for this robustness is a diminished achievable moment space for the vehicle.

Control allocation

Task allocation in a distributed computing system

A conceptual framework is examined for task allocation in distributed systems. Application and computing system parameters critical to task allocation decision processes are discussed. Task allocation techniques are addressed which focus on achieving a balance in the load distribution among the system's processors. Equalization of computing load among the processing elements is the goal. Examples of system performance are presented for specific applications. Both static and dynamic allocation of tasks are considered and system performance is evaluated using different task allocation methodologies.

Seward, Walter D.

Dynamic task allocation for a man-machine symbiotic system

This report presents a methodological approach to the dynamic allocation of tasks in a man-machine symbiotic system in the context of dexterous manipulation and teleoperation. This report addresses a symbiotic system containing two symbiotic partners which work toward controlling a single manipulator arm for the execution of a series of sequential manipulation tasks. It is proposed that an automated task allocator use knowledge about the constraints/criteria of the problem, the available resources, the tasks to be performed, and the environment to dynamically allocate task recommendations for the man and the machine. The presentation of the methodology includes discussions concerning the interaction of the knowledge areas, the flow of control, the necessary communication links, and the replanning of the task allocation. Examples of task allocation are presented to illustrate the results of this methodolgy.

Parker, L. E.