Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1905.06012

Origami Inspired Solar Panel Design

Chris Whitmire·Brij Rokad·Caleb Crumley
View original source ↗Read source document ↗Export metadata ↓

Abstract

The goal of this paper was to take a flat solar panel and make cuts on the panel to make smaller, but still viable solar panels. These smaller solar panels could then be arranged in a tree-like design. The hope was that by having solar panels faced in different directions in 3-dimensional space, the tree system would be able to pick up more sunlight than a flat solar panel. The results were promising, but this project did not take every factor into account. Specifically, optimum shape, temperature and the resistance of system, reflection of sun-rays were not explored in this project. This paper will take an approach from origami paper folding to create the optimum arrangement that will allow the overall system to absorb the maximum energy. Since the system stays stationary throughout the day, it can reduce the maintenance cost and excess energy use because it does not require solar tracking. In this project we have implemented a variety of Evolutionary Algorithms to find the most efficient way to cut a flat solar panel and arrange the resulting smaller panels. Each solution in the population will be tested by computing the amount of solar energy that is absorbed at particular times of the day. The EA will be exploring different combinations of angles and heights of the smaller panels on the tree such that the system can produce the maximum amount of power throughout the day. The performance of our Evolutionary algorithms are comparable to the performance of flat solar panels. Keywords: - Evolutionary Programming, Evolution Strategy, Genetic Algorithm, Solar Panel Optimization.

Explore related subjects

cs.NE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chris Whitmire, Brij Rokad, Caleb Crumley. 2019-05-15. Origami Inspired Solar Panel Design. https://arxiv.org/abs/1905.06012

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quantization robustness from dense representations of sparse functions in high-capacity kernel associative memory

High-capacity associative memories based on Kernel Logistic Regression (KLR) achieve strong retrieval performance but typically require substantial computational resources. This paper investigates the compressibility of KLR Hopfield networks to clarify the geometric principles underlying their robust representations. We present a geometric interpretation based on spontaneous symmetry breaking and Walsh analysis, and examine it through compression experiments involving quantization and pruning. The experiments reveal a clear asymmetry: the network remains robust under low-precision quantization while exhibiting strong sensitivity to pruning. We interpret this behavior through a "sparse function, dense representation" principle, in which a sparse input mapping is implemented through a dense bimodal parameterization. These findings suggest a practical route toward hardware-efficient kernel associative memories and provide insight into the geometric principles underlying robust representation in neural systems.

cs.NE↗
arXiv2026

Genetic algorithm vs. gradient descent for training a neural network architecture dedicated to low data regimes in small medical datasets

Aim/Introduction: Distance-encoding biomorphic-informational neural network (DEBI-NN) is a recently proposed architecture in which connection weights are defined by the distances between neurons positioned in a Euclidian space. This approach drastically reduces the number of trainable parameters compared to classical neural networks in which weights are directly trained. The training process for DEBI-NN is based on a genetic algorithm (GA), rather than gradient descent (GD) which remains the prevailing optimization algorithm in deep learning. We aim to design and implement a GD learner for DEBI-NN and assess its performance compared to GA. Materials and Methods: We designed a spatial backpropagation scheme tailored to DEBI-NN and carried out a comparison between GD and GA for classification tasks, using a synthetic non-linear "two-moons" dataset, two clinical medical imaging radiomic datasets and a fetal cardiotocography dataset with a sample sizes ranging from n=85 to n=2126. Each optimizer was tuned through targeted hyperparameter searches adapted to each dataset. Results: Across all experiments, GA consistently produced superior decision boundaries and classification performance (Synthetic: 100% vs 83%; DLBCL: 83% vs 78%; HECKTOR: 80% vs 67%; Fetal: 81% vs 66%), whereas GD exhibited instability and failed to fully capture the non-linear patterns inherent to DEBI-NN's spatial encoding. The entangled gradients resulting from neuron interdependencies limit the effectiveness of classical backpropagation. Conclusion: These findings highlight fundamental limitations of gradient-based methods in architectures with highly interdependent spatial parameters and confirm the suitability of evolutionary strategies for training DEBI-NN.

cs.NE↗
arXiv2026

NeuroFlex: Lossless Element-Level ANN-SNN Co-Execution for Efficient Sparse Inference

Sparse DNN accelerators specialize in ANN or SNN execution, leaving energy or latency on the table when workload characteristics vary within a layer. Hybrid accelerator designs that switch modes at layer or tile granularity suffer from low PE utilization since one core type idles whenever the other is active. NeuroFlex is the first accelerator to assign every output element independently to ANN or SNN execution mode with zero accuracy loss. We extend integer-exact ANN-SNN equivalence from layers to individual output elements, thereby enabling mode switching with no conversion error. An offline cost-guided scheduler scores each element by its marginal energy-delay trade-off and packs work across PEs, achieving 97-99% PE utilization compared to 40-45% for layer-wise hybrids. NeuroFlex reduces EDP by 57-67% over a strong ANN-only baseline and delivers up to 2.5x speedup over a dual-sparse SNN-only baseline. Our cost-guided scheduler improves throughput by 16-19% over random element assignment across vision, language, and transformer workloads.

cs.NE↗