اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Dimensionality-Reduction Strategy to Compute Shortest Paths in Urban Water Networks
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The efficient computation of shortest paths in complex networks is essential to face new challenges related to critical infrastructures such as a near real-time monitoring and control and the management of big size systems. In particular, using information on the minimum paths in water distribution networks (WDNs) allows to track the diffusion of contaminants and to quantify the resilience and criticality of the system. This is, ultimately, approached by considering dynamically changing path-weights that depend on the flow or on other information available at run-time. These analyses tipically include all the WDN assets but reducing the high degree of physical details with a minimum lost of key information for their performance assessment. This paper proposes a strategy to compute minimum paths that is based on a dimensionality-reduction process. Specifically, the network is partitioned into communities and suitably modified to obtain a reduced complexity representation (e.g., in terms of number of nodes and links). The paper shows how this novel, reduced representation is equivalent to the traditional network on computing the shortest paths. The proposed approach is validated considering two utility networks as case studies. The results show that the proposed method provides the exact solution for the shortest path with a computational-time reduction consistently over 50% and up to 90% for some cases. Furthermore, the application of the proposal on WDNs partitioning shows both hydraulic and economic advantages thanks to their monitoring and controlling at near real-time.
قيم البحث
اقرأ أيضاً
Physarum Polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by biologists to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foragi
ng two food sources s0 and s1. We prove that, under this model, the mass of the mold will eventually converge to the shortest s0 - s1 path of the network that the mold lies on, independently of the structure of the network or of the initial mass distribution. This matches the experimental observations by the biologists and can be seen as an example of a natural algorithm, that is, an algorithm developed by evolution over millions of years.
The apparent ease with which animals move requires the coordination of their many degrees of freedom to manage and properly utilize environmental interactions. Identifying effective strategies for locomotion has proven challenging, often requiring de
tailed models that generalize poorly across modes of locomotion, body morphologies, and environments. We present the first biological application of a gauge-theory-based geometric framework for movement, originally proposed by Wilczek and Shapere nearly $40$ years ago, to describe self-deformation-driven movements through dissipative environments. Using granular resistive force theory to model environmental forces and principal components analysis to identify a low-dimensional space of animal postures and dynamics, we show that our approach captures key features of how a variety of animals, from undulatory swimmers and slitherers to sidewinding rattlesnakes, coordinate body movements and leverage environmental interactions to generate locomotion. Our results demonstrate that this geometric approach is a powerful and general framework that enables the discovery of effective control strategies, which could be further augmented by physiologically-relevant parameters and constraints to provide a deeper understanding of locomotion in a wide variety of biological systems and environments.
This letter propose a new model for characterizing traffic dynamics in scale-free networks. With a replotted road map of cities with roads mapped to vertices and intersections to edges, and introducing the road capacity L and its handling ability at
intersections C, the model can be applied to urban traffic system. Simulations give the overall capacity of the traffic system which is quantified by a phase transition from free flow to congestion. Moreover, we report the fundamental diagram of flow against density, in which hysteresis is found, indicating that the system is bistable in a certain range of vehicle density. In addition, the fundamental diagram is significantly different from single-lane traffic model and 2-D BML model with four states: free flow, saturated flow, bistable and jammed.
Mitigating traffic congestion on urban roads, with paramount importance in urban development and reduction of energy consumption and air pollution, depends on our ability to foresee road usage and traffic conditions pertaining to the collective behav
ior of drivers, raising a significant question: to what degree is road traffic predictable in urban areas? Here we rely on the precise records of daily vehicle mobility based on GPS positioning device installed in taxis to uncover the potential daily predictability of urban traffic patterns. Using the mapping from the degree of congestion on roads into a time series of symbols and measuring its entropy, we find a relatively high daily predictability of traffic conditions despite the absence of any a priori knowledge of drivers origins and destinations and quite different travel patterns between weekdays and weekends. Moreover, we find a counterintuitive dependence of the predictability on travel speed: the road segment associated with intermediate average travel speed is most difficult to be predicted. We also explore the possibility of recovering the traffic condition of an inaccessible segment from its adjacent segments with respect to limited observability. The highly predictable traffic patterns in spite of the heterogeneity of drivers behaviors and the variability of their origins and destinations enables development of accurate predictive models for eventually devising practical strategies to mitigate urban road congestion.
In this paper, urban traffic is modeled using dual graph representation of urban transportation network where roads are mapped to nodes and intersections are mapped to links. The proposed model considers both the navigation of vehicles on the network
and the motion of vehicles along roads. The roads capacity and the vehicle-turning ability at intersections are naturally incorporated in the model. The overall capacity of the system can be quantified by a phase transition from free flow to congestion. Simulation results show that the systems capacity depends greatly on the topology of transportation networks. In general, a well-planned grid can hold more vehicles and its overall capacity is much larger than that of a growing scale-free network.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
