The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper an approach to the many-to-many carpooling problem with automated passenger aggregation is presented. The proposed solution allows to optimally solve the related routing problem, by relying on a constrained shortest path algorithm, for users travelling within multiple transportation networks, thus enabling multi-modality, and exploits the users' availability to be aggregated into carpools...
In this paper a power system protection scheme based on energy storage system placement against closed-loop dynamic load altering attacks is proposed. The protection design consists in formulating a non-convex optimization problem, subject to a Lyapunov stability constraint and solved using a two-step iterative procedure. Simulation results confirm the effectiveness of the approach and the potential...
This paper presents a distributed strategy for load balancing in a smart grid, modeling demand and supply as a networked dynamical system. The algorithm, which is characterized by point-to-point communications among agents implemented at the level of local energy management systems, is proven to converge to a Wardrop equilibrium. Numerical simulations of realistic scenarios are reported to show the...
In the framework of the Future Internet, the aim of the Quality of Experience (QoE) Control functionalities is to track the personalized desired QoE level of the applications. The paper proposes to perform such a task by dynamically selecting the most appropriate Classes of Service (among the ones supported by the network), this selection being driven by a novel heuristic Multi-Agent Reinforcement...
This paper proposes a memetic direct transcription algorithm to solve Multi-Objective Optimal Control Problems (MOOCP). The MOOCP is first transcribed into a Non-linear Programming Problem (NLP) with Direct Finite Elements in Time (DFET) and then solved with a particular formulation of the Multi Agent Collaborative Search (MACS) framework. Multi Agent Collaborative Search is a memetic algorithm in...
The increasing demand of bandwidth, low latency and reliability, even in mobile scenarios, has pushed the evolution of the networking technologies in order to satisfy the requirements of innovative services. In this context, Software Defined Networking (SDN), namely a new networking paradigm that proposes the decoupling of the control plane from the forwarding plane, enables network control centralization...
This paper presents a real time control strategy for energy storage systems integration in electric vehicles fast charging applications combined with generation from intermittent renewable energy sources. A two steps approach taking advantage of the model predictive control methodology is designed on purpose to optimally allocate the reference charging power while managing the priority among the plugged...
The paper describes an innovative and fully cognitive approach which offers the opportunity to cope with some key limitations of the present telecommunication networks by means of the introduction of a novel architecture design in the perspective of the emerging Future Internet framework. Within this architecture, the Quality of Experience (QoE) Management functionalities are aimed at approaching...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.