IEEE/RSJ International Conference on Intelligent Robots and System
DOI: 10.1109/irds.2002.1041702
|View full text |Cite
|
Sign up to set email alerts
|

An incremental deployment algorithm for mobile robot teams

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
230
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 182 publications
(230 citation statements)
references
References 11 publications
0
230
0
Order By: Relevance
“…There are three overloaded nodes and five underloaded nodes. M [3,3] Figure 2, the node and edge weighted bipartite graph shows weights of all edges connecting M [3,3] to underloaded nodes.…”
Section: Hungarian Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…There are three overloaded nodes and five underloaded nodes. M [3,3] Figure 2, the node and edge weighted bipartite graph shows weights of all edges connecting M [3,3] to underloaded nodes.…”
Section: Hungarian Methodsmentioning
confidence: 99%
“…For example, M [3,3] has three clone nodes labeled from 1 to 3. The Hungarian method is then applied to Figure 3 (a) and the optimal result is shown in Figure 3 (b).…”
Section: Hungarian Methodsmentioning
confidence: 99%
See 3 more Smart Citations