Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
Full Text
Peer Reviewed
See detailDistributed identification of the Cell Transmission traffic model: A case study
Rinaldi, Marco UL; Capisani, L.; Ferrara, A. et al

in Procedings of the 2012 American Control Conference, ACC 2012 (2012)

The problem of the distributed identification of a macroscopic first-order traffic model, viz. the Cell Transmission Model (CTM), is considered in the paper. The parameters to be identified characterize ... [more ▼]

The problem of the distributed identification of a macroscopic first-order traffic model, viz. the Cell Transmission Model (CTM), is considered in the paper. The parameters to be identified characterize the dynamics of the density in different sections of the freeway (cells). We explore different distributed identification schemes. The purposes of the approach are mainly to obtain good prediction models through the minimization of the one-step ahead prediction error of the densities of the cells, and to reduce the computational time and the effort required to perform the identification. The methodology is validated relying on real-life data measured on a portion of the A12 freeway in The Netherlands. An evaluation of the performance of the identified model used as a set of virtual sensors in different scenarios is presented. © 2012 AACC American Automatic Control Council). [less ▲]

Detailed reference viewed: 85 (0 UL)
Full Text
Peer Reviewed
See detailDistributed Kalman Filter with minimum-time covariance computation
Thia, Jerry; Yuan, Ye; Shi, Ling et al

in The proceedings of the IEEE 52nd Annual Conference on Decision and Control (2013)

This paper considerably improves the well-known Distributed Kalman Filter (DKF) algorithm by Olfati-Saber (2007) by introducing a novel decentralised consensus value computation scheme, using only local ... [more ▼]

This paper considerably improves the well-known Distributed Kalman Filter (DKF) algorithm by Olfati-Saber (2007) by introducing a novel decentralised consensus value computation scheme, using only local observations of sensors. It has been shown that the state estimates obtained in [8] and [9] approaches those of the Central Kalman Filter (CKF) asymptotically. However, the convergence to the CKF can sometimes be too slow. This paper proposes an algorithm that enables every node in a sensor network to compute the global average consensus matrix of measurement noise covariance in minimum time without accessing global information. Compared with the algorithm in [8], our theoretical analysis and simulation results show that the new algorithm can offer improved performance in terms of time taken for the state estimates to converge to that of the CKF. [less ▲]

Detailed reference viewed: 119 (0 UL)
Full Text
Peer Reviewed
See detailDistributed Prediction of Unsafe Reconfiguration Scenarios of Modular Robotic Programmable Matter
Piranda, Benoit; Chodkiewicz, Paweł; Holobut, Paweł et al

in IEEE Transactions on Robotics (2021), 37(6), 2226-2233

We present a distributed framework for predicting whether a planned reconfiguration step of a modular robot will mechanically overload the structure, causing it to break or lose stability under its own ... [more ▼]

We present a distributed framework for predicting whether a planned reconfiguration step of a modular robot will mechanically overload the structure, causing it to break or lose stability under its own weight. The algorithm is executed by the modular robot itself and based on a distributed iterative solution of mechanical equilibrium equations derived from a simplified model of the robot. The model treats intermodular connections as beams and assumes no-sliding contact between the modules and the ground. We also provide a procedure for simplified instability detection. The algorithm is verified in the Programmable Matter simulator VisibleSim, and in real-life experiments on the modular robotic system Blinky Blocks. © 2004-2012 IEEE. [less ▲]

Detailed reference viewed: 35 (2 UL)
Full Text
Peer Reviewed
See detailDistributed reconstruction of nonlinear networks: An ADMM approach
Pan, Wei UL; Sootla, Aivar; Stan, Guy-Bart

in Proceedings of the 19th World Congress of the International Federation of Automatic Control (IFAC 2014) (2014)

In this paper, we present a distributed algorithm for the reconstruction of large-scale nonlinear networks. In particular, we focus on the identification from time-series data of the nonlinear functional ... [more ▼]

