Search results for "Abstract"
showing 10 items of 1959 documents
A methodology for evaluating the flexibility potential of domestic air-conditioning systems
2020
The paper presents a methodology for quantifying the electrical flexibility potential of air-conditioning systems (ACS) installed in residential buildings according to the building envelope characteristics and the ACS performance. In order to provide a thorough analysis of the issue, the ACS baseline consumption referred to the indoor temperature of 24°C has been computed for three typical residential buildings built in the South of Italy over different periods. The baseline consumption was used as a reference to estimate the effect of the set point temperature change on the ACS power profile. The results showed that increasing the set-point temperature of ACS by 2°C and 4°C leads to a redu…
OMiLAB: A Smart Innovation Environment for Digital Engineers
2020
This position paper introduces a Smart Innovation Environment for experimentation related to digital transformation projects, for the consolidation of a proposed "Digital Engineer" skill profile (with a business-oriented facet labelled as "Digital Innovator"). In the Internet of Things era, this profile implies the ability to perform both digital design and engineering activities, to semantically bridge multiple layers of abstraction and specificity - from business analysis down to cyber-physical engineering. In the paper's proposal, this integration is enabled by conceptual modelling methods and interoperable modelling tools, tailored to support the creation of Digital Twins for innovative…
Simulation Goals and Metrics Identification
2016
Agent-Based Modeling and Simulation (ABMS) is a very useful means for producing high quality models during simulation studies. When ABMS is part of a methodological ap- proach it becomes important to have a method for identifying the objectives of the simulation study in a disciplined fashion. In this work we propose a set of guidelines for properly capturing and representing the goals of the simulations and the metrics, allowing and evaluating the achievement of a simulation objective. We take inspiration from the goal-question-metric approach and with the aid of a specific problem formalization we are able to derive the right questions for relating simulation goals and metrics.
Adaptive consensus of uncertain nonlinear systems with event triggered communication and intermittent actuator faults
2019
This paper investigates distributed consensus tracking problem for uncertain nonlinear systems with event-triggered communication. The common desired trajectory information and each subsystem's state will be broadcast to their linked subsystems only when predefined triggering conditions are satisfied. Compared with the existing related literature, the main features of the results presented in this paper include four folds. (i) A totally distributed adaptive control scheme is developed for multiple nonlinear systems without Lipschitz condition, while with parametric uncertainties. (ii) The derivative of desired trajectory function is allowed unknown by all subsystems and directed communicati…
Learning of Cooperative Behaviour in Robot Populations
2016
This paper addresses convergence and equilibrium properties of game theoretic learning algorithms in robot populations using simple and broadly applicable reward/cost models of cooperation between robotic agents. New models for robot cooperation are proposed by combining regret based learning methods and network evolution models. Results of mean-field game theory are employed in order to show the asymptotic second moment boundedness in the variation of cooperative behaviour. The behaviour of the proposed models are tested in simulation results, which are based on sample networks and a single lane traffic flow case study.
A novel clustering-based algorithm for solving spatially-constrained robotic task sequencing problems
2021
The robotic task sequencing problem (RTSP) appears in various forms across many industrial applications and consists of developing an optimal sequence of motions to visit a set of target points defined in a task space. Developing solutions to problems involving complex spatial constraints remains challenging due to the existence of multiple inverse kinematic solutions and the requirements for collision avoidance. So far existing studies have been limited to relaxed RTSPs involving a small number of target points and relatively uncluttered environments. When extending existing methods to problems involving greater spatial constraints and large sets of target points, they either require subst…
Decorous combinatorial lower bounds for row layout problems
2020
Abstract In this paper we consider the Double-Row Facility Layout Problem (DRFLP). Given a set of departments and pairwise transport weights between them the DRFLP asks for a non-overlapping arrangement of the departments along both sides of a common path such that the weighted sum of the center-to-center distances between the departments is minimized. Despite its broad applicability in factory planning, only small instances can be solved to optimality in reasonable time. Apart from this even deriving good lower bounds using existing integer programming formulations and branch-and-cut methods is a challenging problem. We focus here on deriving combinatorial lower bounds which can be compute…
A decomposition approach to dual shuttle automated storage and retrieval systems
2016
[EN] Automated Storage and Retrieval Systems (AS/RS) have become vital in today¿s distribution and production environments, however it remains necessary to equip them with more efficient operational control policies. Motivated by real situations encountered by companies employing AS/RS, the present paper studies a miniload AS/RS system, with a dual shuttle crane in which a set of storage and retrieval requests must be scheduled such that the prioritized waiting time is minimized. Dual shuttle cranes have received minimal academic attention and thus continue to pose new problems that must be solved. The miniload AS/RS problem is addressed by decomposing it into a location assignment and sequ…
Interrogating witnesses for geometric constraint solving
2012
International audience; Classically, geometric constraint solvers use graph-based methods to decompose systems of geometric constraints. These methods have intrinsic limitations, which the witness method overcomes; a witness is a solution of a variant of the system. This paper details the computation of a basis of the vector space of free infinitesimal motions of a typical witness, and explains how to use this basis to interrogate the witness for dependence detection. The paper shows that the witness method detects all kinds of dependences: structural dependences already detectable by graph-based methods, but also non-structural dependences, due to known or unknown geometric theorems, which…
GRASP and tabu search for the generalized dispersion problem
2021
Abstract The problem of maximizing dispersion requires the selection of a specific number of elements from a given set, in such a way that the minimum distance between the pairs of selected elements is maximized. In recent years, this problem has received a lot of attention and has been solved with many complex heuristics. However, there is a recent variant in which the selected elements have to satisfy two realistic constraints, a minimum capacity limit and a maximum budget, which in spite of its practical significance in facility location, has received little attention. In this paper, we first propose mathematical models to obtain the optimal solution of small- and medium-size instances, …