Search results for " programmi"

Boolean-controlled systems via receding horizon and linear programing

2009

We consider dynamic systems controlled by boolean signals or decisions. We show that in a number of cases, the receding horizon formulation of the control problem can be solved via linear programing by relaxing the binary constraints on the control. The idea behind our approach is conceptually easy: a feasible control can be forced by imposing that the boolean signal is set to one at least one time over the horizon. We translate this idea into constraints on the controls and analyze the polyhedron of all feasible controls. We specialize the approach to the stabilizability of switched and impulsively controlled systems.

ROBUST CONTROL STRATEGIES FOR MULTI—INVENTORY SYSTEMS WITH AVERAGE FLOW CONSTRAINTS

2006

Abstract In this paper we consider multi—inventory systems in presence of uncertain demand. We assume that i) demand is unknown but bounded in an assigned compact set and ii) the control inputs (controlled flows) are subject to assigned constraints. Given a long—term average demand, we select a nominal flow that feeds such a demand. In this context, we are interested in a control strategy that meets at each time all possible current demands and achieves the nominal flow in the average. We provide necessary and sufficient conditions for such a strategy to exist and we characterize the set of achievable flows. Such conditions are based on linear programming and thus they are constructive. In …

Formulations for an inventory routing problem

2014

In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle-indexed variables are superior to the more compact, aggregate formulations.

Predicting lorawan behavior. How machine learning can help

2020

Large scale deployments of Internet of Things (IoT) networks are becoming reality. From a technology perspective, a lot of information related to device parameters, channel states, network and application data are stored in databases and can be used for an extensive analysis to improve the functionality of IoT systems in terms of network performance and user services. LoRaWAN (Long Range Wide Area Network) is one of the emerging IoT technologies, with a simple protocol based on LoRa modulation. In this work, we discuss how machine learning approaches can be used to improve network performance (and if and how they can help). To this aim, we describe a methodology to process LoRaWAN packets a…

Demo - A Cell-level Traffic Generator for LoRa Networks

2017

In this demo we present and validate a LoRa cell traffic generator, able to emulate the behavior of thousands of low-rate sensor nodes deployed in the same cell, by using a single Software Defined Radio (SDR) platform. Differently from traditional generators, whose goal is creating packet flows which emulate specific applications and protocols, our focus is generating a combined radio signal, as seen by a gateway, given by the super-position of the signals transmitted by multiple sensors simultaneously active on the same channel. We argue that such a generator can be of interest for testing different network planning solutions for LoRa networks.

Biproportional Methods And Interindustry Dynamics: The Case of Energy in France

1996

Dynamique de la structure industrielle française

1990

A Note on added information in the RAS Procedure: reexamination of some evidence

2006

International audience; An example in Miernyk (1977) presented a rather counterintuitive result, namely that introducing accurate exogenous information into an RAS matrix estimating procedure could lead to an estimate that was worse than one generated by RAS using no exogenous information at all. This became an oft-cited black mark against RAS. Miller and Blair (1985) included a different (and small) illustration of the same possibility. It was recently pointed out by one of us that the Miller/Blair numerical results are wrong. For that reason, we decided to reexamine all the empirical evidence we could find on the subject. While figures in both Miernyk and Miller/Blair appear to be wrong, …

Regional Multicriteria Analysis and Influence Relation

1986

Note about the concept of ‘Net Multipliers'

2002

International audience; Net multipliers, as introduced by Oosterhaven and Stelder (2002) accept outputs as entries instead of final demand. They are found by multiplying ordinary multipliers by the final demand ratio over the sector's output. This pragmatic solution suffers from ratio instability over time. The alternative net multipliers proposed here are based on the interpretation of the Leontief inverse matrix for the effects generated at each round. The new solution is not sensitive to the size of impacts. Now net multiplier is equal to the corresponding ordinary multiplier minus one, and the ordering of multipliers is unchanged.