检索结果-内蒙古大学图书馆

Graph marginalization for rapid assignment in wide-area surveillance

AD HOC NETWORKS 2011年第2期9卷 180-188页

作者： Ebden, Mark Roberts, Stephen Univ Oxford Dept Engn Sci Oxford OX1 3PJ England

Decentralizing optimization problems across a network can reduce the time required to achieve a solution. We consider a wide-area surveillance sensor network observing an environment by varying the state of each sensor so as to assign it to one or more moving objects. The aim is to maximize an arbitrary utility function related to object tracking or object identification, using graph marginalization in the form of belief propagation. The algorithm performs well in an example application with six heterogeneous sensors. In larger network simulations, the time savings owing to decentralization quickly exceed 90%, with no reduction in optimality. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Sensor networks Coalition formation Agents max-sum algorithm Belief propagation

来源：评论

学校读者我要写书评

暂无评论

max-Product for maximum Weight Matching-Revisited

Max-Product for Maximum Weight Matching-Revisited

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Holldack, Mario Goethe Univ Inst Informat Frankfurt Germany

ISBN: (纸本)9781538647813

We focus on belief propagation for the assignment problem, also known as the maximum weight bipartite matching problem. We provide a constructive proof that the well-known upper bound on the number of iterations (Bayati, Shah, Sharma 2008) is tight up to a factor of four. Furthermore, we investigate the behavior of belief propagation when convergence is not required. We show that the number of iterations required for a sharp approximation consumes a large portion of the convergence time. Finally, we propose an "approximate belief propagation" algorithm for the assignment problem.

关键词： Belief Propagation max-sum algorithm Assignment Problem Matching Approximations

来源：评论

学校读者我要写书评

暂无评论

A New Parking Space Allocation System based on a Distributed Constraint Optimization Approach 13

A New Parking Space Allocation System based on a Distributed...

引用

13th International Conference on Agents and Artificial Intelligence (ICAART)

作者： Ali, Atik Arib, Souhila Aknine, Samir ESI Ex INI Higher Natl Sch Comp Sci CERIST Res Ctr Sci & Tech Informat Algiers Algeria CY Tech Cergy Paris Univ 33 Blvd Port F-95000 Cergy France Univ Claude Bernard Lyon 1 Lab LIRIS UCBL F-69622 Villeurbanne France

ISBN: (纸本)9789897584848

This paper develops and evaluates a new decentralized mechanism for the allocation of parking slots in downtown, using a distributed constraints optimization approach (DCOP). Our mechanism works with the multi-parking/multi-zone model, where vehicles are connected and can exchange information with the distributed allocation system. This mechanism can reach the minimal allocation costs where vehicles are assigned to the parking lots with the best possible aggregated user costs. The cost is calculated based on driver's aggregated preferences over slots. We empirically evaluated the performance of our approach with randomly generated costs and tested on three different configurations. The evaluation shows the performance of each configuration in terms of runtime and volume of exchanged data.

关键词： Parking Allocation DCOPs max-sum algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed User-centric Clustering and Base Station Mode Choose in Ultra Dense Networks

Distributed User-centric Clustering and Base Station Mode Ch...

引用

IEEE International Conference on Communications (IEEE ICC)

作者： Wu, Zhikun Fei, Zesong Han, Zhu Wang, Li-Chun Beijing Inst Technol Sch Informat & Elect Beijing Peoples R China Univ Houston Houston TX 77004 USA Kyung Hee Univ Dept Comp Sci & Engn Seoul 446701 South Korea Natl Chiao Tung Univ Dept Elect Engn Hsinchu Taiwan

ISBN: (纸本)9781538680889

To cope with the exponential growth of demand, ultra dense networks (UDNs) are a promising technology in future mobile networks. With small cells densely deployed in networks, how to allocate wireless resources in UDNs efficiently becomes a challenging research topic. In this paper, we concentrate on the distributed user-centric clustering and base station (BS) mode choose problem in UDNs. We formulate a combinatorial optimization problem, with the throughput maximization and power consumption minimization jointly considered in the optimization object. In order to reduce the complexity of the problem, we decompose the original problem into two subproblems in terms of user-centric clustering and BS mode choose, and then solve those subproblems by the max-sum algorithm in sequence. The proposed algorithm can be conducted in a distributed way, and the computational complexity grows linearly with the network size. Simulation results show that the performance of proposed algorithm approaches the performance of the exhaustive algorithm well, and outperforms the conventional algorithm significantly.

关键词： Ultra dense networks user-centric clustering activation max-sum algorithm

来源：评论

学校读者我要写书评

暂无评论

Graph Marginalization for Rapid Assignment in Wide-Area Surveillance

Graph Marginalization for Rapid Assignment in Wide-Area Surv...

引用

1st International Conference on Ad Hoc Networks (AdHocNets 2009)

