2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2017
DOI: 10.1109/iros.2017.8206299
|View full text |Cite
|
Sign up to set email alerts
|

Decentralized stochastic control of robotic swarm density: Theory, simulation, and experiment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
52
2

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 31 publications
(54 citation statements)
references
References 8 publications
0
52
2
Order By: Relevance
“…We apply this idea but with the opposite aim: namely, we represent discrete points (the robots' positions) with a continuous function. A similar strategy was alluded to in [18] and used in [25,40] to measure the effectiveness of a certain robotic control law, but to our knowledge, our work here and in [1] is the first to develop any such method in a form sufficiently general for common use. This section is devoted to our definition of the error metric and to its basic properties and computational considerations.…”
Section: Quantifying Coveragementioning
confidence: 99%
See 3 more Smart Citations
“…We apply this idea but with the opposite aim: namely, we represent discrete points (the robots' positions) with a continuous function. A similar strategy was alluded to in [18] and used in [25,40] to measure the effectiveness of a certain robotic control law, but to our knowledge, our work here and in [1] is the first to develop any such method in a form sufficiently general for common use. This section is devoted to our definition of the error metric and to its basic properties and computational considerations.…”
Section: Quantifying Coveragementioning
confidence: 99%
“…Under the stochastic control law of [25], the behavior of the error metric over time appears to be a noisy decaying exponential. Therefore, we fit to the data shown in Figure 7 of [25] a function of the form f (t) = α + β exp(− t τ ) by finding error asymptote α, error range β, and time constant τ that minimize the sum of squares of residuals between f (t) and the data. By convention, the steady state settling time is taken to be ts = 4τ , which can be interpreted as the time at which the error has settled to within 2% of its asymptotic value [3].…”
Section: Extrema Bounds Via Nonlinear Programmingmentioning
confidence: 99%
See 2 more Smart Citations
“…Deriving inspiration from nature, embodied artificial swarm systems have been created to mimic emergent pattern formation-with the ultimate goal of designing robotic swarms that can perform complex tasks autonomously [15][16][17][18]. Recently robotic swarms have been used experimentally for applications such as mapping [19], leader-following [20,21], and density control [22]. To achieve swarming behavior, often, robots are controlled based on models, where swarm properties can be predicted exactly [23][24][25][26][27].…”
Section: Introductionmentioning
confidence: 99%