2010 IEEE/RSJ International Conference on Intelligent Robots and Systems 2010
DOI: 10.1109/iros.2010.5649117
|View full text |Cite
|
Sign up to set email alerts
|

A time competitive heterogeneous multi robot path finding algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…The proposed algorithm uses two primitives: “push”, where a robot moves toward its goal until no progress can be made, and “swap”, which allows two robots to swap positions without altering the position of any other robot. Other works include [68] [72] [73] [74] [75] [76] [77] [78] [152] [153] [154] [157].…”
Section: Inherent Problem: Resource Conflictmentioning
confidence: 99%
“…The proposed algorithm uses two primitives: “push”, where a robot moves toward its goal until no progress can be made, and “swap”, which allows two robots to swap positions without altering the position of any other robot. Other works include [68] [72] [73] [74] [75] [76] [77] [78] [152] [153] [154] [157].…”
Section: Inherent Problem: Resource Conflictmentioning
confidence: 99%