16,264 research outputs found
The minimum energy expenditure shortest path method
This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path. Given a simple environment in which a character has the ability to perform actions related to locomotion, such as walking and stair stepping, current techniques execute the shortest path based on the length of the extracted root trajectory. However, actual humans acting in constrained environments do not plan only according to shortest path criterion, they conceptually measure the path that minimizes the amount of energy expenditure. On this basis, it seems that virtual characters should also execute their paths according to the minimization of actual energy expenditure as well. In this article, a simple method that uses a formula for computing vanadium dioxide () levels, which is a proxy for the energy expenditure by humans during various activities, is presented. The presented solution could be beneficial in any situation requiring a sophisticated perspective of the path-execution process. Moreover, it can be implemented in almost every path-planning method that has the ability to measure stepping actions or other actions of a virtual character
Optimal Reverse Carpooling Over Wireless Networks - A Distributed Optimization Approach
We focus on a particular form of network coding, reverse carpooling, in a
wireless network where the potentially coded transmitted messages are to be
decoded immediately upon reception. The network is fixed and known, and the
system performance is measured in terms of the number of wireless broadcasts
required to meet multiple unicast demands. Motivated by the structure of the
coding scheme, we formulate the problem as a linear program by introducing a
flow variable for each triple of connected nodes. This allows us to have a
formulation polynomial in the number of nodes. Using dual decomposition and
projected subgradient method, we present a decentralized algorithm to obtain
optimal routing schemes in presence of coding opportunities. We show that the
primal sub-problem can be expressed as a shortest path problem on an
\emph{edge-graph}, and the proposed algorithm requires each node to exchange
information only with its neighbors.Comment: submitted to CISS 201
Boltzmann meets Nash: Energy-efficient routing in optical networks under uncertainty
Motivated by the massive deployment of power-hungry data centers for service
provisioning, we examine the problem of routing in optical networks with the
aim of minimizing traffic-driven power consumption. To tackle this issue,
routing must take into account energy efficiency as well as capacity
considerations; moreover, in rapidly-varying network environments, this must be
accomplished in a real-time, distributed manner that remains robust in the
presence of random disturbances and noise. In view of this, we derive a pricing
scheme whose Nash equilibria coincide with the network's socially optimum
states, and we propose a distributed learning method based on the Boltzmann
distribution of statistical mechanics. Using tools from stochastic calculus, we
show that the resulting Boltzmann routing scheme exhibits remarkable
convergence properties under uncertainty: specifically, the long-term average
of the network's power consumption converges within of its
minimum value in time which is at most ,
irrespective of the fluctuations' magnitude; additionally, if the network
admits a strict, non-mixing optimum state, the algorithm converges to it -
again, no matter the noise level. Our analysis is supplemented by extensive
numerical simulations which show that Boltzmann routing can lead to a
significant decrease in power consumption over basic, shortest-path routing
schemes in realistic network conditions.Comment: 24 pages, 4 figure
- …