In this paper, we present a distributed algorithm for the reconstruction of large-scale nonlinear networks. In particular, we focus on the identification from time-series data of the nonlinear functional forms and associated parameters of large-scale nonlinear networks. In (Pan et al. (2013)), a nonlinear network reconstruction problem was formulated as a nonconvex optimisation problem based on the combination of a marginal likelihood maximisation procedure with sparsity inducing priors. Using a convex-concave procedure (CCCP), an iterative reweighted lasso algorithm was derived to solve the initial nonconvex optimisation problem. By exploiting the structure of the objective function of this reweighted lasso algorithm, a distributed algorithm can be designed. To this end, we apply the alternating direction method of multipliers (ADMM) to decompose the original problem into several subproblems. To illustrate the effectiveness of the proposed methods, we use our approach to identify a network of interconnected Kuramoto oscillators with different network sizes (500∼100,000 nodes). [less ▲]

Detailed reference viewed: 103 (1 UL)
Full Text
Peer Reviewed
See detailDistributedFBA.jl: High-level, high-performance flux balance analysis in Julia.
Heirendt, Laurent UL; Thiele, Ines UL; Fleming, Ronan MT UL

in Bioinformatics (2017)

MOTIVATION: Flux balance analysis, and its variants, are widely used methods for predicting steady-state reaction rates in biochemical reaction networks. The exploration of high dimensional networks with ... [more ▼]

MOTIVATION: Flux balance analysis, and its variants, are widely used methods for predicting steady-state reaction rates in biochemical reaction networks. The exploration of high dimensional networks with such methods is currently hampered by software performance limitations. RESULTS: DistributedFBA.jl is a high-level, high-performance, open-source implementation of flux balance analysis in Julia. It is tailored to solve multiple flux balance analyses on a subset or all the reactions of large and huge-scale networks, on any number of threads or nodes. AVAILABILITY: The code is freely available on github.com/opencobra/COBRA.jl. The documentation can be found at opencobra.github.io/COBRA.jl. [less ▲]

Detailed reference viewed: 258 (12 UL)
Full Text
See detaildolfiny: Convenience wrappers for DOLFINx
Zilian, Andreas UL; Habera, Michal UL

Scientific Conference (2021, March 23)

With the increased flexibility of DOLFINx and its reduction to core functionality, the responsibility for even some basic components of computational analysis is shifted to the user. This presentation ... [more ▼]

With the increased flexibility of DOLFINx and its reduction to core functionality, the responsibility for even some basic components of computational analysis is shifted to the user. This presentation provides an overview of the open-source package dolfiny, which provides end-user API interfaces to mesh/meshtags generation and processing, expression list handling, function interpolation and projection as well as the restriction of function spaces to parts of the computational domain. This functionality is consistently considered in interfaces to PETSc/SNES as nonlinear solver and SLEPc as eigensolver backend, both allowing the operation on block and nested operators. In addition, the package provides a convenient approach to incorporate time integration into the UFL formulation of the problem, which is exemplified for the generalised alpha method. The capability of dolfiny is demonstrated in a number of examples, ranging between finite strain structural analysis, plasticity and fluid-structure interaction. [less ▲]

Detailed reference viewed: 180 (4 UL)
Full Text
Peer Reviewed
See detailDrawing ER diagrams with TikZ
Fiandrino, Claudio UL

in Ars TeXnica (2013), 15

The paper will illustrate some techniques to represent Entity-Relationship (ER) diagrams with TikZ. In particular, it will focus on the standard internal library \library{er}, on the external package TikZ ... [more ▼]

The paper will illustrate some techniques to represent Entity-Relationship (ER) diagrams with TikZ. In particular, it will focus on the standard internal library \library{er}, on the external package TikZ-er2, on the external tool Graphviz and on the object-oriented approach provided by the er-oo library. [less ▲]

Detailed reference viewed: 162 (8 UL)
Full Text
Peer Reviewed
See detailA dual control approach for repeated anticipatory traffic control with estimation of network flow sensitivity
Huang, Wei; Viti, Francesco UL; Tampere, Chris

