 Maximizing the algebraic connectivity of meshed electrical pathways used as current return networkEtienne Goddet, Nicolas Retière, Vojislav Stojanović, Anca Dieudonné, Jérôme Genoulaz and Jean-Michel Guichon Mathematics and Computers in Simulation (MATCOM), 2019, vol. 158, issue C, 18-31 Abstract: This paper proposes an innovative method for optimizing the connectivity of meshed electrical pathways used to carry return current and provide grounding in more composite aircrafts. In normal operation, these networks should ensure a low voltage drop between power sources and electrical loads. The networks are modelled as graphs and spectral graph analysis is used to study their complexity. Thanks to the insight into graph’s spectrum, a multi-scale reading of meshed networks topology is proposed and an optimization problem is defined to decrease the DC resistance of the network while keeping constant its total weight. It is based on the maximization of the second eigenvalue of the graph’s Laplacian matrix. The optimization problem is applied to a mock-up of a real aircraft current return network. The paper is concluded by checking the DC voltage drops in steady state conditions. Keywords: Graph theory; Spectral analysis; Optimization; Algebraic connectivity; Current return networks (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:158:y:2019:i:c:p:18-31 DOI: 10.1016/j.matcom.2018.05.002 Access Statistics for this article Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.