2010
DOI: 10.1007/s10589-010-9337-3
|View full text |Cite
|
Sign up to set email alerts
|

Monte Carlo algorithm for trajectory optimization based on Markovian readings

Abstract: This paper describes an efficient algorithm to find a smooth trajectory joining two points A and B with minimum length constrained to avoid fixed subsets. The basic assumption is that the locations of the obstacles are measured several times through a mechanism that corrects the sensors at each reading using the previous observation. The proposed algorithm is based on the penalized nonparametric method previously introduced that uses confidence ellipses as a fattening of the avoidance set. In this paper we obt… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…For more detailed information regarding the strong uniform convergence, one can refer to references such as [26] or [27]. These sources provide further insights and explanations on the topic.…”
Section: Discussionmentioning
confidence: 99%
“…For more detailed information regarding the strong uniform convergence, one can refer to references such as [26] or [27]. These sources provide further insights and explanations on the topic.…”
Section: Discussionmentioning
confidence: 99%
“…(the asymptotic property of nonparametric density estimators). Suppose that f ′′ (x) exists and h � cn − (1/5) ; then More details about the strong uniform convergence can be found, for example, in [26] or [27].…”
Section: Appendixmentioning
confidence: 99%