作者： Ebden, Mark Roberts, Stephen Univ Oxford Oxford OX1 3PJ England

ISBN: (纸本)9783642117220

Decentralizing optimization problems across a network can reduce the time required to achieve a solution. We consider a wide-area surveillance (WAS) sensor network observing an environment by varying the state of each sensor so as to assign it to one or more moving objects. The aim is to maximize an arbitrary utility function related to object tracking or object identification, using graph marginalization in the form of belief propagation. The algorithm performs well in an example application with six heterogeneous sensors. In larger network simulations, the time savings owing to decentralization quickly exceed 90%, with no reduction in optimality.

关键词： sensor networks coalition formation agents max-sum algorithm belief propagation

来源：评论

学校读者我要写书评

暂无评论

Graph marginalization for rapid assignment in wide-area surveillance

Graph marginalization for rapid assignment in wide-area surv...

引用

Annual International Conference on Ad Hoc Net-Works

作者： Ebden, Mark Roberts, Stephen Univ Oxford Dept Engn Sci Oxford OX1 3PJ England

关键词： Sensor networks Coalition formation Agents max-sum algorithm Belief propagation

来源：评论

学校读者我要写书评

暂无评论

Multi-agent based railway track management System

Multi-agent based railway track management System

引用

3rd IEEE International Advance Computing Conference (IACC)

作者： Ghosh, Supriyo Dutta, Animesh Alam, Md Alamgir Natl Inst Technol Dept Informat Technol Durgapur 713209 W Bengal India

ISBN: (纸本)9781467345286

The amalgation of social science and multiagent research can be quite harmonious in the domain of multiagent based simulation providing active interdisciplinary advantages. The pivotal role of MABS is to enable agent modelling for a system reproduced to posses realistic behavior. The challenges present in this paper is to model the manually controlled railway system into a multiagent based coordination system. The real object or entity of the railway system being considered as an agent which has its own computational capabilities. The communication and coordination between respective agents can now be a substitution in the place of manual decisions. Thus the idea can replace the restless job of railway control room personals in a more sophisticated way. The paper finds its aim in 100% collision avoidance as well as optimised system delay in railway traffic thus eliminating manual errors causing disasters by proposing a robust and fully automated model.

关键词： Distributed Computing Agent Multi-agent technology max-sum algorithm Railway System Train Management

来源：评论

学校读者我要写书评

暂无评论

max-sum decentralised coordination for sensor systems 08

Max-sum decentralised coordination for sensor systems

引用

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers

作者： W. T. L. Teacy A. Farinelli N. J. Grabham P. Padhy A. Rogers N. R. Jennings University of Southampton Southampton UK

A key challenge for the successful deployment of systems consisting of multiple autonomous networked sensors is the development of decentralised mechanisms to coordinate the activities of these physically distributed devices in order to achieve good system-wide performance. Such mechanisms must act in the presence of local constraints (such as limited power, communication and computational resources) and dynamic environments (where the topology, constraints and utility of the sensor network may change at any time). We propose the use of message passing techniques based on the max-sum algorithm to address this challenge, and in this paper, we demonstrate its use in two different settings. We first present a software simulation where our max-sum decentralised coordination algorithm is used to coordinate sectored radar sensors tracking multiple moving targets (see the ARGUS II DARP project - http://***/research/projects/ARGUS). We then present a hardware implementation of the same algorithm that performs decentralised graph colouring - an intermediate step towards deploying the algorithm to coordinate the sleep/sense cycles of a network of low-power embedded sensors (see the DIF DTC 'Adaptive Energy-Aware Sensor Network' project - http://***/research/projects/AEASN).

关键词： decentralised coordination sensor network max-sum algorithm

来源：评论

学校读者我要写书评

暂无评论

max-sum with Quadtrees for Continuous DCOPs with Application to Lane-Free Autonomous Driving 22

Max-sum with Quadtrees for Continuous DCOPs with Application...

引用

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems

作者： Dimitrios Troullinos Georgios Chalkiadakis Vasilis Samoladas Markos Papageorgiou Technical University of Crete Chania Greece

ISBN: (纸本)9781450392136

In this paper we put forward a novel extension of the classic max-sum algorithm to the framework of Continuous Distributed Constrained Optimization Problems (Continuous DCOPs), in which we model the exchanged messages by means of a popular geometric algorithm, Quadtrees. As such, the discretization process is dynamic and embedded in the internal max-sum operations (addition and marginal maximization). We apply our max-sum with Quadtrees approach to Lane-Free Autonomous Driving in a highway populated with vehicles. Our experimental evaluation verifies the efficiency of our approach in this challenging dynamic coordination domain, demonstrating its superior performance with respect to the standard max-sum algorithm.

关键词： autonomous driving quadtrees factor graphs distributed problem solving lane-free traffic max-sum algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：