2006
DOI: 10.1016/j.robot.2005.10.004
|View full text |Cite
|
Sign up to set email alerts
|

Experiments in multirobot coordination

Abstract: Consequent to previously published theoretical work by Marshall, Broucke, and Francis, this paper summarizes the apparatus and results of multirobot coordination experiments conducted at the University of Toronto Institute for Aerospace Studies. These experiments successfully demonstrated the practicality of cyclic pursuit as a distributed control strategy for multiple wheeled-robot systems. Moreover, the pursuit-based coordination algorithm was found to be surprisingly robust in the presence of unmodelled dyn… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
17
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(18 citation statements)
references
References 15 publications
1
17
0
Order By: Relevance
“…Unfortunately, performing this kind of experiments is often a difficult and expensive task, particularly when dealing with algorithms designed for teams of robots. This is confirmed also by the relatively few experimental results on multi-agent algorithms that can be found in the literature (Marshall et al [2006], Ren and Sorensen [2008], Mastellone et al [2008]). Therefore, allowing students to test multi-robot algorithms on real vehicles, while being highly instructive, may become a prohibitive task, especially in case of large classes.…”
Section: Introductionsupporting
confidence: 76%
“…Unfortunately, performing this kind of experiments is often a difficult and expensive task, particularly when dealing with algorithms designed for teams of robots. This is confirmed also by the relatively few experimental results on multi-agent algorithms that can be found in the literature (Marshall et al [2006], Ren and Sorensen [2008], Mastellone et al [2008]). Therefore, allowing students to test multi-robot algorithms on real vehicles, while being highly instructive, may become a prohibitive task, especially in case of large classes.…”
Section: Introductionsupporting
confidence: 76%
“…Figure 9 shows that in our experiment the robots are stabilized to the star polygon {5/3}. Remark 5.1: When the communication graph is a fixed, directed graph with a ring topology, where agent i could only see agent (i + 1)/mod(n), then the n-agent system would behave like a team of robots in cyclic pursuit [9].…”
Section: Ring Topologymentioning
confidence: 79%
“…Let us characterize the set of equilibria given by (9). We represent the unit vector z i in the rotating frame by z i =…”
Section: Ring Topologymentioning
confidence: 99%
“…Numerous techniques have been proposed for the formation control of multiple distributed nonholonomic WMRs, some experimentally demonstrated with onboard sensing and estimation (e.g., Desai et al 2001;Das et al 2002;Marshall et al 2006;Mariottini et al 2009). On the other hand, many results have been reported for the teleoperation of multiple mobile robots (e.g., centralized Lee and Spong 2005;Lee 2008;Rodriguez-Seda et al 2010;Fong et al 2003, distributed Franchi et al 2012Ochiai et al 2014) and also for the teleoperation with predictive display (e.g., Kim and Bejczy 1993;Chong et al 2002;Mitra and Niemeyer 2008;Kelly et al 2011).…”
mentioning
confidence: 99%