Skip to main content Accessibility help
×
Home

Asymptotics of geometrical navigation on a random set of points in the plane

Abstract

A navigation on a set of points S is a rule for choosing which point to move to from the present point in order to progress toward a specified target. We study some navigations in the plane where S is a nonuniform Poisson point process (in a finite domain) with intensity going to +∞. We show the convergence of the traveller's path lengths, and give the number of stages and the geometry of the traveller's trajectories, uniformly for all starting points and targets, for several navigations of geometric nature. Other costs are also considered. This leads to asymptotic results on the stretch factors of random Yao graphs and random θ-graphs.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Asymptotics of geometrical navigation on a random set of points in the plane
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Asymptotics of geometrical navigation on a random set of points in the plane
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Asymptotics of geometrical navigation on a random set of points in the plane
      Available formats
      ×

Copyright

Corresponding author

Postal address: CNRS, LaBRI, Université de Bordeaux, 351 cours de la Libération, 33405 Talence cedex, France.
∗∗ Email address: bonichon@labri.fr
∗∗ Email address: marckert@labri.fr

Footnotes

Hide All

Partially supported by the ANR project ALADDIN.

Partially supported by ANR-08-BLAN-0190-04A3.

Footnotes

References

Hide All
[1] Aldous, D. J. (2009). The shape theorem for route-lengths in connected spatial networks on random points. Preprint. Available at http://arvix.org/abs/0911.5301v1.
[2] Aldous, D. J. and Kendall, W. S. (2008). Short-length routes in low-cost networks via Poisson line patterns. Adv. Appl. Prob. 40, 121.
[3] Aldous, D. J. and Shun, J. (2010). Connected spatial networks over random points and a route-length statistic. Statist. Sci. 25, 275288.
[4] Athreya, S., Roy, R. and Sarkar, A. (2008). Random directed trees and forest-drainage networks with dependence. Electron. J. Prob. 13, 21602189.
[5] Baccelli, F. and Bordenave, C. (2007). The radial spanning tree of a Poisson point process. Ann. Appl. Prob. 17, 305359.
[6] Bhatt, A. G. and Roy, R. (2004). On a random directed spanning tree. Adv. Appl. Prob. 36, 1942.
[7] Bonichon, N., Gavoille, C., Hanusse, N. and Ilcinkas, D. (2010). Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In Graph Theoretic Concepts in Computer Science (Lecture Notes Comput. Sci. 6410), Springer, Berlin, pp. 266278.
[8] Bordenave, C. (2008). Navigation on a Poisson point process. Ann. Appl. Prob. 18, 708746.
[9] Bose, P. et al. (2010). Pi/2-angle Yao graphs are spanners. ArXiv e-prints, 2010, 1001.2913. Preprint. Available at http://arvix.org/abs/1001.2913v1.
[10] Clarkson, K. L. (1987). Approximation algorithms for shortest path motion planning. In STOC '87: Proc. 19th Annual ACM Symp. on Theory of Computing, ACM, New York, pp. 5665.
[11] Ferrari, P. A., Fontes, L. R. G. and Wu, X.-Y. (2005). Two-dimensional Poisson trees converge to the Brownian web. Ann. Inst. H. Poincaré Prob. Statist. 41, 851858.
[12] Kallenberg, O. (1997). Foundations of Modern Probability. Springer, New York.
[13] Keil, J. M. (1988). Approximating the complete Euclidean graph. In SWAT 88 (Halmstad, 1988; Lecture Notes Comput. Sci. 318), Springer, Berlin, pp. 208213.
[14] Li, X.-Y., Wan, P.-J. and Wang, Y. (2001). Power efficient and sparse spanner for wireless ad hoc networks. In Proc. IEEE 10th Internat. Conf. on Computer Communications and Networks, pp. 564567.
[15] O'Rourke, J. (2010). The Yao graph Y 6 is a spanner. Preprint. Available at http://arxiv.org/abs/1003.3713v2.
[16] Penrose, M. D. and Wade, A. R. (2006). On the total length of the random minimal directed spanning tree. Adv. Appl. Prob. 38, 336372.
[17] Petrov, V. V. (1975). Sums of Independent Random Variables. Springer, New York.
[18] Ruppert, J. and Seidel, R. (1991). Approximating the d-dimensional complete Euclidean graph. In 3rd Canadian Conf. Computational Geometry, pp. 207210.
[19] Yao, A. C. (1982). On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11, 721736.

Keywords

MSC classification

Asymptotics of geometrical navigation on a random set of points in the plane

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed