Abstract
We study the problem of trajectory planning for autonomous vehicles designed to minimize the travel distance while avoiding moving obstacles whose position and speed are not known. Because, in practice, observations from sensors have measurement errors, the stochasticity of the data is modeled using maximum likelihood estimators, which are shown to be consistent as the sample size increases. To comply with the kinematic constraints of the vehicle, we consider smooth trajectories that can be represented by a linear combination of B-spline basis functions, transforming the infinite-dimensional problem into a finite-dimensional one. Moreover, a smooth penalty function is added to the travel distance, transforming the constrained optimization problem into an unconstrained one. The planned stochastic trajectory, obtained from the minimization problem with stochastic confidence regions, is shown to converge almost surely to the deterministic one as the number of sensor observations increases. Finally, we present two simulation studies to demonstrate the proposed method.
Similar content being viewed by others
References
Barraquand, J., Latombe, J.C.: Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles. Algorithmica 10(2), 121 (1993)
Belkhouche, F.: Reactive path planning in a dynamic environment. IEEE Trans. Robot. 25(4), 902–911 (2009)
Bodin, P., Villemoes, L.F., Wahlberg, B.: Selection of best orthonormal rational basis. SIAM J. Control Optim. 38(4), 995–1032 (2000)
Bouthemy, P.: A maximum likelihood framework for determining moving edges. IEEE Trans. Pattern Anal. Mach. Intell. 11(5), 499–511 (1989)
DeVore, R., Petrova, G., Temlyakov, V.: Best basis selection for approximation in l p. Found. Comput. Math. 3(2), 161–185 (2003)
Dias, R., Garcia, N.L., Zambom, A.Z.: A penalized nonparametric method for nonlinear constrained optimization based on noisy data. Comput. Optim. Appl. 45(3), 521–541 (2010)
Dias, R., Garcia, N.L., Zambom, A.Z.: Monte carlo algorithm for trajectory optimization based on markovian readings. Comput. Optim. Appl. 51(1), 305–321 (2012)
Elnagar, A., Gupta, K.: Motion prediction of moving objects based on autoregressive model. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 28(6), 803–810 (1998)
Fiorini, P., and Shiller, Z.: Motion planning in dynamic environments using the relative velocity paradigm. In: [1993] Proceedings IEEE International Conference on Robotics and Automation, vol. 1 pp. 560–565 (1993)
Fliess, M., Levine, J., Martin, P., Rouchon, P.: On differentially flat nonlinear systems. IFAC Proc. Vol. 25(13), 159–163 (1992)
Huang, C.Q., Shi, S.J., Wang, X.G., Chung, W.K.: Parallel force/position controls for robot manipulators with uncertain kinematics. Int. J. Robot. Autom. 20, 158–168 (2005)
Johnson, R.A., Wichern, D.W. (eds.): Applied Multivariate Statistical Analysis. Prentice-Hall Inc, Upper Saddle River (2007)
Kala, R., Shukla, A., Tiwari, R.: Robot path planning using dynamic programming with accelerating nodes. Paladyn 3(1), 23–34 (2012)
Karlin, S.: Some variational problems on certain sobolev spaces and perfect splines. Bull. Am. Math. Soc. 1, 124–128 (1973)
Lachout, P., Liebscher, E., Vogel, S.: Strong convergence of estimators as \({ e}_n\)-minimisers of optimisation problems. Ann. Inst. Stat. Math. 57, 291–313 (2005)
Lindemann, S.R., LaValle, S.M.: Simple and efficient algorithms for computing smooth, collision-free feedback laws over given cell decompositions. Int. J. Robot. Res. 28(5), 600–621 (2009)
Luus, R. Choosing grid points in solving singular optimal control problems by iterative dynamic programming. In: Conference: Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control, pp. 592–045 (2007)
Park, J.-M., Kim, D.-W., Yoon, Y.-S., Kim, H.J., Yi, K.-S.: Obstacle avoidance of autonomous vehicles based on model predictive control. Proc. Inst. Mech. Eng. Part D J. Automob. Eng. 223(12), 1499–1516 (2009)
Reif, U.: Uniform b-spline approximation in sobolev spaces. Numer. Algorithm. 15(1), 1–14 (1997)
Rubagotti, M., Vedova, M.L.D., Ferrara, A.: Time-optimal sliding-mode control of a mobile robot in a dynamic environment. IET Control Theory Appl. 5(16), 1916–1924 (2011)
Sen, P.K., Singer, J.M.: Large Sample Methods in Statistics. An Introduction with Applications. Chapman & Hall, New York-London (1993)
Shiller, Z., Large, F., and Sekhavat, S.: Motion planning in dynamic environments: obstacles moving along arbitrary trajectories. In: Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), vol. 4, pp. 3716–3721 (2001)
Tazir, M. L., Azouaoui, O., Hazerchi, M., and Brahimi, M.: Mobile robot path planning for complex dynamic environments. In: 2015 International Conference on Advanced Robotics (ICAR), pp. 200–206 (2015)
van den Berg, J., Lin, M., Manocha, D.: Reciprocal velocity obstacles for real-time multi-agent navigation. In: 2008 IEEE International Conference on Robotics and Automation, pp. 1928–1935 (2008)
Yang, K., and Sukkarieh, S.: Real-time continuous curvature path planning of uavs in cluttered environments. In: 2008 5th International Symposium on Mechatronics and Its Applications, pp. 1–6 (2008)
Author information
Authors and Affiliations
Corresponding author
Appendices
A Maximum likelihood estimation of \({\varvec{\eta }}_0^\ell , s^\ell , \alpha ^\ell \)
Differentiating the likelihood \(\varLambda ({\varvec{\eta }}_0^\ell , s^\ell , \alpha ^\ell |\mathbf{N}^\ell )\) in (1) with respect to \({\varvec{\eta }}_0^\ell , s^\ell , \mathbf{V}_\alpha ^\ell \) yields the equations
Because the third equation is a vector equation with respect to \(\alpha \) and s, the second equation is redundant, hence
so that
which together with the fact that \(\sin (x)/\cos (x) = \tan (x)\) yields
B Variance of \(\hat{{\varvec{\eta }}}^\ell _t\)
The variance-covariance matrix of \(\hat{{\varvec{\eta }}}_t^\ell \), the estimator of the position of obstacle \(\ell \) at time t, is given by
where the fourth equality follows from the independence of \({{\varvec{\epsilon }}}_k\).
C Proofs of Lemmas and Theorems
Proof of Lemma 1
Part a) For each \(\ell = 1, \ldots , L\),
Writing \(\hat{s}^\ell \mathbf{V}_{\hat{\alpha }}^\ell \) as \(1/(c_2 - c_1^2/T)\sum _{t=1}^Tt\mathbf{N}_t^\ell - c_1/(T(c_2 - c_1^2/T))\sum _{t=1}^T\mathbf{N}_t^\ell \) we have
Hence \(E(\hat{{\varvec{\eta }}}_t^\ell ) = {\varvec{\eta }}_t^\ell \), completing the proof of unbiasedness.
Part b)
For each \(\ell = 1, \ldots , L\),
Since \(\mathbf{N}_i^\ell , i = 1, \ldots , T\) are independent, with \(E(\mathbf{N}_i^\ell ) = {\varvec{\eta }}_i^\ell \), \(Var(\mathbf{N}_i^\ell ) = \varSigma ^\ell \), and \(\sum _{i=1}^{\infty } \frac{1}{i^2} Var[N_{ij}^\ell ] < \infty , j = 1, 2\), it follows from Kolmogorov’s strong law ([21], Theorem 2.3.10) that \(\bar{\mathbf{N}}_T^\ell - E(\bar{\mathbf{N}}_T^\ell ) {\mathop {\longrightarrow }\limits ^{a.s.}}0\).
Note that for \(j = 1, 2\) and any \(\epsilon > 0\), using the fact that \(\sum _{i=1}^T i N_{ij}^\ell /T^2 - E(\sum _{i=1}^T i N_{ij}^\ell /T^2)\) has probability distribution \(N(0,\sigma _{\ell ,j}^2(T+1)(2T+1)/(6T^3))\), one can compute the probability bound
Since \(\sum _{T = 1}^\infty 3\sigma _{\ell ,j}^4(T+1)^2(2T+1)^2/(36T^6) = \sigma _{\ell ,j}^4O(1) < \infty ,\) by the Borel–Cantelli Lemma we have
and hence \(\sum _{i=1}^T i N_{ij}^\ell /T^2 - E(\sum _{i=1}^T i N_{ij}^\ell /T^2) {\mathop {\longrightarrow }\limits ^{a.s.}}0\). A similar argument shows that \(\sum _{i=1}^T i N_{ij}^\ell /T^3 - E(\sum _{i=1}^T i N_{ij}^\ell /T^3) {\mathop {\longrightarrow }\limits ^{a.s.}}0\). Consequently \(\hat{{\varvec{\eta }}}_0^\ell {\mathop {\longrightarrow }\limits ^{a.s.}}{\varvec{\eta }}_0^\ell \) and \(\hat{s}^\ell \mathbf{V}_{\hat{\alpha }}^\ell {\mathop {\longrightarrow }\limits ^{a.s.}}s^\ell \mathbf{V}_{\alpha }^\ell \).
Note that
for any \(T_{max} < \infty \), so that \(\hat{{\varvec{\eta }}_t} = \hat{{\varvec{\eta }}}_0^\ell + t \hat{s}^\ell \mathbf{V}_{\hat{\alpha }}^\ell {\mathop {\longrightarrow }\limits ^{a.s.}}{\varvec{\eta }}_0^\ell + t s^\ell \mathbf{V}_{\alpha }^\ell = {\varvec{\eta }}_t\) uniformly in \(t \in [0, T_{max}]\), completing the proof of Part b).
Part c)
Fix \(t\in [0,T_{max}]\) and \(\mathbf{x}\in \varvec{\varGamma }_t^{\gamma _T}\). By the definition of \(\varvec{\varGamma }_t^{\gamma _T}\) there is some \(\ell =1,\dots , L\) such that
This means that there is a \(\mathbf{z}\in \vartheta _t(\mathbf{N}^\ell ,\gamma _T)\) and \(\mathbf{u}\in B(\mathbf 0 ,r^\ell )\) such that \(\mathbf{x}=\mathbf{z}+\mathbf{u}\). It follows that
Since the radii of \(\vartheta _t(\mathbf{N}^\ell ,\gamma _T)\) are \(\sqrt{\chi ^2_2(\gamma _T)d_t\beta _{\ell ,j}/T}\), for \(j=1,2\), and \(d_t\) is an increasing function of t, we have
Thus,
The limit of the right-hand side of the previous inequality goes to zero as \(T\rightarrow \infty \) by (C1) and Part b). This proves the claim.
Part d)
Note that by the Mean Value Theorem we can obtain
by Part c). \(\square \)
Proof of Lemma 2
We begin by showing that the family of functions \(v_{t1}\), indexed by \(t\in [T_0,\infty )\), is equicontinuous. Fix \(t\in [T_0,\infty )\) and define the function F by
where
It is readily checked that F is continuously differentiable. Define \(w_{t}({\varvec{\theta }})\) implicitly by the equation
for \(t\in [T_0,\infty )\). Notice that by (6), \(w_t({\varvec{\theta }})=v_{t1}({\varvec{\theta }})\) for \(t\in [T_0,T_{\varvec{\theta }}]\). Moreover, for \(t>T_{\varvec{\theta }}\), we have \(w_t({\varvec{\theta }})>b_1\).
By the Implicit Function Theorem, \(w_{t}\) is a differentiable function of \({\varvec{\theta }}\) and for any \(m=1,\dots ,K\) we have
When \(w_t({\varvec{\theta }})\le b_1\) we have
and hence
where \(M = \max _{1\le m\le K}\sup _{0\le u\le b_1} |B_m'(u)|\) is independent of \(t\in [T_0,\infty )\). On the other hand, when \(w_t(\theta )>b_1\) we have
and hence
It follows that regardless of the value of \({\varvec{\theta }}\) or t it is true that
This implies that \(w_t\) is Lipschitz—that is, there is a \(N>0\) such that
for all \({\varvec{\theta }},{\varvec{\phi }}\in \mathbb {R}^K\). Notice that N is independent of t. To see that \(v_{1t}\) is also Lipschitz, fix \({\varvec{\theta }}\) and \({\varvec{\phi }}\) and consider several cases. If
then since \(v_{1t}({\varvec{\phi }})=w_t({\varvec{\phi }})\) for \(t\in [T_0,T_{\varvec{\phi }}]\) for all \({\varvec{\phi }}\in \mathbb {R}^K\) we have
If
then we know that \(v_{1t}({\varvec{\phi }})< b_1=v_{1t}({\varvec{\theta }})\le w_t({\varvec{\theta }})\). Hence,
A similar argument works if
Finally, if
then since \(v_{1t}({\varvec{\theta }})=v_{1t}({\varvec{\phi }})=b_1\),
Thus, \(v_{1t}\) is also Lipschitz with Lipschitz constant N independent of t. It follows that \(v_{t1}\) is equicontinuous.
Moreover, since the \(B_k\) are independent of t and are continuous, it follows that the family of functions
is also equicontinuous. Hence, the family \(\mathbf{v}_t\) defined in (5), indexed by \(t\in [T_0,\infty )\), is equicontinuous. \(\square \)
Proof of Theorem 1
Define
for all \({\varvec{\theta }}\in \mathbb {R}^K\). To show the continuity of \(Q_{\psi , \lambda , H, T}\) it suffices to prove the continuity of the function \({\varvec{\theta }}\mapsto \sup _{t\in [T_0,\infty )}g_t({\varvec{\theta }})\). Since the family of functions \(\mathbf{v}_t\) and the family of functions \({\varvec{\theta }}\mapsto w_{\varvec{\theta }}(t)\) are equicontinuous, the family of functions \(g_t\) for \(t\in [T_0,\infty )\) is also equicontinuous. Moreover, because
the function \({\varvec{\theta }}\mapsto \sup _{t\in [T_0,\infty )}g_t({\varvec{\theta }})\) is continuous. The proof for \(Q_{\psi , \lambda , H}\) is similar. \(\square \)
Proof of Lemma 3
We prove the result for \(Q_{\psi ,\lambda ,H}\). The proof for \(Q_{\psi ,\lambda ,H,T}\) is similar. Let \({\varvec{\theta }}\in \mathbb {R}^K\) be given. If \({\varvec{\theta }}=\mathbf 0 \), then the desired result holds for any \(\mu >0\). Suppose \({\varvec{\theta }}\not = \mathbf 0 \). Find m such that \(\theta _m\not = 0\) and \(|\theta _j|\le |\theta _m|\), and hence \(-1\le \frac{\theta _j}{\theta _m}\le 1\), for all \(j=1,\dots ,K\). We have
where M is given by
Notice that (8) implies that \(Q_{\psi ,\lambda ,H}({\varvec{\theta }})\ge \frac{M}{\sqrt{K}}\Vert {\varvec{\theta }}\Vert \). Thus, if we show that \(M>0\), the result holds with \(\mu =\frac{M}{\sqrt{K}}\).
Suppose for the sake of contradiction that \(M=0\). It follows that for each \(n\in \mathbb {N}\) we can find a \({{\varvec{\xi }}}_n\in [-1,1]^K\) such that at least one of the components of \({{\varvec{\xi }}}_n\) is equal to one and
Since \({{\varvec{\xi }}}_n\in [-1,1]^K\) we have that the sequence \({{\varvec{\xi }}}_n\) is bounded and hence has a subsequence that converges to some \({{\varvec{\xi }}}_0\in [-1,1]^K\) such that \(\xi _{0m}=1\) for some \(m=1,\dots ,K\). Moreover, from (10) \({{\varvec{\xi }}}_0\) must satisfy
and hence
Since \(\xi _{0m}=1\), this implies that \(B'_m\) is a linear combination of \(B'_j\) for \(j\not = m\), which is not true. Thus, we must have \(M>0\). \(\square \)
Proof of Corollary 1
We prove that \(Q_{\psi ,\lambda ,H}\) has a minimizer. The proof for \(Q_{\psi ,\lambda ,H,T}\) is similar. Let \({\varvec{\theta }}_n\), for \(n\in \mathbb {N}\), be a minimizing sequence for \(Q_{\psi ,\lambda ,H}\) so that
It follows from (11) and Lemma 3 that the sequence \({\varvec{\theta }}_n\) is bounded and hence there is a subsequence that converges to some \({\varvec{\theta }}_0\in \mathbb {R}^K\). Taking the limit of (11) as n goes to infinity along this subsequence and utilizing the continuity of \(Q_{\psi ,\lambda ,H}\) implies that
Thus, \({\varvec{\theta }}_0\) is a minimizer. \(\square \)
Proof of Lemma 4
By the independence of the observations, for any \(T_{max}\) we have
follows from the Borel-Cantelli Lemma. \(\square \)
Proof of Lemma 5
By Lemma 4, for any \(\omega \in F^c\), where \(F = \big \{\{ \varvec{\varGamma }_t \not \subset \varvec{\varGamma }_t^{\gamma _T} \text{ for } \text{ some } t \in [0, T_{\varvec{\theta }}]\} \; i.o.\big \}\), there exists \(n_0(\omega )\) such that for all \(T \ge n_0(\omega )\) we have \( \varvec{\varGamma }_t \subset \varvec{\varGamma }_t^{\gamma _T}(\omega )\) for all \(t \in [0, T_{\varvec{\theta }}]\). Thus, for any \({\varvec{\theta }}\in \mathbb {R}^K\), any \(\omega \in F^c\), and all \(T \ge n_0(\omega )\)
Hence, for any \({\varvec{\theta }}\), \(\lambda \), \(\psi \), H, \(\omega \in F^c\), and for all \( T \ge n_o(\omega )\)
since \(\varPhi \) is strictly increasing and H is positive.
Hence, for all \(\omega \in F^c\) we have \(Q_{\psi , \lambda , H, T}({\varvec{\theta }}, \omega ) \ge Q_{\psi , \lambda , H}({\varvec{\theta }})\) for all \(T \ge n_0(\omega )\), so that \(\{Q_{\psi , \lambda , H, T}({\varvec{\theta }}) < Q_{\psi , \lambda , H}({\varvec{\theta }})\;\; i.o.\}\) has probability 0. \(\square \)
Proof of Theorem 2
Utilizing Theorem 2.1 in [15] it suffices to show that \(Q_{\psi , \lambda , H, T}\) epi-converges a.s. to \(Q_{\psi , \lambda , H}\) and that there is a compact set \(C\subset \mathbb {R}^K\) and an \(\alpha \in \mathbb {R}\) such that
The proof that \(Q_{\psi , \lambda , H, T}\) epi-converges a.s. to \(Q_{\psi , \lambda , H}\), which relies on Lemmas 1 and 5 and Theorem 1, is identical to the argument found in the proof of Theorem 3.2 in [6]. Thus, it will not be presented here.
To establish the existence of a compact C and \(\alpha \in \mathbb {R}\) such that (12) holds begin by defining the set
This set is bounded because if \({\varvec{\theta }}\in R\), then by Lemma 3 we have for any \(T\in \mathbb {N}\)
Thus, if we set C equal to the closure of R, C is compact. Now choose
and for any \(T\in \mathbb {N}\) set
Notice that \(A_T\) is not empty since \(\mathbf 0 \in A_T\). Also, for any natural number \(T'\) and \({\varvec{\theta }}\in A_T\) we have
and thus \({\varvec{\theta }}\in R\). This shows that \(A_T\subset R\subset C\). \(\square \)
Rights and permissions
About this article
Cite this article
Zambom, A.Z., Seguin, B. & Zhao, F. Robot path planning in a dynamic environment with stochastic measurements. J Glob Optim 73, 389–410 (2019). https://doi.org/10.1007/s10898-018-0704-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-018-0704-4