Sciweavers

543 search results - page 4 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
ERSHOV
1999
Springer
14 years 5 days ago
Multi-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
Fedor A. Kolushev, Alexander A. Bogdanov
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 2 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
OL
2010
140views more  OL 2010»
13 years 2 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
SAC
2010
ACM
14 years 2 months ago
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
David Portugal, Rui Rocha
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
14 years 1 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis