[图书][B] Energy harvesting for autonomous systems
N White - 2010 - books.google.com
This unique resource provides a detailed understanding of the options for harvesting energy
from localized, renewable sources to supply power to autonomous wireless systems. You …
from localized, renewable sources to supply power to autonomous wireless systems. You …
Agent-based decentralised coordination for sensor networks using the max-sum algorithm
In this paper, we consider the generic problem of how a network of physically distributed,
computationally constrained devices can make coordinated decisions to maximise the …
computationally constrained devices can make coordinated decisions to maximise the …
Distributed constraint optimization for teams of mobile sensing agents
R Zivan, H Yedidsion, S Okamoto, R Glinton… - Autonomous Agents and …, 2015 - Springer
Coordinating a mobile sensor team (MST) to cover targets is a challenging problem in many
multiagent applications. Such applications are inherently dynamic due to changes in the …
multiagent applications. Such applications are inherently dynamic due to changes in the …
[HTML][HTML] Explorative anytime local search for distributed constraint optimization
R Zivan, S Okamoto, H Peled - Artificial Intelligence, 2014 - Elsevier
Abstract Distributed Constraint Optimization Problems (DCOPs) are an elegant model for
representing and solving many realistic combinatorial problems that are distributed by …
representing and solving many realistic combinatorial problems that are distributed by …
Balancing exploration and exploitation in incomplete min/max-sum inference for distributed constraint optimization
Abstract Distributed Constraint Optimization Problems (DCOPs) are NP-hard and therefore
the number of studies that consider incomplete algorithms for solving them is growing …
the number of studies that consider incomplete algorithms for solving them is growing …
[PDF][PDF] Max/min-sum distributed constraint optimization through value propagation on an alternating DAG
R Zivan, H Peled - Proceedings of the 11th International Conference on …, 2012 - ifaamas.org
ABSTRACT Distributed Constraint Optimization Problems (DCOPs) are NP-hard and
therefore the number of studies that consider incomplete algorithms for solving them is …
therefore the number of studies that consider incomplete algorithms for solving them is …
Separate but Equal: Equality in Belief Propagation for Single-Cycle Graphs
Belief propagation is a widely used, incomplete optimization algorithm whose main
theoretical properties hold only under the assumption that beliefs are not equal …
theoretical properties hold only under the assumption that beliefs are not equal …
[HTML][HTML] Governing convergence of Max-sum on DCOPs through damping and splitting
Max-sum is a version of Belief Propagation, used for solving DCOPs. In tree-structured
problems, Max-sum converges to the optimal solution in linear time. Unfortunately, when the …
problems, Max-sum converges to the optimal solution in linear time. Unfortunately, when the …
Privacy preserving implementation of the Max-Sum algorithm and its variants
One of the basic motivations for solving DCOPs is maintaining agents' privacy. Thus,
researchers have evaluated the privacy loss of DCOP algorithms and defined corresponding …
researchers have evaluated the privacy loss of DCOP algorithms and defined corresponding …
[HTML][HTML] Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
Region-optimal algorithms are local search algorithms for solving Distributed Constraint
Optimization Problems (DCOPs). In each iteration of the search in such algorithms, every …
Optimization Problems (DCOPs). In each iteration of the search in such algorithms, every …