126,889 research outputs found
Risk Allocation for Multi-agent Systems using Tatonnement
This paper proposes a new market-based distributed planning algorithm for multi-agent systems under uncertainty, called MIRA (Market-based Iterative Risk Allocation). In large coordination problems, from power grid management to multi-vehicle missions, multiple agents act collectively in order to optimize the performance of the system, while satisfying mission constraints. These optimal plans are particularly susceptible to risk when uncertainty is introduced. We present a distributed planning algorithm that minimizes the system cost while ensuring that the probability of violating mission constraints is below a user-specified level. We build upon the paradigm of risk allocation (Ono and Williams, AAAI-08), in which the planner optimizes not only the sequence of actions, but also its allocation of risk among each constraint at each time step. We extend the concept of risk allocation to multi-agent systems by highlighting risk as a good that is traded in a computational market. The equilibrium price of risk that balances the supply and demand is found by an iterative price adjustment process called tatonnement (also known as Walrasian auction). The simulation results demonstrate the efficiency and optimality of the proposed distributed planner.This research is funded by The Boeing Company grant MIT-BA-GTA-1
Market-based Risk Allocation for Multi-agent Systems
This paper proposes Market-based Iterative Risk Allocation
(MIRA), a new market-based distributed planning
algorithm for multi-agent systems under uncertainty.
In large coordination problems, from power grid
management to multi-vehicle missions, multiple agents
act collectively in order to optimize the performance of
the system, while satisfying mission constraints. These
optimal plans are particularly susceptible to risk when
uncertainty is introduced. We present a distributed planning
algorithm that minimizes the system cost while
ensuring that the probability of violating mission constraints
is below a user-specified level. We build upon the paradigm of risk allocation (Ono
& Williams 2008), in which the planner optimizes not
only the sequence of actions, but also its allocation of
risk among each constraint at each time step. We extend
the concept of risk allocation to multi-agent systems
by highlighting risk as a commodity that is traded
in a computational market. The equilibrium price of
risk that balances the supply and demand is found by
an iterative price adjustment process called tˆatonnement
(also known as Walrasian auction). Our work is distinct
from the classical tˆatonnement approach in that we use
Brent’s method to provide fast guaranteed convergence
to the equilibrium price. The simulation results demonstrate
the efficiency of the proposed distributed planner
V2X Meets NOMA: Non-Orthogonal Multiple Access for 5G Enabled Vehicular Networks
Benefited from the widely deployed infrastructure, the LTE network has
recently been considered as a promising candidate to support the
vehicle-to-everything (V2X) services. However, with a massive number of devices
accessing the V2X network in the future, the conventional OFDM-based LTE
network faces the congestion issues due to its low efficiency of orthogonal
access, resulting in significant access delay and posing a great challenge
especially to safety-critical applications. The non-orthogonal multiple access
(NOMA) technique has been well recognized as an effective solution for the
future 5G cellular networks to provide broadband communications and massive
connectivity. In this article, we investigate the applicability of NOMA in
supporting cellular V2X services to achieve low latency and high reliability.
Starting with a basic V2X unicast system, a novel NOMA-based scheme is proposed
to tackle the technical hurdles in designing high spectral efficient scheduling
and resource allocation schemes in the ultra dense topology. We then extend it
to a more general V2X broadcasting system. Other NOMA-based extended V2X
applications and some open issues are also discussed.Comment: Accepted by IEEE Wireless Communications Magazin
A state-of-the-art review on torque distribution strategies aimed at enhancing energy efficiency for fully electric vehicles with independently actuated drivetrains
© 2019, Levrotto and Bella. All rights reserved. Electric vehicles are the future of private passenger transportation. However, there are still several technological barriers that hinder the large scale adoption of electric vehicles. In particular, their limited autonomy motivates studies on methods for improving the energy efficiency of electric vehicles so as to make them more attractive to the market. This paper provides a concise review on the current state-of-the-art of torque distribution strategies aimed at enhancing energy efficiency for fully electric vehicles with independently actuated drivetrains (FEVIADs). Starting from the operating principles, which include the "control allocation" problem, the peculiarities of each proposed solution are illustrated. All the existing techniques are categorized based on a selection of parameters deemed relevant to provide a comprehensive overview and understanding of the topic. Finally, future concerns and research perspectives for FEVIAD are discussed
Deep Reinforcement Learning for Resource Allocation in V2V Communications
In this article, we develop a decentralized resource allocation mechanism for
vehicle-to-vehicle (V2V) communication systems based on deep reinforcement
learning. Each V2V link is considered as an agent, making its own decisions to
find optimal sub-band and power level for transmission. Since the proposed
method is decentralized, the global information is not required for each agent
to make its decisions, hence the transmission overhead is small. From the
simulation results, each agent can learn how to satisfy the V2V constraints
while minimizing the interference to vehicle-to-infrastructure (V2I)
communications
Recommended from our members
Centralized versus market-based approaches to mobile task allocation problem: State-of-the-art
Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many real-life applications. On the other hand, market-based approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP
- …