in Journal of Advanced Transportation (2016)

Detailed reference viewed: 118 (1 UL)
Full Text
See detailA Dual-Grid Multiscale Approach to CFD-DEM Couplings for Multiphase Flow
Pozzetti, Gabriele UL

Doctoral thesis (2018)

This thesis focuses on a novel dual-grid multiscale approach to CFD- DEM1 couplings, proposes its advantages in terms of numerical proper- ties and performance, and provides examples of engineering ... [more ▼]

This thesis focuses on a novel dual-grid multiscale approach to CFD- DEM1 couplings, proposes its advantages in terms of numerical proper- ties and performance, and provides examples of engineering applications that can benefit from it. In recent years, CFD-DEM couplings are be- coming a more and more adopted solution for the numerical simulation of particle-laden flows. In particular, couplings based on the volume av- eraging technique have become a standard for numerical simulations in chemical and process engineering. Furthermore, they are rapidly spread- ing to civil, geotechnical and mechanical applications due to their ability in dealing with arbitrarily complex mixtures of continuum and granular media. Despite the several advantages that these Eulerian-Lagrangian cou- plings provide, their rigorous application to complex scenarios is currently limited by two main factors. First, the computational traceability of the solutions can become problematic due to the lack of a general theory on the subject. In particular, grid-convergence studies for the solution of the continuous phases are often not feasible due to the averaging procedure that imposes limitations on the grid structure and refinement. Second, the parallel implementation of these numerical schemes holds important disadvantages in terms of memory consumption and inter-physics com- munication load. These disadvantages are significantly limiting the ex- tension of these approaches to large-scale scenarios. This thesis collects some of the most significant works published in the last years on a novel approach that allows solving the two above- mentioned problems, and, therefore, tackling more complex and expen- sive scenarios. I refer to this approach as dual-grid multiscale approach for CFD-DEM couplings. It consists in using two different computational grids, one for the coupling between continuum and discrete entities and one for the solution of the so-obtained continuum equations. The two grids, i.e. the two problems, are in this way resolved on two different scales. The first scale or “bulk” scale is chosen to optimize the averag- ing operation. At this length-scale, the discrete entities are considered as zero-dimensional, and interact with the fluid with local exchanges of momentum, mass, and energy. The second scale or “fluid-fine” scale is identified as the one at which a unique solution for the averaged equa- tions can be provided. In practice, this is chosen as the one at which the solution of the fluid equations becomes grid-independent. An inter-scale communication is adopted by interpolating fields from the fluid-fine scale to the bulk one and vice-versa. The theoretical description of the method is first provided with par- ticular reference to the DEM-VOF coupling. Even in its simplest version, the multiscale approach is shown to generate grid-convergent solutions and significantly higher accuracy than a standard CFD-DEM coupling. This shows how the new approach is able to overcome the first main limitation described above. Then, an optimized parallel implementation of the method is pro- posed to show how this multiscale approach can provide significant ben- efits also for what concerns the execution time. Technically, this is made possible by moving the communication cost of the coupling from the inter-physics communication that characterized the standard CFD-DEM couplings to an optimized inter-scale communication routine. This en- ables the method to overcome a major bottleneck of the parallel execution of CFD-DEM couplings and therefore the second main limitation of those schemes. Finally, the dual-grid multiscale method is applied to approach in- dustrially relevant problems that were till now out-of-reach for standard CFD-DEM couplings, proving how this technique can have direct real- case application and produce immediate benefits for practitioners willing to adopt it. [less ▲]

Detailed reference viewed: 123 (31 UL)
Full Text
Peer Reviewed
See detailDynamic modeling of VISSIM critical gap parameter at unsignalized intersections
Viti, Francesco UL; Wolput, Bart; Tampere, Chris M.J. et al

Poster (2013)

