Search NASA⌕ Search

SEARCH · Search NASA

Results for “constrained bin packing algorithm”

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.

2 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

An Empirical Validation of a Constrained Bin Packing Algorithm for a Home Energy Management System

The increasing number of intelligent electrical appliances and home energy management systems provide a big opportunity for demand response services from residential and small commercial buildings to the grid. Simultaneously, direct control of individual devices by utilities can cause communication bottlenecks, as well as coordination and privacy concerns. These challenges can be addressed by combining the constituent devices into a single house battery equivalent for the purposes of demand response, using Minkowski sum and a 2d bin packing problem. However, the well-studied traditional problems have not been tested in a real house, as implementation carries significant challenges of its own. We deploy the packing problem on residential devices in a controllable house. We report the barriers we found, such as charge forecast and scalability of the algorithm, and discuss our solutions. The study serves as an intermediate step between existing theoretical research and possible future steps, such as prototype deployments of systems that provide residential demand response.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS2004

Adaptive, Distributed Control of Constrained Multi-Agent Systems

Product Distribution (PO) theory was recently developed as a broad framework for analyzing and optimizing distributed systems. Here we demonstrate its use for adaptive distributed control of Multi-Agent Systems (MASS), i.e., for distributed stochastic optimization using MAS s. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (Probability dist&&on on the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. One common way to find that equilibrium is to have each agent run a Reinforcement Learning (E) algorithm. PD theory reveals this to be a particular type of search algorithm for minimizing the Lagrangian. Typically that algorithm i s quite inefficient. A more principled alternative is to use a variant of Newton's method to minimize the Lagrangian. Here we compare this alternative to RL-based search in three sets of computer experiments. These are the N Queen s problem and bin-packing problem from the optimization literature, and the Bar problem from the distributed RL literature. Our results confirm that the PD-theory-based approach outperforms the RL-based scheme in all three domains.

Bieniawski, Stefan↗