2011
DOI: 10.1007/s11633-011-0590-4
|View full text |Cite
|
Sign up to set email alerts
|

Optimisation-based verification process of obstacle avoidance systems for unicycle-like mobile robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…The worst case analysis in the presence of all the possible uncertainties is cast as a problem to finding the combinations of the variations where the minimum distance to the obstacle (d min ) appears. Instead of exhaustive searching the worst cases as in many practices, it is well known that optimization can effectively find a (local) minimum or maximum without evaluating all possible parameters in a solution space [15]. In this paper, the worst case analysis for collision avoidance algorithms is treated as a constrained nonlinear optimization problem with simulation being involved in each iteration.…”
Section: Introductionmentioning
confidence: 99%
“…The worst case analysis in the presence of all the possible uncertainties is cast as a problem to finding the combinations of the variations where the minimum distance to the obstacle (d min ) appears. Instead of exhaustive searching the worst cases as in many practices, it is well known that optimization can effectively find a (local) minimum or maximum without evaluating all possible parameters in a solution space [15]. In this paper, the worst case analysis for collision avoidance algorithms is treated as a constrained nonlinear optimization problem with simulation being involved in each iteration.…”
Section: Introductionmentioning
confidence: 99%