Detailed reference viewed: 85 (0 UL)
Full Text
Peer Reviewed
See detailDynamic modeling of VISSIM's critical gap parameter at unsignalized intersections
Viti, Francesco UL; Wolput, Bart; Tampere, Chris M.J. et al

in Transportation Research Record: Journal of the Transportation Research Board (2014), 2395

Detailed reference viewed: 169 (8 UL)
See detailDynamic modelling of ground antennas
Breyer, Laurent UL

Doctoral thesis (2011)

Detailed reference viewed: 122 (6 UL)
Full Text
Peer Reviewed
See detailDynamic neural network approach for atmospheric pollutant prediction: A pulp mill case study
Sainlez, Matthieu UL

Scientific Conference (2011, May 27)

Detailed reference viewed: 46 (0 UL)
Full Text
Peer Reviewed
See detailDynamic OD estimation in congested networks: theoretical findings and implications in practice
Frederix, Rodric; Viti, Francesco UL; Tampere, Chris M.J.

in Transportmetrica (2013), 9(6), 494-513

In this study we analyse the impact of congestion in dynamic origin–destination (OD) estimation. This problem is typically expressed using a bi-level formulation. When solving this problem the ... [more ▼]

In this study we analyse the impact of congestion in dynamic origin–destination (OD) estimation. This problem is typically expressed using a bi-level formulation. When solving this problem the relationship between OD flows and link flows is linearised. In this article the effect of using two types of linear relationship on the estimation process is analysed. It is shown that one type of linearisation implicitly assumes separability of the link flows, which can lead to biased results when dealing with congested networks. Advantages and disadvantages of adopting non-separable relationships are discussed. Another important source of error attributable to congestion dynamics is the presence of local minima in the objective function. It is illustrated that these local minima are the result of an incorrect interpretation of the information from the detectors. The theoretical findings are cast into a new methodology, which is successfully tested in a proof of concept. [less ▲]

Detailed reference viewed: 72 (1 UL)
Full Text
Peer Reviewed
See detailDynamic Origin-Destination Matrix Estimation on Large-Scale Congested Networks Using A Hierarchical Decomposition Scheme
Frederix, Rodric; Viti, Francesco UL; Tampere, Chris M.J.

in Journal of Intelligent Transportation Systems (2014), 18(1), 51-66

Despite the ever increasing computing power, dynamic Origin-Destination (OD) estimation in congested networks remains troublesome. In previous research, we have shown that an unbiased estimation requires ... [more ▼]

Despite the ever increasing computing power, dynamic Origin-Destination (OD) estimation in congested networks remains troublesome. In previous research, we have shown that an unbiased estimation requires the calculation of the sensitivity of the link flows to all Origin Destination flows, in order to incorporate the effects of congestion spillback. This is however computationally infeasible for large-scale networks. To overcome this issue, we propose a hierarchical approach for off-line application that decomposes the dynamic OD estimation procedure in space. The main idea is to perform a more accurate dynamic OD estimation only on subareas where there is congestion spillback. The output of this estimation is then used as input for the OD estimation on the whole network. This hierarchical approach solves many practical and theoretical limitations of traditional OD estimation methods. The main advantage is that different OD estimation method can be used for different parts of the network as necessary. This allows applying more advanced and accurate, but more time consuming methods only where necessary. The hierarchical approach is tested on a study network and on a real network. In both cases the proposed methodology performs better than traditional OD estimation approaches, indicating its merit. [less ▲]

Detailed reference viewed: 174 (5 UL)
Full Text
Peer Reviewed
See detailDynamic pricing using wavelet neural network under uncertain demands
Sadegh AmalNick, Mohsen; Qorbanian, Roozbeh UL

in Decision Science Letters (2017)

Detailed reference viewed: 201 (3 UL)
Full Text
Peer Reviewed
See detailA dynamic route swapping and control algorithm that maximises network capacity accounting for node constraints and blocking back
Viti, Francesco UL; Huang, Wei; Smith, Mike

Scientific Conference (2016, July)

Detailed reference viewed: 64 (1 UL)