2017
DOI: 10.1016/j.ifacol.2017.08.1991
|View full text |Cite
|
Sign up to set email alerts
|

Constrained Bayesian Optimization with Particle Swarms for Safe Adaptive Controller Tuning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
33
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
3
2

Relationship

3
5

Authors

Journals

citations
Cited by 38 publications
(33 citation statements)
references
References 6 publications
0
33
0
Order By: Relevance
“…To do this in a tractable manner, we focus on finite sets A in the following. However, heuristic extensions to continuous domains exist (Duivenvoorden et al, 2017).…”
Section: Safeopt-mc (Multiple Constraints)mentioning
confidence: 99%
“…To do this in a tractable manner, we focus on finite sets A in the following. However, heuristic extensions to continuous domains exist (Duivenvoorden et al, 2017).…”
Section: Safeopt-mc (Multiple Constraints)mentioning
confidence: 99%
“…Hence, we compare our method to SafeOptSwarm [32] and run only 50 iterations for each algorithm in three independent runs. We attempt a global search after 20 iterations for GoSafeOpt.…”
Section: Hardware Resultsmentioning
confidence: 99%
“…Safe exploration High-dimensional state space Global exploration Sample efficient SafeOpt [24] SafeOptSwarm [32] SafeLineBO [31] GoSafe [29] GoSafeOpt (ours) and provide safety and, optimality guarantees for it. Finally, we demonstrate on software and hardware the superiority of GoSafeOpt over existing methods for safe policy search for high-dimensional problem in Section 5.…”
Section: Contributionsmentioning
confidence: 99%
“…It has been used to safely tune a quadrotor controller for position tracking [6], [24]. In [7], it has been integrated with particle swarm optimization (PSO) to learn high-dimensional controllers. Unfortunately, SAFEOPT may not be sample-efficient due to its exploration strategy.…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, the recursive computation of S o t is expensive and not well suited to the fast responses required by adaptive control. Similarly to [7], here we rely on particle swarm optimization (PSO) [34] to solve this optimization problem, which checks that the particles belong to the one-step optimistic safe set as the optimization progresses and avoids computing it explicitly. We initialize m particles positioned uniformly at random within the discretized pessimistic safe set with grid resolution ∆x, velocity ∆x with random sign (L. 2 of Algorithm 2) and fitness equal to the lower bound of the objective l f t (•).…”
Section: Goose For Adaptive Controlmentioning
confidence: 99%